Exact Analysis of k-Connectivity in Secure Sensor Networks with Unreliable Links

被引：0
|
作者：
Zhao, Jun [1 ,2 ]
Yagan, Osman [1 ,2 ]
Gligor, Virgil [1 ,2 ]
机构：
[1] Carnegie Mellon Univ, CyLab, Pittsburgh, PA 15213 USA
[2] Carnegie Mellon Univ, Dept ECE, Pittsburgh, PA 15213 USA
来源：
2015 13TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS NETWORKS (WIOPT) | 2015年
关键词：
Connectivity; key predistribution; minimum degree; random graphs; security; wireless sensor networks;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The Eschenauer-Gligor (EG) random key predistribution scheme has been widely recognized as a typical approach to secure communications in wireless sensor networks (WSNs). However, there is a lack of precise probability analysis on the reliable connectivity of WSNs under the EG scheme. To address this, we rigorously derive the asymptotically exact probability of k-connectivity in WSNs employing the EG scheme with unreliable links represented by independent on/off channels, where k-connectivity ensures that the network remains connected despite the failure of any (k-1) sensors or links. Our analytical results are confirmed via numerical experiments, and they provide precise guidelines for the design of secure WSNs that exhibit a desired level of reliability against node and link failures.
引用
收藏
页码：191 / 198
页数：8
相关论文
共 50 条
12345