Multi party key-exchange protocols in large scale cognitive radio network

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.