Wireless Networks

, Volume 20, Issue 6, pp 1321–1334 | Cite as

Performance of sufficient conditions for distributed quality-of-service support in wireless networks

  • Ashwin GanesanEmail author


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.


Quality of service (QoS) Admission control Distributed algorithms Interference Wireless networks Conflict graph Link scheduling 



Thanks are due to professor Parmesh Ramanathan for suggesting this direction of scaling the sufficient conditions. A preliminary version of this work is found in the conference paper [5].


  1. 1.
    Bertsekas, D., & Gallager, R.G. (1992). Data networks. Upper Saddle River, NJ: Prentice Hall.zbMATHGoogle Scholar
  2. 2.
    Bollobás, B. (1998). Modern graph theory (Vol. 184). Berlin: Springer.Google Scholar
  3. 3.
    Brooks, R. L. (1941). On colouring the nodes of a network. Proceedings of the Cambridge Philosophical Society, 37, 194–197.CrossRefMathSciNetGoogle Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    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.
  6. 6.
    Ganesan, A. (2010). The performance of an upper bound on the fractional chromatic number of weighted graphs. Applied Mathematics Letters, 23, 497–599.CrossRefMathSciNetGoogle Scholar
  7. 7.
    Gerke, S., & McDiarmid, C. (2001). Graph imperfection. Journal of Combinatorial Theory Series B, 83(1), 58–78.CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Grötschel, M., Lovász, L., & Schrijver, A. (1981). The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1, 169–197.CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Gupta, R., Musacchio, J., & Walrand, J. (2007). Sufficient rate constraints for QoS flows in ad-hoc networks. Ad Hoc Networks, 5, 429–443.CrossRefGoogle Scholar
  10. 10.
    Hajek, B. (1984). Link schedules, flows, and the multichromatic index of graphs. In Proceedings of the conference on information sciences and systems, March.Google Scholar
  11. 11.
    Hajek, B., & Sasaki, G. (1988). Link scheduling in polynomial time. IEEE Transactions on Information Theory, 34(5), 910–917.CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Hale, W.H. (1980). Frequency assignment: theory and applications. Proceedings of the IEEE, 68(12), 1497–1514.CrossRefGoogle Scholar
  13. 13.
    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.Google Scholar
  14. 14.
    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.Google Scholar
  15. 15.
    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.CrossRefGoogle Scholar
  16. 16.
    Lee, W.C.Y. (1995). Mobile cellular telecommunications (2nd ed.). New York City: McGraw-Hill.Google Scholar
  17. 17.
    Sarkar, S., & Sivarajan, K. N. (1998). Hypergraph models for cellular mobile communication systems. IEEE Transactions on Vehicular Technology, 47, 460–471.CrossRefGoogle Scholar
  18. 18.
    Shannon, C. E. (1949). A theorem on coloring the lines of a network. Journal of Mathematical Physics, 28, 148–151.zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Department of Mathematics, Amrita School of EngineeringAmrita UniversityCoimbatoreIndia

Personalised recommendations