Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Preemptive Routing in Ad Hoc Networks Tom Goff, Nael B. Abu-Ghazaleh, Dhananjay S. Phatak and Ridvan Kahvecioglu
 

Summary: Preemptive Routing in Ad Hoc NetworksŁ
Tom Goff, Nael B. Abu-Ghazaleh, Dhananjay S. Phatak and Ridvan Kahvecioglu
Computer Science and Electrical
Engineering Department, University of
Maryland, Baltimore County (UMBC)
Baltimore, MD 21250
{tgoff1,phatak}@umbc.edu
Computer System Research Laboratory
Computer Science Dept.
Binghamton University
Binghamton, NY 13902­6000
nael@cs.binghamton.edu
ABSTRACT
Existing on-demand ad-hoc routing algorithms initiate route dis-
covery only after a path breaks, incurring a significant cost in de-
tecting the disconnection and establishing a new route. In this
work, we investigate adding proactive route selection and main-
tenance to on-demand ad-hoc routing algorithms. More specifi-
cally, when a path is likely to be broken, a warning is sent to the
source indicating the likelihood of a disconnection. The source can

  

Source: Abu-Ghazaleh, Nael B. - Department of Computer Science, State University of New York at Binghamton
Massachusetts Institute of Technology (MIT), Computer Science and Artificial Intelligence Laboratory, Parallel and Distributed Operating Systems Group
Phatak, Dhananjay S. - Department of Computer Science and Electrical Engineering, University of Maryland, Baltimore County

 

Collections: Computer Technologies and Information Sciences