66 research outputs found
How Much Multiuser Diversity is Required for Energy Limited Multiuser Systems?
Multiuser diversity (MUDiv) is one of the central concepts in multiuser (MU)
systems. In particular, MUDiv allows for scheduling among users in order to
eliminate the negative effects of unfavorable channel fading conditions of some
users on the system performance. Scheduling, however, consumes energy (e.g.,
for making users' channel state information available to the scheduler). This
extra usage of energy, which could potentially be used for data transmission,
can be very wasteful, especially if the number of users is large. In this
paper, we answer the question of how much MUDiv is required for energy limited
MU systems. Focusing on uplink MU wireless systems, we develop MU scheduling
algorithms which aim at maximizing the MUDiv gain. Toward this end, we
introduce a new realistic energy model which accounts for scheduling energy and
describes the distribution of the total energy between scheduling and data
transmission stages. Using the fact that such energy distribution can be
controlled by varying the number of active users, we optimize this number by
either (i) minimizing the overall system bit error rate (BER) for a fixed total
energy of all users in the system or (ii) minimizing the total energy of all
users for fixed BER requirements. We find that for a fixed number of available
users, the achievable MUDiv gain can be improved by activating only a subset of
users. Using asymptotic analysis and numerical simulations, we show that our
approach benefits from MUDiv gains higher than that achievable by generic
greedy access algorithm, which is the optimal scheduling method for energy
unlimited systems.Comment: 28 pages, 9 figures, submitted to IEEE Trans. Signal Processing in
Oct. 200
Multichannel Relay assisted NOMA-ALOHA with Reinforcement Learning based Random Access
© 2023, IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. This is the accepted manuscript version of a conference paper which has been published in final form at https://doi.org/10.1109/VTC2023-Spring57618.2023.10200766We investigate multichannel relay assisted non-orthogonal multiple access (NOMA) in slotted ALOHA systems, where each user randomly accesses one of different channel slots and different transmit power for uplink transmissions over two-hop links, to and from the relay. By using multi-agent reinforcement learning, we propose greedy and non-greedy random access methods so that each user can learn its best strategies of random access over multiple relay slots. Random collisions and fading over the relay slots are both considered. The behaviors of relay-aided NOMA-ALOHA strategies are evaluated with the simulation. It is shown that the greedy method outperforms the non-greedy method in terms of average success rate. For deployment of relay, the greedy method benefits in improving transmission reliability under the symmetric relay channels (between the two-hop links) compared to asymmetric channels. Thus, it is interpreted that the proposed greedy method is more promising to the NOMA-ALOHA systems under a symmetric multichannel relay
Multi-Device Selection Scheduling in Non-Identically Distributed Fading Channels
Multiuser selection scheduling concept has been recently proposed in the literature in order to increase the multiuser diversity gain and overcome the significant feedback requirements for the opportunistic scheduling schemes. The main idea is that reducing the feedback overhead saves per-user power that could potentially be added for the data transmission. In this work, we propose to integrate the principle of multiuser selection and the proportional fair scheduling scheme. This is aimed especially at power-limited, multi-device systems in non-identically distributed fading channels. For the performance analysis, we derive closed-form expressions for the outage probabilities and the average system rate of the delay-sensitive and the delay-tolerant systems, respectively, and compare them with the full feedback multiuser diversity schemes. The discrete rate region is analytically presented, where the maximum average system rate can be obtained by properly choosing the number of partial devices. We optimize jointly the number of partial devices and the per-device power saving in order to maximize the average system rate under the power requirement. Through our results, we finally demonstrate that the proposed scheme leveraging the saved feedback power to add for the data transmission can outperform the full feedback multiuser diversity, in non-identical Rayleigh fading of devices’ channels
Practical Spectrum Aggregation for Secondary Networks with Imperfect Sensing
We investigate a collision-sensitive secondary network that intends to opportunistically aggregate and utilize spectrum of a primary network to achieve higher data rates. In opportunistic spectrum access with imperfect sensing of idle primary spectrum, secondary transmission can collide with primary transmission. When the secondary network aggregates more channels in the presence of the imperfect sensing, collisions could occur more often, limiting the performance obtained by spectrum aggregation. In this context, we aim to address a fundamental query, that is, how much spectrum aggregation is worthy with imperfect sensing. For collision occurrence, we focus on two different types of collision: one is imposed by asynchronous transmission; and the other by imperfect spectrum sensing. The collision probability expression has been derived in closed-form with various secondary network parameters: primary traffic load, secondary user transmission parameters, spectrum sensing errors, and the number of aggregated sub-channels. In addition, the impact of spectrum aggregation on data rate is analysed under the constraint of collision probability. Then, we solve an optimal spectrum aggregation problem and propose the dynamic spectrum aggregation approach to increase the data rate subject to practical collision constraints. Our simulation results show clearly that the proposed approach outperforms the benchmark that passively aggregates sub-channels with lack of collision awareness
Unsupervised Machine Intelligence for Automation of Multi-Dimensional Modulation
In this letter, we propose a new unsupervised machine learning technique for a multi-dimensional modulator that can autonomously learn key exploitable features from significant variations of multi-dimensional wireless propagation parameters, followed by a real-time prediction of the best multi-dimensional modulation mode to be used for the next resilient transmission. The proposed method aims to embrace the potential of the unsupervised K-means clustering into the physical layer of noncoherent multi-dimensional transmission. Simulation results show that the proposed scheme can outperform the benchmarks at a cost of simple offline training
Defining Spatial Security Outage Probability for Exposure Region Based Beamforming
With increasing number of antennae in base stations, there is considerable
interest in using beamfomining to improve physical layer security, by creating
an `exposure region' that enhances the received signal quality for a legitimate
user and reduces the possibility of leaking information to a randomly located
passive eavesdropper. The paper formalises this concept by proposing a novel
definition for the security level of such a legitimate transmission, called the
`Spatial Secrecy Outage Probability' (SSOP). By performing a theoretical and
numerical analysis, it is shown how the antenna array parameters can affect the
SSOP and its analytic upper bound. Whilst this approach may be applied to any
array type and any fading channel model, it is shown here how the security
performance of a uniform linear array varies in a Rician fading channel by
examining the analytic SSOP upper bound.Comment: Submitted to the IEEE Transactions on Wireless Communication
- …