DocumentCode
2302107
Title
Lossy Node Identification in Wireless Sensor Network
Author
Li, Yongjun ; Cai, Wandong ; Wang, Wei ; Tian, Guangli
Author_Institution
Sch. of Comput. Sci., Northwestern Polytech. Univ., Xi´´an
fYear
2006
fDate
24-26 July 2006
Firstpage
255
Lastpage
258
Abstract
In a sensor network, the nodes that have a packet loss rate greater than a given threshold are called lossy nodes. Lossy nodes adversely affect network performance and collectively cause breakdown of network service in many cases. In this paper, we propose a new and simple approach to identify the lossy nodes from passive end-to-end measurements. Specifically, we consider the case of identifying lossy nodes during the aggregation of data from a collection of the sensor nodes to a sink node. The proposed method is based on the hamming distance of sequences on receipt/loss of aggregated data between each pair of parent-child node. With prior knowledge of the reverse data aggregation topology, our approach can identify all lossy nodes effectively. Finally, we validate the proposed approach
Keywords
performance evaluation; wireless sensor networks; hamming distance; lossy node identification; network performance; parent-child node; passive end-to-end measurement; reverse data aggregation topology; wireless sensor network; Bandwidth; Computer science; Electric breakdown; Hamming distance; Intelligent networks; Loss measurement; Network topology; Performance loss; Sensor phenomena and characterization; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Network Computing and Applications, 2006. NCA 2006. Fifth IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7695-2640-3
Type
conf
DOI
10.1109/NCA.2006.39
Filename
1659503
Link To Document