Structural Information and Communication Complexity

DOI10.1007/B136628zbMATH Open1085.68525OpenAlexW2480963397MaRDI QIDQ5710092FDOQ5710092

Authors: Mirjam Wattenhofer, Roger Wattenhofer, Peter Widmayer 

Publication date: 30 November 2005

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

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

Recommendations

• Routing in polygons without rectilinearly visible corners
• Routing in polygonal domains
• Routing in polygonal domains
• Algorithmic Aspects of Wireless Sensor Networks
• On a conjecture related to geometric routing
• Succinct Greedy Geometric Routing Using Hyperbolic Geometry
• Geometric ad-hoc routing
• Succinct greedy geometric routing in the Euclidean plane

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cited In (5)

• Title not available (Why is that?)
• Geographic routing on virtual raw anchor coordinate systems
• Algorithmic Aspects of Wireless Sensor Networks
• Position-based routing in wireless ad hoc and sensor networks
• Directional Geometric Routing on Mobile 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 Q5710092)