ACM Home Page
Please provide us with feedback. Feedback
Loss inference in wireless sensor networks based on data aggregation
Full text PdfPdf (230 KB)
Source Information Processing In Sensor Networks archive
Proceedings of the 3rd international symposium on Information processing in sensor networks table of contents
Berkeley, California, USA
POSTER SESSION: Group H: estimation and detection table of contents
Pages: 396 - 404  
Year of Publication: 2004
ISBN:1-58113-846-6
Authors
Gregory Hartl  University of Toronto, Toronto, Ontario
Baochun Li  University of Toronto, Toronto, Ontario
Sponsor
SIGBED: ACM Special Interest Group on Embedded Systems
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 49,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/984622.984680
What is a DOI?

ABSTRACT

In this paper, we consider the problem of inferring per node loss rates from passive end-to-end measurements in wireless sensor networks. Specifically, we consider the case of inferring loss rates during the aggregation of data from a collection of sensor nodes to a sink node. Previous work has studied the general problem of network inference, which considers the cases of inferring link-based metrics in wireline networks. We show how to adapt previous work on network inference so that loss rates in wireless sensor networks may be inferred as well. This includes (1) considering the per-node, instead of per-link, loss rates; and (2) taking into account the unique characteristics of wireless sensor networks. We formulate the problem as a Maximum-Likelihood Estimation (MLE) problem and show how it can be efficiently solved using the Expectation-Maximization (EM) algorithm. The results of the inference procedure may then be utilized in various ways to effectively streamline the data collection process. Finally, we validate our analysis through simulations.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci. A Survey On Sensor Networks. IEEE Communications Magazine, 40(8):102--114, August 2002.
2
 
3
R. Caceres, N. Duffield, J. Horowitz, and D. Towsley. Multicast Based Inference of Network Internal Loss Characteristics. IEEE Trans. on Information Theory, 45:2462--2480, 1999.
 
4
M. Coates, A. H. III, R. Nowak, and B. Yu. Internet Tomography. IEEE Signal Processing Magazine, 19(3):47--65, May 2002.
 
5
M. Coates and R. Nowak. Network Loss Inference Using Unicast End-to-End Measurement. In ITC Seminar on IP Traffic, Measurement and Modelling, September 2000.
 
6
M. Coates and R. Nowak. Network Delay Distribution Inference from End-to-end Unicast Measurement. In Proceedings 2001 IEEE Int. Conf. Acoust., Speech, and Signal Processing, May 2001.
 
7
N. Duffield, J. Horowitz, F. L. Presti,and D. Towsley. Multicast Topology Inference From Measured End-to-End Measurements. In ITC Seminar on IP Traffic, Measurement and Modelling, September 2000.
 
8
 
9
N. Duffield, J. Horowitz, F. L. Presti,and D. Towsley. Multicast Topology Inference From Measured End-to-End Loss. IEEE Trans. on Information Theory, 48:26--45, 2002.
 
10
N. Duffield, F. L. Presti, V. Paxson, and D. Towsley. Inferring Link Loss Using Striped Unicast Probes. In Proceedings of IEEE INFOCOM 2001.
 
11
12
 
13
 
14
G. J. McLachlan and T. Krishnan. The EM Algorithm and Extensions. John Wiley and Sons, Inc., New York, 1997.
 
15
S. Ratnasamy and S. McCanne. Inference of Multicast Routing Trees and Bottleneck Bandwidths using End-to-End Measurements. In Proceedings IEEE INFOCOM 1999.
 
16
Y. Tsang, M. Coates, and R. Nowak. Passive Network Tomography Using EM Algorithms. In Proceedings 2001 IEEE Int. Conf. Acoust., Speech, and Signal Processing, volume 3, pages 1469--1472, May 2001.
17


Collaborative Colleagues:
Gregory Hartl: colleagues
Baochun Li: colleagues