Abstract
Wireless sensor networks with mobile sinks enable a mobile device to move into the sensing area for the purpose of collecting the sensing data. Mobile sinks increase the flexibility and convenience of data gathering in such systems. Taking the energy consumption of the mobile sink into account, the moving distance of the mobile sink must be reduced efficiently. Hence, it is important and necessary to develop an efficient path planning scheme for mobile sinks in large-scale wireless sensor network systems. According to several greedy-based algorithms, we adopt an angle bisector concept to create the moving path for the mobile sink. In this paper, a novel and efficient data collection path planning scheme is proposed to reduce the moving distances and to prolong the lifetimes of mobile sinks in wireless sensor networks. Considering the communication range limitations of sensor nodes and the obstacles within sensing areas, we design an inner center path planning algorithm to reduce the moving distance for the mobile sink. A back-routing avoidance method is included to address the moving path backpropagation problem. We account for the obstacles in sensing area. The reference point of obstacle avoidance is employed to address the obstacle problem. The proposed scheme makes an adaptive decision for creating the moving path of the mobile sink. A suitable moving path planning scheme can be achieved, and the moving distance of the mobile sink can be reduced. The proposed scheme is promising in large-scale wireless sensor networks. When the number of sensor nodes in the sensing area is increased by 50, the proposed scheme yields an average moving distance that is 1.1 km shorter than that of the heuristic tour-planning algorithm, where the sensing area is 5 km × 5 km. Simulation results demonstrate that the proposed data collection path planning scheme outperforms the previously developed greedy-based scheme in terms of the moving paths and moving distances of mobile sinks in wireless sensor networks.
Highlights
Wireless sensor networks (WSNs) with mobile sinks have been widely considered a promising solution to replace people for discovering and collecting sensing data within a highly dangerous region [1,2,3,4,5]
We illustrate a snapshot of the moving path for a certain iteration of the simulation by evaluating the circle path planning algorithm (CCPPA) and our proposed inner center path planning algorithm (ICPPA), where the sensing area is 1000 m × 1000 m and the top left corner is the starting position for the mobile sink to travel through all of the sensor nodes
5 Conclusion The development of a path planning scheme is a challenging issue in wireless sensor networks with mobile sinks
Summary
Wireless sensor networks (WSNs) with mobile sinks have been widely considered a promising solution to replace people for discovering and collecting sensing data within a highly dangerous region [1,2,3,4,5]. The energy efficiency of the sensor nodes is one of the most important features for extending the lifespans of WSNs. A mobile sink is employed to increase the flexibility of the network for collecting the sensing information in largescale monitoring environments. The mobility of the sink enables convenient data collection and reduces the energy consumption by the sensor nodes [6,7,8,9,10]. To reduce the moving distances and to prolong the lifetimes of mobile sinks, a new and efficient data gathering path planning scheme must be developed for large-scale WSN systems. The performance parameters of interest in this paper are the moving path and moving distance of a mobile sink
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
