Centdian Computation for Sensor Networks

DOI10.1007/978-3-642-13562-0_18MaRDI QIDQ3569075zbMATH OpenOpenAlexFDO

Authors Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir

Publication date 17 June 2010

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

Full work available at URL https://doi.org/10.1007/978-3-642-13562-0_18

zbMATH Keywords

cactus graphdistributed algorithmsensor networkcentdian node

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Recommendations

• Distributed algorithms for sensor networks
• Algorithmic Aspects of Wireless Sensor Networks
• Dense, concentric, and non-uniform multi-hop sensor networks
• Centdian computation in cactus graphs
• Geometric algorithms for sensor networks
• Sensor networks and distributed CSP: communication, computation and complexity
• A scalable sensor network using a polar coordinate system
• Distributed computation of virtual coordinates for greedy routing in sensor networks
• Theoretical aspects of distributed computing in sensor networks.

Cited in

(2)

• Computing the clique-width of cactus graphs
• Centdian computation in cactus graphs

This page was built for publication: Centdian Computation for Sensor Networks

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