Power and cost aware localized routing with guaranteed delivery in unit graph based ad hoc networks

In a localized routing algorithm, each node currently holding a message makes forwarding decision solely based on the position information about itself, its neighbors and destination. In a unit graph, two nodes can communicate if and only if the distance between them is no more than the transmission radius, which is the same for each node. This paper proposes localized routing algorithms, aimed at minimizing total power for routing a message or maximizing the total number of routing tasks that a network can perform before a partition. The algorithms are combinations of known greedy power and/or cost aware localized routing algorithms and an algorithm that guarantees delivery. A shortcut procedure is introduced in later algorithm to enhance its performance. Another improvement is to restrict the routing to nodes in a dominating set. These improvements require two-hop knowledge at each node. The efficiency of proposed algorithms is verified experimentally by comparing their power savings, and the number of routing tasks a network can perform before a node loses all its energy, with the corresponding shortest weighted path algorithms and localized algorithms that use fixed transmission power at each node. Significant energy savings are obtained, and feasibility of applying power and cost-aware localized schemes is demonstrated. Copyright © 2004 John Wiley & Sons, Ltd.

[1]  Chun-chao Yeh,et al.  Variable-Radius Routing Protocols for High Throughput, Low Power, and Small Latency in Ad Hoc Wire , 2001 .

[2]  Joseph P. Macker,et al.  Mobile ad hoc networking and the IETF , 1998, MOCO.

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

[4]  Silvia Giordano,et al.  Mobile ad hoc networks , 2002 .

[5]  RNG and internal node based broadcasting algorithms for wireless one-to-one networks , 2001, MOCO.

[6]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

[7]  Jörg Widmer,et al.  Position-based multicast routing for mobile Ad-hoc networks , 2003, MOCO.

[8]  Jie Wu,et al.  Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks , 2004, Cluster Computing.

[9]  Deborah Estrin,et al.  Next Century Challenges: Mobile Networking for Smart Dust , 1999, MobiCom 1999.

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

[11]  Yuan Xue,et al.  A location-aided power-aware routing protocol in mobile ad hoc networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[12]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[13]  Leandros Tassiulas,et al.  Routing for Maximum System Lifetime in Wireless Ad-hoc Networks , 1999 .

[14]  Gregory G. Finn,et al.  Routing and Addressing Problems in Large Metropolitan-Scale Internetworks. ISI Research Report. , 1987 .

[15]  Teresa H. Meng,et al.  Minimum energy mobile wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[16]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

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

[18]  Ivan Stojmenovic,et al.  On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2002, J. Commun. Networks.

[19]  Asis Nasipuri,et al.  Mobile Ad Hoc Networks , 2004 .

[20]  Errol L. Lloyd,et al.  Broadcast scheduling for TDMA in wireless multihop networks , 2002 .

[21]  Krishna M. Sivalingam,et al.  Power optimization in routing protocols for wireless and mobile networks , 2002 .

[22]  Srdjan Capkun,et al.  GPS-free Positioning in Mobile Ad Hoc Networks , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.

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

[24]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[25]  C. R. Lin,et al.  QoS routing in ad hoc wireless networks , 1998, Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260).

[26]  Karthik Dantu,et al.  Power-aware source routing protocol for mobile ad hoc networks , 2002, ISLPED '02.

[27]  Ivan Stojmenovic,et al.  Power-Aware Localized Routing in Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

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

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

[30]  Symeon Papavassiliou,et al.  A position-based multi-zone routing protocol for wide area mobile ad-hoc networks , 1999, 1999 IEEE 49th Vehicular Technology Conference (Cat. No.99CH36363).

[31]  Timothy J. Shepard,et al.  A channel access scheme for large dense packet radio networks , 1996, SIGCOMM '96.

[32]  Ivan Stojmenovic.  Location updates for efficient routing in ad hoc networks , 2002 .

[33]  Lali Barrière,et al.  Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges , 2001, DIALM '01.

[34]  Ivan Stojmenovic,et al.  A routing strategy and quorum based location update scheme for ad hoc wireless networks , 1999 .

[35]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[36]  Srdjan Capkun,et al.  Self-organization in mobile ad hoc networks: the approach of Terminodes , 2001, IEEE Commun. Mag..

[37]  Xiang-Yang Li,et al.  Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks , 2003, IEEE Trans. Parallel Distributed Syst..

[38]  Suresh Singh,et al.  PAMAS—power aware multi-access protocol with signalling for ad hoc networks , 1998, CCRV.

[39]  S. M. Heemstra de Groot,et al.  Power-aware routing in mobile ad hoc networks , 1998, MobiCom '98.

[40]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.