Abstract
Both movement of mobile nodes and path lifetime exhaustion cause to change the network topology in a mobile ad hoc network. Then, it is not easy to obtain the high packet delivery ratio. This paper proposes the Maximum Lifetime Paths (MLP) to transmit a large amount of data using nodes with long lifetime and using fast recovery. The proposed MLP establishes routes based on the shortest path and dynamically recovers routes using warning messages. The simulation experiment results show that MLP increases the packet delivery ratio and reduces the hop distance and the frequency of the route establishment.
This research was supported by the MIC(Ministry of Information and Communication), Korea, under the ITRC(Information Technology Research Center) support program supervised by the IITA(Institute of Information Technology Assessment).
Chapter PDF
Similar content being viewed by others
References
Lee, S.-J., et al.: Split multipath routing with maximally disjoint paths in ad hoc networks. In: IEEE ICC 2001, vol. 10, pp. 3201–3205 (2001)
Comez, J., et al.: PARO: Supporting Dynamic Power Controlled Routing in Wireless Ad Hoc Networks. In: Wireless Networks, pp. 443–460. Kluwer Academic Publishers, Netherlands (2003)
Toh, C.-K.: Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks. IEEE Communications Magazine, 2–11 (2001)
Chen, B., et al.: Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks. Wireless Networks 8, 481–494 (2002)
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
Kim, H., Han, S., Song, J. (2006). Maximum Lifetime Paths for the High Packet Delivery Ratio Using Fast Recovery in a Mobile Ad Hoc Network. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science – ICCS 2006. ICCS 2006. Lecture Notes in Computer Science, vol 3992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758525_147
Download citation
DOI: https://doi.org/10.1007/11758525_147
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34381-3
Online ISBN: 978-3-540-34382-0
eBook Packages: Computer ScienceComputer Science (R0)