This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Power-Aware Localized Routing in Wireless Networks
November 2001 (vol. 12 no. 11)
pp. 1122-1133

Abstract—Recently, a cost aware metric for wireless networks based on remaining battery power at nodes was proposed for shortest-cost routing algorithms, assuming constant transmission power. Power-aware metrics, where transmission power depends on distance between nodes and corresponding shortest power algorithms were also recently proposed. We define a new power-cost metric based on the combination of both node's lifetime and distance-based power metrics. We investigate some properties of power adjusted transmissions and show that, if additional nodes can be placed at desired locations between two nodes at distance d, the transmission power can be made linear in d as opposed to d^\alpha dependence for \alpha\geq 2. This provides basis for power, cost, and power-cost localized routing algorithms where nodes make routing decisions solely on the basis of location of their neighbors and destination. The power-aware routing algorithm attempts to minimize the total power needed to route a message between a source and a destination. The cost-aware routing algorithm is aimed at extending the battery's worst-case lifetime at each node. The combined power-cost localized routing algorithm attempts to minimize the total power needed and to avoid nodes with a short battery's remaining lifetime. We prove that the proposed localized (where each node makes routing decisions based solely on the location of itself, its neighbors, and destination) power, cost, and power-cost efficient routing algorithms are loop-free and show their efficiency by experiments.

[1] S. Basagni, I. Chlamtac, V.R. Syrotiuk, and B.A. Woodward, “A Distance Routing Effect Algorithm for Mobility (DREAM),” Proc. Conf. Mobile Computing MOBICOM, pp. 76-84, 1988.
[2] J. Broch, D.A. Maltz, D.B. Johnson, Y.C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. Conf. Mobile Computing MOBICOM, pp. 85-97, 1998.
[3] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks,” Proc. Third Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., pp. 48-55, Aug. 1999.
[4] S. Capkun, M. Hamdi, and J.P. Hubaux, “GPS-Free Positioning in Mobile Ad-Hoc Networks,” Proc. Hawaii Int'l Conf. System Sciences, Jan. 2001.
[5] S. Chen and K. Nahrstedt, “Distributed Quality-of-Service Routing in Ad-Hoc Networks,” IEEE J. Selected Areas in Comm., vol. 17, pp. 1488-1505, 1999.
[6] J.H. Chang and L. Tassiulas, “Routing for Maximum System Lifetime in Wireless Ad-Hoc Networks,” Proc. 37th Ann. Allerton Conf. Comm., Control, and Computing, Sept. 1999.
[7] J.-H. Chang and L. Tassiulas, “Energy Conserving Routing in Wireless Ad-Hoc Networks,” Proc. INFOCOM 2000, pp. 22-31, Mar. 2000.
[8] M. Ettus, “System Capacity, Latency, and Power Consumption in Multihop-Routed SS-CDMA Wireless Networks,” Proc. IEEE Radio and Wireless Conf., Aug. 1998.
[9] D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, “Next Century Challenges: Scalable Coordination in Sensor Networks,” Proc. Mobile Computing MOBICOM, pp. 263-270, 1999.
[10] G.G. Finn, “Routing and Addressing Problems in Large Metropolitan-Scale Internetworks,” Research Report ISU/RR-87-180, Inst. for Scientific Information, Mar. 1987.
[11] J. Gomez, A.T. Campbell, M. Naghshineh, and C. Bisdikian, “Power-Aware Routing in Wireless Packet Networks,” Proc. IEEE Int'l Workshop Mobile Multimedia Comm., Nov. 1999.
[12] W.R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, “Energy-Efficient Routing Protocols for Wireless Microsensor Networks,” Proc. Hawaii Int'l Conf. System Sciences, Jan. 2000.
[13] W.R. Heinzelman, J. Kulik, and H. Balakrishnan, “Adaptive Protocols for Information Dissemination in Wireless Sensor Networks,” Proc. Conf. Mobile Computing MOBICOM, pp. 174-185, 1999.
[14] T.C. Hou and V.O.K. Li, “Transmission Range Control in Multihop Packet Radio Networks,” IEEE Trans. Comm., vol. 34, no. 1, pp. 38-44, 1986.
[15] Internet Engineering Task Force (IETF) internet draft,http://www.netlib.org/ncwn/pvmsystem.pshttp:/ /www.ietf.org/html.chartersmanet-charter.html , 1998.
[16] J.M. Kahn, R.H. Katz, and K.S.J. Pister, “Next Century Challenges: Mobile Networking for 'Smart Dust',” Proc. Conf. Mobile Computing MOBICOM, pp. 271-278, 1999.
[17] E. Kranakis, H. Singh, and J. Urrutia, “Compass Routing on Geometric Networks,” Proc. 11th Canadian Conf. Computational Geometry, Aug. 1999.
[18] Y.B. Ko and N.H. Vaidya, “Location-Aided Routing (LAR) in Mobile Ad Hoc Networks,” Proc. Conf. Mobile Computing MOBICOM, pp. 66-75, 1998.
[19] C.R. Lin and J.S. Liu, “QoS Routing in Ad Hoc Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 17, no. 8, pp. 1426-1438, Aug. 1999.
[20] J.P. Macker and M.S. Corson, “Mobile Ad Hoc Networking and the IETF,” ACM Mobile Computing and Comm. Rev., vol. 2, no. 1, pp. 9-14, 1998.
[21] R. Nelson and L. Kleinrock, “The Spatial Capacity of a Slotted ALOHA Multihop Packet Radio Network with Capture,” IEEE Trans. Comm., vol. 32, no. 6, pp. 684-694, 1984.
[22] V. Rodoplu and T.H. Meng, “Minimum Energy Mobile Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 17, no. 8, pp. 1333-1344, Aug. 1999.
[23] S. Ramanathan and M. Steenstrup, “A Survey of Routing Techniques for Mobile Communication Networks,” Mobile Networks and Applications, vol. 1, no. 2, pp. 89-104, 1996.
[24] E.M. Royer and C.K. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks,” IEEE Personal Comm., pp. 46-55, Apr. 1999.
[25] S. Singh and C.S. Raghavendra, “PAMAS—Power Aware Multi-Access Protocol with Signalling for Ad Hoc Networks,” Proc. ACM SIGCOMM, Computer Comm. Rev., July 1998.
[26] S. Singh, M. Woo, and C.S. Raghavendra, “Power-Aware Routing in Mobile Ad Hoc Networks,” Proc. Conf. Mobile Computing MOBICOM, pp. 181-190, 1998.
[27] I. Stojmenovic, “Location Updates for Efficient Routing in Ad Hoc Networks,” Handbook on Wireless Networks and Mobile Computing, Wiley&Sons, 2001.
[28] I. Stojmenovic and S. Datta, Power Aware Routing Algorithms with Guaranteed Delivery in Wireless Networks, 2001.
[29] I. Stojmenovic and X. Lin, “GEDIR: Loop-Free Location Based Routing in Wireless Networks,” Int'l Assoc. Science and Technology for Development (IASTED) Conf. Parallel and Distributed Computing and Systems, pp. 1025-1028, Nov. 1999.
[30] I. Stojmenovic and X. Lin, “Power-Aware Localized Routing in Wireless Networks,” Proc. IEEE Int'l Parallel and Distributed Processing Symp., pp. 371-376, May 2000.
[31] I. Stojmenovic and X. Lin, “Power Aware Distributed Routing in Ad Hoc Wireless Networks,” Technical Report TR-98-11, Computer Science, SITE, Univ. of Ottawa, Dec. 1998.
[32] I. Stojmenovic, “A Routing Strategy and Quorum Based Location Update Scheme for Ad Hoc Wireless Networks,” Technical Report TR-99-09, Computer Science, SITE, University of Ottawa, Sept. 1999.
[33] H. Takagi and L. Kleinrock, “Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals,” IEEE Trans. Comm., vol. 32, no. 3, pp. 246-257, 1984.

Index Terms:
Routing, wireless networks, distributed algorithms, power management.
Citation:
Ivan Stojmenovic, Xu Lin, "Power-Aware Localized Routing in Wireless Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 11, pp. 1122-1133, Nov. 2001, doi:10.1109/71.969123
Usage of this product signifies your acceptance of the Terms of Use.