307 research outputs found
Weighted Sum Rate Maximization for Downlink OFDMA with Subcarrier-pair based Opportunistic DF Relaying
This paper addresses a weighted sum rate (WSR) maximization problem for
downlink OFDMA aided by a decode-and-forward (DF) relay under a total power
constraint. A novel subcarrier-pair based opportunistic DF relaying protocol is
proposed. Specifically, user message bits are transmitted in two time slots. A
subcarrier in the first slot can be paired with a subcarrier in the second slot
for the DF relay-aided transmission to a user. In particular, the source and
the relay can transmit simultaneously to implement beamforming at the
subcarrier in the second slot. Each unpaired subcarrier in either the first or
second slot is used for the source's direct transmission to a user. A benchmark
protocol, same as the proposed one except that the transmit beamforming is not
used for the relay-aided transmission, is also considered. For each protocol, a
polynomial-complexity algorithm is developed to find at least an approximately
optimum resource allocation (RA), by using continuous relaxation, the dual
method, and Hungarian algorithm. Instrumental to the algorithm design is an
elegant definition of optimization variables, motivated by the idea of
regarding the unpaired subcarriers as virtual subcarrier pairs in the direct
transmission mode. The effectiveness of the RA algorithm and the impact of
relay position and total power on the protocols' performance are illustrated by
numerical experiments. The proposed protocol always leads to a maximum WSR
equal to or greater than that for the benchmark one, and the performance gain
of using the proposed one is significant especially when the relay is in close
proximity to the source and the total power is low. Theoretical analysis is
presented to interpret these observations.Comment: 8 figures, accepted and to be published in IEEE Transactions on
Signal Processing. arXiv admin note: text overlap with arXiv:1301.293
When Channel Bonding is Beneficial for Opportunistic Spectrum Access Networks
Transmission over multiple frequency bands combined into one logical channel
speeds up data transfer for wireless networks. On the other hand, the
allocation of multiple channels to a single user decreases the probability of
finding a free logical channel for new connections, which may result in a
network-wide throughput loss. While this relationship has been studied
experimentally, especially in the WLAN configuration, little is known on how to
analytically model such phenomena. With the advent of Opportunistic Spectrum
Access (OSA) networks, it is even more important to understand the
circumstances in which it is beneficial to bond channels occupied by primary
users with dynamic duty cycle patterns. In this paper we propose an analytical
framework which allows the investigation of the average channel throughput at
the medium access control layer for OSA networks with channel bonding enabled.
We show that channel bonding is generally beneficial, though the extent of the
benefits depend on the features of the OSA network, including OSA network size
and the total number of channels available for bonding. In addition, we show
that performance benefits can be realized by adaptively changing the number of
bonded channels depending on network conditions. Finally, we evaluate channel
bonding considering physical layer constraints, i.e. throughput reduction
compared to the theoretical throughput of a single virtual channel due to a
transmission power limit for any bonding size.Comment: accepted to IEEE Transactions on Wireless Communication
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
Opportunistic Random Access Scheme Design for OFDMA-based Indoor PLC Networks
International audienceMulti-user systems can benefit from multi-user diversity by assigning channels to users with bestchannel conditions at different time instants. In this paper, we present an opportunistic random accessscheme for OFDMA-based indoor PLC systems, based on time- and frequency-varying channel conditions,to exploit multi-user diversity. The proposed scheme dynamically adjusts the backoff time ofeach user according to its own channel state variations in both time and frequency domains duringthe contention procedure, and thus âbetterâ users have higher priority to contend over their favorablesubchannels. Moreover, subchannels are assigned to users with best channel conditions in order tofurther enhance the system throughput. In addition, an analytical throughput model for such a multiuserand multi-channel system is derived to obtain the optimal parameter settings of the proposedaccess scheme. Simulation results show that the proposed scheme provides significant improvement inthe system throughput even in the case where the number of users highly exceeds that of subchannels
Distributed Game Theoretic Optimization and Management of Multichannel ALOHA Networks
The problem of distributed rate maximization in multi-channel ALOHA networks
is considered. First, we study the problem of constrained distributed rate
maximization, where user rates are subject to total transmission probability
constraints. We propose a best-response algorithm, where each user updates its
strategy to increase its rate according to the channel state information and
the current channel utilization. We prove the convergence of the algorithm to a
Nash equilibrium in both homogeneous and heterogeneous networks using the
theory of potential games. The performance of the best-response dynamic is
analyzed and compared to a simple transmission scheme, where users transmit
over the channel with the highest collision-free utility. Then, we consider the
case where users are not restricted by transmission probability constraints.
Distributed rate maximization under uncertainty is considered to achieve both
efficiency and fairness among users. We propose a distributed scheme where
users adjust their transmission probability to maximize their rates according
to the current network state, while maintaining the desired load on the
channels. We show that our approach plays an important role in achieving the
Nash bargaining solution among users. Sequential and parallel algorithms are
proposed to achieve the target solution in a distributed manner. The
efficiencies of the algorithms are demonstrated through both theoretical and
simulation results.Comment: 34 pages, 6 figures, accepted for publication in the IEEE/ACM
Transactions on Networking, part of this work was presented at IEEE CAMSAP
201
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
- âŠ