Weitere Artikel dieser Ausgabe durch Wischen aufrufen
This work was carried out while the author was with the ECE Department, University of Wisconsin at Madison, WI 53706, USA.
Given a wireless network where some pairs of communication links interfere with each other, we study sufficient conditions for determining whether a given set of minimum bandwidth quality-of-service requirements can be satisfied. We are especially interested in algorithms which have low communication overhead and low processing complexity. The interference in the network is modeled using a conflict graph whose vertices correspond to the communication links in the network. Two links are adjacent in this graph if and only if they interfere with each other due to being in the same vicinity and hence cannot be simultaneously active. The problem of scheduling the transmission of the various links is then essentially a fractional, weighted vertex coloring problem, for which upper bounds on the fractional chromatic number are sought using only localized information. We recall some distributed algorithms for this problem, and then assess their worst-case performance. Our results on this fundamental problem imply that for some well known classes of networks and interference models, the performance of these distributed algorithms is within a bounded factor away from that of an optimal, centralized algorithm. The performance bounds are simple expressions in terms of graph invariants. It is seen that the induced star number of a network plays an important role in the design and performance of such networks.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
Bertsekas, D., & Gallager, R.G. (1992). Data networks. Upper Saddle River, NJ: Prentice Hall. MATH
Bollobás, B. (1998). Modern graph theory (Vol. 184). Berlin: Springer.
Chaitin, G. J. (1982). Register allocation and spilling via graph coloring. In Proceedings of the ACM SIGPLAN 82 symposium on compiler construction (pp. 98–105). Boston, MA.
Ganesan, A. (2009). On some sufficient conditions for distributed quality-of-service support in wireless networks. In Workshop on applications of graph theory in wireless Ad hoc networks and sensor networks (Graph-Hoc’09), proceedings of the international conference on networks and communications pp. 301–306). Chennai, India. doi: 10.1109/NetCoM.2009.17.
Gupta, R., Musacchio, J., & Walrand, J. (2007). Sufficient rate constraints for QoS flows in ad-hoc networks. Ad Hoc Networks, 5, 429–443. CrossRef
Hajek, B. (1984). Link schedules, flows, and the multichromatic index of graphs. In Proceedings of the conference on information sciences and systems, March.
Hale, W.H. (1980). Frequency assignment: theory and applications. Proceedings of the IEEE, 68(12), 1497–1514. CrossRef
Hamdaoui, B., & Ramanathan, P. (2005). Sufficient conditions for flow admission control in wireless ad-hoc networks. ACM Mobile Computing and Communication Review (Special issue on Medium Access and Call Admission Control Algorithms for Next Generation Wireless Networks), 9, 15–24.
Jain, K., Padhye, J., Padmanabhan, V. N., & Qiu, L.(2003). Impact of interference on multi-hop wireless network performance. In Proceedings of the ACM Mobicom. San Diego, CA.
Kodialam, M., & Nandagopal, T. (2005). Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels. IEEE/ACM Transactions on Networking, 13(4), 868–880. CrossRef
Lee, W.C.Y. (1995). Mobile cellular telecommunications (2nd ed.). New York City: McGraw-Hill.
Sarkar, S., & Sivarajan, K. N. (1998). Hypergraph models for cellular mobile communication systems. IEEE Transactions on Vehicular Technology, 47, 460–471. CrossRef
- Performance of sufficient conditions for distributed quality-of-service support in wireless networks
- Springer US
Neuer Inhalt/© Filograph | Getty Images | iStock