Secure and reliable connectivity in heterogeneous wireless sensor networks
Abstract
We consider wireless sensor networks secured by the heterogeneous random key predistribution scheme under an on/off channel model. The heterogeneous random key predistribution scheme considers the case when the network includes sensor nodes with varying levels of resources, features, or connectivity requirements; e.g., regular nodes vs. cluster heads, but does not incorporate the fact that wireless channel are unreliable. To capture the unreliability of the wireless medium, we use an on/off channel model; wherein, each wireless channel is either on (with probability $\alpha$) or off (with probability $1-\alpha$) independently. We present conditions (in the form of zero-one laws) on how to scale the parameters of the network model so that with high probability the network is $k$-connected, i.e., the network remains connected even if any $k-1$ nodes fail or leave the network. We also present numerical results to support these conditions in the finite-node regime.
- Publication:
-
arXiv e-prints
- Pub Date:
- October 2016
- DOI:
- 10.48550/arXiv.1612.02466
- arXiv:
- arXiv:1612.02466
- Bibcode:
- 2016arXiv161202466E
- Keywords:
-
- Computer Science - Networking and Internet Architecture;
- Mathematics - Probability
- E-Print:
- Submitted to IEEE International Conference on Communications 2017 (ICC 2017). substantial text overlap with arXiv:1611.02733, arXiv:1611.02675, arXiv:1610.07576