Guaranteed on-demand discovery of node-disjoint paths in ad hoc networks

Liu, Changwen; Yarvis, Mark; Conner, W. Steven; Guo, Xiaoming

doi:10.1016/j.comcom.2007.05.028

Cited by 22 publications

(19 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A theoretical framework showing the equivalence of on-demand multipath discovery and flow network assignment is established to guarantee the on-demand discovery of an arbitrary number of node-disjoint paths between a pair of nodes as long as they exist. A protocol integrating this theoretical framework with DSR to find out node-disjoint paths is also proposed in [6]. Note that Multipath maintenance in these protocols is equivalent to a new multipath discovery, which means that a RREQ from the source is initiated whenever needed.…”

Section: Related Workmentioning

confidence: 99%

“…A polynomial time algorithm (O(N n 2 )) to find the shortest N vertex-disjoint paths is reported in [15]. These algorithms are centralized and are exploited as basic building blocks for [14] and [6].…”

Section: Related Workmentioning

confidence: 99%

“…Simulation results indicate that AOMDV achieves the best performance in high mobility, while AODV-Multipath performs better at lower mobility but higher node density, and SMR performs the best at low node density. The limitations of these protocols are studied in [6], which states that the on-demand multipath routing protocols mentioned above can not find out all existing node-disjoint paths. A theoretical framework showing the equivalence of on-demand multipath discovery and flow network assignment is established to guarantee the on-demand discovery of an arbitrary number of node-disjoint paths between a pair of nodes as long as they exist.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Route recovery in vertex-disjoint multipath routing for many-to-one sensor networks

Cheng

Xing

Cheng

et al. 2008

Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing

View full text Add to dashboard Cite

Multipath routing is attractive for load-balancing, fault-tolerance, and security enhancement. However, constructing and maintaining a set of node-disjoint paths between the data source and sink is non-trivial in a dynamic environment. In this paper, we study the problem of route recovery in vertex-disjoint multipath routing for sensor networks with many-to-one traffic patterns. We identify the sufficient conditions for multipaths to be recovered when the existing node-disjoint paths are broken, and provide a simple framework for multipath maintenance. This framework is very efficient in time when multipath source routing is employed. Our findings can help to conserve network resource by not launching any route discovery when the data source realizes that a new route may not exist, to guide mobile data sources to relocate themselves in order to reconstruct the new multipaths, and to help newly-deployed data sources quickly determine whether the required number of multipaths exist for sure or not and then compute them. The technique proposed in this paper is a good complement to the classic max-flow algorithm when node-disjoint multipaths are needed.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Route recovery in vertex-disjoint multipath routing for many-to-one sensor networks

Cheng

Xing

Cheng

et al. 2008

Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing

View full text Add to dashboard Cite

show abstract

“…Nodes use the routing table and the packet forwarding auction approach suggested in GTMR to decide the next hop where to forward the packet. On-demand discovery of node-disjoint paths [74]: Liu et al design an algorithm to find nodedisjoint paths in a multipath routing protocol for MANETs. The aim is to guarantee discovery of node-disjoint paths.…”

Section: Truthful Multipath Routing Protocol (Tmrp)mentioning

confidence: 99%

“…Thus, AOMDV [79], TMRP [124] and SMORT [102] build on AODV, while the work on on demand discovery of node disjoint paths [74] and MuSeQoR [103] build on DSR. Note that both are source originated protocols -in general, most of the approaches in this class had chosen a source originated approach.…”

Section: Comparisonmentioning

confidence: 99%

Routing protocols in ad hoc networks: A survey

et al. 2011

View full text Add to dashboard Cite

Ad hoc wireless networks perform the difficult task of multi-hop communication in an environment without a dedicated infrastructure, with mobile nodes and changing network topology. Different deployments exhibit various constraints, such as energy limitations, opportunities, such as the knowledge of the physical location of the nodes in certain scenarios, and requirements, such as real-time or multi-cast communication. In the last 15 years, the wireless networking community designed hundreds of new routing protocols targeting the various scenarios of this design space. The objective of this paper is to create a taxonomy of the ad hoc routing protocols, and to survey and compare representative examples for each class of protocols. We strive to uncover the requirements considered by the different protocols, the resource limitations under which they operate, and the design decisions made by the authors.

show abstract

One-to-One Disjoint Path Covers on Mesh

Fan

Han

et al. 2015

Algorithms and Architectures for Parallel Processing

View full text Add to dashboard Cite

Guaranteed on-demand discovery of node-disjoint paths in ad hoc networks

Cited by 22 publications

References 7 publications

Route recovery in vertex-disjoint multipath routing for many-to-one sensor networks

Route recovery in vertex-disjoint multipath routing for many-to-one sensor networks

Routing protocols in ad hoc networks: A survey

One-to-One Disjoint Path Covers on Mesh

Contact Info

Product

Resources

About