1,689 research outputs found
Full-Duplex MIMO Small-Cell Networks: Performance Analysis
Full-duplex small-cell relays with multiple antennas constitute a core
element of the envisioned 5G network architecture. In this paper, we use
stochastic geometry to analyze the performance of wireless networks with
full-duplex multiple-antenna small cells, with particular emphasis on the
probability of successful transmission. To achieve this goal, we additionally
characterize the distribution of the self-interference power of the full-duplex
nodes. The proposed framework reveals useful insights on the benefits of
full-duplex with respect to half-duplex in terms of network throughput
Opportunistic Relaying in Wireless Networks
Relay networks having source-to-destination pairs and half-duplex
relays, all operating in the same frequency band in the presence of block
fading, are analyzed. This setup has attracted significant attention and
several relaying protocols have been reported in the literature. However, most
of the proposed solutions require either centrally coordinated scheduling or
detailed channel state information (CSI) at the transmitter side. Here, an
opportunistic relaying scheme is proposed, which alleviates these limitations.
The scheme entails a two-hop communication protocol, in which sources
communicate with destinations only through half-duplex relays. The key idea is
to schedule at each hop only a subset of nodes that can benefit from
\emph{multiuser diversity}. To select the source and destination nodes for each
hop, it requires only CSI at receivers (relays for the first hop, and
destination nodes for the second hop) and an integer-value CSI feedback to the
transmitters. For the case when is large and is fixed, it is shown that
the proposed scheme achieves a system throughput of bits/s/Hz. In
contrast, the information-theoretic upper bound of bits/s/Hz
is achievable only with more demanding CSI assumptions and cooperation between
the relays. Furthermore, it is shown that, under the condition that the product
of block duration and system bandwidth scales faster than , the
achievable throughput of the proposed scheme scales as .
Notably, this is proven to be the optimal throughput scaling even if
centralized scheduling is allowed, thus proving the optimality of the proposed
scheme in the scaling law sense.Comment: 17 pages, 8 figures, To appear in IEEE Transactions on Information
Theor
Throughput-Delay Trade-off for Hierarchical Cooperation in Ad Hoc Wireless Networks
Hierarchical cooperation has recently been shown to achieve better throughput
scaling than classical multihop schemes under certain assumptions on the
channel model in static wireless networks. However, the end-to-end delay of
this scheme turns out to be significantly larger than those of multihop
schemes. A modification of the scheme is proposed here that achieves a
throughput-delay trade-off for T(n) between
and , where D(n) and T(n) are
respectively the average delay per bit and the aggregate throughput in a
network of n nodes. This trade-off complements the previous results of El Gamal
et al., which show that the throughput-delay trade-off for multihop schemes is
given by D(n)=T(n) where T(n) lies between and .
Meanwhile, the present paper considers the network multiple-access problem,
which may be of interest in its own right.Comment: 9 pages, 6 figures, to appear in IEEE Transactions on Information
Theory, submitted Dec 200
- β¦