On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks

DOI10.1007/978-3-540-77444-0_58MaRDI QIDQ5445787zbMATH OpenOpenAlexFDO

Authors Stephane Durocher, David Kirkpatrick, Lata Narayanan

Publication date 6 March 2008

Published in Distributed Computing and Networking (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77444-0_58

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Deterministic greedy routing with guaranteed delivery in 3D wireless sensor networks
• Routing with guaranteed delivery in ad hoc wireless networks
• A simple fault-tolerant adaptive and minimal routing approach in 3-D meshes
• On Delivery Guarantees and Worst-Case Forwarding Bounds of Elementary Face Routing Components in Ad Hoc and Sensor Networks

Cites work

• Distributed Computing: A Locality-Sensitive Approach
• Geometric ad-hoc routing, of theory and practice
• scientific article; zbMATH DE number 1522924 (Why is no real title available?)
• ONLINE ROUTING IN CONVEX SUBDIVISIONS
• Routing with guaranteed delivery in ad hoc wireless networks
• Simple heuristics for unit disk graphs
• Unit disk graphs

Cited in

(6)

• Deterministic greedy routing with guaranteed delivery in 3D wireless sensor networks
• Bounding the locality of distributed routing algorithms
• Competitive online routing on Delaunay triangulations
• Local routing in convex subdivisions
• Routing with guaranteed delivery in ad hoc wireless networks
• Ranking and unranking algorithms for derangements based on lexicographical order

This page was built for publication: On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks

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