返回
A Coverage-Aware Hierarchical Charging Algorithm in Wireless Rechargeable Sensor Networks
DOI:10.1109/MNET.2018.1800197.png)
摘要
En 中文
Constant energy supply for sensor nodes is essential for the development of the green Internet of Things (loT). Recently, WRSNs have been proposed to resolve the energy limitations of nodes, aiming to realize continuous functioning. In this article, a coverage-aware hierarchical charging algorithm in WRSNs is proposed, considering energy consumption and the degree of node coverage. The algorithm first performs network clustering using the K-means algorithm. In addition, nodes are classified into multiple levels in each cluster to calculate respective anchor points based on the energy consumption rate and coverage degree of nodes. Then, the anchor points converge to an optimized anchor point in each cluster. To reduce charging latency, the optimized anchor points form two disjoint internal and external polygons. Next, mobile chargers travel along the internal and external polygons, respectively. Experimental results indicate that the proposed algorithm can improve charging efficiency and reduce charging latency substantially.
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
2.6K
被引数:
1.1W
机构
引用论文
HEED: A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networksHEED: 一种用于ad hoc传感器网络的混合,节能,分布式分簇方法
Internet of Things: A Survey on Enabling Technologies, Protocols, and Applications物联网: 关于使能技术、协议和应用的调查

