As the technological breakthrough is made in wireless charging, the wireless rechargeable sensor networks (WRSNs) are finally proposed. In order to reduce the charging completion time, most existing works use the “mo...As the technological breakthrough is made in wireless charging, the wireless rechargeable sensor networks (WRSNs) are finally proposed. In order to reduce the charging completion time, most existing works use the “mobilethen- charge” model—the Wireless charging vehicles (WCV) moves to the charging spot first and then charges nodes nearby. These works often aim to reduce the node’s movement delay or charging delay. However, the charging opportunities during the movement are overlooked in this model because WCV can charge nodes when it goes from one spot to the next. In order to use the charging opportunities, a speed grading method is proposed under the circumstance of variable WCV speed, which transformed the problem of final charging delay into a traveling salesman problem with speed grading. The problem was further solved by linear programming method. The simulation experiments show that, compared with the existing charging methods, the proposed method has a significant improvement in charging delay.展开更多
Wireless sensor networks (WSNs) have the trouble of limited battery power, and wireless charging provides apromising solution to this problem, which is not easily affected by the external environment. In this paper, w...Wireless sensor networks (WSNs) have the trouble of limited battery power, and wireless charging provides apromising solution to this problem, which is not easily affected by the external environment. In this paper, we studythe recharging of sensors in wireless rechargeable sensor networks (WRSNs) by scheduling two mobile chargers(MCs) to collaboratively charge sensors. We first formulate a novel sensor charging scheduling problem with theobjective of maximizing the number of surviving sensors, and further propose a collaborative charging schedulingalgorithm(CCSA) for WRSNs. In the scheme, the sensors are divided into important sensors and ordinary sensors.TwoMCs can adaptively collaboratively charge the sensors based on the energy limit ofMCs and the energy demandof sensors. Finally, we conducted comparative simulations. The simulation results show that the proposed algorithmcan effectively reduce the death rate of the sensor. The proposed algorithm provides a solution to the uncertaintyof node charging tasks and the collaborative challenges posed by multiple MCs in practical scenarios.展开更多
In large-scaleWireless Rechargeable SensorNetworks(WRSN),traditional forward routingmechanisms often lead to reduced energy efficiency.To address this issue,this paper proposes a WRSN node energy optimization algorith...In large-scaleWireless Rechargeable SensorNetworks(WRSN),traditional forward routingmechanisms often lead to reduced energy efficiency.To address this issue,this paper proposes a WRSN node energy optimization algorithm based on regional partitioning and inter-layer routing.The algorithm employs a dynamic clustering radius method and the K-means clustering algorithm to dynamically partition the WRSN area.Then,the cluster head nodes in the outermost layer select an appropriate layer from the next relay routing region and designate it as the relay layer for data transmission.Relay nodes are selected layer by layer,starting from the outermost cluster heads.Finally,the inter-layer routing mechanism is integrated with regional partitioning and clustering methods to develop the WRSN energy optimization algorithm.To further optimize the algorithm’s performance,we conduct parameter optimization experiments on the relay routing selection function,cluster head rotation energy threshold,and inter-layer relay structure selection,ensuring the best configurations for energy efficiency and network lifespan.Based on these optimizations,simulation results demonstrate that the proposed algorithm outperforms traditional forward routing,K-CHRA,and K-CLP algorithms in terms of node mortality rate and energy consumption,extending the number of rounds to 50%node death by 11.9%,19.3%,and 8.3%in a 500-node network,respectively.展开更多
新型无线可充电传感器网络中无线充电小车的充电调度算法研究,针对网络中传感器节点发出的充电请求,进行Revised Earliest Deadline First(REDF)无线充电调度优化算法设计。REDF算法综合考虑充电期限和节点距离两个制约因素,使得每一个...新型无线可充电传感器网络中无线充电小车的充电调度算法研究,针对网络中传感器节点发出的充电请求,进行Revised Earliest Deadline First(REDF)无线充电调度优化算法设计。REDF算法综合考虑充电期限和节点距离两个制约因素,使得每一个传感器的充电需求都能得到及时满足,并且无线充电小车还能够在较短的时间内完成充电工作,从而延长无线传感器网络生命周期,建立一个稳定供应能量的无线传感器网络。算法的性能仿真结果表明,REDF算法的性能要优于Earliest Due Date First(EDDF)。展开更多
文摘As the technological breakthrough is made in wireless charging, the wireless rechargeable sensor networks (WRSNs) are finally proposed. In order to reduce the charging completion time, most existing works use the “mobilethen- charge” model—the Wireless charging vehicles (WCV) moves to the charging spot first and then charges nodes nearby. These works often aim to reduce the node’s movement delay or charging delay. However, the charging opportunities during the movement are overlooked in this model because WCV can charge nodes when it goes from one spot to the next. In order to use the charging opportunities, a speed grading method is proposed under the circumstance of variable WCV speed, which transformed the problem of final charging delay into a traveling salesman problem with speed grading. The problem was further solved by linear programming method. The simulation experiments show that, compared with the existing charging methods, the proposed method has a significant improvement in charging delay.
基金Hubei Provincial Natural Science Foundation of China under Grant No.2017CKB893Wuhan Polytechnic University Reform Subsidy Project Grant No.03220153.
文摘Wireless sensor networks (WSNs) have the trouble of limited battery power, and wireless charging provides apromising solution to this problem, which is not easily affected by the external environment. In this paper, we studythe recharging of sensors in wireless rechargeable sensor networks (WRSNs) by scheduling two mobile chargers(MCs) to collaboratively charge sensors. We first formulate a novel sensor charging scheduling problem with theobjective of maximizing the number of surviving sensors, and further propose a collaborative charging schedulingalgorithm(CCSA) for WRSNs. In the scheme, the sensors are divided into important sensors and ordinary sensors.TwoMCs can adaptively collaboratively charge the sensors based on the energy limit ofMCs and the energy demandof sensors. Finally, we conducted comparative simulations. The simulation results show that the proposed algorithmcan effectively reduce the death rate of the sensor. The proposed algorithm provides a solution to the uncertaintyof node charging tasks and the collaborative challenges posed by multiple MCs in practical scenarios.
基金funded by National Natural Science Foundation of China(No.61741303)Guangxi Natural Science Foundation(No.2017GXNSFAA198161)the Foundation Project of Guangxi Key Laboratory of Spatial Information and Mapping(No.21-238-21-16).
文摘In large-scaleWireless Rechargeable SensorNetworks(WRSN),traditional forward routingmechanisms often lead to reduced energy efficiency.To address this issue,this paper proposes a WRSN node energy optimization algorithm based on regional partitioning and inter-layer routing.The algorithm employs a dynamic clustering radius method and the K-means clustering algorithm to dynamically partition the WRSN area.Then,the cluster head nodes in the outermost layer select an appropriate layer from the next relay routing region and designate it as the relay layer for data transmission.Relay nodes are selected layer by layer,starting from the outermost cluster heads.Finally,the inter-layer routing mechanism is integrated with regional partitioning and clustering methods to develop the WRSN energy optimization algorithm.To further optimize the algorithm’s performance,we conduct parameter optimization experiments on the relay routing selection function,cluster head rotation energy threshold,and inter-layer relay structure selection,ensuring the best configurations for energy efficiency and network lifespan.Based on these optimizations,simulation results demonstrate that the proposed algorithm outperforms traditional forward routing,K-CHRA,and K-CLP algorithms in terms of node mortality rate and energy consumption,extending the number of rounds to 50%node death by 11.9%,19.3%,and 8.3%in a 500-node network,respectively.
文摘新型无线可充电传感器网络中无线充电小车的充电调度算法研究,针对网络中传感器节点发出的充电请求,进行Revised Earliest Deadline First(REDF)无线充电调度优化算法设计。REDF算法综合考虑充电期限和节点距离两个制约因素,使得每一个传感器的充电需求都能得到及时满足,并且无线充电小车还能够在较短的时间内完成充电工作,从而延长无线传感器网络生命周期,建立一个稳定供应能量的无线传感器网络。算法的性能仿真结果表明,REDF算法的性能要优于Earliest Due Date First(EDDF)。
