Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2412.02282 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929611901763584 |
|---|---|
| author | Wang, Junyuan Wu, Tianyao Zhou, Ouyang Zhu, Yaping |
| author_facet | Wang, Junyuan Wu, Tianyao Zhou, Ouyang Zhu, Yaping |
| contents | Clustered cell-free networking, which dynamically partitions the whole network into nonoverlapping subnetworks, has been recently proposed to mitigate the cell-edge problem in cellular networks. However, prior works only focused on optimizing clustered cell-free networking in static scenarios with fixed users. This could lead to a large number of handovers in the practical dynamic environment with moving users, seriously hindering the implementation of clustered cell-free networking in practice. This paper considers user mobility and aims to simultaneously maximize the sum rate and minimize the number of handovers. By transforming the multi-objective optimization problem into a time-varying graph partitioning problem and exploring evolutionary spectral clustering, a temporal-smoothed clustered cell-free networking algorithm is proposed, which is shown to be effective in smoothing network partitions over time and reducing handovers while maintaining similar sum rate. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_02282 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Exploring Evolutionary Spectral Clustering for Temporal-Smoothed Clustered Cell-Free Networking Wang, Junyuan Wu, Tianyao Zhou, Ouyang Zhu, Yaping Networking and Internet Architecture Information Theory Signal Processing Clustered cell-free networking, which dynamically partitions the whole network into nonoverlapping subnetworks, has been recently proposed to mitigate the cell-edge problem in cellular networks. However, prior works only focused on optimizing clustered cell-free networking in static scenarios with fixed users. This could lead to a large number of handovers in the practical dynamic environment with moving users, seriously hindering the implementation of clustered cell-free networking in practice. This paper considers user mobility and aims to simultaneously maximize the sum rate and minimize the number of handovers. By transforming the multi-objective optimization problem into a time-varying graph partitioning problem and exploring evolutionary spectral clustering, a temporal-smoothed clustered cell-free networking algorithm is proposed, which is shown to be effective in smoothing network partitions over time and reducing handovers while maintaining similar sum rate. |
| title | Exploring Evolutionary Spectral Clustering for Temporal-Smoothed Clustered Cell-Free Networking |
| topic | Networking and Internet Architecture Information Theory Signal Processing |
| url | https://arxiv.org/abs/2412.02282 |