Robust Ad-hoc Sensor Routing (RASeR) protocol for mobile wireless sensor networks

Robust Ad-hoc Sensor Routing (RASeR) is a novel protocol for data routing in mobile wireless sensor networks (MWSNs). It is designed to cope with the demanding requirements of emerging technologies, which require the reliable and low-latency delivery of packets in highly mobile conditions. RASeR uses blind forwarding, which is facilitated by a novel method of gradient maintenance. The problem of maintaining a gradient field in a changing topology, without flooding, is solved by using a global time division multiple access MAC. Furthermore, it is enhanced with the additional options of a supersede mode, to aid time-critical applications, reverse flooding, to allow sink-to-sensor commands and energy saving sleep cycles to reduce power consumption. Analytical expressions are derived and verified by simulation. RASeR is compared with the state-of-the-art MWSN routing protocols, PHASeR and MACRO, as well as the MANET protocols, AODV and OLSR. The results indicate that RASeR is a high performance protocol, which shows improvements over PHASeR, MACRO, AODV and OLSR. Tested over varying levels of mobility, scalability and traffic, the simulations yield near perfect PDR in many scenarios, as well as a low end-to-end delay, high throughput, low overhead and low energy consumption. The robustness of this protocol and its consistent reliability, low latency and additional features, makes it highly suitable to a wide number of applications. It is specifically applicable to highly mobile situations with a fixed number of nodes and small payloads

Routing in MobileWireless Sensor Networks: A Leader-Based Approach

This paper presents a leader-based approach to routing in Mobile Wireless Sensor Networks (MWSN). Using local information from neighbour nodes, a leader election mechanism maintains a spanning tree in order to provide the necessary adaptations for efficient routing upon the connectivity changes resulting from the mobility of sensors or sink nodes. We present two protocols following the leader election approach, which have been implemented using Castalia and OMNeT++. The protocols have been evaluated, besides other reference MWSN routing protocols, to analyse the impact of network size and node velocity on performance, which has demonstrated the validity of our approach.Research supported by the Spanish Research Council (MINECO), Grant TIN2016-79897-P, and the Department of Education, Universities and Research of the Basque Government, Grant IT980-16

Routing protocols for next generation mobile wireless sensor networks

The recent research interest in wireless sensor networks has caused the development of many new applications and subsequently, these emerging applications have ever increasing requirements. One such requirement is that of mobility, which has inspired an entirely new array of applications in the form of mobile wireless sensor networks (MWSNs). In terms of communications, MWSNs present a challenging environment due to the high rate at which the topology may be changing. As such, the motivation of this work is to investigate potential communications solutions, in order to satisfy the performance demands of new and future MWSN applications. As such this work begins by characterising and evaluating the requirement of a large variety of these emerging applications. This thesis focuses on the area of routing, which is concerned with the reliable and timely delivery of data from multiple, mobile sensor nodes to a data sink. For this purpose the technique of gradient routing was identified as a suitable solution, since data can quickly be passed down a known gradient that is anchored at the sink. However, in a mobile network, keeping the gradient up-to-date is a key issue. This work proposes the novel use of a global time division multiple access (GTDMA) MAC as a solution to this problem, which mitigates the need for regularly flooding the network. Additionally, the concept of blind forwarding is utilised for its low overhead and high reliability through its inherent route diversity. The key contribution of this thesis is in three novel routing protocols, which use the aforementioned principles. The first protocol, PHASeR, uses a hop-count metric and encapsulates data from multiple nodes in its packets. The hop-count metric was chosen because it is simple and requires no additional hardware. The inclusion of encapsulation is intended to enable the protocol to cope with network congestion. The second protocol, LASeR, utilises location awareness to maintain a gradient and performs no encapsulation. Since many applications require location awareness, the communications systems may also take advantage of this readily available information and it can be used as a gradient metric. This protocol uses no encapsulation in order to reduce delay times. The third protocol, RASeR, uses the hop-count metric as a gradient and also does not perform encapsulation. The reduced delay time and the relaxed requirement for any existing method of location awareness makes this the most widely applicable of the three protocols. In addition to analytical expressions being derived, all three protocols are thoroughly tested through simulation. Results show the protocols to improve on the state-of-the-art and yield excellent performance over varying speeds, node numbers and data generation rates. LASeR shows the lowest overhead and delay, which comes from the advantage of having available location information. Alternatively, at the expense of increased overhead, RASeR gives comparatively high performance metrics without the need for location information. Overall, RASeR can be suitably deployed in the widest range of applications, which is taken further by including four additional modes of operation. These include a supersede mode for applications in which the timely delivery of the most recent data is prioritised. A reverse flooding mechanism, to enable the sink to broadcast control messages to the sensor nodes. An energy saving mode, which uses sleep cycles to reduce the networks power consumption, and finally a pseudo acknowledgement scheme to increase the reliability of the protocol. These additions enable RASeR to satisfy the needs of some of the most demanding MWSN applications. In order to assess the practicality of implementation, RASeR was also evaluated using a small testbed of mobile nodes. The successful results display the protocols feasibility to be implemented on commercially available hardware and its potential to be deployed in the real world. Furthermore, a key issue in the real world deployment of networks, is security and for this reason a fourth routing protocol was designed called RASeR-S. RASeR-S is based on RASeR, but introduces the use of encryption and suggests a security framework that should be followed in order to significantly reduce the possibility of a security threat. Whilst the main focus of this work is routing, alternative MAC layers are assessed for LASeR. Unlike the other two protocols, LASeR uses available location information to determine its gradient and as such, it is not reliant on the GTDMA MAC. For this reason several MAC layers are tested and the novel idea of dedicated sensing slots is introduced, as well as a network division multiple access scheme. The selected and proposed MACs are simulated and the GTDMA and two proposed protocols are shown to give the best results in certain scenarios. This work demonstrates the high levels of performance that can be achieved using gradient orientated routing in a mobile network. It has also shown that the use of a GTDMA MAC is an efficient solution to the gradient maintenance problem. The high impact of this work comes from the versatility and reliability of the presented routing protocols, which means they are able to meet the requirements of a large number of MWSN applications. Additionally, given the importance of security, RASeR-S has been designed to provide a secure and adaptable routing solution for vulnerable or sensitive applications

An Empirical Analysis of cluster-based routing protocols in wireless sensor network

Wireless Sensor Networks (WSNs) are utilized for condition monitoring, developing the board, following animals or goods, social protection, transportation, and house frameworks. WSNs are revolutionizing research. A WSN includes a large number of sensor nodes, or bits, in the application. Bits outfitted with the application\u27s sensors acquire nature data and send it to at least one sink center (in like manner called base stations). This article simulates energy-efficient network initialization strategies using simulation models. First, an overview of network initiation and exploration procedures in wireless ad-hoc networks is provided. The clustering-based routing strategy was selected since it\u27s best for ad-hoc sensor networks. The clustering-based routing techniques used for this study are described below. LEACH, SEP, and Z-SEP are used. MATLAB was used to implement and simulate all routing protocols. All protocols were simulated with various parameters like Number of CHs, Number of Alive Nodes, Number of Dead Nodes, Number of packets to BS, and circumstances to show their functioning and to determine their behavior in different sensor networks

Enhanced priority-based adaptive energy-aware mechanisms for wireless sensor networks

Wireless Sensor Networks (WSN) continues to find its use in our lives. However, research has shown that it has barely attained an optimal performance, particularly in the aspects of data heterogeneity, data prioritization, data routing, and energy efficiency, all of which affects its operational lifetime. The IEEE 802.15.4 protocol standard, which manages data forwarding across the Data Link Layer (DLL) does not address the impact of heterogeneous data and node Battery-Level (BL) which is an indicator for node battery life. Likewise, mechanisms proposed in the literature – TCP-CSMA/CA, QWL-RPL and SSRA have not proffered optimal solution as they encourage excessive computational overhead which results in shortened operational lifetime. These problems are inherited on the Network Layer (NL) where data routing is implemented. Mitigating these challenges, this research presents an Enhanced Priority-based Adaptive Energy-Aware Mechanisms (EPAEAM) for Wireless Sensor Networks. The first mechanism is the Optimized Backoff Mechanism for Prioritized Data (OBMPD) in Wireless Sensor Networks. This mechanism proposed the Class of Service Traffic Priority-based Medium Access Control (CSTP-MAC). The CSTP-MAC is implemented on the DLL. In this mechanism, unique backoff period expressions compute backoff periods according to the class and priority of the heterogeneous data. This approach improved network performances which enhanced network lifetime. The second mechanism is the Shortest Path Priority-Based Objective Function (SPPB-OF) for Wireless Sensor Networks. SPPB-OF is implemented across the NL. SPPB-OF implements a unique shortest path computation algorithm to generate energy-efficient shortest path between the source and destination nodes. The third mechanism is the Cross-Layer Energy-Efficient Priority-based Data Path (CL-EEPDP) for Wireless Sensor Networks. CL-EEPDP is implemented across the DLL and NL with considerations for node battery-level. A unique mathematical expression, Node Battery-Level Estimator (NBLE) is used to estimate the BL of neighbouring nodes. The knowledge of the BL together with the priority of data are used to decide an energy-efficient next-hop node. Benchmarking the EPAEAM with related mechanisms - TCP-CSMA/CA, QWL-RPL and SSRA, results show that EPAEAM achieved improved network performance with a packet delivery ratio (PDR) of 95.4%, and power-saving of 90.4%. In conclusion, the EPAEAM mechanism proved to be a viable energy-efficient solution for a multi-hop heterogeneous data WSN deployment with support for extended operational lifetime. The limitations and scope of these mechanisms are that their application is restricted to the data-link and network layers, moreover, only two classes of data are considered, that is; High Priority Data (HPD) and Low Priority Data (LPD)

Fahrerassistenzsysteme zur energieeffizienten Längsregelung - Analyse und Optimierung der Fahrsicherheit

Die Steigerung der Fahrsicherheit und Energieeffizienz gehören zu den wichtigsten Treibern der Fahrerassistenz. Dabei impliziert eine energieeffiziente Fahrweise häufig auch eine sichere Fahrweise. Dagegen existieren jedoch auch Fahrstrategien, die zu einer Verschlechterung der Fahrsicherheit führen können. Die vorliegende Arbeit beschäftigt sich daher mit der Fragestellung, ob sich die Sicherheit verschlechtert, wenn das vorausfahrende Fahrzeug eine energieeffiziente Fahrweise anwendet

Bicycle Sharing Systems: Fast and Slow Urban Mobility Dynamics

In cities all around the world, new forms of urban micromobility have observed rapid and wide-scale adoption due to their benefits as a shared mode that are environmentally friendly, convenient and accessible. Bicycle sharing systems are the most established among these modes, facilitating complete end-to-end journeys as well as forming a solution for the first/last mile issue that public transportation users face in getting to and from transit stations. They mark the beginnings of a gradual transition towards a more sustainable transportation model that include greater use of shared and active modes. As such, understanding the way in which these systems are used is essential in order to improve their management and efficiency. Given the lack of operator published data, this thesis aims to explore the utility of open bicycle sharing system data standards that are intended for real-time dissemination of bicycle locations in uncovering novel insights into their activity dynamics over varying temporal and geographical scales. The thesis starts by exploring bicycle sharing systems at a global-scale, uncovering their long-term growth and evolution through the development of data cleaning and metric creation heuristics that also form the foundations of the most comprehensive classification of systems. Having established the values of these metrics in conducting comparisons at scale, the thesis then analyses the medium-term impacts of mobility interventions in the context of the COVID-19 pandemic, employing spatio-temporal and network analysis methods that highlight their adaptability and resilience. Finally, the thesis closes with the analysis of granular spatial and temporal dynamics within a dockless system in London that enable the identification of the variations in journey locations throughout different times of the day. In each of these cases, the research highlights the indispensable value of open data and the important role that bicycle sharing systems play in urban mobility