3,765 research outputs found
Fair Coexistence of Scheduled and Random Access Wireless Networks: Unlicensed LTE/WiFi
We study the fair coexistence of scheduled and random access transmitters
sharing the same frequency channel. Interest in coexistence is topical due to
the need for emerging unlicensed LTE technologies to coexist fairly with WiFi.
However, this interest is not confined to LTE/WiFi as coexistence is likely to
become increasingly commonplace in IoT networks and beyond 5G. In this article
we show that mixing scheduled and random access incurs and inherent
throughput/delay cost, the cost of heterogeneity. We derive the joint
proportional fair rate allocation, which casts useful light on current LTE/WiFi
discussions. We present experimental results on inter-technology detection and
consider the impact of imperfect carrier sensing.Comment: 14 pages, 8 figures, journa
Fast Mixing of Parallel Glauber Dynamics and Low-Delay CSMA Scheduling
Glauber dynamics is a powerful tool to generate randomized, approximate
solutions to combinatorially difficult problems. It has been used to analyze
and design distributed CSMA (Carrier Sense Multiple Access) scheduling
algorithms for multi-hop wireless networks. In this paper we derive bounds on
the mixing time of a generalization of Glauber dynamics where multiple links
are allowed to update their states in parallel and the fugacity of each link
can be different. The results can be used to prove that the average queue
length (and hence, the delay) under the parallel Glauber dynamics based CSMA
grows polynomially in the number of links for wireless networks with
bounded-degree interference graphs when the arrival rate lies in a fraction of
the capacity region. We also show that in specific network topologies, the
low-delay capacity region can be further improved.Comment: 12 page
Increasing throughput in IEEE 802.11 by optimal selection of backoff parameters
Engineering and Physical Sciences Research Council. Grant Number: EP/G012628/
An Approximate Inner Bound to the QoS Aware Throughput Region of a Tree Network under IEEE 802.15.4 CSMA/CA and Application to Wireless Sensor Network Design
We consider a tree network spanning a set of source nodes that generate
measurement packets, a set of additional relay nodes that only forward packets
from the sources, and a data sink. We assume that the paths from the sources to
the sink have bounded hop count. We assume that the nodes use the IEEE 802.15.4
CSMA/CA for medium access control, and that there are no hidden terminals. In
this setting, starting with a set of simple fixed point equations, we derive
sufficient conditions for the tree network to approximately satisfy certain
given QoS targets such as end-to-end delivery probability and delay under a
given rate of generation of measurement packets at the sources (arrival rates
vector). The structures of our sufficient conditions provide insight on the
dependence of the network performance on the arrival rate vector, and the
topological properties of the network. Furthermore, for the special case of
equal arrival rates, default backoff parameters, and for a range of values of
target QoS, we show that among all path-length-bounded trees (spanning a given
set of sources and BS) that meet the sufficient conditions, a shortest path
tree achieves the maximum throughput
Throughput-Optimal Random Access with Order-Optimal Delay
In this paper, we consider CSMA policies for scheduling of multihop wireless
networks with one-hop traffic. The main contribution of this paper is to
propose Unlocking CSMA (U-CSMA) policy that enables to obtain high throughput
with low (average) packet delay for large wireless networks. In particular, the
delay under U-CSMA policy becomes order-optimal. For one-hop traffic, delay is
defined to be order-optimal if it is O(1), i.e., it stays bounded, as the
network-size increases to infinity. Using mean field theory techniques, we
analytically show that for torus (grid-like) interference topologies with
one-hop traffic, to achieve a network load of , the delay under U-CSMA
policy becomes as the network-size increases, and hence,
delay becomes order optimal. We conduct simulations for general random
geometric interference topologies under U-CSMA policy combined with congestion
control to maximize a network-wide utility. These simulations confirm that
order optimality holds, and that we can use U-CSMA policy jointly with
congestion control to operate close to the optimal utility with a low packet
delay in arbitrarily large random geometric topologies. To the best of our
knowledge, it is for the first time that a simple distributed scheduling policy
is proposed that in addition to throughput/utility-optimality exhibits delay
order-optimality.Comment: 44 page
- ā¦