基于K-PPER算法的多充电车WRSNs充电策略

可充电无线传感器网络充电策略的研究多基于单充电车，并不能满足网络规模的需求.为此提出一种针对多充电车的基于优先权的周期性充电策略（K-PPER）.采用K-means优化算法进行分簇，以簇为单位对网络进行充电管理，将有充电请求的节点加入归属簇的充电序列中，对节点的实时充电请求按充电优先级排序；最后，基站派出充电车到达充电簇，并按充电序列充电.仿真实验结果表明，网络效用较K-means算法提高约42%，能量效用较局部信息分布式协作协议（DCLK）提高约4%，较分布式协作协议提高约18%.

Charging Strategy of Multiple Charging Vehicles in WRSNs Based on K-PPER Algorithm

Mostly,the charging strategy in wireless rechargeable sensor networks (WRSNs) adopts single mobile charger, but it can't meet the requirements of network scale. The charging strategy of multiple charging vehicles based on K-means improvement periodic energy replenishment based on charging priority (K-PPER) is proposed. Firstly, the network is divided into clusters by adopting the K-means improvement algorithm. Then, the network is recharged in clusters unit. The node with charging request is added to the charging sequence of the belonging cluster. And each charging sequence is sorted by the node's charging priority. At last, the base station sends a mobile charger to the cluster and starts to charge according to the sequence. The experimental results show that the network utility is about 42% higher than K-means. The energy utility of K-PPER algorithm increases about 4% compared with distributed coordination local knowledge (DCLK) protocol, and increases about 18% compared with distributed coordination protocol.