TY - JOUR
T1 - Dynamic route maintenance for geographic forwarding in mobile ad hoc networks
AU - Chou, Chih Hsun
AU - Ssu, Kuo Feng
AU - Jiau, Hewijin Christine
N1 - Funding Information:
We are pleased to thank the anonymous reviewers for their valuable comments and suggestions. This research was supported in part by the Taiwan National Science Council under contracts NSC 95-2221-E-006-074 and 95-2221-E-006-092-MY2.
PY - 2008/2/8
Y1 - 2008/2/8
N2 - Traditional route maintenance requires mobile nodes periodically exchange beacon messages with their neighbors in geographic forwarding algorithms. The interval at which these nodes broadcast their beacon messages is typically fixed. However, determining an appropriate value for this interval is challenging. A longer interval reduces the number of beacons needed, but may result in significant location errors. Conversely, a shorter interval guarantees more accurate location information, but induces heavier control overheads. Additionally, since a fixed value is assigned to the lifetime of each routing entry, the forwarding algorithm cannot adapt well to different mobility environments. Therefore, this paper presents a dynamic route maintenance algorithm (DRM) for beacon-based geographic routing. In the approach, the mobile nodes dynamically adjust their beacon intervals based on their speed of movement. Moreover, the routing information can be well managed using the mobility prediction. The simulation results show that DRM not only significantly decreased the routing overheads in a low mobility scenario but also guaranteed the high quality packet delivery in high mobility environments.
AB - Traditional route maintenance requires mobile nodes periodically exchange beacon messages with their neighbors in geographic forwarding algorithms. The interval at which these nodes broadcast their beacon messages is typically fixed. However, determining an appropriate value for this interval is challenging. A longer interval reduces the number of beacons needed, but may result in significant location errors. Conversely, a shorter interval guarantees more accurate location information, but induces heavier control overheads. Additionally, since a fixed value is assigned to the lifetime of each routing entry, the forwarding algorithm cannot adapt well to different mobility environments. Therefore, this paper presents a dynamic route maintenance algorithm (DRM) for beacon-based geographic routing. In the approach, the mobile nodes dynamically adjust their beacon intervals based on their speed of movement. Moreover, the routing information can be well managed using the mobility prediction. The simulation results show that DRM not only significantly decreased the routing overheads in a low mobility scenario but also guaranteed the high quality packet delivery in high mobility environments.
UR - http://www.scopus.com/inward/record.url?scp=36649025048&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=36649025048&partnerID=8YFLogxK
U2 - 10.1016/j.comnet.2007.10.001
DO - 10.1016/j.comnet.2007.10.001
M3 - Article
AN - SCOPUS:36649025048
SN - 1389-1286
VL - 52
SP - 418
EP - 431
JO - Computer Networks
JF - Computer Networks
IS - 2
ER -