Vol.58, No.3, 2019, pp.711-725, doi:10.32604/cmc.2019.05450
An Asynchronous Clustering and Mobile Data Gathering Schema Based on Timer Mechanism in Wireless Sensor Networks
  • Jin Wang1,2,3, Yu Gao3, Wei Liu3, Wenbing Wu1, Se-Jung Lim4,*
Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation, School of Computer & Communication Engineering, Changsha University of Science & Technology, Changsha, 410114, China.
School of Information Science and Engineering, Fujian University of Technology, Fuzhou, 350000, China.
College of Information Engineering, Yangzhou University, Yangzhou, 225000, China.
Department of Computer Engineering, Chonnam National University, Yeosu, 596597, Korea.
* Corresponding Author: Se-Jung Lim. Email: .
Recently, Wireless sensor networks (WSNs) have become very popular research topics which are applied to many applications. They provide pervasive computing services and techniques in various potential applications for the Internet of Things (IoT). An Asynchronous Clustering and Mobile Data Gathering based on Timer Mechanism (ACMDGTM) algorithm is proposed which would mitigate the problem of “hot spots” among sensors to enhance the lifetime of networks. The clustering process takes sensors’ location and residual energy into consideration to elect suitable cluster heads. Furthermore, one mobile sink node is employed to access cluster heads in accordance with the data overflow time and moving time from cluster heads to itself. Related experimental results display that the presented method can avoid long distance communicate between sensor nodes. Furthermore, this algorithm reduces energy consumption effectively and improves package delivery rate.
Internet of things, wireless sensor networks, clustering, mobile data collection, timer.
Cite This Article
J. . Wang, Y. . Gao, W. . Liu, W. . Wu and S. . Lim, "An asynchronous clustering and mobile data gathering schema based on timer mechanism in wireless sensor networks," Computers, Materials & Continua, vol. 58, no.3, pp. 711–725, 2019.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.