Surrounding nodes in coordinate-free networks

DOI10.1007/978-3-540-68405-3_26MaRDI QIDQ3564328zbMATH OpenOpenAlexFDO

Authors David Lipsky, Sameera Poduri, Gaurav S. Sukhatme, Robert Ghrist

Publication date 2 June 2010

Published in Springer Tracts in Advanced Robotics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-68405-3_26

Mathematics Subject Classification ID

Decentralized systems (93A14) Automated systems (robots, etc.) in control theory (93C85) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Geometric algorithms for sensor networks
• Sequential localization of sensor networks
• Algorithmic Aspects of Wireless Sensor Networks
• On frame and orientation localization for relative sensing networks
• Distributed localization of wireless sensor network using communication wheel

Cites work

• Coordinate-free coverage in sensor networks with controlled boundaries via homology
• Coverage in sensor networks via persistent homology
• Deterministic boundary recognition and topology extraction for large sensor networks
• scientific article; zbMATH DE number 3562121 (Why is no real title available?)
• scientific article; zbMATH DE number 5250977 (Why is no real title available?)
• Unit disk graph recognition is NP-hard

Cited in

(1)

• A simple network of nodes moving on the circle

This page was built for publication: Surrounding nodes in coordinate-free networks

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