无线传感器网络中无线充电调度的最优分区及其应用

IF 0.6 Q4 COMPUTER SCIENCE, THEORY & METHODS International Journal of Grid and High Performance Computing Pub Date : 2023-01-23 DOI:10.4018/ijghpc.316155
Zuoli Zhang, Wenfei Hu, Tung-Hsien Peng, Zexiang Zheng
{"title":"无线传感器网络中无线充电调度的最优分区及其应用","authors":"Zuoli Zhang, Wenfei Hu, Tung-Hsien Peng, Zexiang Zheng","doi":"10.4018/ijghpc.316155","DOIUrl":null,"url":null,"abstract":"Previous research on wireless charging did not discuss the problem of using optimal allocation to improve the network life cycle. The authors designed and analyzed a variety of network area cutting methods: rectangular cutting, square cutting, concentric circle cutting, sector cutting, and mixed cutting. Through simulation experiments, the difference between the survival time and the number of received packets is compared. The experimental results show that mixed cutting can calculate the expected energy consumption according to the energy consumption rate, and then allocate chargers according to the expected energy consumption, making the energy consumption burden of each charger more equitable. Compared with other partition methods, the load capacity distribution of each charger is more uniform. In terms of survival time and receiving message packets, the network can have a longer survival time, receive more message packets, and use the power consumption of each block more evenly and effectively.","PeriodicalId":43565,"journal":{"name":"International Journal of Grid and High Performance Computing","volume":"87 1","pages":"1-17"},"PeriodicalIF":0.6000,"publicationDate":"2023-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimum Partition for Wireless Charging Scheduling in Wireless Sensor Networks With Applications\",\"authors\":\"Zuoli Zhang, Wenfei Hu, Tung-Hsien Peng, Zexiang Zheng\",\"doi\":\"10.4018/ijghpc.316155\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Previous research on wireless charging did not discuss the problem of using optimal allocation to improve the network life cycle. The authors designed and analyzed a variety of network area cutting methods: rectangular cutting, square cutting, concentric circle cutting, sector cutting, and mixed cutting. Through simulation experiments, the difference between the survival time and the number of received packets is compared. The experimental results show that mixed cutting can calculate the expected energy consumption according to the energy consumption rate, and then allocate chargers according to the expected energy consumption, making the energy consumption burden of each charger more equitable. Compared with other partition methods, the load capacity distribution of each charger is more uniform. In terms of survival time and receiving message packets, the network can have a longer survival time, receive more message packets, and use the power consumption of each block more evenly and effectively.\",\"PeriodicalId\":43565,\"journal\":{\"name\":\"International Journal of Grid and High Performance Computing\",\"volume\":\"87 1\",\"pages\":\"1-17\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-01-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Grid and High Performance Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/ijghpc.316155\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Grid and High Performance Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/ijghpc.316155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

以往的无线充电研究并没有讨论利用最优分配来提高网络生命周期的问题。作者设计并分析了多种网络区域切割方法:矩形切割、方形切割、同心圆切割、扇形切割和混合切割。通过仿真实验,比较了生存时间与接收数据包数量的差异。实验结果表明,混合切割可以根据能耗率计算出预期能耗,然后根据预期能耗分配充电器,使每个充电器的能耗负担更加公平。与其他分区方法相比,每个充电器的负载能力分布更加均匀。在生存时间和接收消息包方面,网络可以有更长的生存时间,接收更多的消息包,更均匀有效地利用每个块的功耗。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimum Partition for Wireless Charging Scheduling in Wireless Sensor Networks With Applications
Previous research on wireless charging did not discuss the problem of using optimal allocation to improve the network life cycle. The authors designed and analyzed a variety of network area cutting methods: rectangular cutting, square cutting, concentric circle cutting, sector cutting, and mixed cutting. Through simulation experiments, the difference between the survival time and the number of received packets is compared. The experimental results show that mixed cutting can calculate the expected energy consumption according to the energy consumption rate, and then allocate chargers according to the expected energy consumption, making the energy consumption burden of each charger more equitable. Compared with other partition methods, the load capacity distribution of each charger is more uniform. In terms of survival time and receiving message packets, the network can have a longer survival time, receive more message packets, and use the power consumption of each block more evenly and effectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.70
自引率
10.00%
发文量
24
期刊最新文献
A Potent View on the Effects of E-Learning Pre-Cutoff Value Calculation Method for Accelerating Metric Space Outlier Detection A Security Method for Cloud Storage Using Data Classification An Energy-Efficient Multi-Channel Design for Distributed Wireless Sensor Networks On Allocation Algorithms for Manycore Systems With Network on Chip
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1