A Clue Based Data Collection Routing Protocol for Mobile Sensor Networks

Minimization of energy consumption is the main attention of researchers while developing a routing protocol for wireless sensor networks, as sensor nodes are equipped with limited power supply. Virtual topology is an integral part of routing, and grid-based routing protocols are quite popular due to their simplified and efficient virtual grid topology construction. Although a list of surveys exists that either focus on routing protocols in a broader way or on other virtual topologies, none of these surveys are concerned about grid topology and grid-based routing protocols. Having this motivation in mind and considering the impact of these routing protocols on controlling and managing the energy consumption of wireless sensor networks, this article provides an expansive assessment of grid-based routing protocols based on their methodology. In this survey, the existing grid-based routing protocols are classified into two categories from the perspective of sink mobility: static sink and mobile sink. A phase-wise comprehensive overview of these routing protocols is provided in chronological order, along with their comparative analysis. Furthermore, the characteristics, design issues, and challenges of grid-based routing protocols are also provided.

In view of the routing protocols for wireless sensor networks with mobile sink, the paper classifies the protocols from the network structure and the node mobility pattern respectively. This paper analyzes the design requirements of routing protocols, introduces the characteristics of various protocols and the typical protocols, and analyzes the research ideas of the routing protocols for wireless sensor networks with mobile sink.

SUMMARYIntroduction of mobile sinks into a wireless sensor network can largely improve the network performance. However, sink mobility can cause unexpected changes of network topology, which may bring excessive protocol overhead for route maintenance and may offset the benefit from using mobile sinks. In this paper, we propose an efficient data‐driven routing protocol (DDRP) to address this problem. The design objective is to effectively reduce the protocol overhead for data gathering in wireless sensor networks with mobile sinks. DDRP exploits the broadcast feature of wireless medium for route learning. Specifically, each data packet carries an additional option recording the known distance from the sender of the packet to target mobile sink. The overhearing of transmission of such a data packet will gratuitously provide each listener a route to a mobile sink. Continuous such route‐learning among nodes will provide fresh route information to more and more nodes in the network. When no route to mobile sink is known, random walk routing simply is adopted for data packet forwarding. Simulation results show that DDRP can achieve much lower protocol overhead and longer network lifetime as compared with existing work while preserving high packet delivery ratio. Copyright © 2012 John Wiley & Sons, Ltd.

Increasingly, the services operations which perform data sensing and data propagation in a dynamic environment are important tasks of wireless sensor networks. Therefore, increasing the network lifetime is the main contribution of this investigation. We propose a novel power-aware chessboard-based adaptive routing (PCAR) protocol to support immobility management in wireless sensor networks. The paramount design challenge in this work is to scale-down the network energy consumption, thus maximizing the network lifetime. Our PCAR protocol utilizes vector-oriented propagation, power-consideration decision, and multi-path routing protocols to guide the propagating data to its destination. Moreover, the properties of the clusters are combined in the PCAR to form the cluster-plates in a chessboard-based clustered sensor network. The alternate usage of cluster-head nodes and sleep nodes increases energy efficiency. The opportune divide-and-conquer multi-path fusion mechanism slows down and balances energy consumption. Finally, a performance analysis shows that energy efficiency is achieved by the PCAR protocol.

<span lang="EN-US">Recent developments and widespread in wireless sensor network have led to many routing protocols, many of these protocols consider the efficiency of energy as the ultimate factor to maximize the WSN lifetime. The quality of Service (QoS) requirements for different applications of wireless sensor networks has posed additional challenges. Imaging and data transmission needs both QoS aware routing and energy to ensure the efficient use of sensors. In this paper, we propose an Efficient, Energy-Aware, Least Cost, (ECQSR) quality of service routing protocol for sensor networks which can run efficiently with best-effort traffic processing. The protocol aims to maximize the lifetime of the network out of balancing energy consumption across multiple nodes, by using the concept of service differentiation, finding lower cost by finding the shortest path using nearest neighbor algorithm (NN), also put certain constraints on the delay of the path for real-time data from where link cost that captures energy nodes reserve, energy of the transmission, error rate and other parameters. The results show that the proposed protocol improves the network lifetime and low power consumption.</span>

Wireless Sensor Networks, referred to as WSNs, are made up of various types of sensor nodes. Recent developments in micro electro-mechanical technology have given rise to new integrated circuitry, microprocessor hardware and nano technology, wireless technology, and advanced networking routing protocols. Hospitals and health service facilities, the armed forces, and even residential customers represent a potential huge market for these devices. The problem is that existing sensor network nodes are incapable of providing the support needed to maximize usage of wireless technology. For this reason, there are many novel routing protocols for the wireless sensor networks proposed recently. One is Hierarchical or cluster-based routing. In this paper, we analyze three different types of hierarchical routing protocols: Low Energy Adaptive Clustering Hierarchy (LEACH), Power-Efficient Gathering in Sensor Information Systems (PEGASIS), and Virtual Grid Architecture (VGA). We tried to analyze the performance of these protocols, including the power consumption and overall network performance. We also compared the routing protocol together. This comparison reveals the important features that need to be taken into consideration while designing and evaluating new routing protocols for sensor networks. The simulation results, using same limited sensing range value, show that PEGASIS outperforms all other protocols while LEACH has better performance than VGA. Furthermore, the paper investigates the power consumption for all protocols. On the average, VGA has the worst power consumption when the sensing range is limited, while VGA is the best when the sensing range is increased. Using homogeneous nodes can greatly prolong sensor network’s life time. Also, The network lifetime increases as the number of clusters decreases

Wireless sensor networks (WSNs) include small sensor nodes with battery and processing power and limited memory units then improving power consumption is a major design challenge for any sensor network. In this paper, a new algorithm for routing in the wireless sensor network is proposed using the ultra-innovative algorithm for bacterial Foraging and mobile sink, which leads to energy efficiency. In the proposed method, the number of sensor nodes is determined according to two criteria: the amount of energy on the battery surface and the distance to the sink ahead, which leads to the formation of regular clusters in the network. Nodes adopt a multi-step routing scheme within the network to communicate with the sink. also, the mobile sink is used to balance the load and help consume uniform energy throughout the network. The simulation results show better performance of the proposed method in terms of energy consumption by 17.99%, throughput rate by 30.04%, end-to-end delay by 46.04%, signal-to-noise ratio by 32.81%, delivery rate successfully Data to the sink is 0.80 times higher than the AFSRP (Artificial Fish Swarm Routing Protocol).

In Wireless Sensor Networks (WSN), data gathering using mobile sinks typically incurs constant propagation of sink location indication messages to guide the direction of data reporting. Such behavior is undesirable, especially when the sensor network scale increases, as frequent message flooding will cause serious congestion in network communication and significantly impair the sensor network lifetime. In this paper, we propose a proactive data reporting protocol, SinkTrail, which achieves energy efficient data forwarding to multiple mobile sinks, and effectively reduces the number of sink location broadcasting messages. SinkTrail is unique in two aspects: (1) it allows sufficient flexibility in the movement of mobile sinks to dynamically adapt to unknown terrestrial changes; and (2) without assistance of GPS or predefined landmarks, SinkTrail establishes a logical coordinate system for predicting and tracking mobile sinks' locations, thereby significantly saves energy consumed during the data reporting process. We systematically analyze the impact of several design factors in SinkTrail and explore potential design improvements. The simulation results demonstrate that SinkTrail outperforms the Frequent Flooding Method (FFM) in finding shorter routing path and consumes less energy during data gathering process.

In a wireless sensor network, reducing the energy consumption of sensor nodes and increasing energy conservation can be considered as two significant factors to prolong the network longevity. In this scheme, we proposed an energy-efferent data dissemination algorithm for the sensor nodes by making a virtual hexagonal cell-based infrastructure and multi-mobile sink to create a balance in energy consumption and to mitigate the energy-hole problem. The basic idea of the algorithm is to provide the ability for some of the sensing nodes that are elected by the virtual hexagonal backbone to inform other sensing nodes about the latest location of the nearest mobile sinks to decrease the overhead of updating the mobile sink location for the sensing nodes. Moreover, the sensor nodes can benefit considerably from these specified nodes as a relay node in the multi-hop routing process to send the data to the closest mobile sink based on the latest sink position information, which in turn leads to high energy conservation and low communication overhead between the sensing nodes and the mobile sinks in the network. According to the simulation results, the performance of the proposed scheme is better than the existing data transmission approaches in terms of total energy consumption, delay, and network longevity.

Sensor networks are one of the fastest growing areas in broad wireless ad hoc networking field. A sensor node, typically, contains signal-processing circuits, micro-controllers and a wireless transmitter/receiver antenna. Energy saving is one of the critical issue for sensor networks since most sensors are equipped with non-rechargeable batteries that have limited lifetime. Routing schemes are used to transfer data collected by sensor nodes to base stations. In the literature many routing protocols for wireless sensor networks are suggested. In this work, four routing protocols for wireless sensor networks viz. flooding, Gossiping, GBR and LEACH have been simulated using TinyOS and their power consumption is studied using PowerTOSSIM. A realization of these protocols has been carried out using Mica2 Motes.

We propose a new efficient and robust routing protocol for underwater wireless sensor networks (UWSNs) called the Multiple Data Collection Tree (MDCT) protocol. MDCT proactively constructs and maintains multiple node-disjoint shortest-path routing trees connecting the underwater sensor nodes to onshore sink nodes. These trees provide readily available paths for routing data packets from underwater sensor nodes to surface sink nodes. Using multiple trees improves reliability, reduces congestion (especially at near-root nodes), and shortens routing paths. It also balances energy consumption by distributing the packet-forwarding load over a larger number of nodes. MDCT updates the trees continuously in response to changing underwater conditions such as sensor movements (due to underwater currents) and sensor out-of-power failures. We prove formally the correctness and optimality of the constructed trees. We also show how MDCT outperforms other protocols (namely, VBF, ERGR-EMHC and DCTP) in terms of packet delivery ratio, average end-to-end delay and energy consumption via extensive simulation. For example, compared to VBF, MDCT has increased the delivery ratio by over 75%, has reduced the average end-to-end delay by nearly 60%, and has reduced the energy consumption by 25% in some tested scenarios.

The existing routing protocols for wireless sensor networks were not reasonable in design, which limited their application. Most of the existing studies did not take into account the energy consumption of the network and the balanced use of the energy of sensor nodes, which led to the unsatisfactory application effect of wireless sensor networks in some fields. Therefore, from the perspective of energy balance in wireless sensor networks, this paper proposed a construction method of an energy balance routing protocol in wireless sensor networks based on a fuzzy control strategy. Firstly, based on the analysis of the basic composition of wireless sensor networks and the structure of sensor nodes, this paper expounded the basic process of wireless data transmission and summarized the classification and characteristics of routing protocols in wireless sensor networks from different angles. Secondly, according to the node data transmission characteristics of wireless sensor networks, the energy balance use model of sensor nodes was established, and the design method of the energy balance routing protocol based on fuzzy control strategy was proposed, and the data transmission link was optimized. Finally, through experimental comparative analysis, the results showed that the energy balanced routing protocol proposed in this paper can effectively realize the energy balanced use of the network data transmission process. Compared with other common routing protocols, the wireless sensor network routing protocol proposed in this paper can not only improve the data transmission efficiency and reduce the data redundancy but also save energy consumption and prolong the network running time. The design method of routing protocol proposed in this paper will be conducive to the optimization and application of routing protocol in wireless sensor networks and provide a theoretical basis for the related research of wireless sensor networks.

In this paper, we present mobile sinks with energy-efficient sink location service protocol for wireless sensor networks. The data is collected by mobile sinks in sensor networks. To make source built an efficiently forward data from a source node to a sink with minimal delay path, sink and source broadcast the information of their locations each other in different direction. We also propose a reduced data path detour situations in sink mobility and data forwarding maintenance. Therefore, the overall energy consumption and data transmission time can be reduced effectively. We compare our proposed protocol with Jeon's Sink-oriented Dynamic Location Service (SDLS) protocol. From simulation results, it shows that the proposed protocol has less energy consumption and longer network lifetime than Jeon's.

Underwater Sensor Networks (UWSNs) are significantly different from terrestrial sensor networks in the following aspects: low bandwidth, high latency, node mobility, high error probability, and 3-dimensional space. These new features bring many challenges to the network protocol design of UWSNs. The communication range of underwater wireless sensor networks (UWSNs) is limited, and the nodes are equipped with limited power battery whose replacement is expensive due to underwater harsh environment. Moreover, the networks including small number of nodes have communication problems for long ranges. In this paper, we evaluate the performance of three classical location-based routing protocols (namely, VBF, HH-VBF, and VBVA) for underwater wireless sensor networks in terms of three critical performance metrics for dynamic network topology. Our comparison includes energy consumption, end-to-end delay, and packet delivery ratio.

Mobile sinks have been widely used for data gathering in mobile-enabled wireless sensor networks (mWSNs). However, the frequent network topology dynamics caused by sink mobility in mWSNs may cause excessive protocol overhead for route discovery and maintenance and therefore routing performance degradation. In this paper, we design a new distributed routing protocol for achieving high routing performance in such networks. The designed routing protocol works in a reactive way for route learning/updating and it combines trail based forwarding and data-driven route learning/updating for improved performance as sink(s) move in the network. We present detailed design description of the new protocol. Simulation results show that our protocol can achieve high packet delivery ratio performance with low protocol overhead.