No abstract

Abstract. Cognitive radio networks solve the spectrum scarcity problem by dynamically utilizing the unused spectrums. To ensure secure and reliable communication, cognitive radio mobile ad hoc networks require more stringent and secure protocols due to their intrinsic nature. Tree based topology for cognitive radio network is widely used as it takes less time for join and leave operations for the users within the channel of the spectrum compared to other topologies. This paper presents a survey of tree based group key agreement schemes applicable to cognitive radio networks.

This paper presents an efficient contributory group key agreement protocol for secure communication between the lightweight small devices in cognitive radio mobile ad hoc networks. A Ternary tree based Group ECDH.2 (TGECDH.2) protocol that uses a batch rekeying algorithm during membership change is proposed in this paper. This ternary tree is a balanced key tree in which appropriate insertion point is selected for the joining members during rekeying operation. TGECDH.2 combines the computational efficiency of ECDH protocol and the communication efficiency of GDH.2 protocol. From the performance analysis, it is inferred that the TGECDH.2 outperforms an existing ternary tree based protocol. Hence, it is best suited for the resource constrained mobile devices such as notebooks, laptops, sensors, etc. in cognitive radio mobile ad hoc networks.

Cognitive radio networks need stringent and secure group communication as nodes dynamically access the free portions of radio frequency spectrum to solve the spectrum scarcity in wireless networks. The cognitive radio ad hoc networks can use group key agreement to achieve security in group communication and tree topology to organize the group members in order to reduce the complexity of group operations. This paper proposes a ternary key tree model for tree-based group key agreement in cognitive radio ad hoc networks, and it considers batch rekeying scheme. The range of ids for member, nonmember and pruned nodes in the ternary key tree are analysed in this paper. This paper proposes the analysis of two types of leave operations in the key tree, and the concept of subtree structure is used to analyse the total number of internal nodes that are pruned during leave operations in the key tree through mathematical expressions. This pruned nodes analysis can be used in finding the total number of renewed nodes in the key tree during rekeying process to measure the communication complexity of tree-based group key agreement protocol.Pruned nodes in ternary key tree for cognitive radio ad hoc networks Security Comm. Networks 2015; 8:4289-4307

Part 6: Network SecurityInternational audienceCognitive radio networks have received more research interest in recent years as they can provide a favourable solution to spectrum scarcity problem prevailing in the wireless systems. This paper presents a new key agreement protocol called ‘TKTOFT’ with modified batch rekeying algorithm for distributed group oriented applications in cognitive radio networks by integrating a ternary key tree and an one way function. It is inferred from the experimental results that TKTOFT outperforms the existing one way function based protocol both in terms of computation and communication overhead. Hence, TKTOFT is suited for establishing secure and quick group communication in dynamic groups in cognitive radio networks