Using minimal source trees for on-demand routing in ad hoc networks

Roy, Soumya; Garcia-Luna-Aceves, J.J.

doi:10.1109/infcom.2001.916312

Cited by 28 publications

(21 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, as we also see in Section IV, this process consumes high bandwidth because often valid paths with lower cost are not considered in path computation. SOAR [4] shares the same philosophy as OLIVE and uses on-demand link-state information to create routing tables.…”

Section: G Critique Of Olive With Respect To Other Routing Protocolsmentioning

confidence: 99%

“…S EVERAL on-demand routing protocols have been proposed to maintain routing tables efficiently in ad hoc networks [1]- [4]. Two key features of on-demand routing protocols are that routing information is maintained at a given router for only those destinations to which data must be sent, and the paths to such destinations need not be optimum.…”

Section: Introductionmentioning

confidence: 99%

“…The source tree on-demand adaptive routing (SOAR) protocol [4] was the first to use link-state information on demand. Each router provides its neighbors with a "source tree" consisting of preferred paths to destinations for which the router has traffic.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On-demand loop-free routing with link vectors

Garcia-Luna-Aceves

Roy

2005

IEEE J. Select. Areas Commun.

Self Cite

View full text Add to dashboard Cite

Abstract-We present the on-demand link vector (OLIVE) protocol, a routing protocol for ad hoc networks based on linkstate information that is free of routing loops and supports destination-based packet forwarding. Routers exchange routing information reactively for each destination in the form of complete paths, and each node creates a labeled source graph based on the paths advertised by its neighbors. A node originates a broadcast route request (RREQ) to obtain a route for a destination for which a complete path does not exist in its source graph. When the original path breaks, a node can select an alternative path based on information reported by neighbors, and a node can send a unicast RREQ to verify that the route is still active. A node that cannot find any alternate path to a destination sends route errors reliably to those neighbors that were using it as next hop to the destination. Using simulation experiments in ns2, OLIVE is shown to outperform dynamic source routing, ad hoc on-demand distance vector, optimized link-state routing protocol, and topology broadcast based on reverse-path forwarding, in terms of control overhead, throughput, and average network delay, while maintaining loop-free routing with no need for source routes.Index Terms-Ad hoc networks, on-demand, link-state routing, loop-freedom.

show abstract

Section: G Critique Of Olive With Respect To Other Routing Protocolsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On-demand loop-free routing with link vectors

Garcia-Luna-Aceves

Roy

2005

IEEE J. Select. Areas Commun.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Roy [12] presents the source-tree on-demand adaptive routing protocol (SOAR) based on link-state information. SOAR incurs much less overhead of control routing packets than DSR under various scenarios, ranging from high mobility to low mobility.…”

Section: Related Workmentioning

confidence: 99%

A proximity-based dynamic path shortening scheme for ubiquitous ad hoc networks

Saito

Aida

Tobe

et al. 2004

24th International Conference on Distributed Computing Systems, 2004. Proceedings.

View full text Add to dashboard Cite

show abstract

“…However, with the exception of DASM [16], all of them are single-path algorithms. A few routing algorithms have been proposed that use partial topology information (refer [6], [12] and the references therein) to eliminate the main limitation of topology-broadcast algorithms; however, these algorithms are not loop-free at every instant. Recently, we introduced MPDA [15], which is the first routing algorithm based on link-state information that construct multipaths to each destination that are loop-free at every instant.…”

Section: Introductionmentioning

confidence: 99%

MDVA: a distance-vector multipath routing protocol

Vutukury

Garcia-Luna-Aceves

Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer An

Self Cite

115

View full text Add to dashboard Cite

Abstract-Routing protocols using the Distributed Bellman-Ford (DBF) algorithm converge very slowly to the correct routes when link costs increase, and in the case when a set of link failures results in a network partition, DBF simply fails to converge, a problem which is commonly referred to as the count-to-infinity problem. In this paper, we present the first distance vector routing algorithm MDVA that uses a set of loop-free invariants to prevent the count-to-infinity problem. MDVA, in addition, computes multipaths that are loop-free at every instant. In our earlier work we shows how such loop-free multipaths can be used in traffic load-balancing and minimizing delays, which otherwise are impossible to perform in current single-path routing algorithms [15].

show abstract

Using minimal source trees for on-demand routing in ad hoc networks

Cited by 28 publications

References 15 publications

On-demand loop-free routing with link vectors

On-demand loop-free routing with link vectors

A proximity-based dynamic path shortening scheme for ubiquitous ad hoc networks

MDVA: a distance-vector multipath routing protocol

Contact Info

Product

Resources

About