Analyzing connectivity of heterogeneous secure sensor networks
arXiv:1911.01890 · doi:10.1109/TCNS.2016.2641799
Abstract
We analyze connectivity of a heterogeneous secure sensor network that uses key predistribution to protect communications between sensors. For this network on a set of sensors, suppose there is a pool consisting of distinct keys. The sensors in are divided into groups . Each sensor is independently assigned to exactly a group according to the probability distribution with for , where . Afterwards, each sensor in group independently chooses keys uniformly at random from the key pool , where . Finally, any two sensors in establish a secure link in between if and only if they have at least one key in common. We present critical conditions for connectivity of this heterogeneous secure sensor network. The result provides useful guidelines for the design of secure sensor networks. This paper improves the seminal work [1] (IEEE Transactions on Information Theory 2016) of Ya{ğ}an on connectivity in several aspects (omitted due to arxiv abstract's character limitation; see the paper for details).
arXiv commentPublished in IEEE Transactions on Control of Network Systems
References in corpus (7)
- Zero-one laws for connectivity in random key graphs
- Degree and clustering coefficient in sparse random intersection graphs
- Epidemics on random intersection graphs
- k-Connectivity in Random Key Graphs with Unreliable Links
- Connectivity in Secure Wireless Sensor Networks under Transmission Constraints
- Zero-one laws for connectivity in inhomogeneous random key graphs
- On the strengths of connectivity and robustness in general random intersection graphs