haoyang,fanye,yuanyuan,songwulu,williamarbaugh.pptVIP

 Hao Yang, Fan Ye, Yuan Yuan, Songwu Lu, William Arbaugh (UCLA, IBM, U. Maryland) MobiHoc 2005 Outline Introduction and Background On resiliency of existing solutions Design Analysis and Simulation Results Discussions and Conclusions Introduction Target problem: Compromised nodes Report fabrication attacks Existing solution and their problem Multiple parties endorse an legitimate event; en-route filtering. Problem: Threshold breaks down. Their approach: use location-based information to achieve resilience. General Scenario Large scale sensor network that monitors a vast geographic terrain. Size and shape of the terrain is known a priori Sensor nodes are uniformly randomly deployed to the terrain. Once deployed, each node can obtain its geographic location via a localization scheme. One resourceful sink. General En-route Filtering Framework Initial: A node store some keys, it use its own key to generate a Message Authentication Code (MAC) attached to an event report. It use others keys to verify the report forwarded to it. Each key has a unique index. General En-route Filtering Framework On event occur: A legitimate report must carry m distinct MACs. Multiple nodes sense the event and collaborate generate (one or more) reports with more than m MACs. General En-route Filtering Framework Intermediate nodes: General En-route Filtering Framework Sink verification: Sink knows every keys, it can verify every MACs. Outline Introduction and Background On resiliency of existing solutions Design Analysis and Simulation Results Discussions and Conclusions Interleaved Hop-by-Hop Authentication (IHA) Design parameter: m Sensing cluster with at least m+1 nodes and a cluster head. Along the path, two nodes that are m+1 hops away are associated by a pair-wise key. Threshold: m. Interleaved Hop-by-Hop Authentication (IHA) Statistical En-route Filtering (SEF) Global key pool is divided into m partition. Each node pre-loaded with a few keys randomly chosen from a single part