LEARN: localized energy aware restricted neighborhood routing for ad hoc networks

In this paper, we address the problem of energy efficient localized routing in wireless ad hoc networks. Numerous energy aware routing protocols were proposed to seek the power efficiency of routes. Among them, several geographical localized routing protocols were proposed to help making smarter routing decision using only local information and reduce the routing overhead. However, most of the proposed localized routing methods cannot theoretically guarantee the power efficiency of their routes. In this paper, we give the first localized routing algorithm, called localized energy aware restricted neighborhood routing (LEARN), which can guarantee the power efficiency of its route asymptotically almost sure. Given destination node t, an intermediate node v will only select a certain neighbor v such that < vut les alpha for a parameter alpha < pi/3 in our LEARN method. We theoretically prove that for a network, formed by nodes that are produced by a Poisson distribution with rate n over a compact and convex region O with unit area, when the transmission range rn = radicbetalnl/pin for some beta > pi/alpha, our LEARN routing protocol will find the route for any pair of nodes asymptotically almost sure. When the transmission range rn = radicbetalnl/pin for some beta < pi/alpha, the LEARN routing protocol will not be able to find the route for any pair of nodes asymptotically almost sure. We also conducted simulations to study the performance of LEARN and compare it with a typical localized routing protocol (GPSR) and a global ad hoc routing protocol (DSR)

[1]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[2]  M. Penrose.  The longest edge of the random minimal spanning tree , 1997 .

[3]  Prosenjit Bose,et al.  Online Routing in Triangulations , 1999, SIAM J. Comput..

[4]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

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

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

[7]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[9]  Ivan Stojmenovic,et al.  Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[10]  Qun Li,et al.  Online power-aware routing in wireless Ad-hoc networks , 2001, MobiCom '01.

[11]  Xiang-Yang Li,et al.  Power efficient and sparse spanner for wireless ad hoc networks , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).

[12]  Ivan Stojmenovic,et al.  Power and cost aware localized routing with guaranteed delivery in wireless networks , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[13]  Timothy X. Brown,et al.  An on-demand minimum energy routing protocol for a wireless ad hoc network , 2002, MOCO.

[14]  Roger Wattenhofer,et al.  Asymptotically optimal geometric mobile ad-hoc routing , 2002, DIALM '02.

[15]  Christian Bettstetter,et al.  On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.

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

[17]  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).

[18]  Yu Wang,et al.  Robust deployment and fault tolerant topology control for wireless ad hoc networks , 2003 .

[19]  Roger Wattenhofer,et al.  Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.

[20]  Xiang-Yang Li,et al.  Fault tolerant deployment and topology control in wireless ad hoc networks , 2004, Wirel. Commun. Mob. Comput..

[21]  Dario Pompili,et al.  Optimal local topology knowledge for energy efficient geographical routing in sensor networks , 2004, IEEE INFOCOM 2004.

[22]  Ivan Stojmenovic,et al.  Power and cost aware localized routing with guaranteed delivery in unit graph based ad hoc networks , 2004, Wirel. Commun. Mob. Comput..

[23]  Peng-Jun Wan,et al.  Probabilistic aspects of wireless ad hoc networks , 2005 .

[24]  Archan Misra,et al.  Minimum energy reliable paths using unreliable wireless links , 2005, MobiHoc '05.

[25]  Xiang-Yang Li,et al.  Efficient Delaunay‐based localized routing for wireless sensor networks , 2007, Int. J. Commun. Syst..