Proactive Data Dissemination in Wireless Sensor Networks with Uncontrolled Sink Mobility

This paper investigates Wireless Sensor Networks (WSNs) with mobile sinks that collect data from sensors by following uncontrolled trajectories. In particular, the paper focuses on proactive data dissemination strategies in which the trajectory of the mobile sink is unknown to the sensors. These strategies attempt to obtain a good trade-off between the number of sensors the mobile sinks has to visit in order to collect representative data of all sensors, and the communication effort required by the sensors. All the investigated techniques also avoid the use of multi-hop routing, due to its high cost. Some of them are based on random walks whereas others are based on a combination of probabilistic forwarding and probabilistic storage. An analysis of the various methods in terms of the performance trade-off between the efficiency of the data gathering and communication overhead is also presented

Strengths and Weaknesses of Prominent Data Dissemination Techniques in Wireless Sensor Networks

Data dissemination is the most significant task in a Wireless Sensor Network (WSN). From the bootstrapping stage to the full functioning stage, a WSN must disseminate data in various patterns like from the sink to node, from node to sink, from node to node, or the like. This is what a WSN is deployed for. Hence, this issue comes with various data routing models and often there are different types of network settings that influence the way of data collection and/or distribution. Considering the importance of this issue, in this paper, we present a survey on various prominent data dissemination techniques in such network. Our classification of the existing works is based on two main parameters: the number of sink (single or multiple) and the nature of its movement (static or mobile). Under these categories, we have analyzed various previous works for their relative strengths and weaknesses. A comparison is also made based on the operational methods of various data dissemination schemes

Ferry–Based Directional Forwarding Mechanism for Improved Network Life-Time in Cluster-Based Wireless Sensor Network

Considerable energy saving can be achieved with mobility-based wireless sensor networks (WSN's), where a mobile node (ferry) visits sensing nodes in a network to collect sensed data. However, the critical issues of such WSN's are limited networks lifetime and high data latency, these critical issues are due to the slow mobility and relatively long route distance for ferries to collect and forward data to the sink. Incorporating ferries in WSNs eliminates the need for multi-hop forwarding of data, and as a result, reduce energy consumption at sensing nodes. In this paper, we introduce the One Hop Cluster-Head Algorithm (OHCH), where a subset of ferries serve as cluster heads (CH), travel between nodes with short distance mobility, collect data originated from sources, and transfer it to the sink with minimum hop count possible, this approach can achieve more balance between network energy saving and data collection delay, also, it is an efficient design to combine between ferries and noise

Using mobile sinks in wireless sensor networks to improve building emergency response.

We propose an opportunistic routing scheme for wireless sensor networks operating in volatile environments. In particular, we consider a sensor field for sensing and reporting on buildings during fires, where sensors are progressively being destroyed by the fire. We envisage firefighters equipped with small computers which can act as mobile sink nodes, offering transient shorter routes for relaying data, and offering connectivity to disconnected areas of the network. We examine different ways in which these uncontrolled mobile sinks could enhance performance, and develop protocols for advertising the presence of the mobile sinks, gathering data for forwarding, and prioritising disconnected regions. We evaluate the performance in simulation, and on randomly damaged networks, we show that we can increase the data delivery by up to 50%

Coordinated movement of multiple mobile sinks in a wireless sensor network for improved lifetime

Sink mobility is one of the most effective solutions for improving lifetime and has been widely investigated for the last decade. Algorithms for single-sink mobility are not directly applied to the multiple-sink case due to the latter’s specific challenges. Most of the approaches proposed in the literature use mathematical programming techniques to solve the multiple-sink mobility problem. However, doing so leads to higher complexities when traffic flow information for any possible sink-site combinations is included in the model. In this paper, we propose two algorithms that do not consider all possible sink-site combinations to determine migration points. We first present a centralized movement algorithm that uses an energy-cost matrix for a user-defined threshold number of combinations to coordinate multiple-sink movement. We also give a distributed algorithm that does not use any prior network information and has a low message exchange overhead. Our simulations show that the centralized algorithm gives better network lifetime performance compared to previously proposed MinDiff-RE, random movement, and static-sink algorithms. Our distributed algorithm has a lower network lifetime than centralized algorithms; sinks travel significantly less than in all the other schemes. © 2015, Koç and Korpeoglu

Enhanced VGDRA for Dynamic WSN

Sensor Nodes are fundamental blocks of Wireless Sensor Networks. The focus of researchers is still on reducing the energy dissipation by the sensor nodes over time. Sensor nodes once deployed have a fixed amount of energy available to them. In order to use the energy efficiently the sensor nodes are grouped together based on the tasks performed by them. These groups of sensor nodes are known as clusters. Each cluster is headed by a cluster head connecting the cluster with the base station. Energy consumption is directly proportional to the distance from the base station. The concept of network lifetime is closely related to the energy consumption and area coverage in wireless sensor network. The main aim of the proposed technique is to select cluster heads in such a way that they extend the network lifetime and increase throughput of the network. The efficiency of the proposed cluster head selection technique is that it covers energy consumption and routes selection for data delivery from sensor node to the base station. In this paper an Enhanced Virtual Grid-based Dynamic Routes Adjustment Scheme is proposed presenting a set of rules for the selection of cluster heads in such a way that the energy consumption by the cluster heads is balanced throughout the network and it does not get over exploited

ProFlex: A Probabilistic and Flexible Data Storage Protocol for Heterogeneous Wireless Sensor Networks

This paper presents ProFlex, a proactive data distribution protocol for heterogeneous wireless sensor networks (HWSNs). ProFlex guarantees robustness in data retrieval by intelligently managing data replication among selected storage nodes in the network. Contrarily to related protocols in the literature, ProFlex considers the resource constraints of sensor nodes and constructs multiple data replication structures, which are managed by more powerful nodes. Additionally, ProFlex takes profit of the higher communication range of such powerful nodes in the network and use the long link to improve data distribution. When compared with Supple -- a related protocol, we show by simulation that Proflex increases the network resilience under failures circumstances, decreases the overhead of transmitted messages, and decreases the number of hops to find a specific data in the network.Cet article porte sur la proposition d'un protocole de données proactif de distribution pour les réseaux de capteurs sans fil hétérogènes (HWSNs). Notre protocole, ProFlex, garantit la robustesse de la récupération des données grâce à sa gestion intelligente de la réplication des données entre les nœuds de stockage sélectionnés dans le réseau. Contrairement à d'autres protocoles dans la littérature, ProFlex considère les contraintes de ressources de capteurs et construit plusieurs structures de réplication des données, qui sont gérés par des nœuds plus puissants. En outre, ProFlex profite de la meilleure communication radio de ces nœuds plus puissants et utilise ces longues portée pour améliorer la distribution des données. Nous avons comparé ProFlex avec le protocole Supple et nous avons montré par simulation que Proflex augmente la résilience du réseau, même dans des circonstances des pertes de messages, diminue la surcharge de messages transmis, et diminue le nombre de sauts nécessaire pour trouver un ensemble de données spécifiques dans le réseau

Propose effective routing method for mobile sink in wireless sensor network

Wireless sensor network is one of the popular technologies used for maximizing the lifetime of network and to enhance the data collection process and energy efficiency by mobility. So, this work was proposed and focused on sink mobility which plays a key role in data collection process. The main challenge task was to discover the route in the active network. We have proposed an opportunistic algorithm in this paper with mobile sink to discover the ideal path starting the source to destination node. The proposed system has focused on a sensor field to sense and to report on building during fires where the sensors could be destroyed. The proposed system was evaluated through simulation and compared with existing algorithms (Genetic algorithm, multi-layer perceptron neural network). The performance which showed data delivery can be increased by up to 95%