End-to-end packet-scheduling in wireless ad-hoc networks

Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstraction here, and we study packet routing and scheduling under this model. The main focus of our work is the development of fully-distributed (decentralized) protocols. We present polylogarithmic/constant factor approximation algorithms for various families of disk graphs (which capture the geometric nature of wireless-signal propagation), as well as near-optimal approximation algorithms for general graphs. The packet-scheduling work by L eighton, Maggs and Rao (Combinatorica, 1994) and a basic distributed coloring procedure, originally due to Luby (J. Computer and System Sciences, 1993), underlie many of our algorithms. Experimental work of Finocchi, Panconesi, and Silvestri (SODA 2002) showed that a natural modification of Luby's algorithm leads to improved performance, and a rigorous explanation of this was left as an open question; we prove that the modified algorithm is provably better in the worst-case. Finally, using simulations, we study the impact of the routing strategy and the choice of parameters on the performance of our distributed algorithm for unit disk graphs.

[1]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[2]  Aravind Srinivasan,et al.  Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons , 2003, J. Comput. Syst. Sci..

[3]  Friedhelm Meyer auf der Heide,et al.  Energy, congestion and dilation in radio networks , 2002, SPAA '02.

[4]  Baruch Awerbuch,et al.  Routing with Polynomial Communication-Space Trade-Off , 1992, SIAM J. Discret. Math..

[5]  Aravind Srinivasan,et al.  A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria , 2000, SIAM J. Comput..

[6]  N Linial,et al.  Low diameter graph decompositions , 1993, Comb..

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

[8]  Subramanian Ramanathan,et al.  Scheduling algorithms for multi-hop radio networks , 1992, SIGCOMM '92.

[9]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

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

[11]  Aravind Srinivasan,et al.  On the Complexity of Distributed Network Decomposition , 1996, J. Algorithms.

[12]  Lenore Cowen,et al.  Low-Diameter Graph Decomposition Is in NC , 1992, Random Struct. Algorithms.

[13]  Noga Alon,et al.  Routing permutations on graphs via matchings , 1993, SIAM J. Discret. Math..

[14]  Michael Luby.  Removing randomness in parallel computation without a processor penalty , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

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

[16]  Alessandro Panconesi,et al.  An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms , 2002, SODA '02.

[17]  Aravind Srinivasan,et al.  A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria , 1997, STOC '97.

[18]  Alessandro Panconesi,et al.  Fast distributed algorithms for Brooks-Vizing colourings , 2000, SODA '98.

[19]  Bruce M. Maggs,et al.  Packet routing and job-shop scheduling inO(congestion+dilation) steps , 1994, Comb..

[20]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[21]  Luca Trevisan,et al.  Non-approximability results for optimization problems on bounded degree instances , 2001, STOC '01.

[22]  Christopher L. Barrett,et al.  Ef cient algorithms for channel assign-ment in wireless radio networks , 2005 .

[23]  Aravind Srinivasan,et al.  Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..

[24]  Rafail Ostrovsky,et al.  Universal O(congestion + dilation + log1+εN) local control packet switching algorithms , 1997, STOC '97.

[25]  Yuval Rabani,et al.  Distributed packet switching in arbitrary networks , 1996, STOC '96.

[26]  S. Ramanathan,et al.  A unified framework and algorithm for (T/F/C)DMA channel assignment in wireless networks , 1997, Proceedings of INFOCOM '97.

[27]  Bruce M. Maggs,et al.  Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules , 1999, Comb..

[28]  Bruce M. Maggs,et al.  Randomized Routing and Sorting on Fixed-Connection Networks , 1994, J. Algorithms.

[29]  Christian Scheideler,et al.  Universal Routing Strategies for Interconnection Networks , 1998, Lecture Notes in Computer Science.

[30]  Bruce S. Davie,et al.  Computer Networks: A System Approach , 1998, IEEE Communications Magazine.

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

[32]  Subramanian Ramanathan,et al.  Scheduling algorithms for multihop radio networks , 1993, TNET.

[33]  Bruce S. Davie,et al.  Computer Networks: A Systems Approach, 3rd Edition , 2003 .

[34]  ZhangLisa,et al.  Source routing and scheduling in packet networks , 2005 .

[35]  Andrew V. Goldberg,et al.  Network decomposition and locality in distributed computation , 1989, 30th Annual Symposium on Foundations of Computer Science.