Fair bandwidth sharing algorithms based on game theory frameworks for wireless ad-hoc networks

This paper examines the theoretical aspects of bandwidth sharing in wireless, possibly mobile, ad-hoc networks (MANETs) through a game theoretic framework. It presents some applications to show how such a framework can be invoked to design efficient media access control protocols in a noncooperative, self-organized, topology-blind environment as well as in environments where the competing nodes share some basic information to guide their choice of channel access policies. For this purpose, contentions between concurrent links in a MANET are represented by a conflict graph, and each maximal clique in the graph defines a contention context which in turn imposes a constraint on the share of bandwidth that the links in the clique can obtain. Using this approach the fair bandwidth allocation problem is modeled as a general utility based constrained maximization problem, called the system problem, which is shown to admit a unique solution that can only be obtained when global coordination between all links is possible. By using Lagrange relaxation and duality theory, both a non-cooperative and a cooperative game formulation of the problem are derived. The corresponding mathematical algorithms to solve the two games are also provided where there is no need for global information. Implementation issues of the algorithms are also considered. Finally, simulation results are presented to illustrate the effectiveness of the algorithms.

[1]  Gérard Cornuéjols.  The Strong Perfect Graph Conjecture , 2002 .

[2]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[3]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[4]  Bruce E. Hajek,et al.  Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.

[5]  S. Nash,et al.  Linear and Nonlinear Programming , 1987 .

[6]  T. Basar,et al.  A game-theoretic framework for congestion control in general topology networks , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[7]  J. Goodman.  Note on Existence and Uniqueness of Equilibrium Points for Concave N-Person Games , 1965 .

[8]  Haiyun Luo,et al.  A topology-independent wireless fair queueing model in ad hoc networks , 2005, IEEE Journal on Selected Areas in Communications.

[9]  Brahim Bensaou,et al.  On max-min fairness and scheduling in wireless ad-hoc networks: analytical framework and implementation , 2001, MobiHoc.

[10]  Brahim Bensaou,et al.  A novel admission control and QoS routing Protocol for ad-hoc networks , 2003 .

[11]  Paramvir Bahl,et al.  Distributed Fair Scheduling in a Wireless LAN , 2005, IEEE Trans. Mob. Comput..

[12]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[13]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[14]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[15]  Brahim Bensaou,et al.  A novel topology-blind fair medium access control for wireless LAN and ad hoc networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[16]  Catherine Rosenberg,et al.  A game theoretic framework for bandwidth allocation and pricing in broadband networks , 2000, TNET.

[17]  J. J. Garcia-Luna-Aceves,et al.  A new approach to channel access scheduling for Ad Hoc networks , 2001, MobiCom '01.

[18]  Vaduvur Bharghavan,et al.  Achieving MAC layer fairness in wireless packet networks , 2000, MobiCom '00.

[19]  Andrew T. Campbell,et al.  INSIGNIA: An IP-Based Quality of Service Framework for Mobile ad Hoc Networks , 2000, J. Parallel Distributed Comput..

[20]  Imrich Chlamtac,et al.  A mobility-transparent deterministic broadcast mechanism for ad hoc networks , 1999, TNET.

[21]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[22]  Baruch Schieber,et al.  Guaranteeing fair service to persistent dependent tasks , 1995, SODA '95.

[23]  Klara Nahrstedt,et al.  Distributed quality-of-service routing in ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[24]  Haiyun Luo,et al.  A topology-independent fair queueing model in ad hoc wireless networks , 2000, Proceedings 2000 International Conference on Network Protocols.

[25]  C. Shannon.  A Theorem on Coloring the Lines of a Network , 1949 .

[26]  Anders Hansson,et al.  Comparison between graph-based and interference-based STDMA scheduling , 2001, MobiHoc '01.