On the efficiency of routing in sensor networks

DOI10.1016/j.jpdc.2012.02.021zbMath1248.68063OpenAlexW2058938746MaRDI QIDQ455964

Pierre Leone, Florian Huc, Aubin Jarry, José D. P. Rolim

Publication date: 23 October 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2012.02.021

zbMATH Keywords

geographic routingsensor networkobstacle avoidance

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Related Items (3)

Virtual raw anchor coordinates: a new localization paradigm ⋮ Every Schnyder drawing is a greedy embedding ⋮ Geographic routing on virtual raw anchor coordinate systems

Cites Work

• Unnamed Item
• Theory of semidefinite programming for sensor network localization
• Designing networks with compact routing tables
• Compact Routing with Minimum Stretch
• Improved routing strategies with succinct tables
• Stochastic performance evaluation of hierarchical routing for large networks
• A trade-off between space and efficiency for routing tables
• Optimal-stretch name-independent compact routing in doubling metrics
• Compact routing on euclidian metrics
• A tight bound on approximating arbitrary metrics by tree metrics
• Routing with guaranteed delivery in ad hoc wireless networks

This page was built for publication: On the efficiency of routing in sensor networks