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 条
  • [1] Minimum Node Degree and k-Connectivity in Wireless Networks with Unreliable Links
    Zhao, Jun
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 246 - 250
  • [2] Secure k-connectivity properties of wireless sensor networks
    Law, Yee Wei
    Yen, Li-Hsing
    Di Pietro, Roberto
    Palaniswami, Marimuthu
    2007 IEEE INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR SYSTEMS, VOLS 1-3, 2007, : 1190 - +
  • [3] k-Connectivity in Random Key Graphs With Unreliable Links
    Zhao, Jun
    Yagan, Osman
    Gligor, Virgil
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (07) : 3810 - 3836
  • [4] k-Connectivity of Inhomogeneous Random Key Graphs With Unreliable Links
    Eletreby, Rashad
    Yagan, Osman
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (06) : 3922 - 3949
  • [5] Distribution of k-Connectivity in the Secure Wireless Sensor Network
    Pandey, Jyoti
    Gupta, Bhupendra
    2014 RECENT ADVANCES AND INNOVATIONS IN ENGINEERING (ICRAIE), 2014,
  • [6] Secure k-Connectivity in Wireless Sensor Networks under an On/Off Channel Model
    Zhao, Jun
    Yagan, Osman
    Gligor, Virgil
    2013 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2013, : 2790 - +
  • [7] Connectivity of wireless sensor networks with unreliable links
    Zhang, Ruifeng
    Gorce, Jean-Marie
    2007 SECOND INTERNATIONAL CONFERENCE IN COMMUNICATIONS AND NETWORKING IN CHINA, VOLS 1 AND 2, 2007, : 684 - 688
  • [8] On the Minimum k-Connectivity Repair in Wireless Sensor Networks
    Almasaeid, Hisham M.
    Kamal, Ahmed E.
    2009 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-8, 2009, : 195 - 199
  • [9] DECK: A distributed, asynchronous and exact k-connectivity detection algorithm for Wireless Sensor Networks
    Akram, Vahid Khalilpour
    Dagdeviren, Orhan
    COMPUTER COMMUNICATIONS, 2018, 116 : 9 - 20
  • [10] Toward k-Connectivity of the Random Graph Induced by a Pairwise Key Predistribution Scheme With Unreliable Links
    Yavuz, Faruk
    Zhao, Jun
    Yagan, Osman
    Gligor, Virgil
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (11) : 6251 - 6271
12345