The concentration of data traffic towards the sink in a wireless sensor network causes the nearby nodes to deplete their batteries quicker than other nodes, which leaves the sink stranded and disrupts the sensor data reporting. To mitigate this problem the usage of mobile sinks is proposed. Mobile sinks implicitly provide load-balancing and help achieving uniform energy-consumption across the network. However, the mechanisms to support the sink mobility (e.g., advertising the location of the mobile sink to the network) introduce an overhead in terms of energy consumption and packet delays. With these properties mobile sink routing constitutes an interesting research field with unique requirements. In this paper, we present a survey of the existing distributed mobile sink routing protocols. In order to provide an insight to the rationale and the concerns of a mobile sink routing protocol, design requirements and challenges associated with the problem of mobile sink routing are determined and explained. A definitive and detailed categorization is made and the protocols' advantages and drawbacks are determined with respect to their target applications.

Distributed Mobile Sink Routing for Wireless Sensor Networks: A Survey

Wireless body area networks (WBANs) form a new and interesting area in the world of remote health monitoring. An important concern in such networks is the communication between the sensors. This communication needs to be energy efficient and highly reliable while keeping delays low. Mobility also has to be supported as the nodes are positioned on different parts of the body that move with regard to each other. In this paper, we present a new cross-layer communication protocol for WBANs: CICADA or Cascading Information retrieval by Controlling Access with Distributed slot Assignment. The protocol sets up a network tree in a distributed manner. This tree structure is subsequently used to guarantee collision free access to the medium and to route data towards the sink. The paper analyzes CICADA and shows simulation results. The protocol offers low delay and good resilience to mobility. The energy usage is low as the nodes can sleep in slots where they are not transmitting or receiving.

A low-delay protocol for multishop wireless body area networks

In a typical wireless sensor network, the batteries of the nodes near the sink deplete quicker than other nodes due to the data traffic concentrating towards the sink, leaving it stranded and disrupting the sensor data reporting. To mitigate this problem, mobile sinks are proposed. They implicitly provide load-balanced data delivery and achieve uniform-energy consumption across the network. On the other hand, advertising the position of the mobile sink to the network introduces an overhead in terms of energy consumption and packet delays. In this paper, we propose Ring Routing, a novel, distributed, energy-efficient mobile sink routing protocol, suitable for time-sensitive applications, which aims to minimize this overhead while preserving the advantages of mobile sinks. Furthermore, we evaluate the performance of Ring Routing via extensive simulations.

Ring Routing: An Energy-Efficient Routing Protocol for Wireless Sensor Networks with a Mobile Sink

Internet of Things (IoT) is a novel design paradigm, intended as a network of billions to trillions of tiny sensors communicating with each other to offer innovative solutions to real time problems. These sensors form a network named as wireless sensor networks (WSNs) to monitor physical environment and disseminate collected data back to the base station through multiple hops. WSN has the capability to collect and report data for a specific application. The location information plays an important role for various wireless sensor network applications. A majority of the applications are related to location-based services. The development of sensor technology, processing techniques, and communication systems give rise to a development of the smart sensor for the adaptive and innovative application. So a single localization technique is not adequate for all application. In this paper, a recent extensive analysis of localization techniques and hierarchical taxonomy and their applications in the different context is presented. This taxonomy of the localization technique is classified based on presence of offline training in localization, namely self-determining and training dependent approaches. Finally, various open research issues related to localization schemes for IoT are compared and various directions for future research are proposed.

Location of Things (LoT): A Review and Taxonomy of Sensors Localization in IoT Infrastructure

Advances on localization techniques for wireless sensor networks

In Vehicular Ad Hoc Networks VANETs, a multitude of applications need to address not a single vehicle on the road, nor the whole totality of vehicles, but only a community of vehicles which share the same geographic location for the purpose of safety, traffic efficiency, advertising or infotainment. The goal is to transmit data from a unique source node to a set of destination nodes satisfying a set of geographic criteria. Geocast routing protocol in VANETs appear to be the most appropriate routing technique for these applications. In this investigation, we introduce some existing Geocast routing protocols for VANETs and then we provide a classification of these protocols based on the used relay selection technique. We present a comparison of these Geocast routing protocols according to different criteria and finally, we highlight some directions we are considering for our Geocast routing solution for VANETs.

Geocast Routing Protocols for VANETs: Survey and Guidelines

Mobile sink Wireless Sensor Network (MSWSN) has recently received a lot of attention from the research community. Its appealing characteristics of providing longer network lifetimes, delay optimizations and the flexibility to adapt dissemination strategies according to applications' requirements have proved to be more efficient. Numerous mobile sink based data dissemination strategies have been proposed. This work presents state of the art literature review on MSWSN data dissemination strategies. Issues and flexibilities that did not exist with static sink WSN have been discussed. A classification of available data dissemination strategies and their pros and cons has been discussed.

Data dissemination strategies in mobile sink Wireless Sensor Networks: A survey

Vehicular Ad Hoc Networks (VANETs) are characterized by highly speed nodes, highly dynamic topology and frequent link disconnections. This raises a number of challenges especially in the field of data dissemination. Our study focuses on Geocast routing which consists of routing a message from a unique source vehicle to all vehicles located in a well geographically defined destination area called ZOR (Zone Of Relevance). In this work, we introduce some existing Geocast routing protocols for VANETs as well as a classification of these protocols based on the relay selection technique they use. We then provide a comparison of these protocols according to different criteria. While in literature ZORs are often assumed to be of any form and still chosen according to the scenarios and motivation needs of the authors [1], we consider a ZOR as a set of sub-ZORs and we choose simple geometrical forms for each sub-ZOR so that they would be easy to implement and to represent mathematically. We provide a geometrical vision angles based technique to define if two sub-ZORs are in the same direction in order to send them a single message, and hence, reduce messages overhead. Finally, we introduce a new routing protocol in Sub-ZORs (GeoSUZ) for VANETs based on our geometrical vision angles and greedy forwarding techniques. We compare GeoSUZ to GPSR routing protocol [3] and some numerical results show a significant gain in term of number of messages sent over the network.

/pdf/geocast-routing-protocols-for-vanets-survey-and-geometry-1e4okcgsn3.pdf

Geocast Routing Protocols for VANETs: Survey and Geometry-Driven Scheme Proposal

The interest shown by some community of researchers to autonomous drones or UAVs (unmanned aerial vehicles) has increased with the advent of wireless communication networks. These networks allow UAVs to cooperate more efficiently in an ad hoc manner in order to achieve specific tasks in specific environments. To do so, each drone navigates autonomously while staying connected with other nodes in its group via radio links. This connectivity can deliberately be maintained for a while constraining the mobility of the drones. This will be suitable for the drones involved in a given path of a given transmission between a source and a destination. This constraint could be removed at the end of the transmission process and the mobility of each concerned drone becomes again independent from the others. In this work, we proposed a flocking-based routing protocol for UAVs called BR-AODV. The protocol takes advantage of a well known ad hoc routing protocol for on-demand route computation, and the Boids of Reynolds mechanism for connectivity and route maintaining while data is being transmitted. Moreover, an automatic ground base stations discovery mechanism has been introduced for a proactive drones and ground networks association needed for the context of real-time applications. The performance of BR-AODV was evaluated and compared with that of classical AODV routing protocol and the results show that BR-AODV outperforms AODV in terms of delay, throughput and packet loss.

A Flocking-Based on Demand Routing Protocol for Unmanned Aerial Vehicles

Vehicular ad hoc networks (VANETs) are the key enabling technology for intelligent transportation systems. Carrier-sense multiple access with collision avoidance (CSMA/CA) is the de facto media access standard for inter-vehicular communications, but its performance degrades in high-density networks. Time-division multiple access (TDMA)-based protocols fill this gap to a certain extent, but encounter inefficient clock synchronization and lack of prioritized message delivery. Therefore, we propose a priority-based direction-aware media access control (PDMAC) as a novel protocol for intra-cluster and inter-cluster clock synchronization. Furthermore, PDMAC pioneers a three-tier priority assignment technique to enhance warning messages delivery by taking into account the direction component, message type, and severity level on each tier. Analytical and simulation results validate the improved performance of PDMAC in terms of clock synchronization, channel utilization, message loss rate, end-to-end delays, and network throughput, as compared with eminent VANET MAC protocols.

/pdf/pdmac-a-priority-based-enhanced-tdma-protocol-for-warning-xyf1cspp59.pdf

Saadi Boudjit

Papers

Geocast Routing Protocols for VANETs: Survey and Guidelines

Data dissemination strategies in mobile sink Wireless Sensor Networks: A survey

Geocast Routing Protocols for VANETs: Survey and Geometry-Driven Scheme Proposal

A Flocking-Based on Demand Routing Protocol for Unmanned Aerial Vehicles

PDMAC: A Priority-Based Enhanced TDMA Protocol for Warning Message Dissemination in VANETs.