Performance, Computing, and Communications Conference, 2002. 21st IEEE International (2006)
Phoenix, AZ, USA
Apr. 10, 2006 to Apr. 12, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/.2006.1629433
S. Ozdemir , Dept. of Comput. Sci.&Eng., Arizona State Univ., Tempe, AZ, USA
H. Cam , Dept. of Comput. Sci.&Eng., Arizona State Univ., Tempe, AZ, USA
This paper presents a symmetric key establishment protocol, called event-based reconciliation (ERS), that does not require sensor nodes to store pairwise keys prior to deployment. The novel idea behind ERS is to establish symmetric keys by exchanging the secret key information via distributed source coding that uses some event data as side information. Any two neighboring sensor nodes that are able to detect the same event first exchange some key information using distributed source coding and data of the event detected in the overlapping sensing region, and reconcile a symmetric key in two iterations. A key expansion algorithm is also presented to enhance the recovery of key bits in the presence of bit errors and to improve the secrecy of the key establishment. Performance evaluation results show that ERS has low memory and communication overhead compared to previous symmetric key distribution schemes.
ERS, source coding, wireless sensor network, symmetric key establishment protocol, event-based reconciliation
H. Cam and S. Ozdemir, "Key establishment with source coding and reconciliation for wireless sensor networks," Performance, Computing, and Communications Conference, 2002. 21st IEEE International(PCC), Phoenix, AZ, USA, 2006, pp. 55.