Issue No. 01 - January (2011 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2010.57
Amar Rasheed , Texas A&M University, College Station
Rabi N. Mahapatra , Texas A&M University, College Station
Security services such as authentication and pairwise key establishment are critical to sensor networks. They enable sensor nodes to communicate securely with each other using cryptographic techniques. In this paper, we propose two key predistribution schemes that enable a mobile sink to establish a secure data-communication link, on the fly, with any sensor nodes. The proposed schemes are based on the polynomial pool-based key predistribution scheme, the probabilistic generation key predistribution scheme, and the Q-composite scheme. The security analysis in this paper indicates that these two proposed predistribution schemes assure, with high probability and low communication overhead, that any sensor node can establish a pairwise key with the mobile sink. Comparing the two proposed key predistribution schemes with the Q-composite scheme, the probabilistic key predistribution scheme, and the polynomial pool-based scheme, our analytical results clearly show that our schemes perform better in terms of network resilience to node capture than existing schemes if used in wireless sensor networks with mobile sinks.
Distributed systems, sensor networks.
R. N. Mahapatra and A. Rasheed, "Key Predistribution Schemes for Establishing Pairwise Keys with a Mobile Sink in Sensor Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 22, no. , pp. 176-184, 2010.