Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Routing in Space and Time in Networks with Predictable Mobility
 

Summary: 1
Routing in Space and Time in Networks with
Predictable Mobility
Shashidhar Merugu Mostafa Ammar Ellen Zegura
College of Computing, Georgia Institute of Technology,
801 Atlantic Drive, Atlanta, GA 30332
fmerugu, ammar, ewzg@cc.gatech.edu
March 15, 2004
Abstract--- We consider the problem of routing in emerging
wireless networks where nodes move around explicitly carrying
messages to facilitate communication in an otherwise partitioned
network. The absence of a path at any instant of time between a
source and destination makes the traditional mobile ad hoc rout­
ing protocols unsuitable for these networks. However, the explicit
node movements create paths ``over time'' that include the possi­
bility of a node carrying a message before forwarding to another
suitable node. Identifying such paths over space and time is a key
challenge in these store, carry and forward networks. In most of
these networks, the mobility of nodes is predictable either over a
finite time horizon or indefinitely due to periodicity in node mo­

  

Source: Ammar, Mostafa - College of Computing, Georgia Institute of Technology
Zegura, Ellen W. - College of Computing, Georgia Institute of Technology

 

Collections: Computer Technologies and Information Sciences