Local routing in convex subdivisions

DOI10.1142/S0218195920500016MaRDI QIDQ5149568zbMATH OpenOpenAlexFDO

Authors Prosenjit Bose, Stephane Durocher, Debajyoti Mondal, Maxime Peabody, Matthew Skala, Mohammad Abdul Wahid

Publication date 11 February 2021

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195920500016

zbMATH Keywords

convex subdivisiongeometric graphgeometric routinggraph traversallocal routing

Mathematics Subject Classification ID

Wireless sensor networks as related to computer science (68M18) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Local routing in convex subdivisions
• Memoryless routing in convex subdivisions: random walks are optimal
• On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks
• scientific article; zbMATH DE number 2080234
• ONLINE ROUTING IN CONVEX SUBDIVISIONS

Cites work

• AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE
• Bounding the locality of distributed routing algorithms
• Competitive online routing in geometric graphs
• Local routing in convex subdivisions
• Memoryless routing in convex subdivisions: random walks are optimal
• On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks
• ONLINE ROUTING IN CONVEX SUBDIVISIONS
• Online Routing in Triangulations
• Routing with guaranteed delivery in ad hoc wireless networks

Cited in

(3)

• On local routing of two-terminal nets
• New algorithmic aspects of the local lemma with applications to routing and partitioning
• Local routing in convex subdivisions

This page was built for publication: Local routing in convex subdivisions

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