See this document in CiteSeerX!

Loop-Free Routing Using a Dense Label Set  (Make Corrections)  
in Wireless Networks Marc Mosko and J.J. Garcia-Luna-Aceves Computer...



  Home/Search   Context   Related

 
View or download:
ucsc.edu/research/c...mosko.icdcs04.pdf
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  ucsc.edu/research/ccrg/publica... (more)
(Enter author homepages)

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

Abstract: We present a new class of on-demand routing protocols called Split Label Routing (SLR). The protocols guarantee loop-freedom at every instant by ensuring that node labels are always in topological order, and thus induce a directed acyclic graph (DAG). The novel feature of SLR is that it uses a dense ordinal set with a strict partial order to label nodes. For any two labels there is always some label in between them. This allows SLR to "insert" a node in to an existing DAG, without the need to... (Update)

Active bibliography (related documents):   More   All
2.1:   Loop-Free Routing Using a Dense Label Set - In Wireless Networks   (Correct)
0.3:   Achieving Loop-Free Incremental Routing in Ad Hoc Networks - Rangarajan.. (2004)   (Correct)
0.3:   Unknown -   (Correct)

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

BibTeX entry:   (Update)

@misc{ networks-loopfree,
  author = "In Wireless Networks",
  title = "Loop-Free Routing Using a Dense Label Set",
  url = "citeseer.ist.psu.edu/765210.html" }
Citations (may not include all citations):
386   A highly adaptive distributed routing algorithm for mobile w.. - Park, Corson - 1997
223   Ad hoc on demand distance vector (context) - Perkins, Belding-Royer et al. - 2002
197   The dynamic source routing protocol for mobile ad hoc networ.. (context) - Johnson, Maltz et al. - 2002
144   Termination detection for diffusing computations (context) - Dijkstra, Scholten - 1980
102   A distributed routing algorithm for mobile wireless networks (context) - Corson, Ephremides - 1995
76   OSPF: anatomy of an Internet routing protocol (context) - Moy - 1998
66   Optimized link state routing protocol (context) - Clausen, Jacquet et al. - 2001
65   Distributed algorithms for generating loop-free routes in ne.. (context) - Gafni, Bertsekas - 1981
64   GloMoSim: A scalable network simulation environment - Bajaj, Takai et al. - 1999
47   Performance comparison of two on-demand routing protocols fo.. - Perkins, Royer et al. - 2001
32   Continued Fractions (context) - Khinchin - 1997
13   A new approach to on-demand loop-free multipath routing - Raju, Garcia-Luna-Aceves - 1999
9   Qualnet simulator (context) - Technologies - 2001
7   A new approach to on-demand loop free routing in ad hoc netw.. (context) - Garcia-Luna-Aceves, Mosko et al. - 2003
5   Loop-free routing using diffusing computations (context) - Garcia-Lunes-Aceves - 1993
2   Includes bibliographical references (context) - Ahuja, Magnanti et al. - 1993
2   The Continuum and other Types of Serial Order (context) - Huntington - 1942
2   bit fractional model of binary floating point divison and ex.. (context) - Matula, McFearin - 2003

Documents on the same site (http://www.soe.ucsc.edu/research/ccrg/publications/):   More
Energy-Efficient, Collision-Free Medium Access.. - Rajendran.. (2003)   (Correct)
Node-Centric Hybrid Routing for Ad Hoc Networks - Roy, Garcia-Luna-Aceves (2002)   (Correct)
Energy-Efficient, Collision-Free Medium Access.. - Rajendran.. (2003)   (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