An intelligent call admission control algorithm for load balancing in 5G-satellite networks

A thesis submitted in partial fulfilment of the requirements of the University of Wolverhampton for the degree of Doctor of Philosophy.Cellular networks are projected to deal with an immense rise in data traffic, as well as an enormous and diverse device, plus advanced use cases, in the nearest future; hence, future 5G networks are being developed to consist of not only 5G but also different RATs integrated. In addition to 5G, the user’s device (UD) will be able to connect to the network via LTE, WiMAX, Wi-Fi, Satellite, and other technologies. On the other hand, Satellite has been suggested as a preferred network to support 5G use cases. Satellite networks are among the most sophisticated communication technologies which offer specific benefits in geographically dispersed and dynamic networks. Utilising their inherent advantages in broadcasting capabilities, global coverage, decreased dependency on terrestrial infrastructure, and high security, they offer highly efficient, effective, and rapid network deployments. Satellites are more suited for large-scale communications than terrestrial communication networks. Due to their extensive service coverage and strong multilink transmission capabilities, satellites offer global high-speed connectivity and adaptable access systems. The convergence of 5G technology and satellite networks therefore marks a significant milestone in the evolution of global connectivity. However, this integration introduces a complex problem related to resource management, particularly in Satellite – Terrestrial Integrated Networks (STINs). The key issue at hand is the efficient allocation of resources in STINs to enhance Quality of Service (QoS) for users. The root cause of this issue originates from a vast quantity of users sharing these resources, the dynamic nature of generated traffic, the scarcity of wireless spectrum resources, and the random allocation of wireless channels. Hence, resource allocation is critical to ensure user satisfaction, fair traffic distribution, maximised throughput, and minimised congestion. Achieving load balancing is essential to guarantee an equal amount of traffic distributed between different RATs in a heterogeneous wireless network; this would enable optimal utilisation of the radio resources and lower the likelihood of call blocking/dropping. This research endeavours to address this challenge through the development and evaluation of an intelligent call admission control (CAC) algorithm based on Enhanced Particle Swarm Optimization (EPSO). The primary aim of this research is to design an EPSO-based CAC algorithm tailored specifically for 5G-satellite heterogeneous wireless networks. The algorithm's objectives include maximising the number of admitted calls while maintaining Quality of Service (QoS) for existing users, improving network resource utilization, reducing congestion, ensuring fairness, and enhancing user satisfaction. To achieve these objectives, a detailed research methodology is outlined, encompassing algorithm development, numerical simulations, and comparative analysis. The proposed EPSO algorithm is benchmarked against alternative artificial intelligence and machine learning algorithms, including the Artificial Bee Colony algorithm, Simulated Annealing algorithm, and Q-Learning algorithm. Performance metrics such as throughput, call blocking rates, and fairness are employed to evaluate the algorithms' efficacy in achieving load-balancing objectives. The experimental findings yield insights into the performance of the EPSO-based CAC algorithm and its comparative advantages over alternative techniques. Through rigorous analysis, this research elucidates the EPSO algorithm's strengths in dynamically adapting to changing network conditions, optimising resource allocation, and ensuring equitable distribution of traffic among different RATs. The result shows the EPSO algorithm outperforms the other 3 algorithms in all the scenarios. The contributions of this thesis extend beyond academic research, with potential societal implications including enhanced connectivity, efficiency, and user experiences in 5G-Satellite heterogeneous wireless networks. By advancing intelligent resource management techniques, this research paves the way for improved network performance and reliability in the evolving landscape of wireless communication

Efficient and Virtualized Scheduling for OFDM-Based High Mobility Wireless Communications Objects

Services providers (SPs) in the radio platform technology standard long term evolution (LTE) systems are enduring many challenges in order to accommodate the rapid expansion of mobile data usage. The modern technologies demonstrate new challenges to SPs, for example, reducing the cost of the capital and operating expenditures while supporting high data throughput per customer, extending battery life-per-charge of the cell phone devices, and supporting high mobility communications with fast and seamless handover (HO) networking architecture. In this thesis, a variety of optimized techniques aimed at providing innovative solutions for such challenges are explored. The thesis is divided into three parts. The first part outlines the benefits and challenges of deploying virtualized resource sharing concept. Wherein, SPs achieving a different schedulers policy are sharing evolved network B, allowing SPs to customize their efforts and provide service requirements; as a promising solution for reducing operational and capital expenditures, leading to potential energy savings, and supporting higher peak rates. The second part, formulates the optimized power allocation problem in a virtualized scheme in LTE uplink systems, aiming to extend the mobile devices’ battery utilization time per charge. While, the third part extrapolates a proposed hybrid-HO (HY-HO) technique, that can enhance the system performance in terms of latency and HO reliability at cell boundary for high mobility objects (up to 350 km/hr; wherein, HO will occur more frequent). The main contributions of this thesis are in designing optimal binary integer programmingbased and suboptimal heuristic (with complexity reduction) scheduling algorithms subject to exclusive and contiguous allocation, maximum transmission power, and rate constraints. Moreover, designing the HY-HO based on the combination of soft and hard HO was able to enhance the system performance in term of latency, interruption time and reliability during HO. The results prove that the proposed solutions effectively contribute in addressing the challenges caused by the demand for high data rates and power transmission in mobile networks especially in virtualized resources sharing scenarios that can support high data rates with improving quality of services (QoSs)

Mobile and Wireless Communications

Mobile and Wireless Communications have been one of the major revolutions of the late twentieth century. We are witnessing a very fast growth in these technologies where mobile and wireless communications have become so ubiquitous in our society and indispensable for our daily lives. The relentless demand for higher data rates with better quality of services to comply with state-of-the art applications has revolutionized the wireless communication field and led to the emergence of new technologies such as Bluetooth, WiFi, Wimax, Ultra wideband, OFDMA. Moreover, the market tendency confirms that this revolution is not ready to stop in the foreseen future. Mobile and wireless communications applications cover diverse areas including entertainment, industrialist, biomedical, medicine, safety and security, and others, which definitely are improving our daily life. Wireless communication network is a multidisciplinary field addressing different aspects raging from theoretical analysis, system architecture design, and hardware and software implementations. While different new applications are requiring higher data rates and better quality of service and prolonging the mobile battery life, new development and advanced research studies and systems and circuits designs are necessary to keep pace with the market requirements. This book covers the most advanced research and development topics in mobile and wireless communication networks. It is divided into two parts with a total of thirty-four stand-alone chapters covering various areas of wireless communications of special topics including: physical layer and network layer, access methods and scheduling, techniques and technologies, antenna and amplifier design, integrated circuit design, applications and systems. These chapters present advanced novel and cutting-edge results and development related to wireless communication offering the readers the opportunity to enrich their knowledge in specific topics as well as to explore the whole field of rapidly emerging mobile and wireless networks. We hope that this book will be useful for students, researchers and practitioners in their research studies

Game theory for dynamic spectrum sharing cognitive radio

This thesis was submitted for the degree of Doctor of Philosophy and was awarded by Brunel University on 21 June 2010.‘Game Theory’ is the formal study of conflict and cooperation. The theory is based on a set of tools that have been developed in order to assist with the modelling and analysis of individual, independent decision makers. These actions potentially affect any decisions, which are made by other competitors. Therefore, it is well suited and capable of addressing the various issues linked to wireless communications. This work presents a Green Game-Based Hybrid Vertical Handover Model. The model is used for heterogeneous wireless networks, which combines both dynamic (Received Signal Strength and Node Mobility) and static (Cost, Power Consumption and Bandwidth) factors. These factors control the handover decision process; whereby the mechanism successfully eliminates any unnecessary handovers, reduces delay and overall number of handovers to 50% less and 70% less dropped packets and saves 50% more energy in comparison to other mechanisms. A novel Game-Based Multi-Interface Fast-Handover MIPv6 protocol is introduced in this thesis as an extension to the Multi-Interface Fast-handover MIPv6 protocol. The protocol works when the mobile node has more than one wireless interface. The protocol controls the handover decision process by deciding whether a handover is necessary and helps the node to choose the right access point at the right time. In addition, the protocol switches the mobile nodes interfaces ‘ON’ and ‘OFF’ when needed to control the mobile node’s energy consumption and eliminate power lost of adding another interface. The protocol successfully reduces the number of handovers to 70%, 90% less dropped packets, 40% more received packets and acknowledgments and 85% less end-to-end delay in comparison to other Protocols. Furthermore, the thesis adapts a novel combination of both game and auction theory in dynamic resource allocation and price-power-based routing in wireless Ad-Hoc networks. Under auction schemes, destinations nodes bid the information data to access to the data stored in the server node. The server will allocate the data to the winner who values it most. Once the data has been allocated to the winner, another mechanism for dynamic routing is adopted. The routing mechanism is based on the source-destination cooperation, power consumption and source-compensation to the intermediate nodes. The mechanism dramatically increases the seller’s revenue to 50% more when compared to random allocation scheme and briefly evaluates the reliability of predefined route with respect to data prices, source and destination cooperation for different network settings. Last but not least, this thesis adjusts an adaptive competitive second-price pay-to-bid sealed auction game and a reputation-based game. This solves the fairness problems associated with spectrum sharing amongst one primary user and a large number of secondary users in a cognitive radio environment. The proposed games create a competition between the bidders and offers better revenue to the players in terms of fairness to more than 60% in certain scenarios. The proposed game could reach the maximum total profit for both primary and secondary users with better fairness; this is illustrated through numerical results

Analytical Performance Evaluation of Cooperative and Multi-Radio Concepts in Emerging Wireless Networks

<br/

Resource allocation in networks from a connection-level perspective (Asignación de recursos en redes desde la perspectiva de las conexiones)

En esta tesis, se analizan varios problemas de asignación recursos que surgen en el estudio de los sistemas de telecomunicaciones. En particular, nos centramos en las redes de datos, de los cuales el ejemplo más importante es la Internet global. En este tipo de redes, el recurso escaso que debe ser asignado es la cantidad de ancho de banda de cada conexión curso. Esta asignación realiza en tiempo real por los protocolos subyacentes, que técniamente se encuentran divididos en varios niveles o capas. Desde este punto de vista, la red puede ser pensada como un sistema de control a gran escala, donde cada entidad debe seguir un conjunto dado de leyes de control, a fin de encontrar una asignación adecuada de recursos. Desde el influyente trabajo de Kelly et. al., este problema se ha expresado en términos económicos, dando lugar a la teoría conocida como Network Utility Maximization (maximización de utilidad en redes). Este marco ha demostrado ser una herramienta valiosa para analizar los mecanismos existentes y diseño de protocolos nuevos que mejoran el comportamiento de la red. Proporciona además un vínculo crucial entre el tradicional análisis por capas de los protocolos de red y las técnicas de optimización convexa, dando lugar a lo que se denomina análisis multi-capa de las redes. En este trabajo nos centramos en el análisis de la red desde una perspectiva a nivel de conexiones. En particular, se estudia el desempeño de eficiencia y justicia en la escala de conexiones de varios modelos de asignación de recursos en la red. Este estudio se realiza en varios escenarios: tanto single-path como multi-path (redes con múltiples caminos) así como escenarios cableados e inalámbricos. Se analizan en detalle dos problemas importantes: por un lado, la asignación de los recursos realizada por los protocolos de control de congestión cuando se permiten varias conexiones por usuario. Se identifican algunos problemas del paradigma actual, y se propone un nuevo concepto de \emph{equidad centrada en el usuario}, desarrollando a su vez algoritmos descentralizados que se pueden aplicar en los extremos de la red, y que conducen al sistema a un global adecuado. El segundo problema importante analizado aquí es la asignación de los recursos realizada por los algoritmos de control de congestión cuando trabajan sobre una capa física que permite múltiples velocidades de transmisión como es el caso en las redes inalámbricas. Se demuestra que los algoritmos usuales conducen a ineficiencias importantes desde el punto de vista de las conexiones, y se proponen mecanismos para superar estas ineficiencias y mejorar la asignación de los recursos prestados por dichas redes. A lo largo de este trabajo, se aplican varias herramientas matemáticas, tales como la optimización convexa, la teoría de control y los procesos estocásticos. Por medio de estas herramientas, se construye un modelo del sistema, y se desarrollan leyes de control y algoritmos para lograr el objetivo de desempeño deseado. Como paso final, estos algoritmos fueron probados a través de simulaciones a nivel de paquetes de las redes involucradas, proporcionando la validación de la teoría y la evidencia de que pueden aplicarse en la práctica

Recent Advances in Wireless Communications and Networks

This book focuses on the current hottest issues from the lowest layers to the upper layers of wireless communication networks and provides "real-time" research progress on these issues. The authors have made every effort to systematically organize the information on these topics to make it easily accessible to readers of any level. This book also maintains the balance between current research results and their theoretical support. In this book, a variety of novel techniques in wireless communications and networks are investigated. The authors attempt to present these topics in detail. Insightful and reader-friendly descriptions are presented to nourish readers of any level, from practicing and knowledgeable communication engineers to beginning or professional researchers. All interested readers can easily find noteworthy materials in much greater detail than in previous publications and in the references cited in these chapters

A framework for the dynamic management of Peer-to-Peer overlays

Peer-to-Peer (P2P) applications have been associated with inefficient operation, interference with other network services and large operational costs for network providers. This thesis presents a framework which can help ISPs address these issues by means of intelligent management of peer behaviour. The proposed approach involves limited control of P2P overlays without interfering with the fundamental characteristics of peer autonomy and decentralised operation. At the core of the management framework lays the Active Virtual Peer (AVP). Essentially intelligent peers operated by the network providers, the AVPs interact with the overlay from within, minimising redundant or inefficient traffic, enhancing overlay stability and facilitating the efficient and balanced use of available peer and network resources. They offer an “insider‟s” view of the overlay and permit the management of P2P functions in a compatible and non-intrusive manner. AVPs can support multiple P2P protocols and coordinate to perform functions collectively. To account for the multi-faceted nature of P2P applications and allow the incorporation of modern techniques and protocols as they appear, the framework is based on a modular architecture. Core modules for overlay control and transit traffic minimisation are presented. Towards the latter, a number of suitable P2P content caching strategies are proposed. Using a purpose-built P2P network simulator and small-scale experiments, it is demonstrated that the introduction of AVPs inside the network can significantly reduce inter-AS traffic, minimise costly multi-hop flows, increase overlay stability and load-balancing and offer improved peer transfer performance

Power allocation for optimal synchronization of CDMA and UWB signals based on game theory

This thesis describes a theoretical framework for the design and the analysis of distributed (decentralized) power control algorithms for wireless networks using ultrawideband (UWB) technologies over a frequency-selective and slow-fading channel, focusing of the issue of initial code synchronization. The framework described here is general enough to also encompass the analysis of Code Division Multiple Access (CDMA) systems, seen as a special case of the Impulse-Radio (IR)-UWB technology. To develop this work, we use the tools of game theory that are expedient for deriving scalable, energy-efficient, distributed power control schemes to be applied to a population of battery-operated user terminals in a rich multipath environment. The power control issue is modeled as a noncooperative game in which each transmitter-receiver pair chooses its transmit power and detection threshold pair so as to maximize its own utility, which is defined as the ratio of the probability of signal detection to the transmitted energy per acquisition period (or per bit)

Resource Allocation in Relay-based Satellite and Wireless Communication Networks

A two-level bandwidth allocation scheme is proposed for a slotted Time-Division Multiple Access high data rate relay satellite communication link to provide efficient and fair channel utilization. The long-term allocation is implemented to provide per-flow/per-user Quality-of-Service guarantees and shape the average behavior. The time-varying short-term allocation is determined by solving an optimal timeslot scheduling problem based on the requests and other parameters. Through extensive simulations, the performance of a suitable MAC protocol with two-level bandwidth allocation is analyzed and compared with that of the existing static fixed-assignment scheme in terms of end-to-end delay and successful throughput. It is also shown that pseudo-proportional fairness is achieved for our hybrid protocol. We study rate control systems with heterogeneous time-varying propagation delays, based on analytic fluid flow models composed of first-order delay-differential equations. Both single-flow and multi-flow system models are analyzed, with special attention paid to the Mitra-Seery algorithm. The stationary solutions are investigated. For the fluctuating solutions, their dynamic behavior is analyzed in detail, analytically and numerically, in terms of amplitude, transient behavior, fairness and adaptability, etc.. Especially the effects of heterogeneous time-varying delays are investigated. It is shown that with proper parameter design the system can achieve stable behavior with close to pointwise proportional fairness among flows. Finally we investigate the resource allocation in 802.16j multi-hop relay systems with rate fairness constraints for two mutually exclusive options: transparent and non-transparent relay systems (T-RS and NT-RS). Single-Input Single-Output and Multi-Input Multi-Output antenna systems are considered in the links between the Base Station (BS) and Relay Stations (RS). 1 and 3 RSs per sector are considered. The Mobile Station (MS) association rule, which determines the access station (BS or RS) for each MS, is also studied. Two rules: Highest MCS scheme with the highest modulation and coding rate, and Highest (Mod) ESE scheme with the highest (modified) effective spectrum efficiency, are studied along with the optimal rule that maximizes system capacity with rate fairness constraints. Our simulation results show that the highest capacity is always achieved by NT-RS with 3 RSs per sector in distributed scheduling mode, and that the Highest (Mod) ESE scheme performs closely to the optimal rule in terms of system capacity