Analysis of Link Reversal Routing Algorithms

DOI10.1137/S0097539704443598MaRDI QIDQ5470692zbMATH OpenDBLPWikidataFDO

Authors Costas Busch, Srikanta Tirthapura

Publication date 1 June 2006

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539704443598

zbMATH Keywords

ad hoc networksfault tolerancelink reversal routingself stabilizationwireless networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15) Analysis of algorithms (68W40)

Recommendations

• Time complexity of link reversal routing
• Link reversal routing with binary link labels: work complexity
• A distributed adaptive routing algorithm
• Routing with guaranteed delivery in ad hoc wireless networks
• Concurrent threads and optimal parallel minimum spanning trees algorithm

Cited in

(7)

• An asymptotic study for path reversal.
• Link reversal routing with binary link labels: work complexity
• Efficient checking of link-reversal-based concurrent systems
• Pioneering the establishment of the foundations of the Internet of Things
• Time complexity of link reversal routing
• New transience bounds for max-plus linear systems
• A routing algorithm for wireless ad hoc networks with unidirectional links

This page was built for publication: Analysis of Link Reversal Routing Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470692)