660 research outputs found
Energy-Optimal Scheduling in Low Duty Cycle Sensor Networks
Energy consumption of a wireless sensor node mainly depends on the amount of
time the node spends in each of the high power active (e.g., transmit, receive)
and low power sleep modes. It has been well established that in order to
prolong node's lifetime the duty-cycle of the node should be low. However, low
power sleep modes usually have low current draw but high energy cost while
switching to the active mode with a higher current draw. In this work, we
investigate a MaxWeightlike opportunistic sleep-active scheduling algorithm
that takes into account time- varying channel and traffic conditions. We show
that our algorithm is energy optimal in the sense that the proposed ESS
algorithm can achieve an energy consumption which is arbitrarily close to the
global minimum solution. Simulation studies are provided to confirm the
theoretical results
Delay Performance of MISO Wireless Communications
Ultra-reliable, low latency communications (URLLC) are currently attracting
significant attention due to the emergence of mission-critical applications and
device-centric communication. URLLC will entail a fundamental paradigm shift
from throughput-oriented system design towards holistic designs for guaranteed
and reliable end-to-end latency. A deep understanding of the delay performance
of wireless networks is essential for efficient URLLC systems. In this paper,
we investigate the network layer performance of multiple-input, single-output
(MISO) systems under statistical delay constraints. We provide closed-form
expressions for MISO diversity-oriented service process and derive
probabilistic delay bounds using tools from stochastic network calculus. In
particular, we analyze transmit beamforming with perfect and imperfect channel
knowledge and compare it with orthogonal space-time codes and antenna
selection. The effect of transmit power, number of antennas, and finite
blocklength channel coding on the delay distribution is also investigated. Our
higher layer performance results reveal key insights of MISO channels and
provide useful guidelines for the design of ultra-reliable communication
systems that can guarantee the stringent URLLC latency requirements.Comment: This work has been submitted to the IEEE for possible publication.
Copyright may be transferred without notice, after which this version may no
longer be accessibl
Rethinking Information Theory for Mobile Ad Hoc Networks
The subject of this paper is the long-standing open problem of developing a
general capacity theory for wireless networks, particularly a theory capable of
describing the fundamental performance limits of mobile ad hoc networks
(MANETs). A MANET is a peer-to-peer network with no pre-existing
infrastructure. MANETs are the most general wireless networks, with single-hop,
relay, interference, mesh, and star networks comprising special cases. The lack
of a MANET capacity theory has stunted the development and commercialization of
many types of wireless networks, including emergency, military, sensor, and
community mesh networks. Information theory, which has been vital for links and
centralized networks, has not been successfully applied to decentralized
wireless networks. Even if this was accomplished, for such a theory to truly
characterize the limits of deployed MANETs it must overcome three key
roadblocks. First, most current capacity results rely on the allowance of
unbounded delay and reliability. Second, spatial and timescale decompositions
have not yet been developed for optimally modeling the spatial and temporal
dynamics of wireless networks. Third, a useful network capacity theory must
integrate rather than ignore the important role of overhead messaging and
feedback. This paper describes some of the shifts in thinking that may be
needed to overcome these roadblocks and develop a more general theory that we
refer to as non-equilibrium information theory.Comment: Submitted to IEEE Communications Magazin
Channel-Aware Random Access in the Presence of Channel Estimation Errors
In this work, we consider the random access of nodes adapting their
transmission probability based on the local channel state information (CSI) in
a decentralized manner, which is called CARA. The CSI is not directly available
to each node but estimated with some errors in our scenario. Thus, the impact
of imperfect CSI on the performance of CARA is our main concern. Specifically,
an exact stability analysis is carried out when a pair of bursty sources are
competing for a common receiver and, thereby, have interdependent services. The
analysis also takes into account the compound effects of the multipacket
reception (MPR) capability at the receiver. The contributions in this paper are
twofold: first, we obtain the exact stability region of CARA in the presence of
channel estimation errors; such an assessment is necessary as the errors in
channel estimation are inevitable in the practical situation. Secondly, we
compare the performance of CARA to that achieved by the class of stationary
scheduling policies that make decisions in a centralized manner based on the
CSI feedback. It is shown that the stability region of CARA is not necessarily
a subset of that of centralized schedulers as the MPR capability improves.Comment: The material in this paper was presented in part at the IEEE
International Symposium on Information Theory, Cambridge, MA, USA, July 201
On Coding for Reliable Communication over Packet Networks
We present a capacity-achieving coding scheme for unicast or multicast over
lossy packet networks. In the scheme, intermediate nodes perform additional
coding yet do not decode nor even wait for a block of packets before sending
out coded packets. Rather, whenever they have a transmission opportunity, they
send out coded packets formed from random linear combinations of previously
received packets. All coding and decoding operations have polynomial
complexity.
We show that the scheme is capacity-achieving as long as packets received on
a link arrive according to a process that has an average rate. Thus, packet
losses on a link may exhibit correlation in time or with losses on other links.
In the special case of Poisson traffic with i.i.d. losses, we give error
exponents that quantify the rate of decay of the probability of error with
coding delay. Our analysis of the scheme shows that it is not only
capacity-achieving, but that the propagation of packets carrying "innovative"
information follows the propagation of jobs through a queueing network, and
therefore fluid flow models yield good approximations. We consider networks
with both lossy point-to-point and broadcast links, allowing us to model both
wireline and wireless packet networks.Comment: 33 pages, 6 figures; revised appendi
Achieving Optimal Throughput and Near-Optimal Asymptotic Delay Performance in Multi-Channel Wireless Networks with Low Complexity: A Practical Greedy Scheduling Policy
In this paper, we focus on the scheduling problem in multi-channel wireless
networks, e.g., the downlink of a single cell in fourth generation (4G)
OFDM-based cellular networks. Our goal is to design practical scheduling
policies that can achieve provably good performance in terms of both throughput
and delay, at a low complexity. While a class of -complexity
hybrid scheduling policies are recently developed to guarantee both
rate-function delay optimality (in the many-channel many-user asymptotic
regime) and throughput optimality (in the general non-asymptotic setting),
their practical complexity is typically high. To address this issue, we develop
a simple greedy policy called Delay-based Server-Side-Greedy (D-SSG) with a
\lower complexity , and rigorously prove that D-SSG not only achieves
throughput optimality, but also guarantees near-optimal asymptotic delay
performance. Specifically, we show that the rate-function attained by D-SSG for
any delay-violation threshold , is no smaller than the maximum achievable
rate-function by any scheduling policy for threshold . Thus, we are able
to achieve a reduction in complexity (from of the hybrid
policies to ) with a minimal drop in the delay performance. More
importantly, in practice, D-SSG generally has a substantially lower complexity
than the hybrid policies that typically have a large constant factor hidden in
the notation. Finally, we conduct numerical simulations to validate
our theoretical results in various scenarios. The simulation results show that
D-SSG not only guarantees a near-optimal rate-function, but also empirically is
virtually indistinguishable from delay-optimal policies.Comment: Accepted for publication by the IEEE/ACM Transactions on Networking,
February 2014. A preliminary version of this work was presented at IEEE
INFOCOM 2013, Turin, Italy, April 201
- …