2,054 research outputs found
Distributive Stochastic Learning for Delay-Optimal OFDMA Power and Subband Allocation
In this paper, we consider the distributive queue-aware power and subband
allocation design for a delay-optimal OFDMA uplink system with one base
station, users and independent subbands. Each mobile has an uplink
queue with heterogeneous packet arrivals and delay requirements. We model the
problem as an infinite horizon average reward Markov Decision Problem (MDP)
where the control actions are functions of the instantaneous Channel State
Information (CSI) as well as the joint Queue State Information (QSI). To
address the distributive requirement and the issue of exponential memory
requirement and computational complexity, we approximate the subband allocation
Q-factor by the sum of the per-user subband allocation Q-factor and derive a
distributive online stochastic learning algorithm to estimate the per-user
Q-factor and the Lagrange multipliers (LM) simultaneously and determine the
control actions using an auction mechanism. We show that under the proposed
auction mechanism, the distributive online learning converges almost surely
(with probability 1). For illustration, we apply the proposed distributive
stochastic learning framework to an application example with exponential packet
size distribution. We show that the delay-optimal power control has the {\em
multi-level water-filling} structure where the CSI determines the instantaneous
power allocation and the QSI determines the water-level. The proposed algorithm
has linear signaling overhead and computational complexity ,
which is desirable from an implementation perspective.Comment: To appear in Transactions on Signal Processin
Decentralized Massive MIMO Processing Exploring Daisy-chain Architecture and Recursive Algorithms
Algorithms for Massive MIMO uplink detection and downlink precoding typically
rely on a centralized approach, by which baseband data from all antenna modules
are routed to a central node in order to be processed. In the case of Massive
MIMO, where hundreds or thousands of antennas are expected in the base-station,
said routing becomes a bottleneck since interconnection throughput is limited.
This paper presents a fully decentralized architecture and an algorithm for
Massive MIMO uplink detection and downlink precoding based on the Stochastic
Gradient Descent (SGD) method, which does not require a central node for these
tasks. Through a recursive approach and very low complexity operations, the
proposed algorithm provides a good trade-off between performance,
interconnection throughput and latency. Further, our proposed solution achieves
significantly lower interconnection data-rate than other architectures,
enabling future scalability.Comment: Manuscript accepted for publication in IEEE Transactions on Signal
Processin
Distributed Learning Policies for Power Allocation in Multiple Access Channels
We analyze the problem of distributed power allocation for orthogonal
multiple access channels by considering a continuous non-cooperative game whose
strategy space represents the users' distribution of transmission power over
the network's channels. When the channels are static, we find that this game
admits an exact potential function and this allows us to show that it has a
unique equilibrium almost surely. Furthermore, using the game's potential
property, we derive a modified version of the replicator dynamics of
evolutionary game theory which applies to this continuous game, and we show
that if the network's users employ a distributed learning scheme based on these
dynamics, then they converge to equilibrium exponentially quickly. On the other
hand, a major challenge occurs if the channels do not remain static but
fluctuate stochastically over time, following a stationary ergodic process. In
that case, the associated ergodic game still admits a unique equilibrium, but
the learning analysis becomes much more complicated because the replicator
dynamics are no longer deterministic. Nonetheless, by employing results from
the theory of stochastic approximation, we show that users still converge to
the game's unique equilibrium.
Our analysis hinges on a game-theoretical result which is of independent
interest: in finite player games which admit a (possibly nonlinear) convex
potential function, the replicator dynamics (suitably modified to account for
nonlinear payoffs) converge to an eps-neighborhood of an equilibrium at time of
order O(log(1/eps)).Comment: 11 pages, 8 figures. Revised manuscript structure and added more
material and figures for the case of stochastically fluctuating channels.
This version will appear in the IEEE Journal on Selected Areas in
Communication, Special Issue on Game Theory in Wireless Communication
Wireless Communications in the Era of Big Data
The rapidly growing wave of wireless data service is pushing against the
boundary of our communication network's processing power. The pervasive and
exponentially increasing data traffic present imminent challenges to all the
aspects of the wireless system design, such as spectrum efficiency, computing
capabilities and fronthaul/backhaul link capacity. In this article, we discuss
the challenges and opportunities in the design of scalable wireless systems to
embrace such a "bigdata" era. On one hand, we review the state-of-the-art
networking architectures and signal processing techniques adaptable for
managing the bigdata traffic in wireless networks. On the other hand, instead
of viewing mobile bigdata as a unwanted burden, we introduce methods to
capitalize from the vast data traffic, for building a bigdata-aware wireless
network with better wireless service quality and new mobile applications. We
highlight several promising future research directions for wireless
communications in the mobile bigdata era.Comment: This article is accepted and to appear in IEEE Communications
Magazin
Energy-Efficient Power Control: A Look at 5G Wireless Technologies
This work develops power control algorithms for energy efficiency (EE)
maximization (measured in bit/Joule) in wireless networks. Unlike previous
related works, minimum-rate constraints are imposed and the
signal-to-interference-plus-noise ratio takes a more general expression, which
allows one to encompass some of the most promising 5G candidate technologies.
Both network-centric and user-centric EE maximizations are considered. In the
network-centric scenario, the maximization of the global EE and the minimum EE
of the network are performed. Unlike previous contributions, we develop
centralized algorithms that are guaranteed to converge, with affordable
computational complexity, to a Karush-Kuhn-Tucker point of the considered
non-convex optimization problems. Moreover, closed-form feasibility conditions
are derived. In the user-centric scenario, game theory is used to study the
equilibria of the network and to derive convergent power control algorithms,
which can be implemented in a fully decentralized fashion. Both scenarios above
are studied under the assumption that single or multiple resource blocks are
employed for data transmission. Numerical results assess the performance of the
proposed solutions, analyzing the impact of minimum-rate constraints, and
comparing the network-centric and user-centric approaches.Comment: Accepted for Publication in the IEEE Transactions on Signal
Processin
- …