Abstract
Geographic routing is one of the most widely-accepted techniques to route information in large-scale wireless sensor networks. It is based on a greedy forwarding strategy by which a sensor node selects as next hop relay the most promising neighbor (according to some metric) among those being closer to the destination than itself. This decision is based solely on the position of its neighbors and the destination. Given that sensor nodes are usually operated by batteries, energy-efficiency is a very important metric to be considered by the routing protocol. In this paper we present Locally-Optimal Source Routing (LOSR), a new localized and energy-efficient geographic routing algorithm for wireless sensor networks. Unlike existing energy-efficient geographic routing algorithms, in which current node routing the packet only considers nodes closer to destination than itself, LOSR uses all nodes in the neighborhood to compute a local energy-optimal path formed only by neighbors of the current node towards the selected next hop. Then, source routing is used to force data packets to follow that locally optimal path until next hop is reached. Our simulation results show that the proposed algorithm outperforms the best existing solution, over a variety of network densities and scenarios.
Partially supported by the Spanish MEC by means of the “Ramon y Cajal” program, SAVIA project (CIT-410000-2005-1) and SMART project (TIN2005-07705-C02-02).
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with Guaranteed Delivery in Ad Hoc Wireless Networks. Wireless Networks 7(6), 609–616 (2001)
Finn, G.G.: Routing and Addressing Problems in Large Metropolitan-scale Internetworks. Tech. Rep. ISI/RR-87-180, University of Southern California, Information Sciences Institute (March 1987)
Halkes, G., van Dam, T., Langendoen, K.: Comparing Energy-Saving MAC Protocols for Wireless Sensor Networks. Mobile Networks and Applications 10(5), 783–791 (2005)
Hou, T.-C., Li, V.: Transmission Range Control in Multihop Packet Radio Networks. IEEE Transactions on Communications 34(1), 38–44 (1986)
Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: Proc. 6th annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2000), pp. 243–254. ACM Press, New York (2000)
Kranakis, E., Singh, H., Urrutia, J.: Compass Routing on Geometric Networks. In: 11th Canadian Conference on Computational Geometry (CCCG 1999), Vancouver, pp. 51–54 (August 1999)
Rodoplu, V., Meng, T.: Minimum Energy Mobile Wireless Networks. IEEE Journal on Selected Areas in Communications 17(8), 1333–1344 (1999)
Stojmenovic, I.: Localized Network Layer Protocols in Wireless Sensor Networks based on Optimizing Cost Over Progress Ratio. IEEE Network 20(1), 21–27 (2006)
Stojmenovic, I., Lin, X.: Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks. IEEE Transactions on Parallel and Distributed Systems 12(10), 1023–1032 (2001)
Stojmenovic, I., Lin, X.: Power-Aware Localized Routing in Wireless Networks. IEEE Tran. on Paralell and Distributed Systems 12(10), 1122–1133 (2001)
Takagi, H., Kleinrock, L.: Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals. IEEE Transactions on Communications 32(3), 246–247 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sanchez, J.A., Ruiz, P.M. (2006). Exploiting Local Knowledge to Enhance Energy-Efficient Geographic Routing. In: Cao, J., Stojmenovic, I., Jia, X., Das, S.K. (eds) Mobile Ad-hoc and Sensor Networks. MSN 2006. Lecture Notes in Computer Science, vol 4325. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11943952_48
Download citation
DOI: https://doi.org/10.1007/11943952_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49932-9
Online ISBN: 978-3-540-49933-6
eBook Packages: Computer ScienceComputer Science (R0)