Next-Generation Public Safety Systems Based on Autonomous Vehicles and Opportunistic Communications

An emergency scenario is characterized by the unpredictability of the environment conditions and by the scarcity of the available communication infrastructures. After a natural or human disaster, the main public and private infrastructures are partially damaged or totally destroyed. These infrastructures include roads, bridges, water supplies, electrical grids, telecommunications and so on. In these conditions, the first rescue operations executed by the public safety organizations can be very difficult, due to the unpredictability of the disaster area environment and the lack in the communications systems. The aim of this work is to introduce next-generation public safety systems where the main focus is the use of unmanned vehicles that are able to exploit the self-organizing characteristics of such autonomous systems. With the proposed public safety systems, a team of autonomous vehicles will be able to overcome the hazardous environments of a post disaster scenario by introducing a temporary dynamic network infrastructure which enables the first responders to cooperate and to communicate with the victims involved. Furthermore, given the pervasive penetration of smart end-user devices, the emergence of spontaneous networks could constitute promising solutions to implement emergency communication systems. With these systems the survivors will be able to self-organize in a communication network that allows them to send alerts and information messages towards the rescue teams, even in absence of communication infrastructures

Smart Wireless Sensor Networks

The recent development of communication and sensor technology results in the growth of a new attractive and challenging area - wireless sensor networks (WSNs). A wireless sensor network which consists of a large number of sensor nodes is deployed in environmental fields to serve various applications. Facilitated with the ability of wireless communication and intelligent computation, these nodes become smart sensors which do not only perceive ambient physical parameters but also be able to process information, cooperate with each other and self-organize into the network. These new features assist the sensor nodes as well as the network to operate more efficiently in terms of both data acquisition and energy consumption. Special purposes of the applications require design and operation of WSNs different from conventional networks such as the internet. The network design must take into account of the objectives of specific applications. The nature of deployed environment must be considered. The limited of sensor nodes� resources such as memory, computational ability, communication bandwidth and energy source are the challenges in network design. A smart wireless sensor network must be able to deal with these constraints as well as to guarantee the connectivity, coverage, reliability and security of network's operation for a maximized lifetime. This book discusses various aspects of designing such smart wireless sensor networks. Main topics includes: design methodologies, network protocols and algorithms, quality of service management, coverage optimization, time synchronization and security techniques for sensor networks

Data Compression in Multi-Hop Large-Scale Wireless Sensor Networks

Data collection from a multi-hop large-scale outdoor WSN deployment for environmental monitoring is full of challenges due to the severe resource constraints on small battery-operated motes (e.g., bandwidth, memory, power, and computing capacity) and the highly dynamic wireless link conditions in an outdoor communication environment. We present a compressed sensing approach which can recover the sensing data at the sink with good accuracy when very few packets are collected, thus leading to a significant reduction of the network traffic and an extension of the WSN lifetime. Interplaying with the dynamic WSN routing topology, the proposed approach is efficient and simple to implement on the resource-constrained motes without motes storing of a part of random measurement matrix, as opposed to other existing compressed sensing based schemes. We provide a systematic method via machine learning to find a suitable representation basis, for the given WSN deployment and data field, which is both sparse and incoherent with the measurement matrix in the compressed sensing. We validate our approach and evaluate its performance using our real-world multi-hop WSN testbed deployment in situ in collecting the humidity and soil moisture data. The results show that our approach significantly outperforms three other compressed sensing based algorithms regarding the data recovery accuracy for the entire WSN observation field under drastically reduced communication costs. For some WSN scenarios, compressed sensing may not be applicable. Therefore we also design a generalized predictive coding framework for unified lossless and lossy data compression. In addition, we devise a novel algorithm for lossless compression to significantly improve data compression performance for variouSs data collections and applications in WSNs. Rigorous simulations show our proposed framework and compression algorithm outperform several recent popular compression algorithms for wireless sensor networks such as LEC, S-LZW and LTC using various real-world sensor data sets, demonstrating the merit of the proposed framework for unified temporal lossless and lossy data compression in WSNs

Achieving reliable and enhanced communication in vehicular ad hoc networks (VANETs)

A thesis submitted to the University of Bedfordshire in partial fulfilment of the requirement for the degree of Doctor of PhilosophyWith the envisioned age of Internet of Things (IoTs), different aspects of Intelligent Transportation System (ITS) will be linked so as to advance road transportation safety, ease congestion of road traffic, lessen air pollution, improve passenger transportation comfort and significantly reduce road accidents. In vehicular networks, regular exchange of current position, direction, speed, etc., enable mobile vehicle to foresee an imminent vehicle accident and notify the driver early enough in order to take appropriate action(s) or the vehicle on its own may take adequate preventive measures to avert the looming accident. Actualizing this concept requires use of shared media access protocol that is capable of guaranteeing reliable and timely broadcast of safety messages. This dissertation investigates the use of Network Coding (NC) techniques to enrich the content of each transmission and ensure improved high reliability of the broadcasted safety messages with less number of retransmissions. A Code Aided Retransmission-based Error Recovery (CARER) protocol is proposed. In order to avoid broadcast storm problem, a rebroadcasting vehicle selection metric η, is developed, which is used to select a vehicle that will rebroadcast the received encoded message. Although the proposed CARER protocol demonstrates an impressive performance, the level of incurred overhead is fairly high due to the use of complex rebroadcasting vehicle selection metric. To resolve this issue, a Random Network Coding (RNC) and vehicle clustering based vehicular communication scheme with low algorithmic complexity, named Reliable and Enhanced Cooperative Cross-layer MAC (RECMAC) scheme, is proposed. The use of this clustering technique enables RECMAC to subdivide the vehicular network into small manageable, coordinated clusters which further improve transmission reliability and minimise negative impact of network overhead. Similarly, a Cluster Head (CH) selection metric ℱ(\u1d457) is designed, which is used to determine and select the most suitably qualified candidate to become the CH of a particular cluster. Finally, in order to investigate the impact of available radio spectral resource, an in-depth study of the required amount of spectrum sufficient to support high transmission reliability and minimum latency requirements of critical road safety messages in vehicular networks was carried out. The performance of the proposed schemes was clearly shown with detailed theoretical analysis and was further validated with simulation experiments

Étude d'un réseau de capteur UWB pour la localisation et la communication dans un environnement minier

Le jour n'est peut-être pas très loin où une mine pourra compter sur un système de communication sans fil pour échanger des données, transmettre des informations ou localiser des travailleurs dans le cas d'une activité normale ou en cas d'urgence. Au point de vue de la sécurité, un système de communications sans fil aurait l'avantage de localiser en temps réel un travailleur ou un engin. Les travailleurs se déplacent sans cesse dans une mine. Avec une technologie sans fil permanente, on pourrait localiser les personnes de manière relativement précise. Même en cas d'éboulement, avec une technologie adaptée, il serait possible de savoir où se trouve la personne en détresse. Notre travail de recherche s'inscrit dans la perspective du développement d'un réseau de capteurs ultra large bande (UWB) pour deux applications : l'aide à la radiolocalisation et l'extension du réseau de capteurs sans fil dans la mine. Cette étude est focalisée sur trois aspects. La première partie de notre étude consiste à étudier tous les problèmes reliés à la radiolocalisation dans la mine. Vue l'importance de cette application, nous avons mis en oeuvre un réseau de capteurs en tenant compte d'un futur déploiement dans la mine. La technologie utilisée repose sur la technologie ultra large bande. Comme il n'existe pas de travaux qui traitent ce genre de problèmes, nous avons commencé notre étude par une caractérisation du canal UWB dans les mines souterraines. Pour atteindre ces objectifs, plusieurs campagnes de mesure sur site (mine expérimentale) ont été menées. Nous sommes parvenus à une modélisation du canal de propagation et à avancer des recommandations pour aider au dimensionnement d'un réseau de capteurs dans ce type d'environnement. Dans la première partie, le but est d'étudier le problème de radiolocalisation avec les réseaux de capteurs. Notre scénario proposé serait de placer des capteurs sur chaque agent (mineur, engin). On suppose que chaque noeud (agent) qui circule à travers un réseau d'ancre maillé (déjà déployé), va extraire des informations de distance (en utilisant le critère de temps d'arrivée), ensuite il va utiliser un algorithme de positionnement distribué afin de déterminer sa propre position. Lors de cette partie nous avons aussi étudié quelques estimateurs cohérents et non-cohérents du temps d'arrivée. La caractérisation de l'erreur de mesure utilisant le temps d'arrivée dans un environnement minier a été aussi évaluée. Enfin, dans la dernière partie, nous avons analysé par simulations un déploiement d'un réseau de capteurs UWB ad hoc dans la mine. Nous avons choisi d'adopter une approche théorique afin d'évaluer les performances de cette configuration. Une conception intercouche pour un routage optimal a été étudiée. Nous avons utilisé la couche physique/réseau afin de minimiser l'énergie consommée lors de l'acheminement du données

Train Localisation using Wireless Sensor Networks

Safety and reliability have always been concerns for railway transportation. Knowing the exact location of a train enables the railway system to react to an unusual situation for the safety of human lives and properties. Generally, the accuracy of localisation systems is related with their deployment and maintenance costs, which can be on the order of millions of dollars a year. Despite a lot of research efforts, existing localisation systems based on different technologies are still limited because most of them either require expensive infrastructure (ultrasound and laser), have high database maintenance, computational costs or accumulate errors (vision), offer limited coverage (GPS-dark regions, Wi-Fi, RFID) or provide low accuracy (audible sound). On the other hand, wireless sensor networks (WSNs) offer the potential for a cheap, reliable and accurate solutions for the train localisation system. This thesis proposes a WSN-based train localisation system, in which train location is estimated based on the information gathered through the communication between the anchor sensors deployed along the track and the gateway sensor installed on the train, such as anchor sensors' geographic coordinates and the Received Signal Strength Indicator (RSSI). In the proposed system, timely anchor-gateway communication implies accurate localisation. How to guarantee effective communication between anchor sensors along the track and the gateway sensor on the train is a challenging problem for WSN-based train localisation. I propose a beacon driven sensors wake-up scheme (BWS) to address this problem. BWS allows each anchor sensor to run an asynchronous duty-cycling protocol to conserve energy and establishes an upper bound on the sleep time in one duty cycle to guarantee their timely wake-up once a train approaches. Simulation results show that the BWS scheme can timely wake up the anchor sensors at a very low energy consumption cost. To design an accurate scheme for train localisation, I conducted on-site experiments in an open field, a railway station and a tunnel, and the results show that RSSI can be used as an estimator for train localisation and its applicability increases with the incorporation of another type of data such as location information of anchor sensors. By combining the advantages of RSSI-based distance estimation and Particle Filtering techniques, I designed a Particle-Filter-based train localisation scheme and propose a novel Weighted RSSI Likelihood Function (WRLF) for particle update. The proposed localisation scheme is evaluated through extensive simulations using the data obtained from the on-site measurements. Simulation results demonstrate that the proposed scheme can achieve significant accuracy, where average localisation error stays under 30 cm at the train speed of 40 m=s, 40% anchor sensors failure rate and sparse deployment. In addition, the proposed train localisation scheme is robust to changes in train speed, the deployment density and reliability of anchor sensors. Anchor sensors are prone to hardware and software deterioration such as battery outage and dislocation. Therefore, in order to reduce the negative impacts of these problems, I designed a novel Consensus-based Anchor sensor Management Scheme (CAMS), in which each anchor sensor performs a self-diagnostics and reports the detected faults in the neighbourhood. CAMS can assist the gateway sensor to exclude the input from the faulty anchor sensors. In CAMS, anchor sensors update each other about their opinions on other neighbours and develops consensus to mark faulty sensors. In addition, CAMS also reports the system information such as signal path loss ratio and allows anchor sensors to re-calibrate and verify their geographic coordinates. CAMS is evaluated through extensive simulations based on real data collected from field experiments. This evaluation also incorporated the simulated node failure model in simulations. Though there are no existing WSN-based train localisation systems available to directly compare our results with, the proposed schemes are evaluated with real datasets, theoretical models and existing work wherever it was possible. Overall, the WSN-based train localisation system enables the use of RSSI, with combination of location coordinates of anchor sensors, as location estimator. Due to low cost of sensor devices, the cost of overall system remains low. Further, with duty-cycling operation, energy of the sensor nodes and system is conserved

Radio Communications

In the last decades the restless evolution of information and communication technologies (ICT) brought to a deep transformation of our habits. The growth of the Internet and the advances in hardware and software implementations modified our way to communicate and to share information. In this book, an overview of the major issues faced today by researchers in the field of radio communications is given through 35 high quality chapters written by specialists working in universities and research centers all over the world. Various aspects will be deeply discussed: channel modeling, beamforming, multiple antennas, cooperative networks, opportunistic scheduling, advanced admission control, handover management, systems performance assessment, routing issues in mobility conditions, localization, web security. Advanced techniques for the radio resource management will be discussed both in single and multiple radio technologies; either in infrastructure, mesh or ad hoc networks

Identifying and Harnessing Concurrency for Parallel and Distributed Network Simulation

Although computer networks are inherently parallel systems, the parallel execution of network simulations on interconnected processors frequently yields only limited benefits. In this thesis, methods are proposed to estimate and understand the parallelization potential of network simulations. Further, mechanisms and architectures for exploiting the massively parallel processing resources of modern graphics cards to accelerate network simulations are proposed and evaluated

COMMUNITY DETECTION IN COMPLEX NETWORKS AND APPLICATION TO DENSE WIRELESS SENSOR NETWORKS LOCALIZATION

Complex network analysis is applied in numerous researches. Features and characteristics of complex networks provide information associated with a network feature called community structure. Naturally, nodes with similar attributes will be more likely to form a community. Community detection is described as the process by which complex network data are analyzed to uncover organizational properties, and structure; and ultimately to enable extraction of useful information. Analysis of Wireless Sensor Networks (WSN) is considered as one of the most important categories of network analysis due to their enormous and emerging applications. Most WSN applications are location-aware, which entails precise localization of the deployed sensor nodes. However, localization of sensor nodes in very dense network is a challenging task. Among various challenges associated with localization of dense WSNs, anchor node selection is shown as a prominent open problem. Optimum anchor selection impacts overall sensor node localization in terms of accuracy and consumed energy. In this thesis, various approaches are developed to address both overlapping and non-overlapping community detection. The proposed approaches target small-size to very large-size networks in near linear time, which is important for very large, densely-connected networks. Performance of the proposed techniques are evaluated over real-world data-sets with up to 106 nodes and syntactic networks via Newman\u27s Modularity and Normalized Mutual Information (NMI). Moreover, the proposed community detection approaches are extended to develop a novel criterion for range-free anchor selection in WSNs. Our approach uses novel objective functions based on nodes\u27 community memberships to reveal a set of anchors among all available permutations of anchors-selection sets. The performance---the mean and variance of the localization error---of the proposed approach is evaluated for a variety of node deployment scenarios and compared with random anchor selection and the full-ranging approach. In order to study the effectiveness of our algorithm, the performance is evaluated over several simulations that randomly generate network configurations. By incorporating our proposed criteria, the accuracy of the position estimate is improved significantly relative to random anchor selection localization methods. Simulation results show that the proposed technique significantly improves both the accuracy and the precision of the location estimation

Design and optimisation of a low cost Cognitive Mesh Network

Wireless Mesh Networks (WMNs) have been touted as the most promising wireless technology in providing high-bandwidth Internet access to rural, remote and under-served areas, with relatively lower investment cost as compared to traditional access networks. WMNs structurally comprise of mesh routers and mesh clients. Furthermore, WMNs have an envisaged ability to provide a heterogeneous network system that integrates wireless technologies such as IEEE 802.22 WRAN, IEEE 802.16 WiMAX, IEEE 802.11 Wi-Fi, Blue-tooth etc. The recent proliferation of new devices on the market such as smart phones and, tablets, and the growing number of resource hungry applications has placed a serious strain on spectrum availability which gives rise to the spectrum scarcity problem. The spectrum scarcity problem essentially results in increased spectrum prices that hamper the growth and efficient performance of WMNs as well as subsequent transformation of WMN into the envisaged next generation networks. Recent developments in TV white space communications technology and the emergence of Cognitive radio devices that facilitate Dynamic Spectrum Access (DSA) have provided an opportunity to mitigate the spectrum scarcity problem. To solve the scarcity problem, this thesis reconsiders the classical Network Engineering (NE) and Traffic Engineering (TE) problems to objectively design a low cost Cognitive Mesh network that promotes efficient resources utilization and thereby achieve better Quality of Service (QoS) levels