English

Node Isolation of Secure Wireless Sensor Networks under a Heterogeneous Channel Model

Information Theory 2017-01-05 v1 math.IT

Abstract

We investigate the secure connectivity of wireless sensor networks under a heterogeneous random key predistribution scheme and a heterogeneous channel model. In particular, we study a random graph formed by the intersection of an inhomogeneous random key graph with an inhomogeneous Erd\H{o}s-R\'enyi graph. The former graph is naturally induced by the heterogeneous random key predistribution scheme while the latter graph constitutes a heterogeneous on/off channel model; wherein, the wireless channel between a class-ii node and a class-jj node is on with probability αij\alpha_{ij} independently. We present conditions (in the form of zero-one laws) on how to scale the parameters of the intersection model so that it has no isolated node with high probability as the number of nodes gets large. We also present numerical results to support these zero-one laws in the finite-node regime.

Keywords

Cite

@article{arxiv.1610.07576,
  title  = {Node Isolation of Secure Wireless Sensor Networks under a Heterogeneous Channel Model},
  author = {Rashad Eletreby and Osman Yağan},
  journal= {arXiv preprint arXiv:1610.07576},
  year   = {2017}
}

Comments

In Proceedings of the 54th Annual Allerton Conference on Communication, Control, and Computing. arXiv admin note: text overlap with arXiv:1604.00460

R2 v1 2026-06-22T16:29:57.450Z