Distributed Learning Algorithms for Spectrum Sharing in Spatial Random Access Wireless Networks
From MaRDI portal
Publication:5352633
Abstract: We consider distributed optimization over orthogonal collision channels in spatial random access networks. Users are spatially distributed and each user is in the interference range of a few other users. Each user is allowed to transmit over a subset of the shared channels with a certain attempt probability. We study both the non-cooperative and cooperative settings. In the former, the goal of each user is to maximize its own rate irrespective of the utilities of other users. In the latter, the goal is to achieve proportionally fair rates among users. Simple distributed learning algorithms are developed to solve these problems. The efficiencies of the proposed algorithms are demonstrated via both theoretical analysis and simulation results.
Cited in
(7)- Distributed stochastic gradient tracking methods
- Distributive Stochastic Learning for Delay-Optimal OFDMA Power and Subband Allocation
- Distributed Stochastic Online Learning Policies for Opportunistic Spectrum Access
- A Learning-Based Two-Stage Spectrum Sharing Strategy With Multiple Primary Transmit Power Levels
- Optimal gradient tracking for decentralized optimization
- An accelerated decentralized stochastic optimization algorithm with inexact model
- Zeroth-order proximal clipped gradient method with shifts for distributed stochastic composite optimization problems with infinite variance
This page was built for publication: Distributed Learning Algorithms for Spectrum Sharing in Spatial Random Access Wireless Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5352633)