1,991 research outputs found
Throughput Scaling of Wireless Networks With Random Connections
This work studies the throughput scaling laws of ad hoc wireless networks in
the limit of a large number of nodes. A random connections model is assumed in
which the channel connections between the nodes are drawn independently from a
common distribution. Transmitting nodes are subject to an on-off strategy, and
receiving nodes employ conventional single-user decoding. The following results
are proven:
1) For a class of connection models with finite mean and variance, the
throughput scaling is upper-bounded by for single-hop schemes, and
for two-hop (and multihop) schemes.
2) The throughput scaling is achievable for a specific
connection model by a two-hop opportunistic relaying scheme, which employs
full, but only local channel state information (CSI) at the receivers, and
partial CSI at the transmitters.
3) By relaxing the constraints of finite mean and variance of the connection
model, linear throughput scaling is achievable with Pareto-type
fading models.Comment: 13 pages, 4 figures, To appear in IEEE Transactions on Information
Theor
End-to-End Joint Antenna Selection Strategy and Distributed Compress and Forward Strategy for Relay Channels
Multi-hop relay channels use multiple relay stages, each with multiple relay
nodes, to facilitate communication between a source and destination.
Previously, distributed space-time codes were proposed to maximize the
achievable diversity-multiplexing tradeoff, however, they fail to achieve all
the points of the optimal diversity-multiplexing tradeoff. In the presence of a
low-rate feedback link from the destination to each relay stage and the source,
this paper proposes an end-to-end antenna selection (EEAS) strategy as an
alternative to distributed space-time codes. The EEAS strategy uses a subset of
antennas of each relay stage for transmission of the source signal to the
destination with amplify and forwarding at each relay stage. The subsets are
chosen such that they maximize the end-to-end mutual information at the
destination. The EEAS strategy achieves the corner points of the optimal
diversity-multiplexing tradeoff (corresponding to maximum diversity gain and
maximum multiplexing gain) and achieves better diversity gain at intermediate
values of multiplexing gain, versus the best known distributed space-time
coding strategies. A distributed compress and forward (CF) strategy is also
proposed to achieve all points of the optimal diversity-multiplexing tradeoff
for a two-hop relay channel with multiple relay nodes.Comment: Accepted for publication in the special issue on cooperative
communication in the Eurasip Journal on Wireless Communication and Networkin
Opportunistic Relay Selection with Limited Feedback
It has been shown that a decentralized relay selection protocol based on
opportunistic feedback from the relays yields good throughput performance in
dense wireless networks. This selection strategy supports a hybrid-ARQ
transmission approach where relays forward parity information to the
destination in the event of a decoding error. Such an approach, however,
suffers a loss compared to centralized strategies that select relays with the
best channel gain to the destination. This paper closes the performance gap by
adding another level of channel feedback to the decentralized relay selection
problem. It is demonstrated that only one additional bit of feedback is
necessary for good throughput performance. The performance impact of varying
key parameters such as the number of relays and the channel feedback threshold
is discussed. An accompanying bit error rate analysis demonstrates the
importance of relay selection.Comment: 5 pages, 6 figures, to appear in Proceedings of 2007 IEEE Vehicular
Technology Conference-Spring in Dublin, Irelan
- …