On the efficiency of routing in sensor networks

DOI10.1016/J.JPDC.2012.02.021MaRDI QIDQ455964zbMATH OpenOpenAlexFDO

Authors Florian Huc, Aubin Jarry, Pierre Leone, José 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

obstacle avoidancesensor networkgeographic routing

Mathematics Subject Classification ID

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

Recommendations

• Space-efficiency for routing schemes of stretch factor three
• Oblivious routing for sensor network topologies
• A trade-off between space and efficiency for routing tables
• Reliable and efficient communications in sensor networks
• Sparse communication networks and efficient routing in the plane (extended abstract)

Cites work

• scientific article; zbMATH DE number 1775400 (Why is no real title available?)
• A tight bound on approximating arbitrary metrics by tree metrics
• A trade-off between space and efficiency for routing tables
• Compact routing on Euclidian metrics
• Compact routing with minimum stretch
• Designing networks with compact routing tables
• Improved routing strategies with succinct tables
• Optimal-stretch name-independent compact routing in doubling metrics
• Routing with guaranteed delivery in ad hoc wireless networks
• Stochastic performance evaluation of hierarchical routing for large networks
• Theory of semidefinite programming for sensor network localization

Cited in

(11)

• Rijndael for sensor networks: is speed the main issue?
• A stochastic analysis of a greedy routing scheme in sensor networks
• Sensitivity Analysis of an Optimal Routing Policy in an Ad Hoc Wireless Network
• A distributed routing algorithm for sensor networks derived from macroscopic models
• scientific article; zbMATH DE number 2088435 (Why is no real title available?)
• Virtual raw anchor coordinates: a new localization paradigm
• Information Processing and Routing in Wireless Sensor Networks
• Geographic routing on virtual raw anchor coordinate systems
• Oblivious routing for sensor network topologies
• Every Schnyder drawing is a greedy embedding
• Routing of single-source and multiple-source queries in static sensor networks

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

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