816 research outputs found
A New Phase Transition for Local Delays in MANETs
We consider Mobile Ad-hoc Network (MANET) with transmitters located according
to a Poisson point in the Euclidean plane, slotted Aloha Medium Access (MAC)
protocol and the so-called outage scenario, where a successful transmission
requires a Signal-to-Interference-and-Noise (SINR) larger than some threshold.
We analyze the local delays in such a network, namely the number of times slots
required for nodes to transmit a packet to their prescribed next-hop receivers.
The analysis depends very much on the receiver scenario and on the variability
of the fading. In most cases, each node has finite-mean geometric random delay
and thus a positive next hop throughput. However, the spatial (or large
population) averaging of these individual finite mean-delays leads to infinite
values in several practical cases, including the Rayleigh fading and positive
thermal noise case. In some cases it exhibits an interesting phase transition
phenomenon where the spatial average is finite when certain model parameters
are below a threshold and infinite above. We call this phenomenon, contention
phase transition. We argue that the spatial average of the mean local delays is
infinite primarily because of the outage logic, where one transmits full
packets at time slots when the receiver is covered at the required SINR and
where one wastes all the other time slots. This results in the "RESTART"
mechanism, which in turn explains why we have infinite spatial average.
Adaptive coding offers a nice way of breaking the outage/RESTART logic. We show
examples where the average delays are finite in the adaptive coding case,
whereas they are infinite in the outage case.Comment: accepted for IEEE Infocom 201
Outage and Local Throughput and Capacity of Random Wireless Networks
Outage probabilities and single-hop throughput are two important performance
metrics that have been evaluated for certain specific types of wireless
networks. However, there is a lack of comprehensive results for larger classes
of networks, and there is no systematic approach that permits the convenient
comparison of the performance of networks with different geometries and levels
of randomness.
The uncertainty cube is introduced to categorize the uncertainty present in a
network. The three axes of the cube represent the three main potential sources
of uncertainty in interference-limited networks: the node distribution, the
channel gains (fading), and the channel access (set of transmitting nodes). For
the performance analysis, a new parameter, the so-called {\em spatial
contention}, is defined. It measures the slope of the outage probability in an
ALOHA network as a function of the transmit probability at . Outage is
defined as the event that the signal-to-interference ratio (SIR) is below a
certain threshold in a given time slot. It is shown that the spatial contention
is sufficient to characterize outage and throughput in large classes of
wireless networks, corresponding to different positions on the uncertainty
cube. Existing results are placed in this framework, and new ones are derived.
Further, interpreting the outage probability as the SIR distribution, the
ergodic capacity of unit-distance links is determined and compared to the
throughput achievable for fixed (yet optimized) transmission rates.Comment: 22 pages, 6 figures. Submitted to IEEE Trans. Wireles
Achieving Non-Zero Information Velocity in Wireless Networks
In wireless networks, where each node transmits independently of other nodes
in the network (the ALOHA protocol), the expected delay experienced by a packet
until it is successfully received at any other node is known to be infinite for
signal-to-interference-plus-noise-ratio (SINR) model with node locations
distributed according to a Poisson point process. Consequently, the information
velocity, defined as the limit of the ratio of the distance to the destination
and the time taken for a packet to successfully reach the destination over
multiple hops, is zero, as the distance tends to infinity. A nearest neighbor
distance based power control policy is proposed to show that the expected delay
required for a packet to be successfully received at the nearest neighbor can
be made finite. Moreover, the information velocity is also shown to be non-zero
with the proposed power control policy. The condition under which these results
hold does not depend on the intensity of the underlying Poisson point process.Comment: to appear in Annals of Applied Probabilit
Millimeter Wave Ad Hoc Networks: Noise-limited or Interference-limited?
In millimeter wave (mmWave) communication systems, narrow beam operations
overcome severe channel attenuations, reduce multiuser interference, and thus
introduce the new concept of noise-limited mmWave wireless networks. The regime
of the network, whether noise-limited or interference-limited, heavily reflects
on the medium access control (MAC) layer throughput and on proper resource
allocation and interference management strategies. Yet, alternating presence of
these regimes and, more importantly, their dependence on the mmWave design
parameters are ignored in the current approaches to mmWave MAC layer design,
with the potential disastrous consequences on the throughput/delay performance.
In this paper, tractable closed-form expressions for collision probability and
MAC layer throughput of mmWave networks, operating under slotted ALOHA and
TDMA, are derived. The new analysis reveals that mmWave networks may exhibit a
non-negligible transitional behavior from a noise-limited regime to an
interference-limited regime, depending on the density of the transmitters,
density and size of obstacles, transmission probability, beamwidth, and
transmit power. It is concluded that a new framework of adaptive hybrid
resource allocation procedure, containing a proactive contention-based phase
followed by a reactive contention-free one with dynamic phase durations, is
necessary to cope with such transitional behavior.Comment: accepted in IEEE GLOBECOM'1
Optimal Paths on the Space-Time SINR Random Graph
We analyze a class of Signal-to-Interference-and-Noise-Ratio (SINR) random
graphs. These random graphs arise in the modeling packet transmissions in
wireless networks. In contrast to previous studies on the SINR graphs, we
consider both a space and a time dimension. The spatial aspect originates from
the random locations of the network nodes in the Euclidean plane. The time
aspect stems from the random transmission policy followed by each network node
and from the time variations of the wireless channel characteristics. The
combination of these random space and time aspects leads to fluctuations of the
SINR experienced by the wireless channels, which in turn determine the
progression of packets in space and time in such a network. This paper studies
optimal paths in such wireless networks in terms of first passage percolation
on this random graph. We establish both "positive" and "negative" results on
the associated time constant. The latter determines the asymptotics of the
minimum delay required by a packet to progress from a source node to a
destination node when the Euclidean distance between the two tends to infinity.
The main negative result states that this time constant is infinite on the
random graph associated with a Poisson point process under natural assumptions
on the wireless channels. The main positive result states that when adding a
periodic node infrastructure of arbitrarily small intensity to the Poisson
point process, the time constant is positive and finite
- …