2011/03/22 by Osman Yağan, Osman Yagan, Yagan, Osman +2
Computer Science · Mathematics · #Cryptography and Security (cs.CR) #Discrete Mathematics (cs.DM) #Energy Efficient Wireless Sensor Networks #FOS: Computer and information sciences #Information Theory (cs.IT) #Mobile Ad Hoc Networks #Security in Wireless Sensor Networks #cs.CR #cs.DM #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1103.4401
The extended version of a paper that will appear at WiOpt 2011. Additional parts may later be reported elsewhere
arxiv created 2011/03/22 · openalex publication_date 2011/03/22 · arxiv updated 2011/03/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In the context of wireless sensor networks, the pairwise key distribution scheme of Chan et al. has several advantages over other key distribution schemes including the original scheme of Eschenauer and Gligor. However, this offline pairwise key distribution mechanism requires that the network size be set in advance, and involves all sensor nodes simultaneously. Here, we address this issue by describing an implementation of the pairwise scheme that supports the gradual deployment of sensor nodes in several consecutive phases. We discuss the key ring size needed to maintain the secure connectivity throughout all the deployment phases. In particular we show that the number of keys at each sensor node can be taken to be O(log n) in order to achieve secure connectivity (with high probability).