Performance Analysis of the Spectrum Access Strategies in Cognitive Radio Networks

Kumar, Bhoopendra; Dhurandher, Sanjay Kumar; Obaidat, Mohammad S.

doi:10.1109/cits52676.2021.9618460

Cited by 2 publications

(1 citation statement)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, this system still has a challenge due to its high running cost. Random service allocation was discussed by Souza 46 but resulted in a high service delay due to poor load balancing. Huang 47 proposed an energy‐efficient approach to the idea of co‐locating service placement, which was adequate for a small network but achieved poor service placement in a larger network.…”

Section: Related Workmentioning

confidence: 99%

Reinforcement optimization for decentralized service placement policy in IoT‐centric fog environment

Sulimani

Sajjad

Alghamdi

et al. 2022

Trans Emerging Tel Tech

View full text Add to dashboard Cite

A decentralized service placement policy plays a key role in distributed systems, such as fog computing, where sharing workloads fairly among active computing nodes is critical. A decentralized policy is an inherent feature of the service placement process that may improve load balancing among computers and can reduce the latency in many real‐time Internet of Things (IoT) applications. This article proposes reinforcement optimization for a decentralized service placement policy, which attempts to mitigate some of the drawbacks of existing service placement policies. Matching task size with node specifications and the allocation of less popular but time‐sensitive applications in the fog layer are the primary contributions of this study. Extensive experimental comparisons are made between the proposed algorithm and other well‐known algorithms over service latency, network usage, and computing usage using the iFogSim simulator. A microservice‐based application with varying sizes of computing requests are tested experimentally and show that the proposed algorithm effectively serves computing instances that are closer to users, reducing service latency and network usage. Compared to the existing models, the proposed modified algorithm reduces service latency by 24.1%, network usage by 4%, and computing usage by 20%, thus highlighting positive outcomes when using the proposed algorithm for fog analytics in future real‐time IoT applications.

show abstract

Section: Related Workmentioning

confidence: 99%