Time-aware utility-based resource allocation in wireless networks

Resource allocation and admission control algorithm based on non-cooperation game in wireless mesh networks

We study the problem of admission control and resource (subcarriers, power and bit-loading) allocation in a heterogeneous OFDMA wireless network serving both QoS-constrained high-priority users and best-effort users. By clustering subcarriers, efficient algorithms for cluster and power allocation have been proposed. Our strategy maximizes the total network utility of the best-effort users while satisfying the QoS request for maximum number of high-priority users. We approximate best-effort user utility function as a piece-wise linear function and propose a linear programming based cluster allocation algorithm. The feasibility of the resource allocation problem depends on the number of HP users in the network. Since a large number of demanding HP users would render the resource allocation problem infeasible, a joint admission control and resource allocation scheme could be an efficient way of tackling both problems with less overhead. By incorporating admission control, we propose an efficient and optimal joint admission control and resource allocation algorithm.

Next generation high data rate applications such as High-Definition (HD) video transmission place a heavy load on wireless network resources. To achieve the strict quality of service requirements of HD video in a multi-user network requires efficient resource allocation. Rate-distortion theory provides an appropriate basis for this. The Nash Bargaining Solution (NBS) is proven to generate an optimal solution to a rate-distortion based convex resource allocation problem. Particle Swarm Optimization (PSO) is a meta-heuristic optimizer capable of generating near-optimal solutions. PSO, however, is not constrained to convex optimization problems. The motivation of this work is to demonstrate a PSO implementation capable of achieving an optimal solution to the resource allocation problem. The capability of the PSO approach to reach an optimal solution suggests its potential for resource allocation in a network of heterogeneous applications where convex optimization methods do not apply.

Problem statement. Due to their mobility, flexibility, ease of deployment, and low cost, Autonomous Aerial Vehicle (AAV) play an important role in future wireless networks. However, their pratical implementation faces challenges, including energy constraints, dynamic channel variations, interference management, and the need for efficient resource allocation to ensure seamless connectivity for ground users. Traditional optimization methods often fail to adapt to these complexities in real-time, limiting the effectiveness of AAV-assisted wireless networks. The aim of the work provides a comprehensive review of resource allocation in AAV-assisted wireless networks, focusing on power and bandwidth optimization strategies, as well as the key challenges in ensuring efficient and reliable communication. Methods: used in this study include a systematic review of existing literature, analyzing optimization approaches such as Game Theory, Artificial Intelligence for efficient resource allocation in AAV-assisted wireless networks. Novelty: this study analyzes resource allocation challenges in AAV-assisted network, focusing on the interdependence of power and bandwidth allocation. It explores optimization techniques like Game Theory, and Artificial Intelligence. Results. The analysis in this paper demonstrates that Game Theory and Artificial Intelligence based approaches significantly improve resource allocation efficiency. Additionally, the study identifies key challenges, including heterogeneous density network, security concerns, and complex channel modeling, providing insights for future research. Practical / Theoretical Relevance: This study advences the theoretical understanding of resource allocation in AAV-assisted wireless networks by integrating optimization strategies from Game Theory and Artificial Intelligence. Pratically, it provides insight into enhancing network efficiency, adaptability and security, making AAV-based communication more viable for real-world applications, such as disaster recovery, remote areas coverage, and IoT data collection.

In wireless networks many nodes contend for available resources creating a challenge in resource allocation. With shared resources, fairness in allocation is a serious issue. Fairness metrics have been defined to measure the fairness level of resource decisions in allocations. Therefore, fairness metrics significantly influence network and node performances emphasizing the need for due diligence to fairness metrics. It can be seen that fairness metrics in many of the allocation strategies and algorithms in the literature are not analyzed in depth to show the overall fairness of allocations from different perspectives. Hence, we propose a series of fairness metrics for resource allocation in wireless networks, which evaluate individual, system, short and long term fairness. Our metrics are general enough to be adapted in either multiple or single resource sharing scenarios. Algorithms using these metrics for channel allocation problem in peer-to-peer wireless regional area network is proposed and simulated, and the results show that our metrics in conjunction with smart channel allocation strategies guarantee both the fairness and performances.

An overview of game-theoretic approaches to energy-efficient resource allocation in wireless networks is presented. Focusing on multiple-access networks, it is demonstrated that game theory can be used as an effective tool to study resource allocation in wireless networks with quality-of-service (QoS) constraints. A family of non-cooperative (distributed) games is presented in which each user seeks to choose a strategy that maximizes its own utility while satisfying its QoS requirements. The utility function considered here measures the number of reliable bits that are transmitted per joule of energy consumed and, hence, is particulary suitable for energy-constrained networks. The actions available to each user in trying to maximize its own utility are at least the choice of the transmit power and, depending on the situation, the user may also be able to choose its transmission rate, modulation, packet size, multiuser receiver, multi-antenna processing algorithm, or carrier allocation strategy. The best-response strategy and Nash equilibrium for each game is presented. Using this game-theoretic framework, the effects of power control, rate control, modulation, temporal and spatial signal processing, carrier allocation strategy and delay QoS constraints on energy efficiency and network capacity are quantified.

In a wireless communications network, the movement of mobile users presents significant technical challenges to providing efficient access to the wired broadband network. In this paper, we construct a new analytical/numerical model that characterizes mobile user behavior and the resultant traffic patterns. The model is based on a semi-Markov process representation of mobile user behavior in a general state-space. Using a new algorithm for parameter estimation of a general Hidden Semi-Markov Model (HSMM), we develop an efficient procedure for dynamically tracking the parameters of the model from incomplete data. We then apply our integrated model to obtain estimates of the computational and bandwidth resources required at the wireless/wired network interface to provide high performance wireless Internet access and quality-of-service to mobile users. Finally, we develop a threshold-based admission control scheme in the wireless network based on the velocity information that can be extracted from our model.

In this paper, we provide simulation results for the optimal channel-aware adaptive transmission, dynamic resource allocation and multiuser scheduling schemes for the downlink of a wireless cell that is assisted by a number of relays. The relays are half-duplex and apply a regenerative decode-and-forward scheme, and the channels are Rayleigh block-faded. We apply the optimal resource allocation scheme for two specific scheduling criteria, the maximum capacity scheduler and the proportional fair scheduler. For both scheduling schemes, we study the gains of using relays on the overall aggregate throughput of the system as well as for the individual users. Furthermore, we compare the performance versus the total number of relays and their locations in the wireless cell and we study the statistics of relays' usage. Moreover, we compare between the two scheduling schemes in terms of achievable rate and fairness among users.

SummaryIn this paper, we present a QoS‐driven energy efficient power and subcarrier allocation in green orthogonal frequency division multiple access networks. Our proposed scheme aims at maximizing the effective energy efficiency (EEE), defined as overall effective capacity per total power consumption, subject to given user delay‐QoS requirements and an average sum transmit power constraints. We analytically obtain the uniquely global optimal power and subcarrier using fractional programming, which transforms the fractional program into an equivalent parametric convex program that has a tractable solution. Analytical results show that the optimal solution has the same structure as effective capacity maximization and overall power minimization solutions. Simulation results show that there exists a trade‐off between EEE and delay. When the delay is more stringent, the EEE decreases. Moreover, when the number of subcarriers increase, EEE increases, where a fixed optimal EEE can be achieved regardless of stringency of delay‐QoS requirements. Furthermore, our proposed resource allocation provides significant EEE gains over both the independent resource allocation and overall power minimization schemes. Copyright © 2015 John Wiley & Sons, Ltd.

In this paper, a cross-layer resource allocation mechanism is proposed for wireless multimedia service.In particular, a game theory based on quality of service (QoS) for multimedia users is introduced to deal with the fairness of network resource allocation in wireless networks.Moreover, the channel states of wireless users are additionally regarded under the cross-layer design in WiMAX environment.In details, the bargaining solution is adopted to discover the efficient and fair resource allocation strategy for multimedia service in considering QoS in the peak signal-to-noise ratio (PSNR) and the channel states in the carrier-to-interface ratio (CINR).The proposed mechanism is illustrated and evaluated by simulation results of transmitting video sequences in WiMAX environment.

Проблематика. Сьогодні мобільний зв'язок зайнятий наданням IP-сервісів та передаванням мультимедійного контенту з одного місця в інше, але вже завтра нове покоління 5G зможе контролювати широкий спектр матеріальних об'єктів у реальному часі із лише незначним втручанням людини. Створюється так званий Інтернет речей «IoT» із безліччю нових привабливих програм. У поданій роботі розглянутий новий підхід до розподілу ресурсів для майбутніх безпроводових локальних мереж у складі мереж 5G.
\nМета досліджень. DIDO (Distributed Input Distributed Output) – нова технологія, яка направлена на надання послуг гнучкої багатокористувацької безпроводової мережі в усьому світі у межах міжнародного узгодження і конвенцій для використовуваних частот серед інших мобільних технологій для інтеграції з 5G. Техніка DIDO націлена на розподіл ресурсів для майбутніх мереж безпроводового зв'язку, які можуть використовувати широкий спектр «нетрадиційних» частот від 3 МГц до 30 ГГц і працювати незалежно одна від одної із повною пропускною спроможністю і високою швидкістю передачі даних на відстанях від 100 м до 1000 км.
\nМетодика реалізації. Був проведений аналіз усіх відомих публикацій, які присвячені новому поколінню мобільного зв'язку 5G. Досліджувались аспекти взаємодії 5G із WLAN, BT, WSN та іншими мікро- и пікорадіомережами. Розглянутий новий підхід до розподілу частотних ресурсів для майбутньої WLAN.
\nРезультати досліджень. Представлений огляд, а також обговорюються основні напрямки розробки майбутніх мереж мобільного радіозв'язку 5G за стандартом IMT 2020. Вони включають, окрім іншого, перспективну технологію DIDO (Distributed Input Distributed Output) для розподілу ресурсів для майбутніх мереж безпроводового зв'язку. Зазначена технологія повинна тільки розширити існуючу інфраструктуру мобільного радіозв'язку GERAN, UTRAN, SAE і IMS попередніх поколінь 2G – 4G за допомогою гнучкої «всесвітньої» WLAN, яка працює з використанням баз даних для доступних діапазонів частот та з доступом до Web-контенту на основі так званих DIDO-центрів (DIDO Data Centers). 
\nВисновки. Эфективні WLAN, у тому числі із використанням техноології DIDO, повинні стати частиною нових систем покоління 5G. У якості нового метода розподілу ресурсів для майбутніх безпроводових локальних мереж, з точки зору деяких провідних компаній, таких як Rearden, Microsoft, Samsung, Huawei, має бути використаний метод DIDO.

Future wireless networks are expected to support diverse Internet of Things (IoT) applications under dynamic network conditions through effective resource allocation. However, the growing complexity of underlying optimization problems for resource allocation has brought many challenges to traditional centralized network operations due to inherent computational constraints. To overcome these challenges, this paper proposes a Distributed-Optimization with Centralized-Refining (DO-CR) mechanism to achieve more efficient resource allocation by engaging both access point and all devices. Specifically, the new DO-CR mechanism first utilizes the distributed processing capacity of all devices, allowing them to optimize their own resource allocation schemes through a new resource reservation and reporting technique. Then a centralized optimizer generates a graph of resource trading topology based on individual optimization results and achieves the Pareto optimal solution by the graph-based algorithm. This Pareto optimal solution simplifies the overall optimization problem and enables the central optimizer to solve it with smaller feasible regions. The analysis presents that the DO-CR mechanism’s performance is bounded by Pareto optimality as lower limit and global optimality as upper limit. Simulation results demonstrate that the proposed DO-CR mechanism significantly reduces processing time on the centralized optimizer while maintaining near-optimal utility performance compared to conventional optimization methods.

Resource allocation in wireless networks, i.e., assigning time and frequency slots over specific terminals under spatio-temporal constraints, is a fundamental and challenging problem. Belief Propagation/message passing (inference) algorithms have been proposed for constraint satisfaction problems (CSP), since they are inherently amenable to distributed implementation. This work compares two message passing algorithms for time and frequency allocation, satisfying signal-to-interference-and-noise-ratio, half-duplex-radio operation and routing constraints. The first method periodically checks whether the constraints are satisfied locally and restarts specific messages, when the local constraints (encoded in corresponding factors) are not satisfied. The second method stochastically perturbs Belief Propagation, using Gibbs sampling. The methods are evaluated, based on how often they fail to converge to a valid (i.e., constraint-satisfying) allocation, coined as outage probability. Numerical results demonstrate that, as the maximum number of iterations increase, both methods decrease the outage probability. However, the restarting method offers faster convergence to a valid CSP solution. Future work will focus on next generation 5/6G wireless networks.

In this article, we study the trajectory control, subchannel assignment, and user association design for unmanned aerial vehicles (UAVs)-based wireless networks. We propose a method to optimize the max-min average rate subject to data demand constraints of ground users (GUs) where spectrum reuse and co-channel interference management are considered. The mathematical model is a mixed-integer nonlinear optimization problem which we solve by using the alternating optimization approach where we iteratively optimize the user association, subchannel assignment, and UAV trajectory control until convergence. For the subchannel assignment subproblem, we propose an iterative subchannel assignment (ISA) algorithm to obtain an efficient solution. Moreover, the successive convex approximation (SCA) is used to convexify and solve the nonconvex UAV trajectory control subproblem. Via extensive numerical studies, we illustrate the effectiveness of our proposed design considering different UAV flight periods and number of subchannels and GUs as compared with a simple heuristic.

Future wireless systems are being designed for extremely high data rates and are directly contributing to the global energy consumption. This trend is undesirable not only due to the environmental concerns, but to cost as well since energy costs are becoming a significant part of the operating expenditures for the telecom operators. Recently, energy efficient wireless systems have become a new research paradigm. Cooperative communication has shown good potential in improving coverage, providing robust radio links, reducing infrastructure cost, and has the possibility to reduce the total system energy consumption. This paper looks at possible deployment strategies for wireless networks that can reduce the energy consumption. We look at the tradeoff between the number of relay nodes and the number of base stations and their implications on the total energy consumption of wireless networks. The obtained results show that adaptive resource allocation between the base station and the relay node is an efficient way of reducing the energy consumption of the system. Furthermore, this reduction in energy consumption increases with increasing the system target spectral efficiency.