150 research outputs found
Approaching Throughput-optimality in Distributed CSMA Scheduling Algorithms with Collisions
It was shown recently that CSMA (Carrier Sense Multiple Access)-like
distributed algorithms can achieve the maximal throughput in wireless networks
(and task processing networks) under certain assumptions. One important, but
idealized assumption is that the sensing time is negligible, so that there is
no collision. In this paper, we study more practical CSMA-based scheduling
algorithms with collisions. First, we provide a Markov chain model and give an
explicit throughput formula which takes into account the cost of collisions and
overhead. The formula has a simple form since the Markov chain is "almost"
time-reversible. Second, we propose transmission-length control algorithms to
approach throughput optimality in this case. Sufficient conditions are given to
ensure the convergence and stability of the proposed algorithms. Finally, we
characterize the relationship between the CSMA parameters (such as the maximum
packet lengths) and the achievable capacity region.Comment: To appear in IEEE/ACM Transactions on Networking. This is the longer
versio
Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks
Recently, it has been shown that CSMA-type random access algorithms can
achieve the maximum possible throughput in ad hoc wireless networks. However,
these algorithms assume an idealized continuous-time CSMA protocol where
collisions can never occur. In addition, simulation results indicate that the
delay performance of these algorithms can be quite bad. On the other hand,
although some simple heuristics (such as distributed approximations of greedy
maximal scheduling) can yield much better delay performance for a large set of
arrival rates, they may only achieve a fraction of the capacity region in
general. In this paper, we propose a discrete-time version of the CSMA
algorithm. Central to our results is a discrete-time distributed randomized
algorithm which is based on a generalization of the so-called Glauber dynamics
from statistical physics, where multiple links are allowed to update their
states in a single time slot. The algorithm generates collision-free
transmission schedules while explicitly taking collisions into account during
the control phase of the protocol, thus relaxing the perfect CSMA assumption.
More importantly, the algorithm allows us to incorporate mechanisms which lead
to very good delay performance while retaining the throughput-optimality
property. It also resolves the hidden and exposed terminal problems associated
with wireless networks.Comment: 12 page
Approaching Optimal Centralized Scheduling with CSMA-based Random Access over Fading Channels
Carrier Sense Multiple Access (CSMA) based distributed algorithms can attain
the largest capacity region as the centralized Max-Weight policy does. Despite
their capability of achieving throughput-optimality, these algorithms can
either incur large delay and have large complexity or only operate over
non-fading channels. In this letter, by assuming arbitrary back-off time we
first propose a fully distributed randomized algorithm whose performance can be
pushed to the performance of the centralized Max-Weight policy not only in
terms of throughput but also in terms of delay for completely-connected
interference networks with fading channels. Then, inspired by the proposed
algorithm we introduce an implementable distributed algorithm for practical
networks with a reservation scheme. We show that the proposed practical
algorithm can still achieve the performance of the centralized Max-Weight
policy.Comment: accepted to IEEE Communications Letter
Performance of CSMA in Multi-Channel Wireless Networks
We analyze the performance of CSMA in multi-channel wireless networks,
accounting for the random nature of traffic. Specifically, we assess the
ability of CSMA to fully utilize the radio resources and in turn to stabilize
the network in a dynamic setting with flow arrivals and departures. We prove
that CSMA is optimal in ad-hoc mode but not in infrastructure mode, when all
data flows originate from or are destined to some access points, due to the
inherent bias of CSMA against downlink traffic. We propose a slight
modification of CSMA, that we refer to as flow-aware CSMA, which corrects this
bias and makes the algorithm optimal in all cases. The analysis is based on
some time-scale separation assumption which is proved valid in the limit of
large flow sizes
Recommended from our members
SQ-CSMA : universally lowering the delay of queue-based CSMA/CA
textRecent works show that, by incorporating queue length information, CSMA/CA multiple access protocols can achieve maximum throughput in general ad-hoc wireless networks. In all of these protocols, the aggressiveness with which a link attempts to grab the channel is governed solely by its own queue, and is independent of the queues of other interfering links. While this independence allows for minimal control signaling, it results in schedules that change very slowly. This causes starvation and delays - especially at moderate to high loads. In this work we add a very small amount of signaling - an occasional few bits between interfering links. These bits allow us a new functionality: switching - a link can now turn off its interfering links with a certain probability. The challenge is ensuring maximum throughput and lower delay via the use of this new functionality. We develop a new protocol - Switch-enabled Queue-based CSMA (SQ-CSMA) - that uses switching to achieve both of these objectives. This simple additional functionality, and our protocol to leverage it, can be “added on'' to every existing CSMA/CA protocol that uses queue lengths. Interestingly, we see that in every case it has a significant positive impact on delay, universally furthering the performance of existing protocols.Electrical and Computer Engineerin
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
- …