Universal routing in multi hop radio network

We study dynamic routing in multi-hop radio networks in a specialized framework of adversarial queuing. We consider cross-layer interactions of the following three components of routing protocols: transmission policies for medium-access control, scheduling policies on the network layer, and hearing-control mechanisms through which transmissions interact with a scheduler. We propose a model of adversarial queuing in radio networks in which transmission policies are delegated to oracles and adversaries control packet injection. For such a setting, we propose a definition of universal stability that takes into account not only how packets are injected, as in the wireline adversarial model, but also how transmission policies behave. We investigate which scheduling policies are universally stable, depending on hearing control, and settle this question for many popular scheduling policies.

[1]  Baruch Awerbuch,et al.  Universal-stability results and performance bounds for greedy contention-resolution protocols , 2001, JACM.

[2]  Dariusz R. Kowalski,et al.  Adversarial queuing on the multiple-access channel , 2006, PODC '06.

[3]  Lang long,et al.  On cross-layer design of wireless networks , 2004, Proceedings of the IEEE 6th Circuits and Systems Symposium on Emerging Technologies: Frontiers of Mobile and Wireless Communication (IEEE Cat. No.04EX710).

[4]  Maria J. Serna,et al.  The robustness of stability under link and node failures , 2011, Theor. Comput. Sci..

[5]  Yan Zhang,et al.  Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.

[6]  Vicent Cholvi,et al.  Stability of FIFO networks under adversarial models: State of the art , 2007, Comput. Networks.

[7]  R. Srikant,et al.  A tutorial on cross-layer optimization in wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[8]  Raja Jurdak.  Wireless Ad Hoc and Sensor Networks: A Cross-Layer Design Perspective (Signals and Communication Technology) , 2007 .

[9]  Dariusz R. Kowalski,et al.  Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices , 2012, ICALP.

[10]  Allan Borodin,et al.  Stability preserving transformations: packet routing networks with edge capacities and speeds , 2001, SODA '01.

[11]  Dariusz R. Kowalski,et al.  Universal Routing in Multi-hop Radio Networks , 2016, ArXiv.

[12]  Matthew Andrews,et al.  A Survey of Scheduling Theory in Wireless Data Networks , 2007 .

[13]  Andrzej Pelc,et al.  Broadcasting in UDG radio networks with unknown topology , 2007, PODC '07.

[14]  Maria J. Serna,et al.  Adversarial Queueing Model for Continuous Network Dynamics , 2007, Theory of Computing Systems.

[15]  Maria J. Serna,et al.  Adversarial Models for Priority-Based Networks , 2003, MFCS.

[16]  Maria J. Serna,et al.  The impact of failure management on the stability of communication networks , 2004, Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004..

[17]  Hamid R. Sadjadpour,et al.  Understanding the Interaction between Packet Forwarding and Channel Access in Multihop Wireless Networks , 2012, IEEE Transactions on Mobile Computing.

[18]  Dariusz R. Kowalski,et al.  Distributed Randomized Broadcasting in Wireless Networks under the SINR Model , 2013, Encyclopedia of Algorithms.

[19]  Lisa Zhang,et al.  Routing and scheduling in multihop wireless networks with time-varying channels , 2004, SODA '04.

[20]  Andrzej Pelc,et al.  Broadcasting in undirected ad hoc radio networks , 2003, PODC '03.

[21]  Allan Borodin,et al.  Adversarial queuing theory , 2001, JACM.

[22]  Roger Wattenhofer,et al.  Algorithmic Models of Interference in Wireless Ad Hoc and Sensor Networks , 2009, IEEE/ACM Transactions on Networking.

[23]  Ashish Goel,et al.  Source routing and scheduling in packet networks , 2005, JACM.

[24]  Dariusz R. Kowalski,et al.  Bounds on Stability and Latency in Wireless Communication , 2010, IEEE Communications Letters.

[25]  Lisa Zhang,et al.  Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data , 2005, JACM.

[26]  Antonio Fernández,et al.  Deterministic recurrent communication in restricted Sensor Networks , 2012, Theor. Comput. Sci..

[27]  Rajmohan Rajaraman,et al.  Topology control and routing in ad hoc networks: a survey , 2002, SIGA.

[28]  P. Karn,et al.  MACA-a New Channel Access Method for Packet Radio , 1990 .

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

[30]  Fotis Foukalas,et al.  Cross-layer design proposals for wireless mobile networks: a survey and taxonomy , 2008, IEEE Communications Surveys & Tutorials.

[31]  Maria J. Serna,et al.  A Characterization of Universal Stability in the Adversarial Queuing Model , 2004, SIAM J. Comput..

[32]  Howard Frank,et al.  Routing in Packet-Switching Broadcast Radio Networks , 1976, IEEE Trans. Commun..

[33]  Dariusz R. Kowalski,et al.  A better wake-up in radio networks , 2004, PODC '04.

[34]  JORGE URRUTIA,et al.  Routing with guaranteed delivery in geometric and wireless networks , 2002 .

[35]  Andrzej Pelc,et al.  Electing a Leader in Multi-hop Radio Networks , 2012, OPODIS.

[36]  Antonio Fernández,et al.  Universal stability results for low rate adversaries in packet switched networks , 2003, IEEE Communications Letters.

[37]  Andrzej Pelc,et al.  Efficient Distributed Communication in Ad-Hoc Radio Networks , 2011, ICALP.

[38]  Roger Wattenhofer,et al.  An Algorithmic Approach to Geographic Routing in Ad Hoc and Sensor Networks , 2008, IEEE/ACM Transactions on Networking.

[39]  Calvin C. Newport,et al.  Broadcast in the Ad Hoc SINR Model , 2013, DISC.