A Rendezvous Node Selection and Routing Algorithm for Mobile Wireless Sensor Network = A Rendezvous Node Selection and Routing Algorithm for Mobile Wireless Sensor Network

다국어 초록 (Multilingual Abstract)

Efficient rendezvous node selection and routing algorithm (RNSRA) for wireless sensor networks with mobile sink that visits rendezvous node to gather data from sensor nodes is proposed. In order to plan an optimal moving tour for mobile sink and avoid energy hole problem, we develop the RNSRA to find optimal rendezvous nodes (RN) for the mobile sink to visit. The RNSRA can select the set of RNs to act as store points for the mobile sink, and search for the optimal multi-hop path between source nodes and rendezvous node, so that the rendezvous node could gather information from sensor nodes periodically. Fitness function with several factors is calculated to find suitable RNs from sensor nodes, and the artificial bee colony optimization algorithm (ABC) is used to optimize the selection of optimal multi-hop path, in order to forward data to the nearest RN. Therefore the energy consumption of sensor nodes is minimized and balanced. Our method is validated by extensive simulations and illustrates the novel capability for maintaining the network robustness against sink moving problem, the results show that the RNSRA could reduce energy consumption by 6% and increase network lifetime by 5% as comparing with several existing algorithms.

참고문헌 (Reference)

1 B. Zhang, "Tracking a duty-cycled autonomous underwater vehicle by underwater wireless sensor networks" 5 : 18016-18032, 2017

2 B. Suh, "Rendezvous points and routing path-selection strategies for wireless sensor networks with mobile sink" 52 (52): 167-169, 2016

3 G. L. Xing, "Rendezvous planning in wireless sensor networks with mobile elements" 7 (7): 1430-1443, 2008

4 R. S. Chang, "Planning rendezvous using the Halin graph in wireless sensor networks" 2 (2): 222-229, 2012

5 S. Mottaghi, "Optimizing LEACH clustering algorithm with mobile sink and rendezvous nodes" 69 (69): 507-514, 2015

6 M. Abo-Zahhad, "Mobile sink-based adaptive immune energy efficient clustering protocol for improving the lifetime and stability period of wireless sensor networks" 15 (15): 4576-4586, 2015

7 Y. Z. Wu, "Local search for the Traveling Salesman Problem : A comparative study" 213-220, 2015

8 R. Sugihara, "Improving the data delivery latency in sensor networks with controlled mobility" 386-399, 2008

9 Muhammad Zahid Abbas, "Hop-by-Hop Dynamic Addressing Based Routing Protocol for Monitoring of long range Underwater Pipeline" 한국인터넷정보학회 11 (11): 731-763, 2017

10 C. Tunca, "Distributed mobile sink routing for wireless sensor networks : A survey" 16 (16): 877-897, 2014

11 K. Saleem, "Analyzing ant colony optimization based routing protocol against the hole problem for enhancing user’s connectivity experience" 51 : 1340-1350, 2015

12 H. Salarian, "An energy-efficient mobile-sink path selection strategy for wireless sensor networks" 63 (63): 2407-2419, 2014

13 E. Lim, "An energy efficient rendezvous node selection approach" 423-425, 2017

14 Y. F. Hu, "An endocrine cooperative particle swarm optimization algorithm for routing recovery problem of wireless sensor networks with multiple mobile sinks" 300 : 100-113, 2015

15 J. Y. Chang, "An efficient tree-based power saving scheme for wireless sensor networks with mobile sink" 16 (16): 7545-7557, 2016

16 A. Sharifkhani, "A mobile-sink-based packet transmission scheduling algorithm for dense wireless sensor networks" 58 (58): 2509-2518, 2009

17 Y. S. Jiang, "A distributed routing for wireless sensor networks with mobile sink based on the greedy embedding" 20 : 150-162, 2014

18 Joaquin Aparicio, "A Software Defined Networking Approach to Improve the Energy Efficiency of Mobile Wireless Sensor Networks" 한국인터넷정보학회 11 (11): 2848-2869, 2017

19 W. Cai, "3D Dubins curves based path programming for mobile sink in underwater sensor networks" 53 (53): 48-50, 2016