期刊文献+

无线传感器网络移动汇聚节点密钥管理方案

Key Management Scheme of Mobile Sink in Wireless Sensor Networks
下载PDF
导出
摘要 针对传统的移动汇聚节点密钥管理方案即能耗最低方案、概率型方案、多项式方案等存在抗俘获能力低的问题,提出了一种改进的移动汇聚节点密钥管理方案。该方案实现原理:全体节点共享一个多项式池F,传感器节点的多项式环大小为1,移动汇聚节点的多项式环大小为|F|;利用移动汇聚节点存储资源丰富的优势保证移动汇聚节点与附近的任一传感器节点都存在一个共享多项式,进而通过该共享多项式计算出共享密钥;若规定每个多项式被分配的次数不大于多项式的阶数时,可保证多项式的绝对安全,从而实现节点抗俘获能力最优的目标。实验结果表明,与概率型方案相比,该方案有效地提高了节点的抗俘获能力,并降低了节点能耗。 In view of problem of low anti-capture ability of traditional key management scheme of mobile sink,namely minimum energy consumption scheme,probabilistic scheme and polynomial scheme,the paper proposed an improved key management scheme of mobile sink.The implementing principle of the scheme is as follows: all nodes share a polynomial pool F,size of polynomial loop of sensor is 1 and size of polynomial loop of mobile sink is |F|;using advantage of abundant storage resources of mobile sink to ensure exist a shared polynomial in mobile sink and any sensor nearby,then to calculate shared key through the polynomial.If regulating distributed times of each polynomial are less than orders of the polynomial,it can ensure absolute security of polynomial,so as to realize the best anti-capture ability of nodes.The experiment result showed that the scheme improves anti-capture ability and reduces energy consumption effectively of nodes comparing with probabilistic scheme.
出处 《工矿自动化》 2011年第10期26-31,共6页 Journal Of Mine Automation
基金 江苏省高校自然科学基金资助项目(05KJD52006) 江苏科技大学科研资助项目(2005DX006J)
关键词 无线传感器网络 移动汇聚节点 传感器节点 共享密钥 密钥管理 wireless sensor networks mobile sink sensor node shared key key management
  • 相关文献

参考文献10

  • 1CHAKRABARTI A, SABHARWAL A, AAZHANG B. Communication Power Optimization in a Sensor Network with a Path-Constrained Mobile Observer [J]. ACM Transactions Sensor Networks, 2006, 2 (3) :297-324.
  • 2JAIN S, SHAH R C, BRUNETTE W, et al. Exploiting Mobility for Energy Efficient Data Collection in Wireless Sensor Networks[J]. Mobile Networks and Applications, 2006,11 (3) : 327-339.
  • 3ESCHENAUER L, GLIGOR V D. A Key Management Scheme for Distributed Sensor Networks [C]//The 9th ACM Conference on Computer and Communication, 2002, Washington: 41-47.
  • 4CHAN H W, PERRIG A, SONG D. Random Key Predistribution Schemes for Sensor Networks[C]// 2003 IEEE Symposium on Security and Privacy, 2003 ,Berkeley: 197-213.
  • 5JAWORSKI J, REN M, RYBARCZYK K. Random Key Predistribution for Wireless Sensor Networks Using Deployment Knowledge [ J ]. Computing, 2009, 85(1-2) :57-76.
  • 6WANG J,XIA Z Y, HARN L, et al. Storage-Optimal Key Sharing with Authentication in Sensor Networks []//Parallel and Distributed Processing and Applications, 2005 : 466-474.
  • 7LIU D G, NING P, LI R F. Establishing Pairwise Keys in Distributed Sensor Networks [J]. ACM Transactions on Information and System Security, 2005,8(1) :41-77.
  • 8WEN M, ZHENG Y F, YEW J, et al. A Key Management Protocol with Robust Continuity for Sensor Networks[J]. Computer Standards and Inter- faces, 2009,31 (4) : 642-647.
  • 9CHAKRABARTI A,SABHARWAL A, AAZHANG B. Using Predictable Observer Mobility for Power Efficient Design of Sensor Networks[C]//Proceeding Second Int'l Workshop Information Processing in Sensor Networks, 2003.
  • 10BLUNDO C, SANTIS A D, HERZBERG A, et al. Perfectly-secure Key Distribution for Dynamic Conferences ECl//Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology. London: Springer-Verlag Press, 1992: 471-486.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部