Abstract
SummaryCognitive Radio Ad Hoc Networks (CRAHNs) are an essential method for resolving conflicts between extreme spectrum scarcity and rapid traffic increase while maintaining high‐quality service for consumers. However, the coexistence of primary and secondary users represents a critical challenge for reasonable resource allocation in order to provide a sustaining system performance. Many approaches have been developed to efficiently allocate resources; however, these methods are currently limited by things like user collision, strange traffic networks, and high data transmission error rates. To address these constraints, this paper proposes a policy‐configured reinforcement learning‐based ad hoc network (AHN) model. To obtain the ideal policy configuration for the network, the system first models the cognitive radio (CR) network, in which nodes are initialised and grouped employing the Link Reliability K‐Means clustering Algorithm (LR‐KMA). The available spectrum was then detected and separated into multiple bands utilizing coherent‐based detection (CBD) and signal source identification employing the Parzen–Rosenblatt Window‐based Restricted Boltzmann Machine (PRW‐RBM). Next, the learning model for the resource allocation process employs the Weibull Distribution‐based Blue Monkey Optimization (WD‐BMO) approach to pick the relevant bands. Finally, the experimental results were analyzed in order to evaluate the proposed resource allocation model's performance in CRAHNs. When compared with previous findings, the proposed method improves resource utilization by 5%, the proposed model achieves a 7% higher throughput, and the PRW‐RBM's accuracy improves classification accuracy by 1.07%.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.