.png){kind=icon}
.png){kind=icon}
Return
Distributed Energy Efficient Channel Allocation
.png){kind=icon}
OA
AI
DOI：10.1109/TGCN.2019.2934868.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Design of energy efficient protocols for modern wireless systems has become an important area of research. In this paper, we propose a distributed optimization algorithm for the channel assignment problem for multiple interfering transceiver pairs that cannot communicate with each other. We first modify the auction algorithm for maximal energy efficiency and show that the problem can be solved without explicit message passing using the carrier sense multiple access (CSMA) protocol. We then develop a novel scheme by converting the channel assignment problem into perfect matchings on bipartite graphs. The proposed scheme improves the energy efficiency and does not require any explicit message passing or a shared memory between the users. We derive bounds on the convergence rate and show that the proposed algorithm converges faster than the distributed auction algorithm and achieves near-optimal performance under Rayleigh fading channels. We also present an asymptotic performance analysis of the fast matching algorithm for energy efficient resource allocation and prove the optimality for a large enough number of users and number of channels. Finally, we provide numerical assessments that confirm the faster convergence of the proposed algorithm compared to the distributed auction algorithm.
Keywords:
Auction algorithm
bipartite graph
channel assignment
energy efficiency (EE)
linear programming
distributed protocol
multi-access channel
Rayleigh fading channel
wireless networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
6.7
Papers:
1.3K
Citations:
4.3K