OpenFlow-Based Load Balancing in WLAN: Throughput Analysis

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.

The problem of optimal resource allocation in wireless networks usually involves scheduling of the network independent sets (ISs), of which the number increases exponentially in the network scale. To deal with such large-scale optimization problems, traditional approaches often resort to some heuristics or iterative algorithms for obtaining a relatively small set of ISs to solve the problems, but at the cost of suboptimality or long convergence time. In this paper, we consider wireless network resource allocation in dynamic flow environments, aiming at maximizing the network capacity. We propose a learning-based approach to find ISs based on the dynamic flow demands. Specifically, instead of searching for individual ISs, we propose to learn groups of ISs by using a deep belief network (DBN). We present detailed design of the DBN-based learning method including details in the offline training and online running phases. Simulation results demonstrate that our DBN-based method outperforms existing ones in terms of achieved network capacity and computation time.

Due to the large uncertainty of signal reception, the transmission speed of the wireless communication network resource allocation method is low. Based on social relations, a dynamic allocation method for wireless communication network resources is designed. Establish a wireless ad hoc network composed of a random number of nodes to determine the upper limit of its security capacity, and the nodes at the edge need to undertake more communication transmission loads on average. According to the similarity between users, a triple closed model is used to measure the social trust relationship in wireless communication networks. Considering the social trust and encounter frequency among users, the optimal relay node is selected for the wireless network communication link. The sum of data transmission rates under each allocation scheme is calculated and sorted in descending order, and resources are dynamically allocated based on the principle of maximum overall network throughput. Compared with other schemes through simulation, the dynamic allocation method of wireless communication network resources based on social relations can increase the network transmission speed and improve the communication performance.

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

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 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.

We consider the problem of resource allocation for data transfer between the base station and the users within a cell of a wireless telecommunication network with infinite data queues for each user. The aim is to study the tradeoff between the conflicting objectives of maximizing the system throughput and the quality of service (QoS) to an individual user. Using a policy improvement approach based on Markov decision processes, we develop an intuitive and easy-to-implement index policy. We also demonstrate its superior performance over the existing proportional fair metric algorithm through simulation experiments.

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.

Проблематика. Сьогодні мобільний зв'язок зайнятий наданням 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.

The massive growth of data consumption and the variety of wireless technology emergence has made the handover (HO) an attractive research topic nowadays, mainly due to the popularity of Wireless Local Area Networks (WLANs), which allow users to reach high-speed data communication while they are in movement. Moreover, mobile devices such as tablets and smartphones have also become increasingly popular due to their low cost and ease of use, and an increase in mobile device use is expected to accelerate in the coming years, along with the availability and use of applications such as real-time services and online gaming. The traditional HO methods will likely not meet the requirements of mobile devices for modern applications due to the lack of intelligence, lack of awareness Quality of Service (QoS) and Quality of Experience (QoE) requirements of mobile users. We, therefore, introduce a novel architecture that supports horizontal HO in homogenous networks. This architecture is based on the Software-Defined Wireless Networking (SDWN) concept, where the wireless network is controlled centrally and the wireless Access Points (APs) are programmable. In this architecture, HO algorithms will assist wireless users to find the network that could best support the application requirements through Quality of Service (QoS) and Quality of Experience (QoE) management policies. The first HO algorithm proposed in this thesis is called Quality of Experience Oriented Handover Algorithm. This algorithm will guarantee the best possible connectivity to the users in terms of their QoE and QoS requirements and outperforms the traditional methods in a sparse network environment. The second contribution is called Optimised Handover Algorithm for Dense WLAN Environments. This algorithm has been designed to address dense network environments via taking into consideration the Adaptive Hysteresis Value (AHV). The AHV will help the Optimised Handover Algorithm via reducing the so-called ping-pong effect. This contribution shows promising performance results by selecting the best candidate AP, decreasing the number of redundant HO and avoiding the ping-pong effect. The final contribution is called Priority Based Handover Algorithm. We extended our proposed SDWN architecture in order to include the concept of prioritising users and make a smart decision during the process of HO. This algorithm will prioritise a certain class of users to avoid the effect of the over-congestion. The results show that the approach based on priority outperforms the state of the art and provides better QoE to the high priority users despite the over-congestion situation.

— This article presents a time-aware admission control and resource allocation scheme in wireless networks, in the context of a future generation cellular network. The quality levels (and their respective utility) of different connections are specified using discrete resource-utility (R-U) functions. The scheme uses these R-U functions for allocating and reallocating bandwidth to connections, aiming to maximise the accumulated utility of the system. However, different applications react differently to resource reallocations. Therefore at each allocation time point the following factors are taken into account: the age of the connection, a disconnection (drop) penalty and the sensitiveness to reallocation frequency. The evaluation of our approach shows a superior performance compared to a recent adaptive bandwidth allocation scheme (RBBS). In addition we have studied the overhead that performing a reallocation imposes on the infrastructure. To minimise this overhead, we present an algorithm that efficiently reduces the number of reallocations, while remaining within a given utility bound.

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.

In this paper, we investigate the resource allocation in wireless cooperative networks with multiple selfish but friendly intermediate nodes. To improve the efficiency of power control, we propose a power allocation method based on two-stage Stackelberg game. In this method, the source node is modeled as the buyer, and the relay node and friendly interference node are modeled as sellers. In particular, the source node encourages intermediate nodes to participate in cooperative communication through price incentive, and purchases power from them to improve the system security rate. At the same time, intermediate nodes gain revenue by selling power. In addition, to make selected nodes achieve the maximum system security rate, we introduce a learning-theory based node selection algorithm. Finally, numeri-cal results show that the proposed power allocation method and node selection algorithm can achieve comparable performance to that traditional resource allocation methods.

The increased complexity of future 5G wireless communication networks presents a fundamental issue for optimal resource allocation. This continuous, constrained optimal control problem must be solved in real-time since the power allocation should be consistent with the instantly evolving channel state. This paper emphasizes the application of deep learning to develop solutions for radio resource allocation problems in multiple-input multiple-output systems. We introduce a supervised deep neural network model combined with particle swarm optimization to address the issue using heuristic-generated data. We train the model and evaluate its ability to anticipate resource allocation solutions accurately. The simulation result indicates that the trained DNN-based model can deliver the nearoptimal solution.