Abstract
The design of an effective and robust data gathering algorithm is crucial to the overall performance of wireless sensor networks (WSN). However, using traditional routing algorithms for data gathering is energy-inefficient for sensor nodes with limited power resources and multi-hop communication protocols. Data gathering with mobile sinks provided an effective solution to this problem. The major drawback of this approach is the time and path constraints of the mobile sink, which limit the mobile sink to collect data from all sensor nodes and, then, data routing is still required for these unreachable parts by the mobile sink. This paper presents a new data gathering algorithm called Connectivity-Based Data Collection (CBDC). The CBDC algorithm utilizes the connectivity between sensor nodes so as to determine the trajectory of the mobile sink whilst satisfying its path constraint and minimizing the number of multi-hop communications. The presented results show that CBDC, in comparison with the LEACH-C algorithm, prolongs the network life time at different connectivity levels of sensor networks, varying number of sensor nodes and at different path constraints of the mobile sink.
Highlights
As data aggregation is one of the primary tasks of Wireless Sensor Networks (WSN), sensor nodes with limited power resources and wireless communication range necessitate the need for energy-efficient data collectionHow to cite this paper: Alhasanat, A.I., Matrouk, K.D., Alasha'ary, H.A. and Al-Qadi, Z.A. (2014) Connectivity-Based Data Gathering with Path-Constrained Mobile Sink in Wireless Sensor Networks
From network life time’s point of view, simulation results of this paper showed that connectivity-based data collection (CBDC) outperformed the LEACH-C for varying number of sensor nodes
Both considerations are integrated with the CBDC algorithm in a single benefit function which is applied to all collection points (CP), and the CP with the minimum benefit value is removed
Summary
As data aggregation is one of the primary tasks of Wireless Sensor Networks (WSN), sensor nodes with limited power resources and wireless communication range necessitate the need for energy-efficient data collection. One of the main challenges of this technique is the difficulty of the mobile sink to traverse all sensor nodes in the network, since data must be collected within a specific time deadline. This paper endeavors to design a data gathering algorithm (Data collection and data gathering are used interchangeably in this paper) using path constrained mobile sink referred to as connectivity-based data collection (CBDC) algorithm With this algorithm, the major goal is to maximize the network life time whilst satisfying the time and energy constraints of the mobile sink. The relation between mobile sink path constraints, network connectivity and number of sensor nodes and their impact on network life times are analyzed through extensive Monte Carlo simulation. From network life time’s point of view, simulation results of this paper showed that CBDC outperformed the LEACH-C for varying number of sensor nodes.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
