ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Preemptive routing in Ad Hoc networks
Full text PdfPdf (199 KB)
Source International Conference on Mobile Computing and Networking archive
Proceedings of the 7th annual international conference on Mobile computing and networking table of contents
Rome, Italy
Pages: 43 - 52  
Year of Publication: 2001
ISBN:1-58113-422-3
Authors
Tom Goff  Computer Science and Electrical Engineering Department, University of Maryland, Baltimore County (UMBC), Baltimore, MD
Nael B. Abu-Ghazaleh  Computer System Research Laboratory, Computer Science Dept., Binghamton University, Binghamton, NY
Dhananjay S. Phatak  Computer Science and Electrical Engineering Department, University of Maryland, Baltimore County (UMBC), Baltimore, MD
Ridvan Kahvecioglu  Computer System Research Laboratory, Computer Science Dept., Binghamton University, Binghamton, NY
Sponsor
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 97,   Citation Count: 34
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/381677.381682
What is a DOI?

ABSTRACT

Existing on-demand ad-hoc routing algorithms initiate route discovery only after a path breaks, incurring a significant cost in detecting the disconnection and establishing a new route. In this work, we investigate adding proactive route selection and maintenance to on-demand ad-hoc routing algorithms. More specifically, when a path is likely to be broken, a warning is sent to the source indicating the likelihood of a disconnection. The source can then initiate path discovery early, potentially avoiding the disconnection altogether. A path is considered likely to break when the received packet power becomes close to the minimum detectable power (other approaches are possible). Care must be taken to avoid initiating false route warnings due to fluctuations in received power caused by fading, multipath effects and similar random transient phenomena. Experiments demonstrate that adding proactive route selection and maintenance to DSR and AODV (on-demand ad hoc routing protocols) significantly reduces the number of broken paths, with a small increase in protocol overhead. Packet latency and jitter also goes down in most cases. We also show some experimental results obtained by running TCP on top of the proactive routing schemes proposed. Several improvements and extensions are also discussed. Pro-active route selection and maintenance is general and can be used with other routing algorithms and optimizations to them.


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
WaveLAN/PCMCIA Card User's Guide - Lucent Technologies.
 
2
UCB/LBNL/VINT Network Simulator, web-site http://www-mash.CS.Berkeley.EDU/ns.
 
3
NS-2 with Wireless and Mobility Extensions, available via web-site http://www.monarch.cs.cmu.edu.
 
4
J. B. Andersen, T. S. Rappaport, and S. Yoshida. Propagation measurements and models for wireless communications channels. IEEE Communication Magazine, 33(1):42-49, Jan. 1995.
5
6
 
7
C. Chiang, M. Gerla, and L. Zhang. Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel. In Proceedings of IEEE SICON'97, pages 197-211, Apr. 1997.
 
8
R. Dube, C. Rais, K. Wang, and S. Tripathi. Signal Stability based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks. IEEE Personal Communication, pages 36-45, Feb. 1997.
 
9
L. Ford Jr. and D. Fulkerson. Flows in Networks. Princeton University Press, 1962.
 
10
11
 
12
D. Johnson, D. Maltz, Y. Hu, and J. Jetcheva. The dynamic source routing protocol for mobile ad hoc networks. Internet Draft, Internet Engineering Task Force, Mar. 2001. http://www.ietf.org/internet-drafts/draft-ietf-manet-dsr- 05.txt.
13
 
14
S.-J. Lee, M. Gerla, and C.-K. Toh. 'A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Networks. IEEE Network, Jul. 1999.
 
15
D. A. Maltz, J. Broch, J. Jetcheva, and D. B. Johnson. The Effects of On-Demand Behavior in Routing Protocols for Multi-Hop Wireless Ad Hoc Networks. IEEE Journal on Selected Areas in Communications, special issue on mobile and wireless networks, Aug. 1999.
 
16
 
17
V. Park and S. Corson. Temporally-ordered routing algorithm (TORA) version 1 functional specification. Internet Draft, Internet Engineering Task Force, Nov. 2000. http://www.ietf.org/internet-drafts/draft-ietf-manet-tora-spec- 03.txt.
 
18
G. Pei and M. Gerla. Fisheye state routing in mobile ad hoc networks. In Proceedings of ICC'2000, pages D71-D78, 2000. Internet Draft available at: http://www.ietf.org/internet-drafts/draft-ietf-manet-fsr-00.txt.
 
19
C. Perkins, E. Royer, and S. Das. Ad hoc on-demand distance vector (aodv) routing. Internet Draft, Internet Engineering Task Force, Mar. 2001. http://www.ietf.org/internet-drafts/ draft-ietf-manet-aodv-08.txt.
20
 
21
22
 
23

CITED BY  34

Collaborative Colleagues:
Tom Goff: colleagues
Nael B. Abu-Ghazaleh: colleagues
Dhananjay S. Phatak: colleagues
Ridvan Kahvecioglu: colleagues