Structural Information and Communication Complexity

DOI10.1007/B98251MaRDI QIDQ5315239zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

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, of theory and practice
• Algorithmic Aspects of Wireless Sensor Networks

Cited in

(4)

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