提出一种适合大规模认知无线电网络的密钥交换协议,首先利用拓扑位置将网络分簇,簇内使用multi party Diffie—HeHman,簇间使用a conference key distribution,通过旅行商问题为密钥交换协议提供最优路径。该协议不仅防止被动攻击,而且通过减少对广播信道的依赖提高共享密钥协商过程的效率和成功率,运行效率为O(2max(m)),max(m)为节点数最多的簇中节点数量。
This paper put forward a new method, firstly divided cognitive radio network into multiple clusters, secondly used multi party diffie-hellman in cluster and a conference key distribution among clusters, at last key-change protocols selected the optimal path with traveling salesman problem. This protocol not only prevents passive attack, but also improves the efficiency and success rate of sharing key by reducing the reliance on broadcast channels, the efficiency is O (2max (m) ) , max (m)is the number of nodes in cluster which have the largest number of nodes than other clusters.