Secure Connectivity of Wireless Sensor Networks Under Key Predistribution with on/off Channels release_txngxabl6naphmrg3bevokmvem

by Jun Zhao

Released as a article .

2019  

Abstract

Security is an important issue in wireless sensor networks (WSNs), which are often deployed in hostile environments. The q-composite key predistribution scheme has been recognized as a suitable approach to secure WSNs. Although the q-composite scheme has received much attention in the literature, there is still a lack of rigorous analysis for secure WSNs operating under the q-composite scheme in consideration of the unreliability of links. One main difficulty lies in analyzing the network topology whose links are not independent. Wireless links can be unreliable in practice due to the presence of physical barriers between sensors or because of harsh environmental conditions severely impairing communications. In this paper, we resolve the difficult challenge and investigate k-connectivity in secure WSNs operating under the q-composite scheme with unreliable communication links modeled as independent on/off channels, where k-connectivity ensures connectivity despite the failure of any (k - 1) sensors or links, and connectivity means that any two sensors can find a path in between for secure communication. Specifically, we derive the asymptotically exact probability and a zero-one law for k-connectivity. We further use the theoretical results to provide design guidelines for secure WSNs. Experimental results also confirm the validity of our analytical findings.
In text/plain format

Archived Files and Locations

application/pdf   304.7 kB
file_3dipelw2mfhrnnayybqpxukxee
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2019-11-02
Version   v1
Language   en ?
arXiv  1911.00745v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: dde2bb2d-7d6b-4eb4-a864-0fae2101acc1
API URL: JSON