32,261 research outputs found
Open-Loop Spatial Multiplexing and Diversity Communications in Ad Hoc Networks
This paper investigates the performance of open-loop multi-antenna
point-to-point links in ad hoc networks with slotted ALOHA medium access
control (MAC). We consider spatial multiplexing transmission with linear
maximum ratio combining and zero forcing receivers, as well as orthogonal space
time block coded transmission. New closed-form expressions are derived for the
outage probability, throughput and transmission capacity. Our results
demonstrate that both the best performing scheme and the optimum number of
transmit antennas depend on different network parameters, such as the node
intensity and the signal-to-interference-and-noise ratio operating value. We
then compare the performance to a network consisting of single-antenna devices
and an idealized fully centrally coordinated MAC. These results show that
multi-antenna schemes with a simple decentralized slotted ALOHA MAC can
outperform even idealized single-antenna networks in various practical
scenarios.Comment: 51 pages, 19 figures, submitted to IEEE Transactions on Information
Theor
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
Spatial Interference Cancelation for Mobile Ad Hoc Networks: Perfect CSI
Interference between nodes directly limits the capacity of mobile ad hoc
networks. This paper focuses on spatial interference cancelation with perfect
channel state information (CSI), and analyzes the corresponding network
capacity. Specifically, by using multiple antennas, zero-forcing beamforming is
applied at each receiver for canceling the strongest interferers. Given spatial
interference cancelation, the network transmission capacity is analyzed in this
paper, which is defined as the maximum transmitting node density under
constraints on outage and the signal-to-interference-noise ratio. Assuming the
Poisson distribution for the locations of network nodes and spatially i.i.d.
Rayleigh fading channels, mathematical tools from stochastic geometry are
applied for deriving scaling laws for transmission capacity. Specifically, for
small target outage probability, transmission capacity is proved to increase
following a power law, where the exponent is the inverse of the size of antenna
array or larger depending on the pass loss exponent. As shown by simulations,
spatial interference cancelation increases transmission capacity by an order of
magnitude or more even if only one extra antenna is added to each node.Comment: 6 pages; submitted to IEEE Globecom 200
Distributed Opportunistic Scheduling for MIMO Ad-Hoc Networks
Distributed opportunistic scheduling (DOS) protocols are proposed for
multiple-input multiple-output (MIMO) ad-hoc networks with contention-based
medium access. The proposed scheduling protocols distinguish themselves from
other existing works by their explicit design for system throughput improvement
through exploiting spatial multiplexing and diversity in a {\em distributed}
manner. As a result, multiple links can be scheduled to simultaneously transmit
over the spatial channels formed by transmit/receiver antennas. Taking into
account the tradeoff between feedback requirements and system throughput, we
propose and compare protocols with different levels of feedback information.
Furthermore, in contrast to the conventional random access protocols that
ignore the physical channel conditions of contending links, the proposed
protocols implement a pure threshold policy derived from optimal stopping
theory, i.e. only links with threshold-exceeding channel conditions are allowed
for data transmission. Simulation results confirm that the proposed protocols
can achieve impressive throughput performance by exploiting spatial
multiplexing and diversity.Comment: Proceedings of the 2008 IEEE International Conference on
Communications, Beijing, May 19-23, 200
Unicast Barrage Relay Networks: Outage Analysis and Optimization
Barrage relays networks (BRNs) are ad hoc networks built on a rapid
cooperative flooding primitive as opposed to the traditional point-to-point
link abstraction. Controlled barrage regions (CBRs) can be used to contain this
flooding primitive for unicast and multicast, thereby enabling spatial reuse.
In this paper, the behavior of individual CBRs is described as a Markov process
that models the potential cooperative relay transmissions. The outage
probability for a CBR is found in closed form for a given topology, and the
probability takes into account fading and co-channel interference (CCI) between
adjacent CBRs. Having adopted this accurate analytical framework, this paper
proceeds to optimize a BRN by finding the optimal size of each CBR, the number
of relays contained within each CBR, the optimal relay locations when they are
constrained to lie on a straight line, and the code rate that maximizes the
transport capacity.Comment: 7 pages, 4 figures, 1 table, in IEEE Military Commun. Conf. (MILCOM),
201
Random Access Transport Capacity
We develop a new metric for quantifying end-to-end throughput in multihop
wireless networks, which we term random access transport capacity, since the
interference model presumes uncoordinated transmissions. The metric quantifies
the average maximum rate of successful end-to-end transmissions, multiplied by
the communication distance, and normalized by the network area. We show that a
simple upper bound on this quantity is computable in closed-form in terms of
key network parameters when the number of retransmissions is not restricted and
the hops are assumed to be equally spaced on a line between the source and
destination. We also derive the optimum number of hops and optimal per hop
success probability and show that our result follows the well-known square root
scaling law while providing exact expressions for the preconstants as well.
Numerical results demonstrate that the upper bound is accurate for the purpose
of determining the optimal hop count and success (or outage) probability.Comment: Submitted to IEEE Trans. on Wireless Communications, Sept. 200
Transmission Capacity of Ad-hoc Networks with Multiple Antennas using Transmit Stream Adaptation and Interference Cancelation
The transmission capacity of an ad-hoc network is the maximum density of
active transmitters per unit area, given an outage constraint at each receiver
for a fixed rate of transmission. Assuming that the transmitter locations are
distributed as a Poisson point process, this paper derives upper and lower
bounds on the transmission capacity of an ad-hoc network when each node is
equipped with multiple antennas. The transmitter either uses eigen multi-mode
beamforming or a subset of its antennas to transmit multiple data streams,
while the receiver uses partial zero forcing to cancel certain interferers
using some of its spatial receive degrees of freedom (SRDOF). The receiver
either cancels the nearest interferers or those interferers that maximize the
post-cancelation signal-to-interference ratio. Using the obtained bounds, the
optimal number of data streams to transmit, and the optimal SRDOF to use for
interference cancelation are derived that provide the best scaling of the
transmission capacity with the number of antennas. With beamforming, single
data stream transmission together with using all but one SRDOF for interference
cancelation is optimal, while without beamforming, single data stream
transmission together with using a fraction of the total SRDOF for interference
cancelation is optimal.Comment: Accepted for publication in IEEE Transactions on Information Theory,
Sept 201
- …