1,609 research outputs found
Decentralized Dynamic Hop Selection and Power Control in Cognitive Multi-hop Relay Systems
In this paper, we consider a cognitive multi-hop relay secondary user (SU)
system sharing the spectrum with some primary users (PU). The transmit power as
well as the hop selection of the cognitive relays can be dynamically adapted
according to the local (and causal) knowledge of the instantaneous channel
state information (CSI) in the multi-hop SU system. We shall determine a low
complexity, decentralized algorithm to maximize the average end-to-end
throughput of the SU system with dynamic spatial reuse. The problem is
challenging due to the decentralized requirement as well as the causality
constraint on the knowledge of CSI. Furthermore, the problem belongs to the
class of stochastic Network Utility Maximization (NUM) problems which is quite
challenging. We exploit the time-scale difference between the PU activity and
the CSI fluctuations and decompose the problem into a master problem and
subproblems. We derive an asymptotically optimal low complexity solution using
divide-and-conquer and illustrate that significant performance gain can be
obtained through dynamic hop selection and power control. The worst case
complexity and memory requirement of the proposed algorithm is O(M^2) and
O(M^3) respectively, where is the number of SUs
Generalized Area Spectral Efficiency: An Effective Performance Metric for Green Wireless Communications
Area spectral efficiency (ASE) was introduced as a metric to quantify the
spectral utilization efficiency of cellular systems. Unlike other performance
metrics, ASE takes into account the spatial property of cellular systems. In
this paper, we generalize the concept of ASE to study arbitrary wireless
transmissions. Specifically, we introduce the notion of affected area to
characterize the spatial property of arbitrary wireless transmissions. Based on
the definition of affected area, we define the performance metric, generalized
area spectral efficiency (GASE), to quantify the spatial spectral utilization
efficiency as well as the greenness of wireless transmissions. After
illustrating its evaluation for point-to-point transmission, we analyze the
GASE performance of several different transmission scenarios, including
dual-hop relay transmission, three-node cooperative relay transmission and
underlay cognitive radio transmission. We derive closed-form expressions for
the GASE metric of each transmission scenario under Rayleigh fading environment
whenever possible. Through mathematical analysis and numerical examples, we
show that the GASE metric provides a new perspective on the design and
optimization of wireless transmissions, especially on the transmitting power
selection. We also show that introducing relay nodes can greatly improve the
spatial utilization efficiency of wireless systems. We illustrate that the GASE
metric can help optimize the deployment of underlay cognitive radio systems.Comment: 11 pages, 8 figures, accepted by TCo
Decentralized Fair Scheduling in Two-Hop Relay-Assisted Cognitive OFDMA Systems
In this paper, we consider a two-hop relay-assisted cognitive downlink OFDMA
system (named as secondary system) dynamically accessing a spectrum licensed to
a primary network, thereby improving the efficiency of spectrum usage. A
cluster-based relay-assisted architecture is proposed for the secondary system,
where relay stations are employed for minimizing the interference to the users
in the primary network and achieving fairness for cell-edge users. Based on
this architecture, an asymptotically optimal solution is derived for jointly
controlling data rates, transmission power, and subchannel allocation to
optimize the average weighted sum goodput where the proportional fair
scheduling (PFS) is included as a special case. This solution supports
decentralized implementation, requires small communication overhead, and is
robust against imperfect channel state information at the transmitter (CSIT)
and sensing measurement. The proposed solution achieves significant throughput
gains and better user-fairness compared with the existing designs. Finally, we
derived a simple and asymptotically optimal scheduling solution as well as the
associated closed-form performance under the proportional fair scheduling for a
large number of users. The system throughput is shown to be
, where is the
number of users in one cluster, is the number of subchannels and is
the active probability of primary users.Comment: 29 pages, 9 figures, IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL
PROCESSIN
- β¦