ISBN: 978-981-11-0008-6 DOI: 10.18178/wcse.2016.06.045
A Rendezvous Node Selection Algorithm for Mobile Sink Path Planning in Wireless Sensor Networks
Abstract— Recent research shows that significant energy hole problem can be solved in wireless sensor
network (WSN) by using mobile sink capable of carrying data. In order to plan an optimal moving tour for
mobile sink without long distance travel, we develop the rendezvous node selection algorithm (RNSA) to
find rendezvous nodes (RN) for the sink to visit. The RNSA can select the set of RNs to act as store points
for the mobile sink, and several factors would be considered to find suitable RNs from sensor nodes, the
other sensor nodes would forward data via multi hopping to the nearest RN, such that the energy
consumption of sensor nodes is minimized and uniform to avoid the problem of energy holes while ensuring
sensed data are collected on time. Our scheme is then validated through extensive simulations.
Index Terms— path plan, wireless sensor network, mobile sink, rendezvous node, energy hole.
Xiaoming Wu, Yinglong Wang
College of Information Science and Engineering, Shandong University of Science and Technology, CHINA
Xiaoming Wu, Yinglong Wang, Yifan Hu
Shandong Computer Science Center (National Supercomputer Center in Jinan), CHINA
Shandong Provincial Key Laboratory of Computer Network, CHINA
Cite: Xiaoming Wu, Yinglong Wang, Yifan Hu, "A Rendezvous Node Selection Algorithm for Mobile Sink Path Planning in Wireless Sensor Networks," Proceedings of 2016 6th International Workshop on Computer Science and Engineering, pp. 298-304, Tokyo, 17-19 June, 2016.