Structural Information and Communication Complexity

DOI10.1007/B98251zbMATH Open1085.68504OpenAlexW2499215041MaRDI QIDQ5315239FDOQ5315239

Authors: Paul Boone, Edgar Chávez, Lev Gleitzky, Jaroslav Opatrny, J. Urrutia, Evangelos Kranakis, Gelasio Salazar 

Publication date: 7 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98251

Recommendations

• Routing with guaranteed delivery in ad hoc wireless networks
• Greedy face routing with face identification support in wireless networks
• Route discovery with constant memory in oriented planar geometric networks
• Geometric ad-hoc routing
• Algorithmic Aspects of Wireless Sensor Networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cited In (4)

• Local solutions for global problems in wireless networks
• Constant memory routing in quasi-planar and quasi-polyhedral graphs
• Greedy face routing with face identification support in wireless networks
• ProgressFace: An Algorithm to Improve Routing Efficiency of GPSR-Like Routing Protocols in Wireless Ad Hoc Networks

This page was built for publication: Structural Information and Communication Complexity

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