201 research outputs found
Energy Efficient Scheduling for Loss Tolerant IoT Applications with Uninformed Transmitter
In this work we investigate energy efficient packet scheduling problem for
the loss tolerant applications. We consider slow fading channel for a point to
point connection with no channel state information at the transmitter side
(CSIT). In the absence of CSIT, the slow fading channel has an outage
probability associated with every transmit power. As a function of data loss
tolerance parameters and peak power constraints, we formulate an optimization
problem to minimize the average transmit energy for the user equipment (UE).
The optimization problem is not convex and we use stochastic optimization
technique to solve the problem. The numerical results quantify the effect of
different system parameters on average transmit power and show significant
power savings for the loss tolerant applications.Comment: Published in ICC 201
On optimizing power allocation for reliable communication over fading channels with uninformed transmitter
We investigate energy efficient packet scheduling
and power allocation problem for the services which require
reliable communication to guarantee a certain quality of experience
(QoE). We establish links between average transmit power
and reliability of data transfer, which depends on both average
amount of data transfer and short term rate guarantees. We
consider a slow-fading point-to-point channel without channel
state information at the transmitter side (CSIT). In the absence
of CSIT, the slow fading channel has an outage probability
associated with every transmit power. As a function of data
loss tolerance parameters, and minimum rate and peak power
constraints, we formulate an optimization problem that adapts
rate and power to minimize the average transmit power for
the user equipment (UE). Then, a relaxed optimization problem
is formulated where transmission rate is assumed to be fixed
for each packet transmission. We use Markov chain to model
constraints of the optimization problem. The corresponding
problem is not convex for both of the formulated problems, therefore
a stochastic optimization technique, namely the simulated
annealing algorithm, is used to solve them. The numerical results
quantify the effect of various system parameters on average
transmit power and show significant energy savings when the
service has less stringent requirements on timely and reliable
communication
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
Active Queue Management for Fair Resource Allocation in Wireless Networks
This paper investigates the interaction between end-to-end flow control and MAC-layer scheduling on wireless links. We consider a wireless network with multiple users receiving information from a common access point; each user suffers fading, and a scheduler allocates the channel based on channel quality,but subject to fairness and latency considerations. We show that the fairness property of the scheduler is compromised by the transport layer flow control of TCP New Reno. We provide a receiver-side control algorithm, CLAMP, that remedies this situation. CLAMP works at a receiver to control a TCP sender by setting the TCP receiver's advertised window limit, and this allows the scheduler to allocate bandwidth fairly between the users
- …