1,762 research outputs found
Resource Allocation for Downlink Multi-Cell OFDMA Cognitive Radio Network Using Hungarian Method
This paper considers the problem of resource allocation for downlink part of an OFDM-based multi-cell cognitive radio network which consists of multiple secondary transmitters and receivers communicating simultaneously in the presence of multiple primary users. We present a new framework to maximize the total data throughput of secondary users by means of subchannel assignment, while ensuring interference leakage to PUs is below a threshold. In this framework, we first formulate the resource allocation problem as a nonlinear and non-convex optimization problem. Then we represent the problem as a maximum weighted matching in a bipartite graph and propose an iterative algorithm based on Hungarian method to solve it. The present contribution develops an efficient subchannel allocation algorithm that assigns subchannels to the secondary users without the perfect knowledge of fading channel gain between cognitive radio transmitter and primary receivers. The performance of the proposed subcarrier allocation algorithm is compared with a blind subchannel allocation as well as another scheme with the perfect knowledge of channel-state information. Simulation results reveal that a significant performance advantage can still be realized, even if the optimization at the secondary network is based on imperfect network information
Analysis Framework for Opportunistic Spectrum OFDMA and its Application to the IEEE 802.22 Standard
We present an analytical model that enables throughput evaluation of
Opportunistic Spectrum Orthogonal Frequency Division Multiple Access (OS-OFDMA)
networks. The core feature of the model, based on a discrete time Markov chain,
is the consideration of different channel and subchannel allocation strategies
under different Primary and Secondary user types, traffic and priority levels.
The analytical model also assesses the impact of different spectrum sensing
strategies on the throughput of OS-OFDMA network. The analysis applies to the
IEEE 802.22 standard, to evaluate the impact of two-stage spectrum sensing
strategy and varying temporal activity of wireless microphones on the IEEE
802.22 throughput. Our study suggests that OS-OFDMA with subchannel notching
and channel bonding could provide almost ten times higher throughput compared
with the design without those options, when the activity and density of
wireless microphones is very high. Furthermore, we confirm that OS-OFDMA
implementation without subchannel notching, used in the IEEE 802.22, is able to
support real-time and non-real-time quality of service classes, provided that
wireless microphones temporal activity is moderate (with approximately one
wireless microphone per 3,000 inhabitants with light urban population density
and short duty cycles). Finally, two-stage spectrum sensing option improves
OS-OFDMA throughput, provided that the length of spectrum sensing at every
stage is optimized using our model
A Comprehensive Survey of Potential Game Approaches to Wireless Networks
Potential games form a class of non-cooperative games where unilateral
improvement dynamics are guaranteed to converge in many practical cases. The
potential game approach has been applied to a wide range of wireless network
problems, particularly to a variety of channel assignment problems. In this
paper, the properties of potential games are introduced, and games in wireless
networks that have been proven to be potential games are comprehensively
discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on
Communications, vol. E98-B, no. 9, Sept. 201
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
- …