Probabilistic inference of lossy links using end-to-end data in sensor networks

Lossy links used in a sensor network affect network performance, and hence need to be detected and repaired [1, 2]. One approach to detect lossy links is that each node monitors the loss rates on its neighboring links and reports them to the sink. This approach, although straightforward, causes large amount of traffic. Another approach to detect lossy links is through end-to-end data that are transmitted periodically from sources to the sink(s) [3, 1, 2]. This end-to-end approach has the advantage of not generating any additional monitoring traffic. The challenge is, however, to develop accurate inference algorithms for lossy link detection based on end-to-end measurements.

[1]  Patrick Thiran,et al.  Using End-to-End Data to Infer Lossy Links in Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[2]  Ramesh Govindan,et al.  Understanding packet delivery performance in dense wireless sensor networks , 2003, SenSys '03.

[3]  Nick G. Duffield,et al.  Network Tomography of Binary Network Performance Characteristics , 2006, IEEE Transactions on Information Theory.

[4]  Thomas Schmid,et al.  SensorScope: Experiences with a Wireless Building Monitoring Sensor Network , 2005 .

[5]  Frank R. Kschischang,et al.  A factor graph approach to link loss monitoring in wireless sensor networks , 2005, IEEE Journal on Selected Areas in Communications.

[6]  J. Beasley,et al.  Enhancing an algorithm for set covering problems , 1992 .

[7]  Baochun Li,et al.  Loss inference in wireless sensor networks based on data aggregation , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.