A novel coalition game theory based resource allocation and selfish attack avoidance in cognitive radio ad-hoc networks

Cognitive radio (CR) is an intelligent radio, which is target to exploit the utmost available spectrum holes for unlicensed users by sensing the environment. The arrival of advanced wireless communication device leads to demand in the spectrum and the need to improve utilization of vacant spectrum. In the past decade the spectrum sensing and allocation has been the main focus of research than security in cognitive radio. A selfish cognitive radio node is a serious security issue which occupies a part or full resources (pre-occupation problem) in the multiple channel, and forbids other legitimate cognitive nodes from consuming the resources. This self-centered cognitive radio can critically degrade the performance of the network; so a skillful resource allocation strategy should adopted in order to avoid these selfish attacks in the network. The conventional resource allocation approaches in cognitive network are fully dependent. In this scheme, a coalition game theory used to avoid these selfish attacks with multiple PU's and multiple SU's. The proposed approaches consist of multiple PU's and SU's gathered on a set, in which PU allows the other SU's to make use of its resources in contract or agreement on a timely basis. The PU makes decision to select the optimal SU based on their channel status and the SU act as a relay to PU and help the PU in their transmission of data. This scheme adopts efficient resource allocation in a multichannel cooperative manner due to emerging of many cooperative communication devices. This proposed system follows the core concept and also support shapley value to equally distribute the payoff throughout the users in the network. By this resource allocation approach, the selfish attacks can be prevented in the system and thereby increase the resource utilization efficiency in the network