Distributed Game theory-based Routing protocol for Cognitive Radio ad hoc networks

Doomari, Soodeh Amiri; Mirjalily, Ghasem; Abouei, Jamshid

doi:10.1109/jcsse.2015.7219796

Cited by 5 publications

(4 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition,

z_l

and

z_r

denote the identical and independent complex Gaussian noises with zero mean and power spectral density

N_{0}/2

, both are independent from

x_m

. The additive white Gaussian noise power in each user band is expressed as

\sigma ^2 = N_{0}/2\times 2W = N_0W

[43]. In the second phase of transmission, DRs use the AF protocol, i.e.…”

Section: System Model and Problem Descriptionmentioning

confidence: 99%

A matching‐based context‐aware relay assignment scheme with power control in ad‐hoc wireless networks

Amini

Abouei

2022

IET Communications

Self Cite

View full text Add to dashboard Cite

In this paper, an emergency ad‐hoc network based on cognitive radio is considered. It is assumed that secondary users (SUs) are moving agents in which some fixed agents namely distributed relays (DRs), forward the data gathered by SUs to destination. The main goal is to maximize the capacity of data gathering in destination with respect to the maximum interference tolerable by primary users (PU), and SU's and DR's power constraints. A mixed‐integer nonlinear model (MINLP) for joint relay assignment and power allocation is shown. Given that MINLP problems are NP‐Hard, a two interdependent solutions are proposed to achieve the relay assignment and power control. A social‐aware dynamic relay assignment algorithm (SADRA) based on many‐to‐one matching is proposed. In this matching, the preference list of DRs is the result of mean opinion scores ranking that two roulette wheel selection and random walk selection techniques are applied to eliminate the same priorities. In the second phase, a greedy adaptive algorithm for non‐convex power allocation problem that converges to the component‐wise minimal power is proposed. It is shown that the SADRA algorithm converges to a two‐sided exchange stable matching. The superior performance of the proposed SADRA algorithm is verified by the simulation results.

show abstract

“…In addition,

z_l

and

z_r

denote the identical and independent complex Gaussian noises with zero mean and power spectral density

N_{0}/2

, both are independent from

x_m

. The additive white Gaussian noise power in each user band is expressed as

\sigma ^2 = N_{0}/2\times 2W = N_0W

[43]. In the second phase of transmission, DRs use the AF protocol, i.e.…”

Section: System Model and Problem Descriptionmentioning

confidence: 99%

A matching‐based context‐aware relay assignment scheme with power control in ad‐hoc wireless networks

Amini

Abouei

2022

IET Communications

Self Cite

View full text Add to dashboard Cite

show abstract

“…RCV helps to reduce the end-to-end delay and decreases the interference from SUs imposed on the PUs. The most important difference between proposed method and [14] is that this work considers the amount of interference between SUs and moreover it focuses on the physical interference model as in [20]. Another advantage of the proposed algorithm compared with [14] is the load balancing technique that leads to decrease the network congestion and also decreases the amount of aggregate interference on the PUs.…”

Section: Contributions and Paper Organizationmentioning

confidence: 99%

“…Similar to [20], we consider two interference models: protocol model and physical model. In protocol model, a transmission from node i to j ∀ i, j ∈ {1, 2, .…”

Section: Interference Modelmentioning

confidence: 99%

Interference Aware Routing Game for Cognitive Radio Ad-hoc Networks

Amiri-Doomari¹,

Mirjalily²,

Abouei³

2018

JTIT

Self Cite

View full text Add to dashboard Cite

Cognitive radio is a new communication paradigm that is able to solve the problem of spectrum scarcity in wireless networks. In this paper, interference aware routing game, (IRG), is proposed that connects the ﬂow initiators to the destinations. A network formation game among secondary users (SUs) is formulated in which each secondary user aims to maximize its utility, while it reduces the aggregate interference on the primary users (PUs) and the end-to-end delay. In order to reduce the end-to-end delay and the accumulated interference, the IRG algorithm selects upstream neighbors in a view point of the sender. To model the interference between SUs, IRG uses the signal-to-interference-plus noise (SINR) model. The eﬀectiveness of the proposed algorithm is validated by evaluating the aggregate interference from SUs to the PUs and end-to-end delay. A comprehensive numerical evaluation is performed, which shows that the performance of the proposed algorithm is signiﬁcantly better than the Interference Aware Routing (IAR) using network formation game in cognitive radio mesh networks.

show abstract

“…In, Yuan et al authors introduce a routing algorithm based on the network formation game to avoid the interference from SUs imposed on PUs in CR mesh networks. This work was further expanded in Doomari et al by introducing the load balancing and the physical interference model between SUs. Kamruzzaman et al proposes a Spectrum and Energy‐aware Routing protocol for mobile CRAHNs, which is based on the dynamic source routing.…”

Section: Related Workmentioning

confidence: 99%

Joint load balanced stable routing and communication segment assignment in mobile cognitive radio ad‐hoc networks

Amiri-Doomari

Mirjalily

Abouei

2018

Int J Communication

Self Cite

View full text Add to dashboard Cite

Summary The fundamental issues in mobile cognitive radio ad‐hoc networks are the selection of the optimal stable paths between nodes and proper assignment of the frequency channels/time slots (communication segments) to the links. In this paper, a joint load balanced stable routing and communication segment assignment algorithm is proposed that considers jointly the mobility prediction, mitigating the co‐channel interference and energy consumption. The novelty of the proposed algorithm lies in the increasing of the path stability, which benefits from the maximum link lifetime parameter and introduced weighting function to keep routes away from the PU's region. This avoids the negative impacts on the PUs' operations and decreases the conflict of the cognitive nodes. In the proposed algorithm, the concept of load balancing is considered that yields in the balancing energy consumption in the network, improving the network performance and distributing traffic loads on all available channels. The effectiveness of the proposed algorithm is verified by evaluating the aggregate interference energy, average end‐to‐end delay, goodput, and the energy usage per packet under 6 scenarios. The results show that the performance of the proposed algorithm is significantly better than the recently proposed joint stable routing and channel assignment protocol.

show abstract

Distributed Game theory-based Routing protocol for Cognitive Radio ad hoc networks

Cited by 5 publications

References 16 publications

A matching‐based context‐aware relay assignment scheme with power control in ad‐hoc wireless networks

A matching‐based context‐aware relay assignment scheme with power control in ad‐hoc wireless networks

Interference Aware Routing Game for Cognitive Radio Ad-hoc Networks

Joint load balanced stable routing and communication segment assignment in mobile cognitive radio ad‐hoc networks

Contact Info

Product

Resources

About