Channel selection for simultaneous move game in cognitive radio ad hoc networks

Minhas, Qurratul-Ain; Mahmood, Hasan; Malik, Hafiz

doi:10.1007/s11276-015-0952-x

Cited by 6 publications

(4 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To understand the dynamics of opportunistic spectrum access, they proposed a cognitive radio graph model (CRGM) that considers the impact of the number of channels and the number of neighbors of SU and the PU's activities on connectivity. Minhas et al 16 have proposed a potential game-theoretic model for channel allocation in cognitive radio ad hoc network. Liang et al have addressed the connectivity in CRNs.…”

Section: Related Workmentioning

confidence: 99%

“…Although the advanced algorithm performs better, but it involves the finding of maximal graph matching, this worsens the performance in highly dynamic spectrum environment and causes frequent channel switching. Minhas et al 16 have proposed a potential game-theoretic model for channel allocation in cognitive radio ad hoc network. They have also used learning technique to achieve stable solution for channel allocation.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

κ‐channel connectivity in cognitive radio networks for bounded tree‐width graphs

Yadav

Misra

2017

Int J Communication

View full text Add to dashboard Cite

Channel connectivity problem in cognitive radio network (CCP in CRN) is to find a channel assignment for secondary users (SUs) such that underlying graph induced by SUs (potential graph) is connected. Channel connectivity problem in CRNs has been proved to be NP-complete for general graph and remains NP-complete even if the underlying potential graph is the tree. Fixed parameter tractability of CCP in CRN has been of research interest because of its practicability. In this work, we have proposed novel problem of fixed parameter tractability for -CCP of CRN ( -CCP in CRN), ie, whether a given CRN remains connected when any of −1 channels are reclaimed by primary users, called -CCP. This is very crucial to check and design an effective channel assignment algorithm that provides connectivity to SUs on channels reclamation by primary users. To our knowledge, fixed parameter tractability of -CCP in CRNs has not been studied and becoming useful because of development of 5G if the underlying potential graph has bounded tree-width and number of channels is parameterized. We address -CCP in CRN and propose an O( ) O( ) n O(1) time algorithm if the underlying potential graph is bounded by tree-width and generates a feasible channel assignment under which given CRN is -channel connected, where is the number of channels and n is the number of SUs in CRN. We show that the -CCP is fixed parameter tractable, when underlying potential graph has bounded tree-width and number of channels is parameterized. To count the different possible potential solution of -CCP, we propose a polynomial time algorithm for the corresponding enumeration problem (the number of different feasible channel assignments) Enum--CCP on the potential graph with bounded tree-width when the number of channels is bounded by a constant. Through simulation, we have observed that the feasibility of -CCP highly depends on the available channels at each SU and number of radio present at each SU.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

κ‐channel connectivity in cognitive radio networks for bounded tree‐width graphs

Yadav

Misra

2017

Int J Communication

View full text Add to dashboard Cite

show abstract

“…The better is the utility function the better is the proposed algorithm [13]. From the available literature [14]- [20], it has been observed that most of the researchers have considered (i) bit error rate (BER) (ii) signal-to-interference-plus-noise ratio (SINR), (iii) energy consumption (iv) throughput, and (v) quality of service network metrics to formulate the utility function.…”

Section: Introductionmentioning

confidence: 99%

Design of utility functions for game-based channel allocation in cognitive radio wireless sensor network

Rai¹,

Ghose

Sarma³

2021

IJEECS

View full text Add to dashboard Cite

Cognitive radio enabled wireless sensor network is capable of reducing the spectrum scarcity problem of the wireless networks. Looking at the scarcity of available bandwidth, and the high growth in the number of communication devices in recent times, cognitive radio technology has proven to be a promising technology for the days to come. The application of Game Theory in cognitive radio networks has been visible in recent research works. However, only limited literature is available in which possibilities of applying the game-theory based approaches for the challenging task of channel assignment in cognitive radio wireless sensor are available in the literature. It is understood that the crux of the solution to the problem of scheming games for allocation of the channel is centered on the selection of the utility function in order to increase the efficiency of the channel allocation algorithm. Accordingly, the study regarding the influence of several utility functions on the performance of the corresponding channel allocation algorithm is important. Such a study enables designers to arrive at the optimal utility function to be used in game-theory based channel allocation algorithms, and the same is explored to the best extent, in this paper. The detailed procedure of allocating channels to all the contending nodes through game-based channel allocation has been discussed in this paper. Moreover, the performance of six different utility functions proposed which can be used for channel allocation using game theory has been evaluated for respective performances through MATLAB-based simulations.

show abstract

“…A popular class of distributed CRNs are the ones based on game-theoretic models [26][27][28][29][30]. In such models, each cognitive BS acts as a player in a game and hence follows a strategy proper to that game to decide independently on channel assignment.…”

Section: Introductionmentioning

confidence: 99%

Sensing Device Management for History‐Based Spectrum Sharing in Cognitive Radio Networks

Hawa

Jubair

Al‐Zubi

et al. 2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

A novel approach to managing a fully distributed cognitive radio network (CRN) is presented. This approach builds on the concept of history-based spectrum access, in which cognitive base stations (BSs) independently estimate the system load using history records and adaptively swap their occupied spectrum bands to ensure allocation fairness and high overall throughput. In addition, cognitive BSs monitor primary user (PU) behavior in order to avoid interfering with active PUs. In this work, we address two issues that afflict history-based access: the first is the high cost of the sensing devices needed at each cognitive BS to be able to independently draw conclusions about the status of the CRN and the second is the unreliability inherent in practical sensing hardware (such as energy detectors). Simulation results show that the proposed technique manages to solve the two abovementioned issues without any noticeable drop in performance and without sacrificing the distributed nature of the protocol.

show abstract

Channel selection for simultaneous move game in cognitive radio ad hoc networks

Cited by 6 publications

References 14 publications

κ‐channel connectivity in cognitive radio networks for bounded tree‐width graphs

κ‐channel connectivity in cognitive radio networks for bounded tree‐width graphs

Design of utility functions for game-based channel allocation in cognitive radio wireless sensor network

Sensing Device Management for History‐Based Spectrum Sharing in Cognitive Radio Networks

Contact Info

Product

Resources

About