Neighbor tables in sensor network routing

Authors:
Daniele Puccinelli;Silvia Giordano
Affiliations:
University of Applied Sciences of Southern Switzerland, Manno;University of Applied Sciences of Southern Switzerland, Manno
Venue:
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Year:
2010

Citing 4
Cited 0

Taming the underlying challenges of reliable multihop routing in sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
MoteLab: a wireless sensor network testbed

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Collection tree protocol

Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Reliable data delivery in large-scale low-power sensor networks

ACM Transactions on Sensor Networks (TOSN)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many-to-one sensor network routing, neighbor tables are commonly viewed as the centerpiece of the control plane and are typically used to allow nodes to recover from route breakage. Our results, however, indicate that table-free routing is a competitive strategy.