Clustering and splitting charging algorithms for large scaled wireless rechargeable sensor networks

被引:71
作者
Lin, Chi [1 ,2 ]
Wu, Guowei [1 ,2 ]
Obaidat, Mohammad S. [3 ]
Yu, Chang Wu [4 ]
机构
[1] Dalian Univ Technol, Sch Software, Rd 8, Dalian 116620, Peoples R China
[2] Key Lab Ubiquitous Network & Serv Software Liaoni, Dalian 116621, Peoples R China
[3] Fordham Univ, Comp & Informat Sci, 441 East Fordham Rd, Bronx, NY 10458 USA
[4] Chung Hua Univ, Dept Comp Sci & Informat Engn, Hsinchu, Taiwan
基金
中国国家自然科学基金;
关键词
Wireless rechargeable sensor networks; Charging efficiency; Task splitting; MAC PROTOCOL; ENERGY REPLENISHMENT; AGGREGATION; MANAGEMENT; SCHEME;
D O I
10.1016/j.jss.2015.12.017
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
As the interdiscipline of wireless communication and control engineering, the periodical charging issue in Wireless Rechargeable Sensor Networks (WRSNs) is a popular research problem. However, existing techniques for periodical charging neglect to focus on the location relationship and topological feature, leading to large charging times and long traveling time. In this paper, we develop a hybrid clustering charging algorithm (HCCA), which firstly constructs a network backbone based on a minimum connected dominating set built from the given network. Next, a hierarchical clustering algorithm which takes advantage of location relationship, is proposed to group nodes into clusters. Afterward, a K-means clustering algorithm is implemented to calculate the energy core set for realizing energy awareness. To further optimize the performance of HCCA, HCCA-TS is proposed to transform the energy charging process into a task splitting model. Tasks generated from HCCA are split into small tasks, which aim at reducing the charging time to enhance the charging efficiency. At last, simulations are carried out to demonstrate the merit of the schemes. Simulation results indicate that HCCA can enhance the performance in terms of reducing charging times, journey time and average charging time simultaneously. Moreover, HCCA-TS can further improve the performance of HCCA. (C) 2015 Elsevier Inc. All rights reserved.
引用
收藏
页码:381 / 394
页数:14
相关论文
共 53 条
[1]   Wireless sensor networks: a survey [J].
Akyildiz, IF ;
Su, W ;
Sankarasubramaniam, Y ;
Cayirci, E .
COMPUTER NETWORKS, 2002, 38 (04) :393-422
[2]  
[Anonymous], 2013, P 16 ACM INT C MOD A
[3]  
[Anonymous], IEEE ACM T NETWORK
[4]  
[Anonymous], 2012, IEEE T MOBILE COMPUT, DOI DOI 10.1109/TMC.2012.161
[5]  
[Anonymous], 2012, P 15 ACM INT C MOD A
[6]  
[Anonymous], 2011, P IEEE GLOBAL TELECO
[7]  
[Anonymous], 17 IEEE INT C HIGH P
[8]   AODV routing protocol implementation design [J].
Chakeres, ID ;
Belding-Royer, EM .
24TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS WORKSHOPS, PROCEEDINGS, 2004, :698-703
[9]   Optimal Scheduling for Quality of Monitoring in Wireless Rechargeable Sensor Networks [J].
Cheng, Peng ;
He, Shibo ;
Jiang, Fachang ;
Gu, Yu ;
Chen, Jiming .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2013, 12 (06) :3072-3084
[10]   A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks [J].
Cheng, XZ ;
Huang, X ;
Li, DY ;
Wu, WL ;
Du, DZ .
NETWORKS, 2003, 42 (04) :202-208