- freely available
- re-usable
Sensors 2010, 10(1), 808-821; doi:10.3390/s100100808
Article
Effective Route Maintenance and Restoration Schemes in Mobile Ad Hoc Networks
Department of Computer Science, Korea Advanced Institute of Science and Technology (KAIST), 335 Gwahangno, Yuseong-gu, Daejeon, 305-701, Korea
* Author to whom correspondence should be addressed.
Received: 13 January 2010; in revised form: 18 January 2010 / Accepted: 20 January 2010 / Published: 21 January 2010
(This article belongs to the Section Physical Sensors)
Abstract: This study proposes a location-based hybrid routing protocol to improve data packet delivery and to reduce control message overhead in mobile ad hoc networks. In mobile environments, where nodes move continuously at a high speed, it is generally difficult to maintain and restore route paths. Therefore, this study suggests a new flooding mechanism to control route paths. The essence of the proposed scheme is its effective tracking of the destination’s location based on the beacon messages of the main route nodes. Through experiments based on an NS-2 simulator, the proposed scheme shows improvements in the data packet delivery ratio and reduces the amount of routing control message overhead compared with existing routing protocols such as AODV, LAR, ZRP and AODV-DFR.
Keywords: route maintenance; route restoration; mobile ad hoc network
Article Statistics
Click here to load and display the download statistics.Cite This Article
MDPI and ACS Style
Kang, B.-S.; Ko, I.-Y. Effective Route Maintenance and Restoration Schemes in Mobile Ad Hoc Networks. Sensors 2010, 10, 808-821.
AMA StyleKang B.-S., Ko I.-Y. Effective Route Maintenance and Restoration Schemes in Mobile Ad Hoc Networks. Sensors. 2010; 10(1):808-821.
Chicago/Turabian StyleKang, Byung-Seok; Ko, In-Young. 2010. "Effective Route Maintenance and Restoration Schemes in Mobile Ad Hoc Networks." Sensors 10, no. 1: 808-821.
Sensors
EISSN 1424-8220
Published by MDPI Publishing, Basel, Switzerland
RSS
E-Mail Table of Contents Alert
