DocumentCode :
3245177
Title :
Secure Aggregation in Sensor Networks Using Neighborhood Watch
Author :
Rabinovich, P. ; Simon, Robert
Author_Institution :
George Mason Univ., Fairfax
fYear :
2007
fDate :
24-28 June 2007
Firstpage :
1484
Lastpage :
1491
Abstract :
Many sensor networks (SN) use in-network aggregation to minimize the amount of data transmitted by sensors. Unfortunately, aggregation makes the network more vulnerable: a central server collecting the SN´s results receives less information that could be used to detect and/or mitigate cheating. In this paper we study stealth attacks where an adversary seeks to deceive the system without being detected. We propose several measures to make a sensor network resilient to attack: (a) mutual monitoring and constraint validation, (b) randomized delivery trees, and (c) redundancy in the data supplied by the network. We introduce several protocols to achieve resilience as well as a reputation system to allow detection and exclusion of compromised sensors. We conclude by reporting results of our simulations under several attack models.
Keywords :
telecommunication security; trees (mathematics); wireless sensor networks; constraint validation; in-network aggregation; mutual monitoring; neighborhood watch; randomized delivery trees; secure aggregation; sensor networks; Computer science; Monitoring; Network servers; Protocols; Resilience; Routing; Sensor systems; Tin; USA Councils; Watches;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 2007. ICC '07. IEEE International Conference on
Conference_Location :
Glasgow
Print_ISBN :
1-4244-0353-7
Type :
conf
DOI :
10.1109/ICC.2007.249
Filename :
4288920
Link To Document :
بازگشت