Secure k-connectivity properties of wireless sensor networks

Yee Wei Law*, Li-Hsing Yen, Roberto Di Pietro, Marimuthu Palaniswami


研究成果: Chapter同行評審


A k-connected wireless sensor network (WSN) allows messages to be routed via one (or more) of at least k node-disjoint paths, so that even if some nodes along one of the paths fail, or are compromised, the other paths can still be used. This is a much desired feature in fault tolerance and security. k-connectivity in this context is largely a well-studied subject. When we apply the random key pre-distribution scheme to secure a WSN however, and only consider the paths consisting entirely of secure (authenticated and/or encrypted) links, we are concerned with the secure k-connectivity of the WSN. This notion of secure k-connectivity is relatively new and no results are yet available. The random key pre-distribution scheme has two important parameters: the key ring size and the key pool size. While it has been determined before the relation between these parameters and 1-connectivity, our work in k-connectivity is new. Using a recently introduced random graph model called kryptograph, we derive mathematical formulae to estimate the asymptotic probability of a WSN being securely k-connected, and the expected secure k-connectivity, as a function of the key ring size and the key pool size. Finally, our theoretical findings are supported by simulation results.

主出版物標題From Problem toward Solution
主出版物子標題Wireless Sensor Networks Security
發行者Nova Science Publishers, Inc.
出版狀態Published - 1 12月 2009


深入研究「Secure k-connectivity properties of wireless sensor networks」主題。共同形成了獨特的指紋。