Provable Algorithms for Joint Optimization of Transport , Routing and MAC layers in Wireless Ad Hoc Networks

Given a wireless network and a collection of source-destination pairs {(si, ti)}, what is the maximum end-to-end rate (throughput) at which the network can transfer data from the sources to their corresponding destinations? The problem is nontrivial to solve in the case of wireless networks due to interference. It is additionally complicated when taking into account TCP like transport protocols. Here, we present near-optimal provably good polynomialtime routing and scheduling algorithms for solving these and other throughput maximization problems in wireless ad hoc networks. We also present distributed algorithms for simultaneously optimizing a large class of throughput related objectives with fixed routes and schedules. We consider a wide variety of conflict-graph based models with both primary and secondary wireless interference constraints. Our techniques can accommodate a variety of routing constraints such as low energy, low hop-count, etc. as well as incorporate wireless technologies such as multiple channels and directional antennas.

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

[2]  Aravind Srinivasan,et al.  Algorithmic aspects of capacity in wireless networks , 2005, SIGMETRICS '05.

[3]  Andrea J. Goldsmith,et al.  Capacity regions for wireless ad hoc networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[4]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  Arunabha Sen,et al.  A new model for scheduling packet radio networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[6]  Randeep Bhatia,et al.  Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks , 2006, IEEE J. Sel. Areas Commun..

[7]  Leandros Tassiulas,et al.  Routing for network capacity maximization in energy-constrained ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[8]  Eytan Modiano,et al.  Minimum energy disjoint path routing in wireless ad-hoc networks , 2003, MobiCom '03.

[9]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.

[10]  A. Gräf,et al.  On Coloring Unit Disk Graphs , 1998, Algorithmica.

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

[12]  Fabian Kuhn,et al.  Ad-hoc networks beyond unit disk graphs , 2003, DIALM-POMC '03.

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

[14]  Ashish Goel,et al.  Bandwidth Allocation in Networks: A Single Dual Update Subroutine for Multiple Objectives , 2004, CAAN.

[15]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[16]  Ashish Goel,et al.  Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs , 2006, Algorithmica.

[17]  Éva Tardos,et al.  Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[18]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[19]  Xiaojun Lin,et al.  The Impact of Imperfect Scheduling on Cross-Layer Rate Control in Multihop Wireless Networks , 2022 .

[20]  Stephen P. Boyd,et al.  Simultaneous routing and resource allocation via dual decomposition , 2004, IEEE Transactions on Communications.

[21]  S. Ramanathan.  A unified framework and algorithm for channel assignment in wireless networks , 1999, Wirel. Networks.

[22]  Roger Wattenhofer,et al.  Unit disk graph approximation , 2004, DIALM-POMC '04.

[23]  Xiaojun Lin,et al.  Joint rate control and scheduling in multihop wireless networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[24]  Madhav V. Marathe,et al.  Characterizing the interaction between routing and MAC protocols in ad-hoc networks , 2002, MobiHoc '02.

[25]  Mung Chiang,et al.  Balancing transport and physical Layers in wireless multihop networks: jointly optimal congestion control and power control , 2005, IEEE Journal on Selected Areas in Communications.

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

[27]  Yong Pei,et al.  On the capacity improvement of ad hoc wireless networks using directional antennas , 2003, MobiHoc '03.

[28]  Lin Xiao,et al.  Cross-layer optimization of wireless networks using nonlinear column generation , 2006, IEEE Transactions on Wireless Communications.

[29]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[30]  Madhav V. Marathe,et al.  Approximation Algorithms for Channel Assignment in Radio Networks , 1998 .

[31]  Madhav V. Marathe,et al.  The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks , 2004, IEEE Journal on Selected Areas in Communications.