342 research outputs found
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
Outage analysis of superposition modulation aided network coded cooperation in the presence of network coding noise
We consider a network, where multiple sourcedestination pairs communicate with the aid of a half-duplex relay node (RN), which adopts decode-forward (DF) relaying and superposition-modulation (SPM) for combining the signals transmitted by the source nodes (SNs) and then forwards the composite signal to all the destination nodes (DNs). Each DN extracts the signals transmitted by its own SN from the composite signal by subtracting the signals overheard from the unwanted SNs. We derive tight lower-bounds for the outage probability for transmission over Rayleigh fading channels and invoke diversity combining at the DNs, which is validated by simulation for both the symmetric and the asymmetric network configurations. For the high signal-to-noise ratio regime, we derive both an upperbound as well as a lower-bound for the outage performance and analyse the achievable diversity gain. It is revealed that a diversity order of 2 is achieved, regardless of the number of SN-DN pairs in the network. We also highlight the fact that the outage performance is dominated by the quality of the worst overheated link, because it contributes most substantially to the network coding noise. Finally, we use the lower bound for designing a relay selection scheme for the proposed SPM based network coded cooperative communication (SPM-NC-CC) system.<br/
Sign-Compute-Resolve for Random Access
We present an approach to random access that is based on three elements:
physical-layer network coding, signature codes and tree splitting. Upon
occurrence of a collision, physical-layer network coding enables the receiver
to decode the sum of the information that was transmitted by the individual
users. For each user this information consists of the data that the user wants
to communicate as well as the user's signature. As long as no more than
users collide, their identities can be recovered from the sum of their
signatures. A splitting protocol is used to deal with the case that more than
users collide. We measure the performance of the proposed method in terms
of user resolution rate as well as overall throughput of the system. The
results show that our approach significantly increases the performance of the
system even compared to coded random access, where collisions are not wasted,
but are reused in successive interference cancellation.Comment: Accepted for presentation at 52nd Annual Allerton Conference on
Communication, Control, and Computin
Network-Coded Multiple Access
This paper proposes and experimentally demonstrates a first wireless local
area network (WLAN) system that jointly exploits physical-layer network coding
(PNC) and multiuser decoding (MUD) to boost system throughput. We refer to this
multiple access mode as Network-Coded Multiple Access (NCMA). Prior studies on
PNC mostly focused on relay networks. NCMA is the first realized multiple
access scheme that establishes the usefulness of PNC in a non-relay setting.
NCMA allows multiple nodes to transmit simultaneously to the access point (AP)
to boost throughput. In the non-relay setting, when two nodes A and B transmit
to the AP simultaneously, the AP aims to obtain both packet A and packet B
rather than their network-coded packet. An interesting question is whether
network coding, specifically PNC which extracts packet (A XOR B), can still be
useful in such a setting. We provide an affirmative answer to this question
with a novel two-layer decoding approach amenable to real-time implementation.
Our USRP prototype indicates that NCMA can boost throughput by 100% in the
medium-high SNR regime (>=10dB). We believe further throughput enhancement is
possible by allowing more than two users to transmit together
Collision Helps - Algebraic Collision Recovery for Wireless Erasure Networks
Current medium access control mechanisms are based on collision avoidance and
collided packets are discarded. The recent work on ZigZag decoding departs from
this approach by recovering the original packets from multiple collisions. In
this paper, we present an algebraic representation of collisions which allows
us to view each collision as a linear combination of the original packets. The
transmitted, colliding packets may themselves be a coded version of the
original packets.
We propose a new acknowledgment (ACK) mechanism for collisions based on the
idea that if a set of packets collide, the receiver can afford to ACK exactly
one of them and still decode all the packets eventually. We analytically
compare delay and throughput performance of such collision recovery schemes
with other collision avoidance approaches in the context of a single hop
wireless erasure network. In the multiple receiver case, the broadcast
constraint calls for combining collision recovery methods with network coding
across packets at the sender. From the delay perspective, our scheme, without
any coordination, outperforms not only a ALOHA-type random access mechanisms,
but also centralized scheduling. For the case of streaming arrivals, we propose
a priority-based ACK mechanism and show that its stability region coincides
with the cut-set bound of the packet erasure network
Millimeter Wave Cellular Networks: A MAC Layer Perspective
The millimeter wave (mmWave) frequency band is seen as a key enabler of
multi-gigabit wireless access in future cellular networks. In order to overcome
the propagation challenges, mmWave systems use a large number of antenna
elements both at the base station and at the user equipment, which lead to high
directivity gains, fully-directional communications, and possible noise-limited
operations. The fundamental differences between mmWave networks and traditional
ones challenge the classical design constraints, objectives, and available
degrees of freedom. This paper addresses the implications that highly
directional communication has on the design of an efficient medium access
control (MAC) layer. The paper discusses key MAC layer issues, such as
synchronization, random access, handover, channelization, interference
management, scheduling, and association. The paper provides an integrated view
on MAC layer issues for cellular networks, identifies new challenges and
tradeoffs, and provides novel insights and solution approaches.Comment: 21 pages, 9 figures, 2 tables, to appear in IEEE Transactions on
Communication
- …