Fully distributed optimal channel assignment for open spectrum access

Abstract

In this paper we address the problem of fully distributed assignment of users to sub-bands such that the sum-rate of the system is maximized. We introduce a modified auction algorithm that can be applied in a fully distributed way using an opportunistic CSMA assignment scheme and is $\epsilon$ optimal. We analyze the expected time complexity of the algorithm and suggest a variant to the algorithm that has lower expected complexity. We then show that in the case of i.i.d Rayleigh channels a simple greedy scheme is asymptotically optimal as $\SNR$ increases or as the number of users is increased to infinity. We conclude by providing simulated results of the suggested algorithms.

Cited by in corpus (10)

• Real-time City-scale Ridesharing via Linear Assignment Problems
• Distributed Channel Assignment in Cognitive Radio Networks: Stable Matching and Walrasian Equilibrium
• On the needs for MaaS platforms to handle competition in ridesharing mobility
• Distributed Learning for Channel Allocation Over a Shared Spectrum
• Game of Thrones: Fully Distributed Learning for Multi-Player Bandits
• Asymptotically Optimal Distributed Channel Allocation: a Competitive Game-Theoretic Approach
• Asymptotically Optimal Resource Block Allocation With Limited Feedback
• Medium Access Control protocol for Collaborative Spectrum Learning in Wireless Networks
• Energy Efficiency of Opportunistic Device-to-Device Relaying Under Lognormal Shadowing
• Downlink Resource Allocation in Multiuser Cell-free MIMO Networks with User-centric Clustering