ACM Home Page
Please provide us with feedback. Feedback
Age matters: efficient route discovery in mobile ad hoc networks using encounter ages
Full text PdfPdf (458 KB)
Source International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing table of contents
Annapolis, Maryland, USA
SESSION: Routing table of contents
Pages: 257 - 266  
Year of Publication: 2003
ISBN:1-58113-684-6
Authors
Henri Dubois-Ferriere  EPFL, Lausanne, Switzerland
Matthias Grossglauser  EPFL, Lausanne, Switzerland
Martin Vetterli  EPFL, Lausanne, Switzerland
Sponsors
ACM: Association for Computing Machinery
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 106,   Citation Count: 27
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/778415.778446
What is a DOI?

ABSTRACT

We propose FResher Encounter SearcH (FRESH), a simple algorithm for efficient route discovery in mobile ad hoc networks. Nodes keep a record of their most recent encounter times with all other nodes. Instead of searching for the destination, the source node searches for any intermediate node that encountered the destination more recently than did the source node itself. The intermediate node then searches for a node that encountered the destination yet more recently, and the procedure iterates until the destination is reached. Therefore, FRESH replaces the single network-wide search of current proposals with a succession of smaller searches, resulting in a cheaper route discovery. Routes obtained are loop-free.The performance of such a scheme will depend on the nodes' mobility processes. Under standard mobility processes our simulations show that route discovery cost can be decreased by an order of magnitude, a significant gain given that route discovery is a major source of routing overhead in ad hoc networks.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
C. Chiang, H. Wu, W. Liu, and M. Gerla. Routing in clustered multihop, mobile wireless networks. In Proceedings of the IEEE Singapore International Conference on Networks, Singapore, April 1997.
 
4
Samir Ranjan Das, Charles E. Perkins, and Elizabeth E. Royer. Performance comparison of two on-demand routing protocols for ad hoc networks. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM), Tel Aviv, Israel, March 2000.
 
5
Matthias Grossglauser and Martin Vetterli. Locating nodes with EASE: Last Encounter Routing for Ad Hoc Networks through Mobility Diffusion. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM), San Francisco, CA, April 2003.
 
6
Zygmunt J. Haas, Marc R. Pearlman, and Prince Samar. The interzone routing protocol (ierp) for ad hoc networks. IETF Internet-Draft, draft-ietf-manet-zone-ierp-02.txt, July 2002.
 
7
Zygmunt J. Haas, Marc R. Pearlman, and Prince Samar. The intrazone routing protocol (iarp) for ad hoc networks. IETF Internet-Draft, draft-ietf-manet-zone-iarp-02.txt, 2002.
 
8
David B Johnson and David A Maltz. Dynamic source routing in ad hoc wireless networks. In Imielinski and Korth, editors, Mobile Computing, volume 353. Kluwer Academic Publishers, 1996.
 
9
 
10
L. Li, J. Halpern, and Z. Haas. Gossip-based ad hoc routing. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM), New York, NY, June 2002.
 
11
 
12
Z. J. Haas M. R. Pearlman and T. Samar. Zone routing protocol (zrp). IETF, Internet-Draft, 2002.
 
13
 
14
Bluetooth SIG. Bluetooth v1.1 specification. http://www.bluetooth.org, 2000.
15

CITED BY  27

Collaborative Colleagues:
Henri Dubois-Ferriere: colleagues
Matthias Grossglauser: colleagues
Martin Vetterli: colleagues