Secure Distributed Routing Algorithm with Optimizing Energy Consumption for Cognitive Radio Networks

In cognitive radio networks, the non-cooperative behavior is an inherent security issue. Then it is important to guarantee the support of the cooperation among nodes. In this paper, first the distributed routing problems with optimizing energy use are translated into a 0–1 integer programming problem by analyzing the dynamical power interference among nodes. Secondly, the key allocation about end nodes is devised to realize the confidentiality about data transmission. Thirdly, a secure distributed routing algorithm (SDRA) with energy use is proposed to ensure the security on end-to-end communication. The simulation and analysis show that the energy use for the SDRA is lower than that of the spectrum and energy aware routing protocol. Moreover, the trust mechanism based on Bayesian theorem is more compatible than that of Beta function for distributed routing algorithm in the actual situation.