1,632 research outputs found
Analysis of a Cooperative Strategy for a Large Decentralized Wireless Network
This paper investigates the benefits of cooperation and proposes a relay
activation strategy for a large wireless network with multiple transmitters. In
this framework, some nodes cooperate with a nearby node that acts as a relay,
using the decode-and-forward protocol, and others use direct transmission. The
network is modeled as an independently marked Poisson point process and the
source nodes may choose their relays from the set of inactive nodes. Although
cooperation can potentially lead to significant improvements in the performance
of a communication pair, relaying causes additional interference in the
network, increasing the average noise that other nodes see. We investigate how
source nodes should balance cooperation vs. interference to obtain reliable
transmissions, and for this purpose we study and optimize a relay activation
strategy with respect to the outage probability. Surprisingly, in the high
reliability regime, the optimized strategy consists on the activation of all
the relays or none at all, depending on network parameters. We provide a simple
closed-form expression that indicates when the relays should be active, and we
introduce closed form expressions that quantify the performance gains of this
scheme with respect to a network that only uses direct transmission.Comment: Updated version. To appear in IEEE Transactions on Networkin
An Upper Bound on Multi-hop Transmission Capacity with Dynamic Routing Selection
This paper develops upper bounds on the end-to-end transmission capacity of
multi-hop wireless networks. Potential source-destination paths are dynamically
selected from a pool of randomly located relays, from which a closed-form lower
bound on the outage probability is derived in terms of the expected number of
potential paths. This is in turn used to provide an upper bound on the number
of successful transmissions that can occur per unit area, which is known as the
transmission capacity. The upper bound results from assuming independence among
the potential paths, and can be viewed as the maximum diversity case. A useful
aspect of the upper bound is its simple form for an arbitrary-sized network,
which allows insights into how the number of hops and other network parameters
affect spatial throughput in the non-asymptotic regime. The outage probability
analysis is then extended to account for retransmissions with a maximum number
of allowed attempts. In contrast to prevailing wisdom, we show that
predetermined routing (such as nearest-neighbor) is suboptimal, since more hops
are not useful once the network is interference-limited. Our results also make
clear that randomness in the location of relay sets and dynamically varying
channel states is helpful in obtaining higher aggregate throughput, and that
dynamic route selection should be used to exploit path diversity.Comment: 14 pages, 5 figures, accepted to IEEE Transactions on Information
Theory, 201
Downlink SDMA with Limited Feedback in Interference-Limited Wireless Networks
The tremendous capacity gains promised by space division multiple access
(SDMA) depend critically on the accuracy of the transmit channel state
information. In the broadcast channel, even without any network interference,
it is known that such gains collapse due to interstream interference if the
feedback is delayed or low rate. In this paper, we investigate SDMA in the
presence of interference from many other simultaneously active transmitters
distributed randomly over the network. In particular we consider zero-forcing
beamforming in a decentralized (ad hoc) network where each receiver provides
feedback to its respective transmitter. We derive closed-form expressions for
the outage probability, network throughput, transmission capacity, and average
achievable rate and go on to quantify the degradation in network performance
due to residual self-interference as a function of key system parameters. One
particular finding is that as in the classical broadcast channel, the per-user
feedback rate must increase linearly with the number of transmit antennas and
SINR (in dB) for the full multiplexing gains to be preserved with limited
feedback. We derive the throughput-maximizing number of streams, establishing
that single-stream transmission is optimal in most practically relevant
settings. In short, SDMA does not appear to be a prudent design choice for
interference-limited wireless networks.Comment: Submitted to IEEE Transactions on Wireless Communication
Reliable multi-hop routing with cooperative transmissions in energy-constrained networks
We present a novel approach in characterizing the optimal reliable multi-hop virtual multiple-input single-output (vMISO) routing in ad hoc networks. Under a high node density regime, we determine the optimal cardinality of the cooperation
sets at each hop on a path minimizing the total energy cost per transmitted bit. Optimal cooperating set cardinality curves are derived, and they can be used to determine the optimal routing strategy based on the required reliability, transmission power, and path loss coefficient. We design a new greedy geographical
routing algorithm suitable for vMISO transmissions, and demonstrate the applicability of our results for more general networks
Capacity of Cellular Wireless Network
Earlier definitions of capacity for wireless networks, e.g., transport or
transmission capacity, for which exact theoretical results are known, are well
suited for ad hoc networks but are not directly applicable for cellular
wireless networks, where large-scale basestation (BS) coordination is not
possible, and retransmissions/ARQ under the SINR model is a universal feature.
In this paper, cellular wireless networks, where both BS locations and mobile
user (MU) locations are distributed as independent Poisson point processes are
considered, and each MU connects to its nearest BS. With ARQ, under the SINR
model, the effective downlink rate of packet transmission is the reciprocal of
the expected delay (number of retransmissions needed till success), which we
use as our network capacity definition after scaling it with the BS density.
Exact characterization of this natural capacity metric for cellular wireless
networks is derived. The capacity is shown to first increase polynomially with
the BS density in the low BS density regime and then scale inverse
exponentially with the increasing BS density. Two distinct upper bounds are
derived that are relevant for the low and the high BS density regimes. A single
power control strategy is shown to achieve the upper bounds in both the
regimes. This result is fundamentally different from the well known capacity
results for ad hoc networks, such as transport and transmission capacity that
scale as the square root of the (high) BS density. Our results show that the
strong temporal correlations of SINRs with PPP distributed BS locations is
limiting, and the realizable capacity in cellular wireless networks in high-BS
density regime is much smaller than previously thought. A byproduct of our
analysis shows that the capacity of the ALOHA strategy with retransmissions is
zero.Comment: A shorter version to appear in WiOpt 201
The Outage Probability of a Finite Ad Hoc Network in Nakagami Fading
An ad hoc network with a finite spatial extent and number of nodes or mobiles
is analyzed. The mobile locations may be drawn from any spatial distribution,
and interference-avoidance protocols or protection against physical collisions
among the mobiles may be modeled by placing an exclusion zone around each
radio. The channel model accounts for the path loss, Nakagami fading, and
shadowing of each received signal. The Nakagami m-parameter can vary among the
mobiles, taking any positive value for each of the interference signals and any
positive integer value for the desired signal. The analysis is governed by a
new exact expression for the outage probability, defined to be the probability
that the signal-to-interference-and-noise ratio (SINR) drops below a threshold,
and is conditioned on the network geometry and shadowing factors, which have
dynamics over much slower timescales than the fading. By averaging over many
network and shadowing realizations, the average outage probability and
transmission capacity are computed. Using the analysis, many aspects of the
network performance are illuminated. For example, one can determine the
influence of the choice of spreading factors, the effect of the receiver
location within the finite network region, and the impact of both the fading
parameters and the attenuation power laws.Comment: to appear in IEEE Transactions on Communication
- …