Optimal Geographic Routing for Wireless Networks with Near-Arbitrary Holes and Traffic

We consider the problem of throughput-optimal routing over large-scale wireless ad-hoc networks. Gupta and Kumar (2000) showed that a throughput capacity (a uniform rate over all source-destination pairs) of thetas( 1/radicn log n ) is achievable in random planar networks, and the capacity is achieved by straight-line routes. In reality, both the network model and the traffic demands are likely to be highly non-uniform. In this paper, we first propose a randomized forwarding strategy based on geographic routing that achieves near-optimal throughput over random planar networks with an arbitrary number of routing holes (regions devoid of nodes) of varying sizes. Next, we study a random planar network with arbitrary source-destination pairs with arbitrary traffic demands. For such networks, we demonstrate a randomized local load-balancing algorithm that supports any traffic load that is within a poly-logarithmic factor of the throughput region. Our algorithms are based on geographic routing and hence inherit their advantageous properties of low- complexity, robustness and stability.

[1]  Sergio D. Servetto,et al.  Capacity, stability and flows in large-scale random networks , 2004, Information Theory Workshop.

[2]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[3]  Leonidas J. Guibas,et al.  GLIDER: gradient landmark-based distributed routing for sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[4]  Alexander L. Stolyar,et al.  Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm , 2005, Queueing Syst. Theory Appl..

[5]  Massimo Franceschetti,et al.  Closing the gap in the capacity of random wireless networks , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[6]  Sanjay Shakkottai,et al.  On Optimal Geographic Routing in Wireless Networks with Holes and Non-Uniform Traffic , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[7]  Devavrat Shah,et al.  Throughput-delay trade-off in wireless networks , 2004, IEEE INFOCOM 2004.

[8]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[9]  Fabian Kuhn,et al.  Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.

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

[11]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[12]  Robert Morris,et al.  Location Proxies and Intermediate Node Forwarding for Practical Geographic Forwarding , 2001 .

[13]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[14]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

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

[16]  Ness B. Shroff,et al.  Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[17]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[18]  Ness B. Shroff,et al.  Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[19]  Ness B. Shroff,et al.  Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility , 2006, IEEE Transactions on Information Theory.

[20]  Eytan Modiano,et al.  Capacity and delay tradeoffs for ad hoc mobile networks , 2005, IEEE Trans. Inf. Theory.

[21]  D. Shah,et al.  Capacity-Delay Scaling in Arbitrary Wireless Networks , 2006 .

[22]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[23]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .