.png){kind=icon}
返回
Random key predistribution for wireless sensor networks using deployment knowledge
.png){kind=icon}
OA
AI
DOI：10.1007/s00607-009-0036-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a key distribution scheme for wireless sensor networks which uses deployment knowledge. Deployment is modeled as a grid of hexagonal clusters, into centers of which the sensor nodes are dropped according to a given probability distribution (e.g. a Gaussian one). We consider sensor connectivity in a random intersection graph model, instead of the more commonly used in literature G(n, p) graph model. While the latter is easier to analyze, the former is much more suitable to modeling sensor network key distribution. We provide analytical, asymptotic results showing how to pick parameters (key pool size |S|, the number of chosen keys d) depending on the number of deployed nodes in order to assure global connectivity of the network, and estimate the diameter of the network for the given parameters.
Keyword:
Wireless sensor network
Deployment knowledge
Random key predistribution
Random intersection graph
Connectivity
Diameter
期刊
C
IF:
2.8
论文数:
2.3K
被引数:
3.5K
机构
引用论文
.png){kind=icon}
The factorial validity of the Maslach Burnout Inventory: Student Survey (MBI-SS) in Poland马斯拉奇职业倦怠量表学生版（MBI-SS）在波兰的因子效度OAAI
OAAI分享收藏
没有更多内容
没有更多内容