Optimization of the OpenFlow Controller in Wireless Environments for Enhancing Mobility

OpenRoads or OpenFlow Wireless is an open-source platform for deploying an innovative and realistic strategy for different services in wireless networks. It provides a wireless extension for OpenFlow. It is developed to support existing Wireless Local Area Networks (WLANs) and Worldwide Interoperability for Microwave Access (WiMAX) networks. It can provide several mobility managers and run them concurrently in the network including hard handover, informed handover, n-casting and Hoolock. However, the provided mobility support for flow-based routing, where flows of one source taking different paths through multiple wireless access points or base stations, is not simple and hard to be deployed in the traditional routing algorithms. This paper proposes an intelligent mobility enhancement control and then develops an algorithm to decide which neighbor switches need to be selected for the installation of new flow entries and to allocate the appropriate idle-timeout for the selected switches. The proposed approach provides a simple solution to solve the user mobility problem in wireless OpenFlow environments which can handle the fast migration of user addresses (e.g. IP addresses) between several wireless access points and base stations. This approach leads to improvement in the end users' experience

A review of cyber threats and defence approaches in emergency management

Emergency planners, first responders and relief workers increasingly rely on computational and communication systems that support all aspects of emergency management, from mitigation and preparedness to response and recovery. Failure of these systems, whether accidental or because of malicious action, can have severe implications for emergency management. Accidental failures have been extensively documented in the past and significant effort has been put into the development and introduction of more resilient technologies. At the same time researchers have been raising concerns about the potential of cyber attacks to cause physical disasters or to maximise the impact of one by intentionally impeding the work of the emergency services. Here, we provide a review of current research on the cyber threats to communication, sensing, information management and vehicular technologies used in emergency management. We emphasise on open issues for research, which are the cyber threats that have the potential to affect emergency management severely and for which solutions have not yet been proposed in the literature

Instantly Decodable Network Coding: From Centralized to Device-to-Device Communications

From its introduction to its quindecennial, network coding has built a strong reputation for enhancing packet recovery and achieving maximum information flow in both wired and wireless networks. Traditional studies focused on optimizing the throughput of the system by proposing elaborate schemes able to reach the network capacity. With the shift toward distributed computing on mobile devices, performance and complexity become both critical factors that affect the efficiency of a coding strategy. Instantly decodable network coding presents itself as a new paradigm in network coding that trades off these two aspects. This paper review instantly decodable network coding schemes by identifying, categorizing, and evaluating various algorithms proposed in the literature. The first part of the manuscript investigates the conventional centralized systems, in which all decisions are carried out by a central unit, e.g., a base-station. In particular, two successful approaches known as the strict and generalized instantly decodable network are compared in terms of reliability, performance, complexity, and packet selection methodology. The second part considers the use of instantly decodable codes in a device-to-device communication network, in which devices speed up the recovery of the missing packets by exchanging network coded packets. Although the performance improvements are directly proportional to the computational complexity increases, numerous successful schemes from both the performance and complexity viewpoints are identified

Context-aware task scheduling in distributed computing systems

These days, the popularity of technologies such as machine learning, augmented reality, and big data analytics is growing dramatically. This leads to a higher demand of computational power not only for IT professionals but also for ordinary device users who benefit from new applications. At the same time, the computational performance of end-user devices increases to meet the demands of these resource-hungry applications. As a result, there is a coexistence of a huge demand of computational power on the one side and a large pool of computational resources on the other side. Bringing these two sides together is the idea of computational resource sharing systems which allow applications to forward computationally intensive workload to remote resources. This technique is often used in cloud computing where customers can rent computational power. However, we argue that not only cloud resources can be used as offloading targets. Rather, idle CPU cycles from end-user administered devices at the edge of the network can be spontaneously leveraged as well. Edge devices, however, are not only heterogeneous in their hardware and software capabilities, they also do not provide any guarantees in terms of reliability or performance. Does it mean that either the applications that require further guarantees or the unpredictable resources need to be excluded from such a sharing system? In this thesis, we propose a solution to this problem by introducing the Tasklet system, our approach for a computational resource sharing system. The Tasklet system supports computation offloading to arbitrary types of devices, including stable cloud instances as well as unpredictable end-user owned edge resources. Therefore, the Tasklet system is structured into multiple layers. The lowest layer is a best-effort resource sharing system which provides lightweight task scheduling and execution. Here, best-effort means that in case of a failure, the task execution is dropped and that tasks are allocated to resources randomly. To provide execution guarantees such as a reliable or timely execution, we add a Quality of Computation (QoC) layer on top of the best-effort execution layer. The QoC layer enforces the guarantees for applications by using a context-aware task scheduler which monitors the available resources in the computing environment and performs the matchmaking between resources and tasks based on the current state of the system. As edge resources are controlled by individuals, we consider the fact that these users need to be able to decide with whom they want to share their resources and for which price. Thus, we add a social layer on top of the system that allows users to establish friendship connections which can then be leveraged for social-aware task allocation and accounting of shared computation

Enabling technologies for urban smart mobility: Recent trends, opportunities and challenges

The increasing population across the globe makes it essential to link smart and sustainable city planning with the logistics of transporting people and goods, which will significantly contribute to how societies will face mobility in the coming years. The concept of smart mobility emerged with the popularity of smart cities and is aligned with the sustainable development goals defined by the United Nations. A reduction in traffic congestion and new route optimizations with reduced ecological footprint are some of the essential factors of smart mobility; however, other aspects must also be taken into account, such as the promotion of active mobility and inclusive mobility, encour-aging the use of other types of environmentally friendly fuels and engagement with citizens. The Internet of Things (IoT), Artificial Intelligence (AI), Blockchain and Big Data technology will serve as the main entry points and fundamental pillars to promote the rise of new innovative solutions that will change the current paradigm for cities and their citizens. Mobility‐as‐a‐service, traffic flow optimization, the optimization of logistics and autonomous vehicles are some of the services and applications that will encompass several changes in the coming years with the transition of existing cities into smart cities. This paper provides an extensive review of the current trends and solutions presented in the scope of smart mobility and enabling technologies that support it. An overview of how smart mobility fits into smart cities is provided by characterizing its main attributes and the key benefits of using smart mobility in a smart city ecosystem. Further, this paper highlights other various opportunities and challenges related to smart mobility. Lastly, the major services and applications that are expected to arise in the coming years within smart mobility are explored with the prospective future trends and scope

Research routing and MAC based on LEACH and S-MAC for energy efficiency and QoS in wireless sensor network

The wireless sensor is a micro-embedded device with weak data processing capability and small storage space. These nodes need to complete complex jobs, including data monitoring, acquisition and conversion, and data processing. Energy efficiency should be considered as one of the important aspects of the Wireless Sensor Network (WSN) throughout architecture and protocol design. At the same time, supporting Quality of Service (QoS) in WSNs is a research field, because the time-sensitive and important information is expected for the transmitting to to the sink node immediately. The thesis is supported by the projects entitled “The information and control system for preventing forest fires”, and “The Erhai information management system”, funded by the Chinese Government. Energy consumption and QoS are two main objectives of the projects. The thesis discusses the two aspects in route and Media Access Control (MAC). For energy efficiency, the research is based on Low Energy Adaptive Clustering Hierarchy (LEACH) protocol. LEACH is a benchmark clustering routing protocol which imposes upon cluster heads to complete a lot of aggregation and relay of messages to the base-station. However, there are limitations in LEACH. LEACH does not suit a wide area in clustering strategy and multi-hop routing. Moreover, routing protocols only focus on one factor, combining the clustering strategy and multi-hop routing mechanism were not considered in routing protocol for performance of network. QoS is supported by the MAC and routing protocol. Sensor MAC(S-MAC) makes the use of the periodically monitoring / sleeping mechanism, as well as collision and crosstalk avoidance mechanism. The mechanism reduces energy costs. Meanwhile, it supports good scalability and avoids the collision. However, the protocols do not take the differentiated services. For supporting QoS,A new route protocol needs to be designed and realized on embed platforms, which has WIFI mode and a Linux operation system to apply on the actual system. This research project was conducted as following the steps: A new protocol called RBLEACH is proposed to solve cluster on a widely scale based on LEACH. The area is divided into a few areas, where LEACH is improved to alter the selecting function in each area. RBLEACH creates routes selected by using a new algorithm to optimize the performance of the network. A new clustering method that has been developed to use several factors is PS-ACO-LEACH. The factors include the residual energy of the cluster head and Euclidean distances between cluster members and a cluster head. It can optimally solve fitness function and maintain a load balance in between the cluster head nodes, a cluster head and the base station. Based on the “Ant Colony” algorithm and transition of probability, a new routing protocol was created by “Pheromone” to find the optimal path of cluster heads to the base station. This protocol can reduce energy consumption of cluster heads and unbalanced energy consumption. Simulations prove that the improved protocol can enhance the performance of the network, including lifetime and energy conservation. Additionally, Multi Index Adaptive Routing Algorithm (MIA-QR) was designed based on network delay, packet loss rate and signal strength for QoS. The protocol is achieved by VC on an embedded Linux system. The MIA-QR is tested and verified by experiment and the protocol is to support QoS. Finally, an improved protocol (SMAC -SD) for wireless sensor networks is proposed, in order to solve the problem of S-MAC protocol that consider either service differentiation or ensure quality of service. According to service differentiation, SMAC-SD adopts an access mechanism based on different priorities including the adjustment of priority mechanisms of channel access probability, channel multi-request mechanisms and the configuring of waiting queues with different priorities and RTS backoff for different service, which makes the important service receive high channel access probability, ensuring the transmission quality of the important service. The simulation results show that the improved protocol is able to gain amount of important service and shortens the delay at the same time. Meanwhile, it improves the performance of the network effectivel

Stochastic Dynamics of Cascading Failures in Electric-Cyber Infrastructures

Emerging smart grids consist of tightly-coupled systems, namely a power grid and a communication system. While today\u27s power grids are highly reliable and modern control and communication systems have been deployed to further enhance their reliability, historical data suggest that they are yet vulnerable to large failures. A small set of initial disturbances in power grids in conjunction with lack of effective, corrective actions in a timely manner can trigger a sequence of dependent component failures, called cascading failures. The main thrust of this dissertation is to build a probabilistic framework for modeling cascading failures in power grids while capturing their interactions with the coupled communication systems so that the risk of cascading failures in the composite complex electric-cyber infrastructures can be examined, analyzed and predicted. A scalable and analytically tractable continuous-time Markov chain model for stochastic dynamics of cascading failures in power grids is constructed while retaining key physical attributes and operating characteristics of the power grid. The key idea of the proposed framework is to simplify the state space of the complex power system while capturing the effects of the omitted variables through the transition probabilities and their parametric dependence on physical attributes and operating characteristics of the system. In particular, the effects of the interdependencies between the power grid and the communication system have been captured by a parametric formulation of the transition probabilities using Monte-Carlo simulations of cascading failures. The cascading failures are simulated with a coupled power-system simulation framework, which is also developed in this dissertation. Specifically, the probabilistic model enables the prediction of the evolution of the blackout probability in time. Furthermore, the asymptotic analysis of the blackout probability as time tends to infinity enables the calculation of the probability mass function of the blackout size, which has been shown to have a heavy tail, e.g., power-law distribution, specifically when the grid is operating under stress scenarios. A key benefit of the model is that it enables the characterization of the severity of cascading failures in terms of a set of operating characteristics of the power grid. As a generalization to the Markov chain model, a regeneration-based model for cascading failures is also developed. The regeneration-based framework is capable of modeling cascading failures in a more general setting where the probability distribution of events in the system follows an arbitrarily specified distribution with non-Markovian characteristics. Further, a novel interdependent Markov chain model is developed, which provides a general probabilistic framework for capturing the effects of interactions among interdependent infrastructures on cascading failures. A key insight obtained from this model is that interdependencies between two systems can make two individually reliable systems behave unreliably. In particular, we show that due to the interdependencies two chains with non-heavy tail asymptotic failure distribution can result in a heavy tail distribution when coupled. Lastly, another aspect of future smart grids is studied by characterizing the fundamental bounds on the information rate in the sensor network that monitors the power grid. Specifically, a distributed source coding framework is presented that enables an improved estimate of the lower bound for the minimum required communication capacity to accurately describe the state of components in the information-centric power grid. The models developed in this dissertation provide critical understanding of cascading failures in electric-cyber infrastructures and facilitate reliable and quick detection of the risk of blackouts and precursors to cascading failures. These capabilities can guide the design of efficient communication systems and cascade aware control policies for future smart grids