ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computer Networks
Volume 52, Issue 2, 8 February 2008, Pages 418-431
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (511 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comnet.2007.10.001    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2007 Elsevier B.V. All rights reserved.

Dynamic route maintenance for geographic forwarding in mobile ad hoc networks

Chih-Hsun ChouCorresponding Author Contact Information, a, E-mail The Corresponding Author, Kuo-Feng Ssua and Hewijin Christine Jiaua

aDepartment of Electrical Engineering, National Cheng Kung University, Tainan, Taiwan

Received 3 January 2007; 
revised 1 October 2007; 
accepted 1 October 2007. 
Responsible Editor: M. van Steen. 
Available online 9 October 2007.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

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.

Keywords: Geographic routing; Beacon intervals; Delivery rates; Routing performance; Mobile ad hoc networks

Article Outline

1. Introduction
2. Related work
3. System assumptions
4. Dynamic route maintenance
4.1. Beacon interval generation
4.2. Beacon interval adjustment
4.3. Route management
5. Position error analysis
6. Performance evaluation
6.1. Simulation setup
6.2. Simulation results
6.2.1. Invalid routing entry rate
6.2.2. Relay success rate
6.2.3. Packet delivery rate
6.2.4. Path length
6.2.5. Beacon overhead
7. Conclusion
Acknowledgements
References
Vitae















Computer Networks
Volume 52, Issue 2, 8 February 2008, Pages 418-431
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.