Route discovery with constant memory in oriented planar geometric networks

DOI10.1002/NET.20114MaRDI QIDQ5487818zbMATH OpenOpenAlexFDO

Authors

Publication date 12 September 2006

Published in Networks (Search for Journal in Brave)

Full work available at URL https://ir.library.carleton.ca/pub/2881

zbMATH Keywords

constant memory routingEulerian networkface routingoriented planar network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Algorithmic Aspects of Wireless Sensor Networks
• Constant memory routing in quasi-planar and quasi-polyhedral graphs
• Directional Geometric Routing on Mobile Ad Hoc Networks
• Online Routing in Triangulations
• scientific article; zbMATH DE number 1522924

Cites work

• Geometric ad-hoc routing, of theory and practice
• Graph theory with applications

Cited in

(5)

• Constant memory routing in quasi-planar and quasi-polyhedral graphs
• Bounding the locality of distributed routing algorithms
• Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
• Algorithmic Aspects of Wireless Sensor Networks
• Structural Information and Communication Complexity

This page was built for publication: Route discovery with constant memory in oriented planar geometric networks

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