141,808 research outputs found
Wireless Scheduling with Power Control
We consider the scheduling of arbitrary wireless links in the physical model
of interference to minimize the time for satisfying all requests. We study here
the combined problem of scheduling and power control, where we seek both an
assignment of power settings and a partition of the links so that each set
satisfies the signal-to-interference-plus-noise (SINR) constraints.
We give an algorithm that attains an approximation ratio of , where is the number of links and is the ratio
between the longest and the shortest link length. Under the natural assumption
that lengths are represented in binary, this gives the first approximation
ratio that is polylogarithmic in the size of the input. The algorithm has the
desirable property of using an oblivious power assignment, where the power
assigned to a sender depends only on the length of the link. We give evidence
that this dependence on is unavoidable, showing that any
reasonably-behaving oblivious power assignment results in a -approximation.
These results hold also for the (weighted) capacity problem of finding a
maximum (weighted) subset of links that can be scheduled in a single time slot.
In addition, we obtain improved approximation for a bidirectional variant of
the scheduling problem, give partial answers to questions about the utility of
graphs for modeling physical interference, and generalize the setting from the
standard 2-dimensional Euclidean plane to doubling metrics. Finally, we explore
the utility of graph models in capturing wireless interference.Comment: Revised full versio
Beyond Geometry : Towards Fully Realistic Wireless Models
Signal-strength models of wireless communications capture the gradual fading
of signals and the additivity of interference. As such, they are closer to
reality than other models. However, nearly all theoretic work in the SINR model
depends on the assumption of smooth geometric decay, one that is true in free
space but is far off in actual environments. The challenge is to model
realistic environments, including walls, obstacles, reflections and anisotropic
antennas, without making the models algorithmically impractical or analytically
intractable.
We present a simple solution that allows the modeling of arbitrary static
situations by moving from geometry to arbitrary decay spaces. The complexity of
a setting is captured by a metricity parameter Z that indicates how far the
decay space is from satisfying the triangular inequality. All results that hold
in the SINR model in general metrics carry over to decay spaces, with the
resulting time complexity and approximation depending on Z in the same way that
the original results depends on the path loss term alpha. For distributed
algorithms, that to date have appeared to necessarily depend on the planarity,
we indicate how they can be adapted to arbitrary decay spaces.
Finally, we explore the dependence on Z in the approximability of core
problems. In particular, we observe that the capacity maximization problem has
exponential upper and lower bounds in terms of Z in general decay spaces. In
Euclidean metrics and related growth-bounded decay spaces, the performance
depends on the exact metricity definition, with a polynomial upper bound in
terms of Z, but an exponential lower bound in terms of a variant parameter phi.
On the plane, the upper bound result actually yields the first approximation of
a capacity-type SINR problem that is subexponential in alpha
Beam-searching and Transmission Scheduling in Millimeter Wave Communications
Millimeter wave (mmW) wireless networks are capable to support multi-gigabit
data rates, by using directional communications with narrow beams. However,
existing mmW communications standards are hindered by two problems: deafness
and single link scheduling. The deafness problem, that is, a misalignment
between transmitter and receiver beams, demands a time consuming beam-searching
operation, which leads to an alignment-throughput tradeoff. Moreover, the
existing mmW standards schedule a single link in each time slot and hence do
not fully exploit the potential of mmW communications, where directional
communications allow multiple concurrent transmissions. These two problems are
addressed in this paper, where a joint beamwidth selection and power allocation
problem is formulated by an optimization problem for short range mmW networks
with the objective of maximizing effective network throughput. This
optimization problem allows establishing the fundamental alignment-throughput
tradeoff, however it is computationally complex and requires exact knowledge of
network topology, which may not be available in practice. Therefore, two
standard-compliant approximation solution algorithms are developed, which rely
on underestimation and overestimation of interference. The first one exploits
directionality to maximize the reuse of available spectrum and thereby
increases the network throughput, while imposing almost no computational
complexity. The second one is a more conservative approach that protects all
active links from harmful interference, yet enhances the network throughput by
100% compared to the existing standards. Extensive performance analysis
provides useful insights on the directionality level and the number of
concurrent transmissions that should be pursued. Interestingly, extremely
narrow beams are in general not optimal.Comment: 5 figures, 7 pages, accepted in ICC 201
Wireless Network Stability in the SINR Model
We study the stability of wireless networks under stochastic arrival
processes of packets, and design efficient, distributed algorithms that achieve
stability in the SINR (Signal to Interference and Noise Ratio) interference
model.
Specifically, we make the following contributions. We give a distributed
algorithm that achieves -efficiency on all networks
(where is the number of links in the network), for all length monotone,
sub-linear power assignments. For the power control version of the problem, we
give a distributed algorithm with -efficiency (where is the length diversity of the link set).Comment: 10 pages, appeared in SIROCCO'1
- …