Path Renewal Method in Filtering Based Wireless Sensor Networks
AbstractIn applications of wireless sensor networks, there are many security issues. Attackers can create false reports and transmit the reports to the networks. These false reports can lead not only false alarms, but also the depletion of limited energy resources. In order to filter out such false reports during the forwarding process, Ye et al. proposed the statistical en-route filtering (SEF). Several research efforts to enhance the efficiency of SEF have been made. Especially, the path selection method proposed by Sun et al. can improve the detection power of SEF by considering the information on the filtering keys of and distances of upstream paths. However, such selection mechanism could lead to favored paths in heavy traffic, which would result in unbalanced energy consumption. In this paper, we propose a path renewal method to provide load balancing for sensor networks in terms of energy consumption. In our method, a node renews its upstream path to save energy resources if the remaining energy of and the communication traffic of the node exceed some threshold values. We show the effectiveness of the proposed method in terms of balanced energy consumption and filtering power by providing simulation results. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Kim, J.M.; Han, Y.S.; Lee, H.Y.; Cho, T.H. Path Renewal Method in Filtering Based Wireless Sensor Networks. Sensors 2011, 11, 1396-1404.
Kim JM, Han YS, Lee HY, Cho TH. Path Renewal Method in Filtering Based Wireless Sensor Networks. Sensors. 2011; 11(2):1396-1404.Chicago/Turabian Style
Kim, Jin Myoung; Han, Young Shin; Lee, Hae Young; Cho, Tae Ho. 2011. "Path Renewal Method in Filtering Based Wireless Sensor Networks." Sensors 11, no. 2: 1396-1404.