Collision-free routing in sink-centric sensor networks with coarse-grain coordinates

DOI10.1007/978-3-642-19222-7_16MaRDI QIDQ3000503zbMATHOpenAlexFDO

Authors Alfredo Navarra, Cristina M. Pinotti

Publication date 19 May 2011

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-19222-7_16

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Recommendations

• Distributed colorings for collision-free routing in sink-centric sensor networks
• scientific article; zbMATH DE number 2061536
• Collision-free path coloring with application to minimum-delay gathering in sensor networks
• Localization and scheduling protocols for actor-centric sensor networks
• Distributed computation of virtual coordinates for greedy routing in sensor networks

Cites work

• Efficient corona training protocols for sensor networks

Cited in

(3)

• scientific article; zbMATH DE number 2061536 (Why is no real title available?)
• Localization and scheduling protocols for actor-centric sensor networks
• Distributed colorings for collision-free routing in sink-centric sensor networks

This page was built for publication: Collision-free routing in sink-centric sensor networks with coarse-grain coordinates

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