This paper investigates the Maximum Link Scheduling and Shortest Link Scheduling problems with power assignment, considering two widely adopted interference models: the Signal-to-Interference-plus-Noise Ratio (SINR) model and the Rayleigh fading model, and proposes two approximation algorithms.
Abstract
Link scheduling remains a fundamental challenge in wireless networks, as it directly affects critical performance metrics such as throughput, delay, fairness, and energy efficiency. In this paper, we investigate the Maximum Link Scheduling (MLS) and Shortest Link Scheduling (SLS) problems with power assignment, considering two widely adopted interference models: the Signal-to-Interference-plus-Noise Ratio (SINR) model and the Rayleigh fading model. We propose two approximation algorithms: the TMP algorithm for MLS and the TSP algorithm for SLS, both of which employ a class-dependent oblivious power assignment strategy. The validity of these algorithms is established rigorously for both interference models. Our approach classifies the set of links into distinct classes and schedules them by partitioning the link deployment plane associated with each class into small triangular regions. Our theoretical analysis and simulation results demonstrate that the plane partitioning and classification framework outperforms the considered baseline schemes in terms of scheduling efficiency and resource utilization. Moreover, simulation results show that our power assignment method achieves a substantial reduction in energy consumption of nodes compared to competing algorithms.
Rate-Splitting Multiple Access (RSMA) has emerged as a robust interference management strategy for future wireless networks. This paper investigates the performance of a hierarchical RSMA scheme in the downlink of a multi-antenna system, designed to efficiently serve clustered user deployments. We derive exact and asymptotic closed-form expressions for the outage probability of users under Nakagami- $m$ fading channels, considering a two-layer message splitting architecture (systemcommon, group-common, and private streams). Furthermore, to ensure fairness and reliability, we formulate a min-max power allocation problem to minimize the worst-case outage probability among users. A Geometric Programming-based algorithm is proposed to solve the resulting non-convex optimization problem. The numerical results validate the theoretical analysis and demonstrate the impact of different strategies for using this model, such as the number of users per group, user allocation strategies, and the number of base station transmit antennas.
R. P. De Souza, E. Olivo· International Mediterranean...· 0 citations
Comparison shows that, under the evaluated DeepMIMO-based scenarios, the examined assignment-based methods exhibit different trade-offs in throughput, energy-consumption-related performance, bandwidth utilization, and adaptability to varying user demands, offering useful insights for 5G MIMO resource allocation studies.
Nikolaos Prodromos, Damianos Diasakos, V. Kokkinos et al.· Wireless personal communicat...· 0 citations
We consider convergecast in a multi-hop sensor network, in which sensors sample physical processes of interest and transmit packets containing these samples to a single sink node over a routing tree. The sink node remotely estimates these processes based on received packets. Our objective is to design centralized multi-hop sampling and scheduling policies that minimize the average age of information (AAoI) across sensors for networks operating under a complete interference model as well as random losses in the wireless network. We propose a policy that samples sources and schedules links according to an analytically characterized priority index. Through simulations, we compare the AAoI of the proposed policy with policies from prior work and show improved performance. The improvement in performance is observed to be larger as the number of sources increases or when the reliability of links decreases demonstrating the utility of the proposed policy. An extension to $K$ -hop interference model is also discussed.
N. Raj, V. Sukumaran· IEEE Wireless Communications...· 0 citations
Wi-Fi, that is wireless networks based on the IEEE 802.11 standard, operates in a decentralized manner based on carrier sense multiple access (CSMA). Owing to the operational characteristics of a CSMA protocol, the effects of interference and channel sensing sensitivity on the overall network throughput and fairness become more significant as the Wi-Fi network gets denser, i.e., the number of access points (APs) increases. The transmit and receive coverage can be adjusted by controlling the transmit power and clear channel assessment (CCA) threshold, respectively; the network performance can then be improved in terms of the network sum throughput and fairness. However, the analytical optimization of the transmit power and CCA threshold is a complicated task because both parameters of multiple APs and stations (STAs) are mutually coupled. Alternatively, the mechanism of the proposed problem is modeled using a Markov decision process (MDP) and the optimal solution is obtained by using a reinforcement learning (RL) approach. Considering the complexity and convergence rate of an algorithm as well as the distributed Wi-Fi network architecture, we propose a distributed multi-agent Q-learning algorithm. The effectiveness of the proposed algorithm is examined through intensive simulations with several benchmarks. Based on the simulation results, it can be deduced that the quality of services (QoS) of dense Wi-Fi networks can be effectively optimized by controlling the transmission power and CCA threshold.
Younghoon Kim, Jaeha Ahn, Youngbin You et al.· IEEE Access· 0 citations
Millimeter-wave (mmWave) communication systems are vulnerable to severe attenuation, blockage-induced LOS/NLOS transitions, and time-varying co-channel interference. This paper develops a lightweight distributed power-allocation framework in which each base station independently updates a tabular Q-learning policy using locally observable blockage-ratio, serving-distance, and aggregate-interference information. The proposed state-dependent dynamic reward is recalculated at every decision step, and its coefficients vary explicitly with the instantaneous blockage ratio, QoS satisfaction ratio, and normalized interference level. All learning-based and non-learning baselines are evaluated using the same topology realizations, blockage and mobility traces, and random seeds. Under the reconstructed simulation settings, the proposed method achieves performance comparable to fixed Q-learning while retaining a transparent blockage-aware state and low-complexity distributed implementation. DQN, greedy, and uniform power achieve higher raw capacity or QoS in the considered small-scale network. Results from 30 paired runs with 95% confidence intervals, together with ablation, sensitivity, beam-misalignment, and overhead analyses, clarify the empirical benefits, limitations, and deployment scope of the proposed method. The study focuses on power control after beam establishment; joint beam tracking and power allocation remain outside the present scope.
Zhuoning Yang, Ziwei Chen· Italian National Conference...· 0 citations