202,209 research outputs found
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/
Power-Optimal Feedback-Based Random Spectrum Access for an Energy Harvesting Cognitive User
In this paper, we study and analyze cognitive radio networks in which
secondary users (SUs) are equipped with Energy Harvesting (EH) capability. We
design a random spectrum sensing and access protocol for the SU that exploits
the primary link's feedback and requires less average sensing time. Unlike
previous works proposed earlier in literature, we do not assume perfect
feedback. Instead, we take into account the more practical possibilities of
overhearing unreliable feedback signals and accommodate spectrum sensing
errors. Moreover, we assume an interference-based channel model where the
receivers are equipped with multi-packet reception (MPR) capability.
Furthermore, we perform power allocation at the SU with the objective of
maximizing the secondary throughput under constraints that maintain certain
quality-of-service (QoS) measures for the primary user (PU)
A Tutorial on Clique Problems in Communications and Signal Processing
Since its first use by Euler on the problem of the seven bridges of
K\"onigsberg, graph theory has shown excellent abilities in solving and
unveiling the properties of multiple discrete optimization problems. The study
of the structure of some integer programs reveals equivalence with graph theory
problems making a large body of the literature readily available for solving
and characterizing the complexity of these problems. This tutorial presents a
framework for utilizing a particular graph theory problem, known as the clique
problem, for solving communications and signal processing problems. In
particular, the paper aims to illustrate the structural properties of integer
programs that can be formulated as clique problems through multiple examples in
communications and signal processing. To that end, the first part of the
tutorial provides various optimal and heuristic solutions for the maximum
clique, maximum weight clique, and -clique problems. The tutorial, further,
illustrates the use of the clique formulation through numerous contemporary
examples in communications and signal processing, mainly in maximum access for
non-orthogonal multiple access networks, throughput maximization using index
and instantly decodable network coding, collision-free radio frequency
identification networks, and resource allocation in cloud-radio access
networks. Finally, the tutorial sheds light on the recent advances of such
applications, and provides technical insights on ways of dealing with mixed
discrete-continuous optimization problems
Random Access Transport Capacity
We develop a new metric for quantifying end-to-end throughput in multihop
wireless networks, which we term random access transport capacity, since the
interference model presumes uncoordinated transmissions. The metric quantifies
the average maximum rate of successful end-to-end transmissions, multiplied by
the communication distance, and normalized by the network area. We show that a
simple upper bound on this quantity is computable in closed-form in terms of
key network parameters when the number of retransmissions is not restricted and
the hops are assumed to be equally spaced on a line between the source and
destination. We also derive the optimum number of hops and optimal per hop
success probability and show that our result follows the well-known square root
scaling law while providing exact expressions for the preconstants as well.
Numerical results demonstrate that the upper bound is accurate for the purpose
of determining the optimal hop count and success (or outage) probability.Comment: Submitted to IEEE Trans. on Wireless Communications, Sept. 200
Opportunistic Interference Mitigation Achieves Optimal Degrees-of-Freedom in Wireless Multi-cell Uplink Networks
We introduce an opportunistic interference mitigation (OIM) protocol, where a
user scheduling strategy is utilized in -cell uplink networks with
time-invariant channel coefficients and base stations (BSs) having
antennas. Each BS opportunistically selects a set of users who generate the
minimum interference to the other BSs. Two OIM protocols are shown according to
the number of simultaneously transmitting users per cell: opportunistic
interference nulling (OIN) and opportunistic interference alignment (OIA).
Then, their performance is analyzed in terms of degrees-of-freedom (DoFs). As
our main result, it is shown that DoFs are achievable under the OIN
protocol with selected users per cell, if the total number of users in
a cell scales at least as . Similarly, it turns out that
the OIA scheme with () selected users achieves DoFs, if scales
faster than . These results indicate that there exists a
trade-off between the achievable DoFs and the minimum required . By deriving
the corresponding upper bound on the DoFs, it is shown that the OIN scheme is
DoF optimal. Finally, numerical evaluation, a two-step scheduling method, and
the extension to multi-carrier scenarios are shown.Comment: 18 pages, 3 figures, Submitted to IEEE Transactions on Communication
Energy Harvesting Wireless Communications: A Review of Recent Advances
This article summarizes recent contributions in the broad area of energy
harvesting wireless communications. In particular, we provide the current state
of the art for wireless networks composed of energy harvesting nodes, starting
from the information-theoretic performance limits to transmission scheduling
policies and resource allocation, medium access and networking issues. The
emerging related area of energy transfer for self-sustaining energy harvesting
wireless networks is considered in detail covering both energy cooperation
aspects and simultaneous energy and information transfer. Various potential
models with energy harvesting nodes at different network scales are reviewed as
well as models for energy consumption at the nodes.Comment: To appear in the IEEE Journal of Selected Areas in Communications
(Special Issue: Wireless Communications Powered by Energy Harvesting and
Wireless Energy Transfer
- …