Advertisement

Scalable Max-Min Fairness in Wireless Ad Hoc Networks

  • Congzhou Zhou
  • N. F. Maxemchuk
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 28)

Abstract

Our previous work proposes a macro model to perform flow and access control in wireless ad hoc networks. In this paper, we demonstrate specifically how to apply the model to achieve max-min fair rate allocation. Our proposed scheme is simple and scalable when comparing to other techniques in the literature. Moreover, it has the ability to provide stability in mobile environment. Simulation results show that our new method provides a good max-min fair flow assignment, and with that assignment, quality of service guarantees can be achieved for real-time applications.

Keywords

macro model max-min fairness scalability quality of service 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bertsekas, D., Gallagher, R.: Data Networks. Prentice Hall, Upper Saddle River (1992)Google Scholar
  2. 2.
    Nace, D., Pioro, M.: Max-Min Fairness and Its Applications to Routing and Load-Balancing in Communication Networks: A Tutorial. IEEE Communications Surveys & Tutorials 10(4), 5–17 (2008)CrossRefGoogle Scholar
  3. 3.
    Jaffe, J.: Bottleneck Flow Control. IEEE Transactions on Communications 29(7), 954–962 (1981)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Huang, X.L., Bensaou, B.: On Max-Min Fairness and Scheduling in Wireless Ad-Hoc Networks: Analytical Framework and Implementation. In: 2nd ACM International Symposium on Mobile Ad Hoc Networking & Computing, Long Beach, pp. 221–231 (2001)Google Scholar
  5. 5.
    Tassiulas, L., Sarkar, S.: Maxmin Fair Scheduling in Wireless Networks. IEEE Journal on Selected Areas in Communications 23(1), 163–173 (2005)CrossRefGoogle Scholar
  6. 6.
    Wang, X., Kar, K.: Distributed Algorithms for Max-Min Fair Rate Allocation in Aloha Networks. In: 42nd Annual Allerton Conference, Urbana-Champaign (2004)Google Scholar
  7. 7.
    Wang, X., Kar, K., Pang, J.S.: Lexicographic Max-Min Fairness in a Wireless Ad-Hoc Network with Random Access. In: 45th IEEE Conference on Decision and Control, San Diego, pp. 1294–1300 (2006)Google Scholar
  8. 8.
    Aoun, B., Boutaba, R.: Max-Min Fair Capacity of Wireless Mesh Networks. In: 2006 IEEE International Conference on Mobile Adhoc and Sensor Systems, Vancouver, pp. 21–30 (2006)Google Scholar
  9. 9.
    Sridharan, A., Krishnamachari, B.: Maximizing Network Utilization with Max-Min Fairness in Wireless Sensor Networks. In: 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops, Limassol, pp. 1–9 (2007)Google Scholar
  10. 10.
    Maxemchuk, N.F., Zhou, C.: A Macro Model of Frequently Changing Mobile Networks to Perform Flow and Access Control. Mobile Networks and Applications 11(5), 649–659 (2006)CrossRefGoogle Scholar
  11. 11.
    Zhou, C., Maxemchuk, N.F.: Applying a Macro Model of Ad Hoc Networks to Access Control. In: 7th International Conference on Networking, Cancun, pp. 445–453 (2008)Google Scholar
  12. 12.
    Yang, Y., Kravets, R.: Contention-Aware Admission Control for Ad Hoc Networks. IEEE Transactions on Mobile Computing 4(4), 363–377 (2005)CrossRefGoogle Scholar
  13. 13.
    Sanzgiri, K., Chakeres, I., Belding-Royer, E.: Determining Intra-Flow Contention along Multihop Paths in Wireless Networks. In: 1st International Conference on Broadband Networks, San Jose, pp. 611–620 (2004)Google Scholar
  14. 14.
  15. 15.
    802.11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications. IEEE Computer Society (1999)Google Scholar
  16. 16.
    Karp, B., Kung, H.T.: GPSR: Greedy Perimeter Stateless Routing for Wireless Networks. In: 6th Annual ACM/IEEE International Conference on Mobile computing and Networking, Boston, pp. 243–254 (2000)Google Scholar
  17. 17.
    Liao, W.H., Tseng, Y.C., Sheu, J.P.: GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks. Telecommunication Systems 18(1), 37–60 (2001)CrossRefzbMATHGoogle Scholar
  18. 18.
    Kim, D., Maxemchuk, N.F.: Simple Robotic Routing in Ad Hoc Networks. In: 13th IEEE International Conference on Network Protocols, Boston, pp. 159–168 (2005)Google Scholar
  19. 19.
    Gupta, P., Kumar, P.R.: The Capacity of Wireless Networks. IEEE Transactions on Information Theory 46(2), 388–404 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Li, J., Blake, C., De Couto, D.S.J., Lee, H.I., Morris, R.: Capacity of Ad Hoc Wireless Networks. In: 7th Annual International Conference on Mobile computing and Networking, Rome, pp. 61–69 (2001)Google Scholar

Copyright information

© ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering 2010

Authors and Affiliations

  • Congzhou Zhou
    • 1
  • N. F. Maxemchuk
    • 1
  1. 1.Department of Electrical EngineeringColumbia UniversityNew YorkUSA

Personalised recommendations