Next Article in Journal
Approaches to Enhancing Gas Sensing Properties: A Review
Next Article in Special Issue
Plummeting Broadcast Storm Problem in Highways by Clustering Vehicles Using Dominating Set and Set Cover
Previous Article in Journal
A Three-Hierarchy Evaluation of Polarimetric Performance of GF-3, Compared with ALOS-2/PALSAR-2 and RADARSAT-2
Article Menu
Issue 7 (April-1) cover image

Export Article

Open AccessArticle

Energy Efficient Routing Algorithm with Mobile Sink Support for Wireless Sensor Networks

Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation, School of Computer & Communication Engineering, Changsha University of Science & Technology, Changsha 410000, China
College of Information Engineering, Yangzhou University, Yangzhou 225000, China
School of Information Science and Engineering, Fujian University of Technology, Fuzhou 350000, China
School of Computing Science and Engineering, Vellore Institute of Technology (VIT), Tamil Nadu 632014, India
Business Administration Research Institute, Sungshin W. University, Seoul 100744, Korea
Author to whom correspondence should be addressed.
Sensors 2019, 19(7), 1494;
Received: 4 February 2019 / Revised: 20 March 2019 / Accepted: 26 March 2019 / Published: 27 March 2019
(This article belongs to the Special Issue Advances in Sustainable Computing for Wireless Sensor Networks)
PDF [6547 KB, uploaded 2 April 2019]
  |     |  


Recently, wireless sensor network (WSN) has drawn wide attention. It can be viewed as a network with lots of sensors that are autonomously organized and cooperate with each other to collect, process, and transmit data around targets to some remote administrative center. As such, sensors may be deployed in harsh environments where it is impossible for battery replacement. Therefore, energy efficient routing is crucial for applications that introduce WSNs. In this paper, we present an energy efficient routing schema combined with clustering and sink mobility technology. We first divide the whole sensor field into sectors and each sector elects a Cluster Head (CH) by calculating its members’ weight. Member nodes calculate energy consumption of different routing paths to choose the optimal scenario. Then CHs are connected into a chain using the greedy algorithm for intercluster communication. Simulation results prove the presented schema outperforms some similar work such as Cluster-Chain Mobile Agent Routing (CCMAR) and Energy-efficient Cluster-based Dynamic Routing Algorithm (ECDRA). Additionally, we explore the influence of different network parameters on the performance of the network and further enhance its performance. View Full-Text
Keywords: Wireless sensor network (WSN); clustering; mobile sink; moving trajectory scheduling; energy efficiency Wireless sensor network (WSN); clustering; mobile sink; moving trajectory scheduling; energy efficiency

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Wang, J.; Gao, Y.; Liu, W.; Sangaiah, A.K.; Kim, H.-J. Energy Efficient Routing Algorithm with Mobile Sink Support for Wireless Sensor Networks. Sensors 2019, 19, 1494.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top