电信科学 ›› 2010, Vol. 26 ›› Issue (12): 68-71.doi: 10.3969/j.issn.1000-0801.2010.12.020

• 研究与开发 • 上一篇    下一篇

基于认知无线电网络的Huffman密钥分发树

林庚1,乔占西2,薛楠3   

  1. 1 北京科技大学信息工程学院 北京100083
    2 河南科技大学 洛阳471003
    3 中国电子信息产业发展研究院 北京100846
  • 出版日期:2010-12-15 发布日期:2010-12-15
  • 基金资助:
    国家自然科学基金资助课题

Huffman Key Distribution Trees Based on Cognitive Radio Network

Geng Lin1,Zhanxi Qiao2,Nan Xue3   

  1. 1 College of Information Engineering，University of Science and Technology Beijing，Beijing 100083，China
    2 Henan Science ＆ Technology University，Luoyang 471003，China
    3 Ministry of Information Industry IT Industry Research Institute，Beijing 100846，China
  • Online:2010-12-15 Published:2010-12-15

在线阅读

5

PDF下载

326

摘要：

针对认知无线电网络可用信道动态变化和网络中各认知节点可用信道不尽相同的特点，在应用组播技术的认知无线电网络中，以认知节点没有可用信道而退出组播组的情况为依据，提出以非可用信道数作为叶节点的权值，构造适用于认知无线电网络组播环境的密钥分发树。非可用信道数多的节点位于树的上部，非可用信道数少的节点位于树的下部。由证明可知，其具有最小的密钥存储量和平均密钥更新消息包数。

关键词: 认知无线电网络, 组播, 密钥管理, Huffman树

Abstract:

Considering the characteristics that the dynamic spectrum and nodes have different channels available in cognitive radio network，if a cognitive node has no available channel，it has to quit the multicast group in the multicast environment.According to this phenomenon，this paper proposed a method to structure the key distribution tree that is suitable for cognitive radio network multicast environment，using the number of non-available channels as the weight of leaf nodes.The nodes with more non-available channels are in the higher part of the tree and the nodes with less non-available channels are in the lower part of the tree.It is proofed that the average cost of re-keying and the number of keys held by each user are minimal.

Key words: cognitive radio network, multicast, key management, Huffman tree

No Suggested Reading articles found!