Dynamic decentralised algorithms for cognitive radio relay networks with multiple primary and secondary users utilising matching theory

Abstract

We propose a distributed spectrum access algorithm for cognitive radio relay networks with multiple primary users (PUs) and multiple secondary users (SUs). The key idea behind the proposed algorithm is that the PUs negotiate with the SUs on both the amount of monetary compensation, and the amount of time the SUs are either (i) allowed spectrum access, or (ii) cooperatively relaying the PU's data, such that both the PUs' and the SUs' minimum rate requirements are satisfied. The proposed algorithm is shown to be flexible in prioritising either the PUs or the SUs. We prove that the proposed algorithm will result in the best possible stable matching and is weak Pareto optimal. Numerical analysis also reveals that the distributed algorithm can achieve a performance comparable to an optimal centralised solution, but with significantly less overhead and complexity. Copyright © 2013 John Wiley & Sons, Ltd.

BLMA: A Blind Matching Algorithm With Application to Cognitive Radio Networks

“…In this section, we modify the system model slightly to show another application where the utilities of agents on the two sides of the market show opposite trends but are not necessarily quasi-convex 18 . We continue to consider a limited information scenario so that agents can only calculate their utilities but no information is available about the utilities of other users in the network.…”

“…18 The realization suggested in this section naturally include the more stringent case of quasi-convex utilities. 19 We will thereafter continue to assume τ k = 1 w.l.o.g.…”

Distributed Matching Algorithms: Maximizing Secrecy in the Presence of Untrusted Relay

“…CDA was proposed in [21] for maximizing the sum-rate for PU. In our case we modified the algorithm to maximize the secrecy sum-rate while SU benefit in terms of limited duration spectrum access.…”

“…with and without the Source (S) -Destination (D) link. Then a user cooperation based game theoretic matching algorithm is presented based on the Conventional Distributed Algorithm (CDA) of [21] for maximizing the secrecy provided by the CJ. The CJ is then compensated for its service by the provision of the source's spectrum for a limited amount of time.…”

Performance study of a CSMA based multiuser MAC protocol for cognitive radio networks: analysis of channel utilization and opportunity perspective

“…Cognitive radio (CR) can solve this problem of spectrum by exploiting white spaces (spectrum holes) of primary user (PU) network; and assigning it to the secondary users (SUs) [1]. Recently, various overlay medium access control (MAC) layer solutions are provided by many authors for CR networks (CRNs).…”