无线可充电传感器网络的无线充电器部署优化

Ji-Hau Liao, Jehn-Ruey Jiang
{"title":"无线可充电传感器网络的无线充电器部署优化","authors":"Ji-Hau Liao, Jehn-Ruey Jiang","doi":"10.1109/U-MEDIA.2014.72","DOIUrl":null,"url":null,"abstract":"In a wireless rechargeable sensor network (WRSN), sensor nodes can harvest energy from wireless chargers to refill their power supplies so that the WRSN can operate sustainably. This paper considers wireless chargers equipped with 3D-beamforming directional antennas, and assumes they can be deployed on grid points at a fixed height to propose two greedy algorithms solving the following critical problem: how to deploy as few as possible chargers to make the WRSN sustainable. The first algorithm is the node based greedy cone selecting (NB-GCS) algorithm trying to optimize the number of chargers based on node positions. The second algorithm is the pair based greedy cone selecting (PB-GCS) algorithm trying to optimize the number of chargers based on node pairs. We conduct simulation and analyze the time complexity of the NB-GCS and PB-GCS algorithms. As will be shown, the latter is better in terms of the number of chargers, while the former has lower time complexity.","PeriodicalId":174849,"journal":{"name":"2014 7th International Conference on Ubi-Media Computing and Workshops","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"Wireless Charger Deployment Optimization for Wireless Rechargeable Sensor Networks\",\"authors\":\"Ji-Hau Liao, Jehn-Ruey Jiang\",\"doi\":\"10.1109/U-MEDIA.2014.72\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a wireless rechargeable sensor network (WRSN), sensor nodes can harvest energy from wireless chargers to refill their power supplies so that the WRSN can operate sustainably. This paper considers wireless chargers equipped with 3D-beamforming directional antennas, and assumes they can be deployed on grid points at a fixed height to propose two greedy algorithms solving the following critical problem: how to deploy as few as possible chargers to make the WRSN sustainable. The first algorithm is the node based greedy cone selecting (NB-GCS) algorithm trying to optimize the number of chargers based on node positions. The second algorithm is the pair based greedy cone selecting (PB-GCS) algorithm trying to optimize the number of chargers based on node pairs. We conduct simulation and analyze the time complexity of the NB-GCS and PB-GCS algorithms. As will be shown, the latter is better in terms of the number of chargers, while the former has lower time complexity.\",\"PeriodicalId\":174849,\"journal\":{\"name\":\"2014 7th International Conference on Ubi-Media Computing and Workshops\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 7th International Conference on Ubi-Media Computing and Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/U-MEDIA.2014.72\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 7th International Conference on Ubi-Media Computing and Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/U-MEDIA.2014.72","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 28

摘要

在无线充电传感器网络(WRSN)中,传感器节点可以从无线充电器中收集能量来补充其电源,从而使WRSN能够持续运行。本文考虑配备3d波束形成定向天线的无线充电器,并假设它们可以部署在固定高度的网格点上,提出两种贪心算法,解决以下关键问题:如何部署尽可能少的充电器以使WRSN可持续。第一种算法是基于节点的贪心锥选择(NB-GCS)算法,该算法试图根据节点位置优化充电器的数量。第二种算法是基于对的贪心锥选择(PB-GCS)算法,该算法试图基于节点对来优化充电器的数量。对NB-GCS和PB-GCS算法进行了仿真和时间复杂度分析。如图所示,后者在充电器数量方面更胜一筹,而前者具有更低的时间复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Wireless Charger Deployment Optimization for Wireless Rechargeable Sensor Networks
In a wireless rechargeable sensor network (WRSN), sensor nodes can harvest energy from wireless chargers to refill their power supplies so that the WRSN can operate sustainably. This paper considers wireless chargers equipped with 3D-beamforming directional antennas, and assumes they can be deployed on grid points at a fixed height to propose two greedy algorithms solving the following critical problem: how to deploy as few as possible chargers to make the WRSN sustainable. The first algorithm is the node based greedy cone selecting (NB-GCS) algorithm trying to optimize the number of chargers based on node positions. The second algorithm is the pair based greedy cone selecting (PB-GCS) algorithm trying to optimize the number of chargers based on node pairs. We conduct simulation and analyze the time complexity of the NB-GCS and PB-GCS algorithms. As will be shown, the latter is better in terms of the number of chargers, while the former has lower time complexity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信