SCALABLE AND EFFICIENT VERTICAL HANDOVER DECISION ALGORITHMS IN VEHICULAR NETWORK CONTEXTS

A finales de los años noventa, y al comienzo del nuevo milenio, las redes inalámbricas han evolucionado bastante, pasando de ser sólo una tecnología prometedora para convertirse en un requisito para las actividades cotidianas en las sociedades desarrolladas. La infraestructura de transporte también ha evolucionado, ofreciendo comunicación a bordo para mejorar la seguridad vial y el acceso a contenidos de información y entretenimiento. Los requisitos de los usuarios finales se han hecho dependientes de la tecnología, lo que significa que sus necesidades de conectividad han aumentado debido a los diversos requisitos de las aplicaciones que se ejecutan en sus dispositivos móviles, tales como tabletas, teléfonos inteligentes, ordenadores portátiles o incluso ordenadores de abordo (On-Board Units (OBUs)) dentro de los vehículos. Para cumplir con dichos requisitos de conectividad, y teniendo en cuenta las diferentes redes inalámbricas disponibles, es necesario adoptar técnicas de Vertical Handover (VHO) para cambiar de red de forma transparente y sin necesidad de intervención del usuario. El objetivo de esta tesis es desarrollar algoritmos de decisión (Vertical Handover Decision Algorithms (VHDAs)) eficientes y escalables, optimizados para el contexto de las redes vehiculares. En ese sentido se ha propuesto, desarrollado y probado diferentes algoritmos de decisión basados en la infraestructura disponible en las actuales, y probablemente en las futuras, redes inalámbricas y redes vehiculares. Para ello se han combinado diferentes técnicas, métodos computacionales y modelos matemáticos, con el fin de garantizar una conectividad apropiada, y realizando el handover hacia las redes más adecuadas de manera a cumplir tanto con los requisitos de los usuarios como los requisitos de las aplicaciones. Con el fin de evaluar el contexto, se han utilizado diferentes herramientas para obtener información variada, como la disponibilidad de la red, el estado de la red, la geolocalizaciónMárquez Barja, JM. (2012). SCALABLE AND EFFICIENT VERTICAL HANDOVER DECISION ALGORITHMS IN VEHICULAR NETWORK CONTEXTS [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/17869Palanci

Simulating resource management in fog computing systems

The fog computing paradigm was introduced to address the new challenges and requirements posed by the Internet of Things (IoT). It extends the cloud to the edge of the network, thereby facilitating processing and storing a massive amount of data where it is created and used. This novel computing paradigm is widely studied in both the academy and the industry, primarily by simulation. Today, a large variety of edge and fog computing simulators exist and are reviewed by several surveys. These reviews, however, mainly focus on high-level comparisons of these simulators and often make contradictory statements, which makes it difficult to assess what studies are feasible with a simulation tool. To address these challenges, we focus on a single state-of-the-art fog simulation tool, iFogSim2. In this paper, we provide an in-depth review of the simulator and examine its model, assumptions, and technical characteristics. Our analysis describes the details of fog resource management mechanisms implemented by iFogSim2 and discusses what it is capable of and where its limitations lie. We construct a case study to assess the tool's suitability for a mobile 5G scenario, namely, road surface weather analysis with smart vehicles. The case study is used to retrieve qualitative results of what is feasible with the tool, and what is not. We demonstrate that iFogSim2 has a valid locality model for the mobile 5G use case, but it is not suitable for experimenting with vehicular fog computing, dynamic placement, server-side service discovery, and load-balancing. In addition, we present a modeling and analytics framework, built for iFogSim2, to improve the simulation software and facilitate future research with the tool

Profiling Energy Efficiency of Mobile Crowdsensing Data Collection Frameworks for Smart City Applications

Mobile crowdsensing (MCS) has emerged in the last years and has become one of the most prominent paradigms for urban sensing. In MCS, citizens actively participate in the sensing process by contributing data with their smartphones, tablets, wearables and other mobile devices to a collector. As citizens sustain costs while contributing data, i.e., the energy spent from the batteries for sensing and reporting, devising energy efficient data collection frameworks (DCFs) is essential. In this work, we compare the energy efficiency of several DCFs through CrowdSenSim, which allows to perform large-scale simulation experiments in realistic urban environments. Specifically, the DCFs under analysis differ one with each other by the data reporting mechanism implemented and the signaling between users and the collector needed for sensing and reporting decisions. Results reveal that the key criterion differentiating DCFs' energy consumption is the data reporting mechanism. In principle, continuous reporting to the collector should be more energy consuming than probabilistic reporting. However, DCFs with continuous reporting that implement mechanisms to block sensing and data delivery after a certain amount of contribution are more effective in harvesting data from the crowd

Why Energy Matters? Profiling Energy Consumption of Mobile Crowdsensing Data Collection Frameworks

Mobile Crowdsensing (MCS) has emerged in the last years and has become one of the most prominent paradigms for urban sensing. The citizens actively participate in the sensing process by contributing data with their mobile devices. To produce data, citizens sustain costs, i.e., the energy consumed for sensing and reporting operations. Hence, devising energy efficient data collection frameworks (DCF) is essential to foster participation. In this work, we investigate from an energy-perspective the performance of different DCFs. Our methodology is as follows: (i) we developed an Android application that implements the DCFs, (ii) we profiled the energy and network performance with a power monitor and Wireshark, (iii) we included the obtained traces into CrowdSenSim simulator for large-scale evaluations in city-wide scenarios such as Luxembourg, Turin and Washington DC. The amount of collected data, energy consumption and fairness are the performance indexes evaluated. The results unveil that DCFs with continuous data reporting are more energy-efficient and fair than DCFs with probabilistic reporting. The latter exhibit high variability of energy consumption, i.e., to produce the same amount of data, the associated energy cost of different users can vary significantly

Building the Future Internet through FIRE

The Internet as we know it today is the result of a continuous activity for improving network communications, end user services, computational processes and also information technology infrastructures. The Internet has become a critical infrastructure for the human-being by offering complex networking services and end-user applications that all together have transformed all aspects, mainly economical, of our lives. Recently, with the advent of new paradigms and the progress in wireless technology, sensor networks and information systems and also the inexorable shift towards everything connected paradigm, first as known as the Internet of Things and lately envisioning into the Internet of Everything, a data-driven society has been created. In a data-driven society, productivity, knowledge, and experience are dependent on increasingly open, dynamic, interdependent and complex Internet services. The challenge for the Internet of the Future design is to build robust enabling technologies, implement and deploy adaptive systems, to create business opportunities considering increasing uncertainties and emergent systemic behaviors where humans and machines seamlessly cooperate

Building the Future Internet through FIRE

The Internet as we know it today is the result of a continuous activity for improving network communications, end user services, computational processes and also information technology infrastructures. The Internet has become a critical infrastructure for the human-being by offering complex networking services and end-user applications that all together have transformed all aspects, mainly economical, of our lives. Recently, with the advent of new paradigms and the progress in wireless technology, sensor networks and information systems and also the inexorable shift towards everything connected paradigm, first as known as the Internet of Things and lately envisioning into the Internet of Everything, a data-driven society has been created. In a data-driven society, productivity, knowledge, and experience are dependent on increasingly open, dynamic, interdependent and complex Internet services. The challenge for the Internet of the Future design is to build robust enabling technologies, implement and deploy adaptive systems, to create business opportunities considering increasing uncertainties and emergent systemic behaviors where humans and machines seamlessly cooperate

Novel applications and contexts for the cognitive packet network

Autonomic communication, which is the development of self-configuring, self-adapting, self-optimising and self-healing communication systems, has gained much attention in the network research community. This can be explained by the increasing demand for more sophisticated networking technologies with physical realities that possess computation capabilities and can operate successfully with minimum human intervention. Such systems are driving innovative applications and services that improve the quality of life of citizens both socially and economically. Furthermore, autonomic communication, because of its decentralised approach to communication, is also being explored by the research community as an alternative to centralised control infrastructures for efficient management of large networks. This thesis studies one of the successful contributions in the autonomic communication research, the Cognitive Packet Network (CPN). CPN is a highly scalable adaptive routing protocol that allows for decentralised control in communication. Consequently, CPN has achieved significant successes, and because of the direction of research, we expect it to continue to find relevance. To investigate this hypothesis, we research new applications and contexts for CPN. This thesis first studies Information-Centric Networking (ICN), a future Internet architecture proposal. ICN adopts a data-centric approach such that contents are directly addressable at the network level and in-network caching is easily supported. An optimal caching strategy for an information-centric network is first analysed, and approximate solutions are developed and evaluated. Furthermore, a CPN inspired forwarding strategy for directing requests in such a way that exploits the in-network caching capability of ICN is proposed. The proposed strategy is evaluated via discrete event simulations and shown to be more effective in its search for local cache hits compared to the conventional methods. Finally, CPN is proposed to implement the routing system of an Emergency Cyber-Physical System for guiding evacuees in confined spaces in emergency situations. By exploiting CPN’s QoS capabilities, different paths are assigned to evacuees based on their ongoing health conditions using well-defined path metrics. The proposed system is evaluated via discrete-event simulations and shown to improve survival chances compared to a static system that treats evacuees in the same way.Open Acces

A Game-Theoretic Approach to Strategic Resource Allocation Mechanisms in Edge and Fog Computing

With the rapid growth of Internet of Things (IoT), cloud-centric application management raises questions related to quality of service for real-time applications. Fog and edge computing (FEC) provide a complement to the cloud by filling the gap between cloud and IoT. Resource management on multiple resources from distributed and administrative FEC nodes is a key challenge to ensure the quality of end-user’s experience. To improve resource utilisation and system performance, researchers have been proposed many fair allocation mechanisms for resource management. Dominant Resource Fairness (DRF), a resource allocation policy for multiple resource types, meets most of the required fair allocation characteristics. However, DRF is suitable for centralised resource allocation without considering the effects (or feedbacks) of large-scale distributed environments like multi-controller software defined networking (SDN). Nash bargaining from micro-economic theory or competitive equilibrium equal incomes (CEEI) are well suited to solving dynamic optimisation problems proposing to ‘proportionately’ share resources among distributed participants. Although CEEI’s decentralised policy guarantees load balancing for performance isolation, they are not faultproof for computation offloading. The thesis aims to propose a hybrid and fair allocation mechanism for rejuvenation of decentralised SDN controller deployment. We apply multi-agent reinforcement learning (MARL) with robustness against adversarial controllers to enable efficient priority scheduling for FEC. Motivated by software cybernetics and homeostasis, weighted DRF is generalised by applying the principles of feedback (positive or/and negative network effects) in reverse game theory (GT) to design hybrid scheduling schemes for joint multi-resource and multitask offloading/forwarding in FEC environments. In the first piece of study, monotonic scheduling for joint offloading at the federated edge is addressed by proposing truthful mechanism (algorithmic) to neutralise harmful negative and positive distributive bargain externalities respectively. The IP-DRF scheme is a MARL approach applying partition form game (PFG) to guarantee second-best Pareto optimality viii | P a g e (SBPO) in allocation of multi-resources from deterministic policy in both population and resource non-monotonicity settings. In the second study, we propose DFog-DRF scheme to address truthful fog scheduling with bottleneck fairness in fault-probable wireless hierarchical networks by applying constrained coalition formation (CCF) games to implement MARL. The multi-objective optimisation problem for fog throughput maximisation is solved via a constraint dimensionality reduction methodology using fairness constraints for efficient gateway and low-level controller’s placement. For evaluation, we develop an agent-based framework to implement fair allocation policies in distributed data centre environments. In empirical results, the deterministic policy of IP-DRF scheme provides SBPO and reduces the average execution and turnaround time by 19% and 11.52% as compared to the Nash bargaining or CEEI deterministic policy for 57,445 cloudlets in population non-monotonic settings. The processing cost of tasks shows significant improvement (6.89% and 9.03% for fixed and variable pricing) for the resource non-monotonic setting - using 38,000 cloudlets. The DFog-DRF scheme when benchmarked against asset fair (MIP) policy shows superior performance (less than 1% in time complexity) for up to 30 FEC nodes. Furthermore, empirical results using 210 mobiles and 420 applications prove the efficacy of our hybrid scheduling scheme for hierarchical clustering considering latency and network usage for throughput maximisation.Abubakar Tafawa Balewa University, Bauchi (Tetfund, Nigeria

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