Distributed execution of cognitive relaying with time incentive: multiple PU scenario

Abstract

The prime focus of this study is in developing distributed algorithms for cognitive relaying with time incentive for multiple primary users (CRTI-M). CRTI-M is a symbiotic paradigm in which the incumbent primary users (PUs) of the spectrum, with weak transmission links, seek cooperation from the cognitive secondary user (SU) nodes in their vicinity, and in return reward them with an incentive time for the latter's own communication. When relaying through the SU network, each PU can either use its own spectrum or that of the other PUs. Cross-layer optimization problems are formulated to enable both these possibilities in a multi-hop multi-channel cognitive radio network with the objective of maximizing the cumulative time incentive for the SUs. Corresponding distributed algorithms are developed, which face the challenge of meeting the constraints of the formulated problems with only local information and the lack of a centralized controller. Further, to make the CRTI-M schemes practically realizable, a MAC scheduling protocol is suggested, which gives emphasis to the distributed implementation and provides a unified framework for the PUs and SUs. Simulation results are furnished to demonstrate the effectiveness of the proposed algorithms.

Efficient token circulation strategies against misers in device‐to‐device relay using token‐based incentive mechanisms

“…In bandwidth‐exchanging mechanisms [27, 28], after a UE $$u_j$$ helps relay data for another UE $$u_i$$, $$u_i$$ should give $$u_j$$ a portion of its bandwidth as compensation. Some variations are also proposed, such as exchanging the transmission time [29] or the relay service [30]. Nevertheless, these mechanisms ask $$u_i$$ to compensate $$u_j$$ right after it gets $$u_j$$'s service, even though $$u_j$$ does not require $$u_i$$'s assistance instantly.…”

Intelligent spectrum assignment and migration in cognitive radio network

“…Simulation results show that the algorithm significantly reduces the number of channel switchings, minimizes the delay, and saves the transmission power. Other noticeable works are a family of distributed spectrum sharing schemes [19,20,[30][31][32]. In these schemes, operators announce the availability and quality of their spectrum bands and each SU makes his own decision about his spectrum access strategy.…”