几乎确定连接在安全无线传感器网络

Jyoti Pandey, B. Gupta, S. S. Lamba
{"title":"几乎确定连接在安全无线传感器网络","authors":"Jyoti Pandey, B. Gupta, S. S. Lamba","doi":"10.1109/WOCN.2014.6923055","DOIUrl":null,"url":null,"abstract":"In this paper, our work is to focus on the almost sure connectivity properties of secure wireless sensor networks. We consider a wireless sensor network which is generated randomly using random key pre distribution scheme given by Eschenauer and Gligor under non-full visibilitys. Here, we consider a sensor network in 2-dimensional space, and a sequence Xn = {Xi, X2,...Xn}, with n sensor nodes distributed uniformly over a compact space C ⊂ R2 We focus on network cut to deal with connectivity issues in WSNs. We have given a strong relationship and derived a threshold for the proportion of key ring and key pool size, above which graph will have no cut in the network almost surely. We prove that if key pool size is n log n and key ring size of an arbitrary node is c log n and if c > 1/s(1-s/n) then there will be no cut in the network.","PeriodicalId":149158,"journal":{"name":"2014 Eleventh International Conference on Wireless and Optical Communications Networks (WOCN)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Almost sure connectivity in secure wireless sensor network\",\"authors\":\"Jyoti Pandey, B. Gupta, S. S. Lamba\",\"doi\":\"10.1109/WOCN.2014.6923055\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, our work is to focus on the almost sure connectivity properties of secure wireless sensor networks. We consider a wireless sensor network which is generated randomly using random key pre distribution scheme given by Eschenauer and Gligor under non-full visibilitys. Here, we consider a sensor network in 2-dimensional space, and a sequence Xn = {Xi, X2,...Xn}, with n sensor nodes distributed uniformly over a compact space C ⊂ R2 We focus on network cut to deal with connectivity issues in WSNs. We have given a strong relationship and derived a threshold for the proportion of key ring and key pool size, above which graph will have no cut in the network almost surely. We prove that if key pool size is n log n and key ring size of an arbitrary node is c log n and if c > 1/s(1-s/n) then there will be no cut in the network.\",\"PeriodicalId\":149158,\"journal\":{\"name\":\"2014 Eleventh International Conference on Wireless and Optical Communications Networks (WOCN)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Eleventh International Conference on Wireless and Optical Communications Networks (WOCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WOCN.2014.6923055\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Eleventh International Conference on Wireless and Optical Communications Networks (WOCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOCN.2014.6923055","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们的工作重点是安全无线传感器网络的几乎确定的连接特性。研究了在非完全可见条件下,利用Eschenauer和Gligor给出的随机密钥预分配方案随机生成的无线传感器网络。Xn}, n个传感器节点均匀分布在紧凑空间C∧R2我们专注于网络切割来处理wsn中的连通性问题。我们给出了一个强关系,并推导出了一个密钥环和密钥池大小比例的阈值,高于这个阈值的图几乎肯定不会在网络中被切断。证明了如果密钥池大小为n log n,任意节点的密钥环大小为c log n,且c > 1/s(1-s/n),则网络中不存在切割。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Almost sure connectivity in secure wireless sensor network
In this paper, our work is to focus on the almost sure connectivity properties of secure wireless sensor networks. We consider a wireless sensor network which is generated randomly using random key pre distribution scheme given by Eschenauer and Gligor under non-full visibilitys. Here, we consider a sensor network in 2-dimensional space, and a sequence Xn = {Xi, X2,...Xn}, with n sensor nodes distributed uniformly over a compact space C ⊂ R2 We focus on network cut to deal with connectivity issues in WSNs. We have given a strong relationship and derived a threshold for the proportion of key ring and key pool size, above which graph will have no cut in the network almost surely. We prove that if key pool size is n log n and key ring size of an arbitrary node is c log n and if c > 1/s(1-s/n) then there will be no cut in the network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信