J. J. Garcia-Luna-Aceves
ABSTRACT
A new protocol is presented for on-demand loop-free routing in ad hoc networks. The new protocol, called labeled distance routing (LDR) protocol, uses a distance invariant to establish an ordering criterion and per-destination sequence numbers to reset the invariant resulting in loop-freedom at every instant. The distance invariant allows nodes to change their next hops or distances to destinations without creating routing-table loops. The destination sequence number, which only the destination may increment, permits nodes to reset the values of their distance invariants. The performance of LDR is compared against the performance of three other protocols that are representative of the state-of-the art, namely AODV, DSR and OLSR.
- L. Bajaj et al. GloMoSim: A scalable network simulation environment. Technical Report 990027, UCLA Computer Science Department, 1999.]]Google Scholar
- T. Clausen et al. Optimized link state routing protocol. IETF Internet draft, draft-ietf-manet-olsr-06.txt, Sep 2001.]] Google ScholarDigital Library
- E. W. Dijkstra and C. S. Scholten. Termination detection for diffusing computations. Information Processing Letters, 11(1):1--4, Aug. 1980.]]Google ScholarCross Ref
- E. M. Gafni and D. P. Bertsekas. Distributed algorithms for generating loop-free routes in networks with frequently changing topology, IEEE Trans. Comm., COM-29(1):11--18, Jan. 1981.]]Google ScholarCross Ref
- J. Garcia-Luna-Aceves and S. Murthy. A path finding algorithm for loop-free routing. IEEE/ACM Trans. Networking, 5(1):148--160, Feb. 1997.]] Google ScholarDigital Library
- J. J. Garcia-Luna-Aceves and M. Spohn. Source-tree routing in wireless networks. In Proc. IEEE ICNP'99, pp. 273--82, Oct. 1999.]] Google ScholarDigital Library
- J. J. Garcia-Lunes-Aceves. Loop-free routing using diffusing computations. IEEE/ACM Transactions on Networking, 1(1):130--41, Feb. 1993.]] Google ScholarDigital Library
- D. Johnson et al. The dynamic source routing protocol for mobile ad hoc networks (DSR). IETF Internet draft, draft-ietf-manet-dsr-07.txt, Feb 2002.]]Google Scholar
- D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, volume 353. Kluwer Academic Publishers, 1996.]]Google Scholar
- R. Ogier et al. Topology broadcast based on reverse-path forwarding (TBRPF). IETF Internet draft, draft-ietf-manet-tbrpf-05.txt, Mar 2001.]] Google ScholarDigital Library
- V. D. Park and M. S. Corson. A highly adaptive distributed routing algorithm for mobile wireless networks. In IEEE INFOCOM, pp. 1405--13 vol. 3, Apr. 1997.]] Google ScholarDigital Library
- C. Perkins, E. Belding-Royer, and S. Das. Ad hoc on demand distance vector (AODV) routing. IETF Internet draft, draft-ietf-manet-aodv-10.txt, Mar 2002.]] Google ScholarDigital Library
- C. Perkins et al. Performance comparison of two on-demand routing protocols for ad hoc networks. IEEE Personal Communications, 8(1):16--28, Feb 2001.]]Google ScholarCross Ref
- A. Plakoo and A. Laouiti. INRIA OLSR draft 3 linux source code. http://menetou.inria.fr/olsr/#code, ported by Marco Spohn, 2001.]]Google Scholar
- J. Raju and J. J. Garcia-Luna-Aceves. A new approach to on-demand loop-free multipath routing. In IEEE IC3N'99, pp. 522--7, Oct. 1999.]]Google Scholar
- M. Spohn and J. J. Garcia-Luna-Aceves. Neighborhood aware source routing. In ACM MOBIHOC 2001, pp. 11--21, Oct. 2001.]] Google ScholarDigital Library
- S. Vutukury and J. Garcia-Luna-Aceves. A simple approximation to minimum-delay routing. In Proc. AMC SIGCOMM 1999, pp. 227--238, Sept. 1999.]] Google ScholarDigital Library
Index Terms
- A new approach to on-demand loop-free routing in ad hoc networks
Recommendations
Using labeled paths for loop-free on-demand routing in ad hoc networks
MobiHoc '04: Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computingWe present the Feasible Label Routing (FLR) protocol for mobilead hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loop-free incremental(hop-by-hop) routing of data packets using only the addresses of ...
A new approach to on-demand loop-free routing in networks using sequence numbers
Web dynamicsA new protocol is presented for on-demand, loop-free routing in ad hoc networks. The new protocol, called the labeled distance routing (LDR) protocol, uses a distance invariant to establish an ordering criterion and per-destination sequence numbers to ...
A Multipath On-Demand Routing with Path Selection Entropy for Ad Hoc Networks
ICYCS '08: Proceedings of the 2008 The 9th International Conference for Young Computer ScientistsAn ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. The multipath routing in mobile ad hoc networks is difficult because ...
Comments