10,907 research outputs found
Dynamic Resource Allocation in Cognitive Radio Networks: A Convex Optimization Perspective
This article provides an overview of the state-of-art results on
communication resource allocation over space, time, and frequency for emerging
cognitive radio (CR) wireless networks. Focusing on the
interference-power/interference-temperature (IT) constraint approach for CRs to
protect primary radio transmissions, many new and challenging problems
regarding the design of CR systems are formulated, and some of the
corresponding solutions are shown to be obtainable by restructuring some
classic results known for traditional (non-CR) wireless networks. It is
demonstrated that convex optimization plays an essential role in solving these
problems, in a both rigorous and efficient way. Promising research directions
on interference management for CR and other related multiuser communication
systems are discussed.Comment: to appear in IEEE Signal Processing Magazine, special issue on convex
optimization for signal processin
AirSync: Enabling Distributed Multiuser MIMO with Full Spatial Multiplexing
The enormous success of advanced wireless devices is pushing the demand for
higher wireless data rates. Denser spectrum reuse through the deployment of
more access points per square mile has the potential to successfully meet the
increasing demand for more bandwidth. In theory, the best approach to density
increase is via distributed multiuser MIMO, where several access points are
connected to a central server and operate as a large distributed multi-antenna
access point, ensuring that all transmitted signal power serves the purpose of
data transmission, rather than creating "interference." In practice, while
enterprise networks offer a natural setup in which distributed MIMO might be
possible, there are serious implementation difficulties, the primary one being
the need to eliminate phase and timing offsets between the jointly coordinated
access points.
In this paper we propose AirSync, a novel scheme which provides not only time
but also phase synchronization, thus enabling distributed MIMO with full
spatial multiplexing gains. AirSync locks the phase of all access points using
a common reference broadcasted over the air in conjunction with a Kalman filter
which closely tracks the phase drift. We have implemented AirSync as a digital
circuit in the FPGA of the WARP radio platform. Our experimental testbed,
comprised of two access points and two clients, shows that AirSync is able to
achieve phase synchronization within a few degrees, and allows the system to
nearly achieve the theoretical optimal multiplexing gain. We also discuss MAC
and higher layer aspects of a practical deployment. To the best of our
knowledge, AirSync offers the first ever realization of the full multiuser MIMO
gain, namely the ability to increase the number of wireless clients linearly
with the number of jointly coordinated access points, without reducing the per
client rate.Comment: Submitted to Transactions on Networkin
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
Secrecy Outage and Diversity Analysis of Cognitive Radio Systems
In this paper, we investigate the physical-layer security of a multi-user
multi-eavesdropper cognitive radio system, which is composed of multiple
cognitive users (CUs) transmitting to a common cognitive base station (CBS),
while multiple eavesdroppers may collaborate with each other or perform
independently in intercepting the CUs-CBS transmissions, which are called the
coordinated and uncoordinated eavesdroppers, respectively. Considering multiple
CUs available, we propose the round-robin scheduling as well as the optimal and
suboptimal user scheduling schemes for improving the security of CUs-CBS
transmissions against eavesdropping attacks. Specifically, the optimal user
scheduling is designed by assuming that the channel state information (CSI) of
all links from CUs to CBS, to primary user (PU) and to eavesdroppers are
available. By contrast, the suboptimal user scheduling only requires the CSI of
CUs-CBS links without the PU's and eavesdroppers' CSI. We derive closed-form
expressions of the secrecy outage probability of these three scheduling schemes
in the presence of the coordinated and uncoordinated eavesdroppers. We also
carry out the secrecy diversity analysis and show that the round-robin
scheduling achieves the diversity order of only one, whereas the optimal and
suboptimal scheduling schemes obtain the full secrecy diversity, no matter
whether the eavesdroppers collaborate or not. In addition, numerical secrecy
outage results demonstrate that for both the coordinated and uncoordinated
eavesdroppers, the optimal user scheduling achieves the best security
performance and the round-robin scheduling performs the worst. Finally, upon
increasing the number of CUs, the secrecy outage probabilities of the optimal
and suboptimal user scheduling schemes both improve significantly.Comment: 16 pages, 5 figures, accepted to appear, IEEE Journal on Selected
Areas in Communications, 201
- …