On Mobility Management in Multi-Sink Sensor Networks for Geocasting of Queries

In order to efficiently deal with location dependent messages in multi-sink wireless sensor networks (WSNs), it is key that the network informs sinks what geographical area is covered by which sink. The sinks are then able to efficiently route messages which are only valid in particular regions of the deployment. In our previous work (see the 5th and 6th cited documents), we proposed a combined coverage area reporting and geographical routing protocol for location dependent messages, for example, queries that are injected by sinks. In this paper, we study the case where we have static sinks and mobile sensor nodes in the network. To provide up-to-date coverage areas to sinks, we focus on handling node mobility in the network. We discuss what is a better method for updating the routing structure (i.e., routing trees and coverage areas) to handle mobility efficiently: periodic global updates initiated from sinks or local updates triggered by mobile sensors. Simulation results show that local updating perform very well in terms of query delivery ratio. Local updating has a better scalability to increasing network size. It is also more energy efficient than ourpreviously proposed approach, where global updating in networks have medium mobility rate and speed

Review on Localization based Routing Protocols for Underwater Wireless Sensor Network

Underwater Wireless Sensor Network (UWSN) can enable many scientific, military, safety, commercial and environmental applications. Majority of the network models has been introduced for the deployment of sensor nodes through routing schemes and methodologies along with different algorithms but still the design of routing protocol for underwater environment is a challenging issue due to distinctive characteristics of underwater medium. The majority of the issues are also needed to fulfill the appropriate approach for the underwater medium like limited bandwidth, high bit error rates, propagation delay, and 3D deployment. This paper focuses the comparative analysis of the localization based routing protocols for UWSN. This comparative analysis plays a significant attention to construct a reliable routing protocol, which provides the effectual discovery of the route between the source node and the sink node. In addition this comparative analysis also focuses the data packets forwarding mechanism, the deployment of sensor nodes and location based routing for UWSN in different conditions

Vehicular networking in the recursive internetwork architecture

Vehicles such as cars are expected to use communication technologies for retrieving different kinds of information and exchanging information with other vehicles for safety and infotainment purposes. This results in vehicular networks, where vehicles can connect to other vehicles or communication infrastructures such as Road Side Units. The Recursive Inter- Network Architecture (RINA) has been proposed as a Future Internet architecture. This paper investigates and analyses how vehicular networks can be supported by RINA and how a RINA based vehicular network architecture can be designed to support efficient management of mobile vehicles.Peer ReviewedPostprint (author's final draft

A Scalable Data Dissemination Protocol Based on Vehicles Trajectories Analysis

International audienceSince the last decade, the emergence of affordable wireless devices in vehicle ad-hoc networks has been a key step towards improving road safety as well as transport efficiency. Informing vehicles about interesting safety and non-safety events is of key interest. Thus, the design of an efficient data dissemination protocol has been of paramount importance. A careful scrutiny of the pioneering vehicle-to-vehicle data dissemination approaches highlights that geocasting is the most feasible approach for VANET applications, more especially in safety applications, since safety events are of interest mainly to vehicles located within a specific area, commonly called ZOR or Zone Of Relevance, close to the event. Indeed, the most challenging issue in geocast protocols is the definition of the ZOR for a given event dissemination. In this paper, we introduce a new geocast approach, called Data Dissemination Protocol based on Map Splitting (DPMS). The main thrust of DPMS consists of building the zones of relevance through the mining of correlations between vehicles' trajectories and crossed regions. To do so, we rely on the Formal Concept Analysis (FCA), which is a method of extracting interesting clusters from relational data. The performed experiments show,that DPMS outperforms its competitors in terms of effectiveness and efficiency. (C) 2017 Elsevier B.V. All rights reserved