Hash-area-based data dissemination protocol in wireless sensor networks

Data dissemination from multiple sources to mobile sinks is fundamental and challenging in WSN applications due to limited energy supply of sensor nodes and sink mobility. Previous data dissemination protocols either rely on an energy-consuming coordinate system or build an inefficient backbone. In this paper, we propose a hierarchical role-based data dissemination (HRDD) protocol in wireless sensor networks. In HRDD, a small number of sensor nodes are assigned to serve as cluster heads and agents to form the data dissemination backbone and mitigate unnecessary query forwarding. In addition, HRDD designs an efficient data delivery mechanism that provides shorter paths to accelerate data delivery as well as reduce the number of data transmissions. An adaptive backbone maintenance mechanism is also introduced for low-energy cluster heads and agents to reduce their load, thereby prolonging the network lifetime. The experimental results show that HRDD achieves the longer network lifetime, the shorter delay, and the high success ratio compared to the prior work.

This paper studies on delivery-guaranteed and effective data dissemination for mobile sink groups in wireless sensor networks. A mobile sink group denotes a set of tightly coupled mobile sinks for team collaborations such as a team of firefighters and a group of solders. The mobile sinks have a group movement feature. They thus randomly move in personal spaces as well as collectively move together as a single entity. To support such group mobility, previous studies provide circle-based protocols determining successive circular areas of a group continuously moving, and then propagate data in the areas by flooding. However, since a group is still moving during decision of each circle, they may cause asynchrony between circles and actual group positions. Eventually, it could harm reachability and energy-efficiency. We therefore propose a novel data dissemination protocol using motion properties of a mobile sink group: slowly varying and streamlike movement. By the slowly varying constraint, the protocol predictively and effectively delivers data to a group through a band of sensor nodes located in front of the streamlike trajectory of the group.

Lifetime and energy efficiency are important factors in the design of wireless sensor network. A critical issue during data collection is the formation of energy holes near the sink. Sensors which are located near the sink have to participate in relaying data on behalf of other sensors and thus their energy will be depleted very quickly. Mobile sink movement yields the significant performance gained by decreasing the amount of energy consumption. In this paper, we propose an Intelligent Grid Based Data Disseminating protocol for mobile sink in wireless sensor networks. We have utilized a virtual grid as the protocol's substructure. In our proposed method, cell heads (CHs) will be selected based on the locations of virtual cross points (CPs) and CPs selection is needless to transfer any required data between neighbor nodes. We have optimized CPs selection using linear programming technique in order to increase network lifetime. By selecting the CHs based on our proposed algorithm, data will be disseminated toward the sink. Our data dissemination protocol is simple and has low overhead to construct and maintain. Also, we have presented a new method for sink location update which leads to the least cost in data transfer. Simulation results illustrate that by utilizing hierarchical functionality and selecting appropriate CPs and consequently selecting CHs, energy consumption will be decreased in comparison with other presented methods which directly lead to network lifetime increment. Also by determining an optimal cell size, packet delivery rate will be improved noticeably.

One of the major challenges in facing the design of disseminating protocol for Wireless Sensor Networks (WSNs) is to find an energy efficiency way. Recently, several researches have been studied for this issue, and SPMS, that outperforms the well-known protocol SPIN, specially is a representative protocol. Also one of many characters of SPMS is the using of the shortest path to minimize the energy consumption. However, since it repeatedly uses the same path as the shortest path, the maximizing of the network lifetime is impossible, though it reduces the energy consumption. In this paper, we propose a novel data dissemination protocol, called Energy and Distance Aware protocol based on SPIN (EDAS), that guarantees energy-efficient data transmission and maximizes network lifetime. EDAS solves the network lifetime problem by using the residual energy and the efficient distance between nodes to determine a path for data dissemination. The simulation results show that EDAS guarantees energy-efficient transmission and moreover increases the network lifetime by approximately 69% than that of SPMS.KeywordsWireless Sensor NetworksData Dissemination ProtocolEnergy EfficiencyLifetimeSPMS

Achieving efficient data dissemination to a mobile sink moving is one of the main challenges in wireless sensor networks. In this paper, we describe DHA, a data Dissemination protocol based on Home agent and Access node. DHA introduces the home agent and access node concepts to represent the mobile sink in sensor networks. The movement of the mobile sink affects only the access nodes and home agent, and the sensor nodes can transfer data to the fixed home agent without knowing the position of mobile sink. All the sensor nodes except the home agent and access node don't need to be updated in the direction of forwarding future data. DHA provides reliable and efficient data delivery to a mobile sink with minimum overheads. Our result shows that DHA increases the reliability of data delivery to the mobile sink and reduces the number of broadcast packets, thereby increasing the lifetime of sensor networks.

Life time and Energy Efficiency are important factors in the design of wireless sensor network. A critical issue during data collection is the formation of energy holes near the sink. Sensors near the sink have to participate in relaying data on behalf of other sensors and thus their energy will be depleted very quickly. The mobile sink movement yields the significant performance gained through decreasing the amount of energy consumption. In this study, we propose a Grid Based approach for Data Disseminating to the Mobile Sink in Wireless Sensor Network. Mapping the position of nodes and sink to virtual grid infrastructure construct our main contribution. So that the data which is buffered by nodes could be disseminated to the mobile sink to the optimal manner. Finally, comprehensive simulation reveals the superiority of proposed algorithm in various scenarios.

In wireless sensor networks, the existing real-time routing protocols for stationary sinks exploit a spatiotemporal approach, utilizing the delivery speed based on the end-to-end distance to fulfill the desired time deadline. This approach cannot be directly applied to a mobile sink since the distance can be varied depending on its movement. That is, the delivery speed cannot be determined without knowing the intermediate sensors to know the current location update of the mobile sink and control their transmission speeds. We focus on the real-time protocol for slowly varying mobile sink compared to transmission speed, which may be the most common case. By the slowly varying constraint, the movable area of a sink can be determined by the two factors: its moving distance and initial location. The movable area could provide the maximum transmission distance between a source and a mobile sink. This letter proposes a real-time data dissemination protocol for mobile sinks utilizing the movable area concept. Simulation results show the proposed protocol provides high success ratio of real-time requirement.

Wireless Sensor Networks (WSNs) are popular in smart homes to implement context-aware and intelligent services. Due to fixing bugs and adding new functions, the software on sensor nodes needs to be updated depending on efficient bulk data dissemination. Existing page transfer of data dissemination protocols employ pipelining technique to achieve spatial multiplexing. The conventional pipelining inefficiency, however, becomes a bottleneck in terms of dissemination delay and communication overhead. In this paper, we propose SAPM, a novel Self-Adjusting Pipelining Mechanism for efficient bulk data dissemination. By considering the impact of link correlation, detecting accumulated pages in sensor nodes, and carefully selecting the number of pages to request, SAPM shortens the dissemination delay effectively and reduces communication overhead to improve current bulk data dissemination protocols' performance. Our evaluation results on test bed experiments and extensive simulations show that SAPM reduces the completion time of state-of-the-art bulk data dissemination protocols by 27.8% on average compared to naive solution and the number of transmissions by 17.4% on average under high link correlation while having a low memory overhead.

In wireless sensor networks, a clustering-based technique is considered as an efficient approach for supporting mobile sinks without using position information. It exploits a Backbone-based Virtual Infrastructure (BVI) which uses only cluster heads (CHs) to construct routing structures. Since sensor nodes have constrained energy and are failure-prone, the effective design of both a clustering structure to construct a BVI and a routing protocol in the BVI is an important issue to achieve energy-efficient and reliable data delivery. However, since previous studies use one-hop clustering for a BVI, they are not robust against node and link failures and thus leading low data delivery ratio. They also use flooding-based routing protocols in a BVI and thus leading high energy consumption. Thus, in this paper, we propose a rendezvous-based data dissemination protocol based on multi-hop clustering (RDDM). Since RDDM uses a multi-hop clustering to provide enough backup sensor nodes to substitute a CH and enough backup paths between neighbor CHs, it can provide high robustness against node and link failures. By using a rendezvous CH, RDDM constructs routing paths from source nodes to mobile sinks without flooding in our BVI and thus can save energy of sensor nodes. By considering movement types of sinks, RDDM finds out a shorter path between a source node and a mobile sink through signaling only between neighbor CHs and thus can reduce the energy consumption. Analysis and simulation results show that RDDM provides better performance than previous protocols in terms of energy consumption and data delivery ratio.

À Load-balancing and Self-adaptation Clustering for Lifetime Prolonging in Large Scale Wireless Sensor Networks

The advantages of deploying mobile sinks (MSs) in wireless sensor networks (WSNs) have attracted tremendous attention recently, because mobility of a sink provides an efficient method to improve data gathering performance in WSNs. However, in such kind of WSN, the efficiency of data dissemination is obviously affected by the trajectory of the MS. Therefore, optimal moving schemes of the MS have been studied in many researches. Nevertheless, in many cases, the trajectory of the MS is not able to change ideally as previous studies assumed but depending on the environmental conditions. In this paper, we focus on the efficiency of data gathering in WSN with a MS whose trajectory cannot change ideally and propose a new data diffusion scheme - implementing a new Pre-Diffusion Algorithm (PDA) in a hierarchical WSN aimed at improving data gathering efficiency. This hierarchical WSN is composed of several clusters, and datatransmission is done by higher powered cluster head (CH) node. Our scheme predetermines the cluster area where the MS is going to arrive in most probability in next period of time. MS fulfills data converging in the cluster head (CH)whose distance to the MS may the smallest compared with other CHs when data gathering starts. Thus more data can be collected with less trajectory length of MS. Simulation results show that our proposed scheme improves data gathering efficiency as compared to conventional scheme.

Wireless sensor network swears an exceptional fine-grained interface between the virtual and physical worlds. The clustering algorithm is a kind of key technique used to reduce energy consumption. Many clustering, power management, and data dissemination protocols have been specifically designed for wireless sensor network (WSN) where energy awareness is an essential design issue. Each clustering algorithm is composed of three phases cluster head (CH) selection, the setup phase, and steady state phase. The hot point in these algorithms is the cluster head selection. The focus, however, has been given to the residual energy-based clustering protocols which might differ depending on the application and network architecture. In this paper, a survey of the state-of-the-art clustering techniques in WSNs has been compared to find the merits and demerits among themselves. It has been assumed that the sensor nodes are randomly distributed and are not mobile, the coordinates of the base station (BS) and the dimensions of the sensor field are known.

Mobile Agents (MAs) are referred to as autonomous application programs with the inherent ability to move between nodes towards a goal completion. In the context of Wireless Sensor Networks (WSNs), MAs may be used in the process of combining data from different sources aiming at maximizing the useful information content. MAs have been initially developed to replace the Client/Server model which exhibits many disadvantages, particularly in WSN environments (e.g. heavy bandwidth usage and high energy consumption). Mobile Agents can be used to significantly reduce the cost of communication, especially through low bandwidth, by moving the processing function to the data rather than bring the data to a central processor. The main objective of this paper is to analyze some Client/Server and Mobile Agent data dissemination protocols in WSN.

Large scale Wireless Sensor Networks (WSNs) often utilize multiple mobile sink nodes to improve the network lifetime and scalability. However, most of the studies conducted in this context, consider unlimited buffer capacity for the sink nodes. But, this model cannot truly describe the behavior of WSNs and causes congestion in the sink nodes. To solve this problem, in this paper, we use limited buffer capacity for each mobile sink node in WSNs and present a two-level Fuzzy Logic Controller (FLC)-based dynamic clustering scheme and congestion prevention. In this scheme, sink nodes try to predict current load based on their loads in previous rounds by using ARIMA method and based on it, the first FLC selects the nearest uncongested sink node from multiple available mobile sink nodes. Then, the second FLC applies the output of the first FLC to select appropriate nodes as cluster heads to mitigate the energy consumption in the network. Extensive simulation results indicate the effectiveness of the proposed fuzzy logic-based solution in reducing congestion in the mobile sink nodes and improving load balancing in them which these result in the network lifetime improvement and decreasing the number of retransmissions.

Active data dissemination for mobile sink groups in wireless sensor networks