Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks

We present a framework for the provision of deterministic end-to-end bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility conditions, multi-hop sessions are dynamically offered allocations, further translated to link demands. Using a distributed Time Division Multiple Access (TDMA) protocol nodes adapt to the demand changes on their adjacent links by local, conflict-free slot reassignments. As soon as the demand changes stabilize, the nodes must incrementally converge to a TDMA schedule that realizes the global link (and session) demand allocation.We first derive sufficient local feasibility conditions for certain topology classes and show that trees can be maximally utilized.We then introduce a converging distributed link scheduling algorithm that exploits the logical tree structure that arises in several ad hoc network applications.Decoupling bandwidth allocation to multi-hop sessions from link scheduling allows support of various end-to-end Quality of Service (QoS) objectives. We focus on the max-min fairness (MMF) objective and design an end-to-end asynchronous distributed algorithm for the computation of the session MMF rates. Once the end-to-end algorithm converges, the link scheduling algorithm converges to a TDMA schedule that realizes these rates.We demonstrate the applicability of this framework through an implementation over an existing wireless technology. This implementation is free of restrictive assumptions of previous TDMA approaches: it does not require any a-priori knowledge on the number of nodes in the network nor even network-wide slot synchronization.

[1]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[2]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[3]  Anthony Ephremides,et al.  The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm , 1981, IEEE Trans. Commun..

[4]  Erdal Arikan,et al.  Some complexity results about packet radio networks , 1983, IEEE Trans. Inf. Theory.

[5]  M.J. Post,et al.  A Distributed Evolutionary Algorithm for Reorganizing Network Communications , 1985, MILCOM 1985 - IEEE Military Communications Conference.

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

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

[8]  C. Cheng,et al.  A protocol to maintain a minimum spanning tree in a dynamic topology , 1988, SIGCOMM.

[9]  C. Cheng,et al.  A protocol to maintain a minimum spanning tree in a dynamic topology , 1988, SIGCOMM 1988.

[10]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM '89.

[11]  Aaron Kershenbaum,et al.  Distributed scheduling of CDMA networks with minimal information , 1991, IEEE Trans. Commun..

[12]  A. Charny,et al.  An Algorithm for Rate Allocation in a Packet-Switching Network With Feedback , 1994 .

[13]  Mario Gerla,et al.  Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.

[14]  J.J. Garcia-Luna-Aceves,et al.  Distributed assignment of codes for multihop packet-radio networks , 1997, MILCOM 97 MILCOM 97 Proceedings.

[15]  Kevin R. Fall,et al.  Ns: notes and documentation , 1997 .

[16]  Anujan Varma,et al.  Congestion management in high-speed networks , 1997 .

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

[18]  Ellen W. Zegura,et al.  Utility max-min: an application-oriented bandwidth allocation scheme , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[19]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE J. Sel. Areas Commun..

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

[21]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[22]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[23]  Haiyun Luo,et al.  A new model for packet scheduling in multihop wireless networks , 2000, MobiCom '00.

[24]  Raj Jain,et al.  The ERICA switch algorithm for ABR traffic management in ATM networks , 1998, TNET.

[25]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[26]  Anthony Ephremides,et al.  On the construction of energy-efficient broadcast and multicast trees in wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[28]  C. Lin,et al.  On-demand QoS routing in multihop mobile networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[29]  Niklas Johansson,et al.  JUMP mode---a dynamic window-based scheduling framework for Bluetooth scatternets , 2001, MobiHoc '01.

[30]  Leandros Tassiulas,et al.  A Distributed Scheduling Algorithm for a Bluetooth Scatternet , 2001 .

[31]  Imrich Chlamtac,et al.  Bluetrees-scatternet formation to enable Bluetooth-based ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[32]  András Rácz,et al.  A pseudo random coordinated scheduling algorithm for Bluetooth scatternets , 2001, MobiHoc '01.

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

[34]  Chenxi Zhu,et al.  QoS routing for mobile ad hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[35]  Matthias Frank,et al.  Bluetooth scatternets: an enhanced adaptive scheduling scheme , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[36]  Mario Gerla,et al.  Rendezvous scheduling in Bluetooth scatternets , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[37]  Leandros Tassiulas,et al.  Performance issues of Bluetooth scatternets and other asynchronous TDMA ad hoc networks , 2002 .

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

[39]  Hari Balakrishnan,et al.  An Efficient Scatternet Formation Algorithm for Dynamic Environments , 2002 .

[40]  Saswati Sarkar,et al.  Forming Connected Topologies in Bluetooth Adhoc Networks , 2003 .

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

[42]  Klara Nahrstedt,et al.  Price-based resource allocation in wireless ad hoc networks , 2003, IWQoS'03.

[43]  Jitendra Padhye,et al.  Routing in multi-radio, multi-hop wireless mesh networks , 2004, MobiCom '04.

[44]  S. Shakkottai,et al.  Hop-by-hop congestion control over a wireless multi-hop network , 2007, IEEE INFOCOM 2004.

[45]  Leandros Tassiulas,et al.  Asynchronous TDMA ad hoc networks: scheduling and performance , 2004, Eur. Trans. Telecommun..

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

[47]  Guohong Cao,et al.  Optimizing tree reconfiguration for mobile target tracking in sensor networks , 2004, IEEE INFOCOM 2004.

[48]  Vaduvur Bharghavan,et al.  Spine routing in ad hoc networks , 1998, Cluster Computing.

[49]  Leandros Tassiulas,et al.  Distributed on-line schedule adaptation for balanced slot allocation in wireless ad hoc networks , 2004, Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004..

[50]  Edward W. Knightly,et al.  End-to-end performance and fairness in multihop wireless backhaul networks , 2004, MobiCom '04.

[51]  Leandros Tassiulas,et al.  End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks , 2005, IEEE Transactions on Automatic Control.

[52]  Lijun Chen,et al.  Joint congestion control and media access control design for ad hoc wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[53]  Murali S. Kodialam,et al.  Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels , 2005, IEEE/ACM Transactions on Networking.