Joint congestion control and media access control design for ad hoc wireless networks

We present a model for the joint design of congestion control and media access control (MAC) for ad hoc wireless networks. Using contention graph and contention matrix, we formulate resource allocation in the network as a utility maximization problem with constraints that arise from contention for channel access. We present two algorithms that are not only distributed spatially, but more interestingly, they decompose vertically into two protocol layers where TCP and MAC jointly solve the system problem. The first is a primal algorithm where the MAC layer at the links generates congestion (contention) prices based on local aggregate source rates, and TCP sources adjust their rates based on the aggregate prices in their paths. The second is a dual subgradient algorithm where the MAC sub-algorithm is implemented through scheduling link-layer flows according to the congestion prices of the links. Global convergence properties of these algorithms are proved. This is a preliminary step towards a systematic approach to jointly design TCP congestion control algorithms and MAC algorithms, not only to improve performance, but more importantly, to make their interaction more transparent.

[1]  Lan Wang,et al.  TCP over wireless multi-hop protocols: simulation and experiments , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[2]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[3]  Theodore S. Rappaport,et al.  Cross-layer design for wireless networks , 2003, IEEE Commun. Mag..

[4]  R. Srikant,et al.  End-to-end congestion control schemes: utility functions, random losses and ECN marks , 2003, TNET.

[5]  Feng Wang,et al.  Improving TCP performance over mobile ad-hoc networks with out-of-order detection and response , 2002, MobiHoc '02.

[6]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[7]  John T. Wen,et al.  A unifying passivity framework for network flow control , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[9]  Brahim Bensaou,et al.  Fair bandwidth sharing algorithms based on game theory frameworks for wireless ad-hoc networks , 2004, IEEE INFOCOM 2004.

[10]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[11]  Rajendra V. Boppana,et al.  A comparison of TCP performance over three routing protocols for mobile ad hoc networks , 2001, MobiHoc.

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

[13]  Gérard Cornuéjols,et al.  The Strong Perfect Graph Theorem , 2003 .

[14]  Tamer A. ElBatt,et al.  Joint scheduling and power control for wireless ad hoc networks , 2002, IEEE Transactions on Wireless Communications.

[15]  Mario Gerla,et al.  Enhancing TCP fairness in ad hoc wireless networks using neighborhood RED , 2003, MobiCom '03.

[16]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[17]  Leandros Tassiulas,et al.  Maxmin fair scheduling in wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[18]  Mario Gerla,et al.  Fair Sharing of MAC under TCP in Wireless Ad Hoc Networks , 1999 .

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

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

[21]  Naum Zuselevich Shor,et al.  Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.

[22]  Mung Chiang,et al.  To layer or not to layer: balancing transport and physical layers in wireless multihop networks , 2004, IEEE INFOCOM 2004.

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

[24]  Murali S. Kodialam,et al.  Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem , 2003, MobiCom '03.

[25]  Nitin H. Vaidya,et al.  Analysis of TCP Performance over Mobile Ad Hoc Networks , 1999, Wirel. Networks.

[26]  Mario Gerla,et al.  TCP behavior across multihop wireless networks and the wired internet , 2002, WOWMOM '02.

[27]  Haiyun Luo,et al.  The impact of multihop wireless channel on TCP throughput and loss , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[28]  Ansi Ieee,et al.  Part11 : Wireless LAN Media Access Control (MAC) and Physical Layer (PHY) Specifications , 1999 .

[29]  Stephen P. Boyd,et al.  Simultaneous routing and resource allocation for wireless networks , 2001 .

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

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

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

[33]  Shugong Xu,et al.  Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks? , 2001, IEEE Commun. Mag..

[34]  Lun Li,et al.  Can shortest-path routing and TCP maximize utility , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[35]  Steven H. Low,et al.  A duality model of TCP and queue management algorithms , 2003, TNET.

[36]  Sanjay Shakkottai,et al.  Hop-by-Hop Congestion Control Over a Wireless Multi-Hop Network , 2004, IEEE/ACM Transactions on Networking.

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