237 research outputs found
A Survey on Delay-Aware Resource Control for Wireless Systems --- Large Deviation Theory, Stochastic Lyapunov Drift and Distributed Stochastic Learning
In this tutorial paper, a comprehensive survey is given on several major
systematic approaches in dealing with delay-aware control problems, namely the
equivalent rate constraint approach, the Lyapunov stability drift approach and
the approximate Markov Decision Process (MDP) approach using stochastic
learning. These approaches essentially embrace most of the existing literature
regarding delay-aware resource control in wireless systems. They have their
relative pros and cons in terms of performance, complexity and implementation
issues. For each of the approaches, the problem setup, the general solution and
the design methodology are discussed. Applications of these approaches to
delay-aware resource allocation are illustrated with examples in single-hop
wireless networks. Furthermore, recent results regarding delay-aware multi-hop
routing designs in general multi-hop networks are elaborated. Finally, the
delay performance of the various approaches are compared through simulations
using an example of the uplink OFDMA systems.Comment: 58 pages, 8 figures; IEEE Transactions on Information Theory, 201
Minimizing the Age of Information in Wireless Networks with Stochastic Arrivals
We consider a wireless network with a base station serving multiple traffic
streams to different destinations. Packets from each stream arrive to the base
station according to a stochastic process and are enqueued in a separate (per
stream) queue. The queueing discipline controls which packet within each queue
is available for transmission. The base station decides, at every time t, which
stream to serve to the corresponding destination. The goal of scheduling
decisions is to keep the information at the destinations fresh. Information
freshness is captured by the Age of Information (AoI) metric.
In this paper, we derive a lower bound on the AoI performance achievable by
any given network operating under any queueing discipline. Then, we consider
three common queueing disciplines and develop both an Optimal Stationary
Randomized policy and a Max-Weight policy under each discipline. Our approach
allows us to evaluate the combined impact of the stochastic arrivals, queueing
discipline and scheduling policy on AoI. We evaluate the AoI performance both
analytically and using simulations. Numerical results show that the performance
of the Max-Weight policy is close to the analytical lower bound
Queue stability analysis in network coded wireless multicast.
In this dissertation queue stability in wireless multicast networks with packet erasure channels is studied. Our focus is on optimizing packet scheduling so as to maximize throughput. Specifically, new queuing strategies consisting of several sub-queues are introduced, where all newly arrived packets are first stored in the main sub-queue on a first-come-first-served basis. Using the receiver feedback, the transmitter combines packets from different sub-queues for transmission. Our objective is to maximize the input rate under the queue stability constraints. Two packet scheduling and encoding algorithms have been developed. First, the optimization problem is formulated as a linear programming (LP) problem, according to which a network coding based optimal packet scheduling scheme is obtained. Second, the Lyapunov optimization model is adopted and decision variables are defined to derive a network coding based packet scheduling algorithm, which has significantly less complexity and smaller queue backlog compared with the LP solution. Further, an extension of the proposed algorithm is derived to meet the requirements of time-critical data transmission, where each packet expires after a predefined deadline and then dropped from the system. To minimize the average transmission power, we further derive a scheduling policy that simultaneously minimizes both power and queue size, where the transmitter may choose to be idle to save energy consumption. Moreover, a redundancy in the schedules is inadvertently revealed by the algorithm. By detecting and removing the redundancy we further reduce the system complexity. Finally, the simulation results verify the effectiveness of our proposed algorithms over existing works
Energy Harvesting Wireless Communications: A Review of Recent Advances
This article summarizes recent contributions in the broad area of energy
harvesting wireless communications. In particular, we provide the current state
of the art for wireless networks composed of energy harvesting nodes, starting
from the information-theoretic performance limits to transmission scheduling
policies and resource allocation, medium access and networking issues. The
emerging related area of energy transfer for self-sustaining energy harvesting
wireless networks is considered in detail covering both energy cooperation
aspects and simultaneous energy and information transfer. Various potential
models with energy harvesting nodes at different network scales are reviewed as
well as models for energy consumption at the nodes.Comment: To appear in the IEEE Journal of Selected Areas in Communications
(Special Issue: Wireless Communications Powered by Energy Harvesting and
Wireless Energy Transfer
Energy Cost Optimization for Strongly Stable Multi-Hop Green Cellular Networks
Last decade witnessed the explosive growth in mobile devices and their traffic demand, and hence the significant increase in the energy cost of the cellular service providers. One major component of energy expenditure comes from the operation of base stations. How to reduce energy cost of base stations while satisfying users’ soaring demands has become an imperative yet challenging problem. In this dissertation, we investigate the minimization of the long-term time-averaged expected energy cost while guaranteeing network strong stability. Specifically, considering flow routing, link scheduling, and energy constraints, we formulate a time-coupling stochastic Mixed-Integer Non-Linear Programming (MINLP) problem, which is prohibitively expensive to solve. We reformulate the problem by employing Lyapunov optimization theory and develop a decomposition based algorithm which ensures network strong stability. We obtain the bounds on the optimal result of the original problem and demonstrate the tightness of the bounds and the efficacy of the proposed scheme
Joint Data Routing and Power Scheduling for Wireless Powered Communication Networks
In a wireless powered communication network (WPCN), an energy access point
supplies the energy needs of the network nodes through radio frequency wave
transmission, and the nodes store the received energy in their batteries for
their future data transmission. In this paper, we propose an online stochastic
policy that jointly controls energy transmission from the EAP to the nodes and
data transfer among the nodes. For this purpose, we first introduce a novel
perturbed Lyapunov function to address the limitations on the energy
consumption of the nodes imposed by their batteries. Then, using Lyapunov
optimization method, we propose a policy which is adaptive to any arbitrary
channel statistics in the network. Finally, we provide theoretical analysis for
the performance of the proposed policy and show that it stabilizes the network,
and the average power consumption of the network under this policy is within a
bounded gap of the minimum power level required for stabilizing the network
- …