AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (2.2 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Article | Open Access

Weighted De-Synchronization Based Resource Allocation in Wireless Networks

Kimchheang Chhea1Dara Ron1Jung-Ryun Lee1,2( )
School of Electronics and Electrical Engineering (EEE) at Chung-Ang University, Seoul, 156-756, Korea
Department of Intelligent Energy and Industry, Chung-Ang University, Seoul, 156-756, Korea
Show Author Information

Abstract

Considering the exponential growth of wireless devices with data-starving applications fused with artificial intelligence, the significance of wireless network scalability using distributed behavior and fairness among users is a crucial feature in guaranteeing reliable service to numerous users in the network environment. The Kuramoto model is described as nonlinear self-sustained phase oscillators spinning at varying intrinsic frequencies connected through the sine of their phase differences and displays a phase transition at a specific coupling strength, in which a mutual behavior is accomplished. In this work, we apply the Kuramoto model to achieve a weighted fair resource allocation in a wireless network, where each user has different quality of service (QoS) requirements. Because the original Kuramoto model is the synchronization model, we propose a new weighting parameter for representing requirement of each node resource and modify the Kuramoto model to achieve weighted fair resource allocation for users with different QoS requirements. The proposed modified Kuramoto model allocates all users the resource based on their weight among contending nodes in a distributed manner. We analyze the convergence condition for the proposed model, and the results reveal that the proposed algorithm achieves a weighted fair resource allocation and with potentially high convergence speed compared to previous algorithm.

References

【1】
【1】
 
 
Computers, Materials & Continua
Pages 1815-1826

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Chhea K, Ron D, Lee J-R. Weighted De-Synchronization Based Resource Allocation in Wireless Networks. Computers, Materials & Continua, 2023, 75(1): 1815-1826. https://doi.org/10.32604/cmc.2023.032376

128

Views

4

Downloads

3

Crossref

1

Web of Science

3

Scopus

Received: 16 May 2022
Accepted: 15 September 2022
Published: 30 April 2023
© The Author 2024.

This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.