40,123 research outputs found
Degrees of Freedom of Wireless X Networks
We explore the degrees of freedom of user wireless networks,
i.e. networks of transmitters and receivers where every transmitter has
an independent message for every receiver. We derive a general outerbound on
the degrees of freedom \emph{region} of these networks. When all nodes have a
single antenna and all channel coefficients vary in time or frequency, we show
that the \emph{total} number of degrees of freedom of the network is equal
to per orthogonal time and frequency dimension.
Achievability is proved by constructing interference alignment schemes for
networks that can come arbitrarily close to the outerbound on degrees of
freedom. For the case where either M=2 or N=2 we find that the outerbound is
exactly achievable. While networks have significant degrees of freedom
benefits over interference networks when the number of users is small, our
results show that as the number of users increases, this advantage disappears.
Thus, for large , the user wireless network loses half the
degrees of freedom relative to the MIMO outerbound achievable
through full cooperation. Interestingly, when there are few transmitters
sending to many receivers () or many transmitters sending to few
receivers (), networks are able to approach the degrees
of freedom possible with full cooperation on the MIMO channel.
Similar to the interference channel, we also construct an example of a 2 user
channel with propagation delays where the outerbound on degrees of freedom
is achieved through interference alignment based on a simple TDMA strategy.Comment: 26 page
On the Capacity of the Finite Field Counterparts of Wireless Interference Networks
This work explores how degrees of freedom (DoF) results from wireless
networks can be translated into capacity results for their finite field
counterparts that arise in network coding applications. The main insight is
that scalar (SISO) finite field channels over are analogous
to n x n vector (MIMO) channels in the wireless setting, but with an important
distinction -- there is additional structure due to finite field arithmetic
which enforces commutativity of matrix multiplication and limits the channel
diversity to n, making these channels similar to diagonal channels in the
wireless setting. Within the limits imposed by the channel structure, the DoF
optimal precoding solutions for wireless networks can be translated into
capacity optimal solutions for their finite field counterparts. This is shown
through the study of the 2-user X channel and the 3-user interference channel.
Besides bringing the insights from wireless networks into network coding
applications, the study of finite field networks over also
touches upon important open problems in wireless networks (finite SNR, finite
diversity scenarios) through interesting parallels between p and SNR, and n and
diversity.Comment: Full version of paper accepted for presentation at ISIT 201
Multiple Unicast Capacity of 2-Source 2-Sink Networks
We study the sum capacity of multiple unicasts in wired and wireless multihop
networks. With 2 source nodes and 2 sink nodes, there are a total of 4
independent unicast sessions (messages), one from each source to each sink node
(this setting is also known as an X network). For wired networks with arbitrary
connectivity, the sum capacity is achieved simply by routing. For wireless
networks, we explore the degrees of freedom (DoF) of multihop X networks with a
layered structure, allowing arbitrary number of hops, and arbitrary
connectivity within each hop. For the case when there are no more than two
relay nodes in each layer, the DoF can only take values 1, 4/3, 3/2 or 2, based
on the connectivity of the network, for almost all values of channel
coefficients. When there are arbitrary number of relays in each layer, the DoF
can also take the value 5/3 . Achievability schemes incorporate linear
forwarding, interference alignment and aligned interference neutralization
principles. Information theoretic converse arguments specialized for the
connectivity of the network are constructed based on the intuition from linear
dimension counting arguments.Comment: 6 pages, 7 figures, submitted to IEEE Globecom 201
Real Interference Alignment and Degrees of Freedom Region of Wireless X Networks
Abstract-We consider a single hop wireless X network with K transmitters and J receivers, all with single antenna. Each transmitter conveys for each receiver an independent message. The channel is assumed to have constant coefficients. We develop interference alignment scheme for this setup and derived several achievable degrees of freedom regions. We show that in some cases, the derived region meets a previous outer bound and are hence the DoF region. For our achievability schemes, we divide each message into streams and use real interference alignment on the streams. Several previous results on the DoF region and total DoF for various special cases can be recovered from our result. Index Terms-real interference alignment, degrees of freedom region, wireless X network, stream alignmen
Degrees of Freedom of Two-Hop Wireless Networks: "Everyone Gets the Entire Cake"
We show that fully connected two-hop wireless networks with K sources, K
relays and K destinations have K degrees of freedom both in the case of
time-varying channel coefficients and in the case of constant channel
coefficients (in which case the result holds for almost all values of constant
channel coefficients). Our main contribution is a new achievability scheme
which we call Aligned Network Diagonalization. This scheme allows the data
streams transmitted by the sources to undergo a diagonal linear transformation
from the sources to the destinations, thus being received free of interference
by their intended destination. In addition, we extend our scheme to multi-hop
networks with fully connected hops, and multi-hop networks with MIMO nodes, for
which the degrees of freedom are also fully characterized.Comment: Presented at the 2012 Allerton Conference. Submitted to IEEE
Transactions on Information Theor
- β¦