首页> 外文会议>International Conference on Signal Processing and Integrated Networks >Improving Closest Pair Key Distribution Scheme using Neighbour Node Connectivity Prediction
【24h】

Improving Closest Pair Key Distribution Scheme using Neighbour Node Connectivity Prediction

机译:使用邻居节点连接预测改进最近的对密钥分配方案

获取原文

摘要

In wireless sensor network key predistribution is an important phase for ensuring security and it is done prior to deployment of sensor nodes into a target field. There are various key predistribution schemes (KPS in short) for wireless sensor network proposed earlier. Closest Pair KPS (CPKS) is such a scheme, which was first proposed by D. Liu and P. Ning and is used when sensor node location is known prior to deployment. In their scheme, they assign pairwise keys with a set of sensor nodes whose expected position are closest to the expected position of the sensor node. Here in this paper, we propose an improvement over traditional CPKS by neighbour node connectivity prediction technique to enhance probability of key share among nodes. The proposed algorithm is implemented and various experiments were done over different network scenario. The performance of the proposed scheme is discussed with the help of experimental results.
机译:在无线传感器网络中,网络密钥预分配是确保安全性的重要阶段,并且在将传感器节点部署到目标字段之前在完成之前完成。对于早期提出的无线传感器网络,有各种关键预分析方案(简称短暂的KPS)。最接近的对KPS(CPK)是这样的方案,其首先由D. Liu和P. ning提出,并且当在部署之前已知传感器节点位置时使用。在其方案中,它们分配了一组传感器节点的成对键,其预期位置最靠近传感器节点的预期位置。在本文中,我们通过邻居节点连接预测技术提出了传统CPK的改进,以提高节点之间的关键份额的概率。实现了所提出的算法,并在不同的网络场景下进行各种实验。在实验结果的帮助下讨论了所提出的方案的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号