检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘景祥 徐文政 LIU Jingxiang;XU Wenzheng(School of Computer Science,Sichuan University,Chengdu 610065,China)
出 处:《计算机工程与应用》2023年第6期251-257,共7页Computer Engineering and Applications
基 金:四川省重点研发计划(2020YFG0089,22ZDYF3599,2020YFG0304);四川省科技厅项目(2017GZDZX0003)。
摘 要:在无线可充电传感器网络中,针对移动充电车采用多节点部分充电模型在充电调度过程中往复行驶,导致充电时间增加的问题进行了研究。提出一种新颖的多节点部分充电模型,从全局优化移动充电车在每个充电位置的充电时间,保证每个能量临界的传感器被充满电。同时提出AlgMinTime算法进行路径规划,确定移动充电车的充电环路以及对应位置的充电时间,使得环路上总充电调度时间最小化。最终通过仿真实验评估所提出算法的性能。实验结果表明,所提算法的充电调度平均环路时间相较于SOTA算法缩短9.8%。In the wireless rechargeable sensor network,the mobile charger adopts the multi-node partial charging model to reciprocate during the charging scheduling process,which leads to the increase of the charging duration.For this rea-son,this paper proposes a novel multi-node partial charging model,which globally optimizes the charging duration of the charger at each charging position,ensuring that each energy-critical sensor is fully charged.Meanwhile,the AlgMinTime algorithm is designed for path planning to determine the charging tour of the charger and the charging duration corre-sponding to the charging position,such that the total charging scheduling duration in the tour is minimized.Finally,the performance of the proposed algorithm is evaluated through simulation experiments.Experimental results show that the average tour duration of charging scheduling by the proposed algorithm is 9.8%shorter than that of the SOTA algorithm.
关 键 词:无线传感器网络 多节点充电 部分充电 充电调度 路径规划
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222