See this document in CiteSeerX!

Routing in a Highly Dynamic Topology  (Make Corrections)  
Yashar Ganjali, Nick McKeown



  Home/Search   Context   Related

 
View or download:
stanford.edu/~yganjali/researc...VRS.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  stanford.edu/~ygan...Publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Routing in mobile ad-hoc networks is hard because the topology can change very rapidly. By the time new paths are discovered, the network can change again -- and in extreme cases, packets circulate endlessly and the system is unstable. Most attempts to solve this problem have required that the topology changes slowly. In this paper, we propose a routing algorithm called Volcano Routing Scheme (VRS) which will route packets successfully, even if the topology changes very rapidly. VRS doesn't... (Update)

Active bibliography (related documents):   More   All
0.2:   GREP: Protocol and Proof of Loop-Free Operation - Dubois-Ferriere.. (2003)   (Correct)
0.2:   Probabilistic Routing in Intermittently Connected Networks - Lindgren, Doria, Schelen (2004)   (Correct)
0.1:   Analyzing Control Traffic Overhead in Mobile Ad-hoc.. - Viennot, Jacquet.. (2002)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ ganjali-routing,
  author = "Yashar Ganjali and Nick McKeown",
  title = "Routing in a Highly Dynamic Topology",
  url = "citeseer.ist.psu.edu/744779.html" }
Citations (may not include all citations):
577   Highly dynamic destinationsequenced distance-vector routing .. - Perkins, Bhagwat - 1994
386   A highly adaptive distributed routing algorithm for mobile w.. - Park, Corson - 1997
173   Performance comparison of two on-demand routing protocols fo.. - Parkins, Royer et al. - 2001
88   The performance of query control schemes for the zone routin.. - Haas, Pearlman - 2001
87   Geocastgeographic addressing and routing - Navas, Imielinski - 1997
63   Scalable routing strategies for ad hoc wireless networks - Iwata, Chiang et al. - 1999
45   Improved approximation algorithms for the multi-commodity fl.. - Awerbuch, Leighton - 1994
44   Geographical routing using partial information for wireless .. - Jain, Puri et al. - 2001
41   A simple local-control approximation algorithm for multicomm.. - Awerbuch, Leighton - 1993
37   Scalable and robust internetwork routing for mobile hosts - Johnson - 1994
26   demand multicast routing protocol in multihop wireless mobil.. - Lee, Su et al. - 2002
22   End-to-end communication with polynomial overhead (context) - Awerbuch, Mansour et al. - 1989
15   Simple routing strategies for adversarial systems - Awerbuch, Berenbrink et al. - 2001
14   Ad-hoc on-demand distance vector routing (context) - Parkins, Royer et al. - 1999
14   Bertsekas and Robert Gallager (context) - Dimitri - 1992
11   RDMAR: a bandwidth-efficient routing protocol for mobile ad .. - Aggelou, Tafazolli - 1999
10   Routing and Multicasting Strategies in Wireless Mobile Ad Ho.. - Lee - 2000
10   Next century challenges: Mobile networking (context) - Kahn, Katz et al. - 1999
7   GPS-based geographic addressing, routing, and resource disco.. (context) - Imielinski, Navas - 1999
4   Age matters: Efficient route discovery in mobile ad hoc netw.. (context) - Dubois-Ferriere, Grossgloauser et al. - 2003

Documents on the same site (http://yuba.stanford.edu/~yganjali/Publications.html):
Characterization of Networks Supporting Multi-dimensional.. - Ganjali, Hajiaghayi (2001)   (Correct)
Routers with Very Small Buffers - Mihaela Enachescu Yashar (2006)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC