Abstract
To extend the network lifetime, the route may be periodically alternated to prevent the energy consumption being concentrated to a small number of nodes. This method incurs large routing traffic incurred by frequent route discovery, which implies that it may not increase the network life time as much as it intends to. To solve this problem, we propose an energy efficient routing algorithm which uses two levels of route alternation. When it first finds the end to end route, it also caches the backup routes. It first changes the route using the backup routes and after the all the costs of the backup routes increase more than a certain amount, it begins to find a new end to end route and new backup routes. When it alternates routes using the backup route, the routing overhead is very small. In this way HPSR can reduce the routing overhead while distributing the cost throughout the network. We compare the performance of HPSR with existing routing algorithms using OPNET.
This work was supported by the grant No.R01-2003-000-10724-0 from Korea Science & Engineering Foundation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Toh, C.K.: Ad Hoc Mobile Wireless Networks. Prentice-Hall, Englewood Cliffs (2002)
Valera, A., Seah, W., Rao, S.V.: Cooperative Packet Caching and Shortest Multipath Routin In Mobile Ad hoc Networks. In: IEEE INFOCOM 2003, pp. 260–269 (2003)
Spohn, M., Garsia-Luna-Aceves, J.J.: Neighborhood Aware Source Routing. In: ACM Symposium on Mobile Ad Hoc Networking and Computing (October 2001)
Kim, S., Noh, W., An, S.: Multi-path Ad Hoc Routing Considering Path Redundancy. In: IEEE ISCC 2003, vol 1, pp. 45–50 (2003)
Chung, C.M., Wang, Y.H., Chuang, C.: Probabilistic Analysis of Routes on Mobile Ad Hoc Networks. In: 15th International Conference on Information Networking, pp. 933–937 (2001)
Haas, Z.J.: A Routing Protocol for the Reconfigurable Wireless Network. In: ICUPC 1997, vol. 2, pp. 565–566 (October 1997)
Maleki, M., Dantu, K., Pedram, M.: Power-aware Source Routing Protocol for Mobile Ad Hoc Networks. In: ISLPED 2002, pp. 72–75 (2002)
Kar, K., Kodialam, M., Lakshman, T.V., Tassiulas, L.: Routing for Network Capacity Maximization in Energy-constrained Ad-hoc Networks. In: Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies, vol 1, pp. 673–681 (2003)
Tsudaka, K., Kawahara, M., Matsumoto, A., Okada, H.: Power Control Routing for Multi Hop Wireless Hop Wireless Ad-hoc Network. In: IEEE GLOBECOM 2001, pp. 2819–2824 (November 2001)
Toh, C.K.: Maximum battery life routing to support ubiquitous mobile computing in wireless ad-hoc networks. IEEE Communications Magazine 39(6), 138–147 (2001)
Singh, S., Woo, M., Raghavendra, C.S.: Power aware routing in mobile ad-hoc networks. In: ACM/IEEE International Conference on Mobile Computing and Networking, pp. 181–190 (1998)
Doshi, S., Bhandare, S., Brown, T.: An On-demand Minimum Energy Routing Protocol for a Wireless Ad Hoc Network. ACM Mobile Computing and Communications Review, 6(3) (July 2002)
Feeney, L.M., Nilsson, M.: Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment. In: IEEE INFOCOM 2001, pp. 1548–1557 (April 2001)
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
Jung, SW., Lee, CW. (2006). Energy-Aware Routing Algorithm Using Backup Route for Ad-Hoc Networks. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751588_87
Download citation
DOI: https://doi.org/10.1007/11751588_87
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34072-0
Online ISBN: 978-3-540-34074-4
eBook Packages: Computer ScienceComputer Science (R0)