Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Statistical model of lossy links in wireless sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
X-MAC: a short preamble MAC protocol for duty-cycled wireless sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
Proceedings of the 6th ACM conference on Embedded network sensor systems
The β-factor: measuring wireless link burstiness
Proceedings of the 6th ACM conference on Embedded network sensor systems
Bursty traffic over bursty links
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Routing without routes: the backpressure collection protocol
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Opportunistic, receiver-initiated data-collection protocol
EWSN'12 Proceedings of the 9th European conference on Wireless Sensor Networks
| Hi-index | 0.00 |
Link estimation provides a long-term estimate of the quality of a link based on its past history. However, this need for a history of past packets is also its main drawback: First, most link estimators only adapt slowly to changing link conditions, being mainly designed to identify long-term stable links. As a result they leave out bursty, potentially long ranging links [2, 4]. Second, in low traffic environments, as seen in many of today's typically heavily duty-cycled application-slink estimates are potentially outdated as they are based on old packets. Finally, it requires to store estimates, i.e., state information, for its neighbors, and (4) relies on beacons to probe links.