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

TL;DR
This paper analyzes the secure connectivity of wireless sensor networks using the q-composite key predistribution scheme considering unreliable on/off communication channels, providing rigorous probabilistic results and design guidelines.
Contribution
It offers the first rigorous analysis of k-connectivity in secure WSNs under the q-composite scheme with unreliable links modeled as on/off channels.
Findings
Derived asymptotically exact probability of k-connectivity.
Established a zero-one law for secure network connectivity.
Validated theoretical results with experimental data.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
