Exploring analytical models for proactive resource management in highly mobile environments

In order to provide ubiquitous communication, seamless connectivity is now required in all environments including highly mobile networks. By using vertical handover techniques it is possible to provide uninterrupted communication as connections are dynamically switched between wireless networks as users move around. However, in a highly mobile environment, traditional reactive approaches to handover are inadequate. Therefore, proactive handover techniques, in which mobile nodes attempt to determine the best time and place to handover to local networks, are actively being investigated in the context of next-generation mobile networks. Using this approach, it is possible to enhance channel allocation and resource management by using probabilistic mechanisms; because, it is possible to explicitly detect contention for resources. This paper presents a proactive approach for resource allocation in highly mobile networks and analyzed the user contention for common resources such as radio channels in highly mobile wireless networks. The proposed approach uses an analytical modelling approach to model the contention and results are obtained showing enhanced system performance. Based on these results an operational space has been explored and are shown to be useful for emerging future networks such as 5G by allowing base stations to calculate the probability of contention based on the demand for network resources. This study indicates that the proactive model enhances handover and resource allocation for highly mobile networks. This paper analyzed the effects of and alpha and beta, in effect, how these parameters affect the proactive resource allocation requests in the contention queue has been modelled for any given scenario from the conference paper "Exploring analytical models to maintain quality-of-service for resource management using a proactive approach in highly mobile environments"

Exploiting user contention to optimize proactive resource allocation in future networks

In order to provide ubiquitous communication, seamless connectivity is now required in all environments including highly mobile networks. By using vertical handover techniques it is possible to provide uninterrupted communication as connections are dynamically switched between wireless networks as users move around. However, in a highly mobile environment, traditional reactive approaches to handover are inadequate. Therefore, proactive handover techniques, in which mobile nodes attempt to determine the best time and place to handover to local networks, are actively being investigated in the context of next generation mobile networks. The Y-Comm Framework which looks at proactive handover techniques has de�fined two key parameters: Time Before Handover and the Network Dwell Time, for any given network topology. Using this approach, it is possible to enhance resource management in common networks using probabilistic mechanisms because it is now possible to express contention for resources in terms of: No Contention, Partial Contention and Full Contention. As network resources are shared between many users, resource management must be a key part of any communication system as it is needed to provide seamless communication and to ensure that applications and servers receive their required Quality-of-Service. In this thesis, the contention for channel resources being allocated to mobile nodes is analysed. The work presents a new methodology to support proactive resource allocation for emerging future networks such as Vehicular Ad-Hoc Networks (VANETs) by allowing us to calculate the probability of contention based on user demand of network resources. These results are veri�ed using simulation. In addition, this proactive approach is further enhanced by the use of a contention queue to detect contention between incoming requests and those waiting for service. This thesis also presents a new methodology to support proactive resource allocation for future networks such as Vehicular Ad-Hoc Networks. The proposed approach has been applied to a vehicular testbed and results are presented that show that this approach can improve overall network performance in mobile heterogeneous environments. The results show that the analysis of user contention does provide a proactive mechanism to improve the performance of resource allocation in mobile networks

A survey of machine learning techniques applied to self organizing cellular networks

In this paper, a survey of the literature of the past fifteen years involving Machine Learning (ML) algorithms applied to self organizing cellular networks is performed. In order for future networks to overcome the current limitations and address the issues of current cellular systems, it is clear that more intelligence needs to be deployed, so that a fully autonomous and flexible network can be enabled. This paper focuses on the learning perspective of Self Organizing Networks (SON) solutions and provides, not only an overview of the most common ML techniques encountered in cellular networks, but also manages to classify each paper in terms of its learning solution, while also giving some examples. The authors also classify each paper in terms of its self-organizing use-case and discuss how each proposed solution performed. In addition, a comparison between the most commonly found ML algorithms in terms of certain SON metrics is performed and general guidelines on when to choose each ML algorithm for each SON function are proposed. Lastly, this work also provides future research directions and new paradigms that the use of more robust and intelligent algorithms, together with data gathered by operators, can bring to the cellular networks domain and fully enable the concept of SON in the near future

Exploiting resource contention in highly mobile environments and its application to vehicular ad-hoc networks

As network resources are shared between many users, resource management must be a key part of any communication system as it is needed to provide seamless communication and to ensure that applications and servers receive their required Quality-of-Service. However, mobile environments also need to consider handover issues. Furthermore, in a highly mobile environment, traditional reactive approaches to handover are inadequate and thus proactive techniques have been investigated. Recent research in proactive handover techniques, defined two key parameters: Time Before Handover and Network Dwell Time for a mobile node in any given networking topology. Using this approach, it is possible to enhance resource management in common networks using probabilistic mechanisms because it is possible to express contention for resources in terms of: No Contention, Partial Contention and Full Contention. This proactive approach is further enhanced by the use of a contention queue to detect contention between incoming requests and those waiting for service. This paper therefore presents a new methodology to support proactive resource allocation for future networks such as Vehicular Ad-Hoc Networks. The proposed approach has been applied to a vehicular testbed and results are presented that show that this approach can improve overall network performance in mobile heterogeneous environments

Exploring intelligent service migration in a highly mobile network

Mobile services allow services to be migrated or replicated closer to users as they move around. This is now regarded as a viable mechanism to provide good Quality of Service to users in highly mobile environments such as vehicular networks. The vehicular environment is rapidly becoming a significant part of the internet and this presents various challenges that must be addressed; this is due to continuous handovers as mobile devices change their point of attachment to these networks resulting in a loss of service. Therefore, this explains the need to build a framework for intelligent service migration. This thesis addresses these issues. It starts by discussing the requirements for intelligent service migration. Then it investigates a low latency Quality of Service Aware Framework as well as an experimental transport protocol that would be favoured by vehicular networks. Furthermore, two analytical models are developed using the Zero-Server Markov Chain technique which is a way of analysing scenarios when the server is not continuously available to serve. Using the Zero-Server Markov Chain, the first analytical model looks at lost service due to continuous handovers and the communication dynamics of vehicular networks, while the second model analyses how service migration affects service delivery in these networks. Formulas are developed to yield the average number of packets in the system, the response time, the probability of blocking and a new parameter called the probability of lost service. These formulas are then applied to the Middlesex VANET Testbed to look at reactive and proactive service migration. These techniques are then incorporated into a new Service Management Framework to provide sustainable Quality of Service and Quality of Experience to mobile users in vehicular networks. This thesis also shows that this new approach is better than current approaches as it addresses key issues in intelligent service migration in such environments, and hence can play a significant part in the development of Intelligent Transport Systems for Smart Cities

Matching Theory for Future Wireless Networks: Fundamentals and Applications

The emergence of novel wireless networking paradigms such as small cell and cognitive radio networks has forever transformed the way in which wireless systems are operated. In particular, the need for self-organizing solutions to manage the scarce spectral resources has become a prevalent theme in many emerging wireless systems. In this paper, the first comprehensive tutorial on the use of matching theory, a Nobelprize winning framework, for resource management in wireless networks is developed. To cater for the unique features of emerging wireless networks, a novel, wireless-oriented classification of matching theory is proposed. Then, the key solution concepts and algorithmic implementations of this framework are exposed. Then, the developed concepts are applied in three important wireless networking areas in order to demonstrate the usefulness of this analytical tool. Results show how matching theory can effectively improve the performance of resource allocation in all three applications discussed