具有能量收集的物联网网络的时间约束无人机辅助数据收集

Pengfei Du, Fan Xie, S. H. A. Chen, Xuejun Zhang
{"title":"具有能量收集的物联网网络的时间约束无人机辅助数据收集","authors":"Pengfei Du, Fan Xie, S. H. A. Chen, Xuejun Zhang","doi":"10.1109/INFOCOMWKSHPS57453.2023.10226065","DOIUrl":null,"url":null,"abstract":"This work investigates the time-constrained unmanned aerial vehicle (UAV) aided data collection problem for Internet of Thing (IoT) networks, where multiple IoT devices (IoTDs) harvest the solar energy and send their sensed data to the UAV in the uplink by applying the time division multiple access (TDMA) method. Specifically, we propose to maximize the total number of served IoTDs in a finite data gathering period via optimizing the trajectory of UAV, the time allocation and transmitting power of IoTDs under the UAV's maximum flight speed constraint, and the energy harvesting neutralization constraint of every IoTD. To tackle this non-linear integer programming, we first convert it into an equivalent tractable problem by adding the deductive penalty into the target function, and develop the time-constrained UAV-assisted data collection algorithm (TCDCA) to achieve a sub-optimal solution by exploiting the alternating optimization, successive convex approximation (SCA) and quadratic approximation methods. Subsequently, abundant simulations results are provided to confirm that the TCDCA is able to notably enhance the total number of served IoTDs compared to the conventional scheme with constant trajectory or constant time allocation.","PeriodicalId":354290,"journal":{"name":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Time-Constrained UAV-Aided Data Collection for IoT Networks with Energy Harvesting\",\"authors\":\"Pengfei Du, Fan Xie, S. H. A. Chen, Xuejun Zhang\",\"doi\":\"10.1109/INFOCOMWKSHPS57453.2023.10226065\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work investigates the time-constrained unmanned aerial vehicle (UAV) aided data collection problem for Internet of Thing (IoT) networks, where multiple IoT devices (IoTDs) harvest the solar energy and send their sensed data to the UAV in the uplink by applying the time division multiple access (TDMA) method. Specifically, we propose to maximize the total number of served IoTDs in a finite data gathering period via optimizing the trajectory of UAV, the time allocation and transmitting power of IoTDs under the UAV's maximum flight speed constraint, and the energy harvesting neutralization constraint of every IoTD. To tackle this non-linear integer programming, we first convert it into an equivalent tractable problem by adding the deductive penalty into the target function, and develop the time-constrained UAV-assisted data collection algorithm (TCDCA) to achieve a sub-optimal solution by exploiting the alternating optimization, successive convex approximation (SCA) and quadratic approximation methods. Subsequently, abundant simulations results are provided to confirm that the TCDCA is able to notably enhance the total number of served IoTDs compared to the conventional scheme with constant trajectory or constant time allocation.\",\"PeriodicalId\":354290,\"journal\":{\"name\":\"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10226065\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFOCOMWKSHPS57453.2023.10226065","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本研究研究了物联网(IoT)网络中时间受限的无人机(UAV)辅助数据收集问题,其中多个物联网设备(iotd)通过应用时分多址(TDMA)方法收集太阳能并将其感知数据发送给上行链路中的无人机。具体而言,我们提出通过优化无人机的飞行轨迹、无人机最大飞行速度约束下IoTD的时间分配和发射功率以及每个IoTD的能量收集中和约束,在有限的数据采集周期内实现服务IoTD总数的最大化。为了解决这一非线性整数规划问题,我们首先通过在目标函数中加入演绎惩罚,将其转化为一个等效的可处理问题,并开发了时间约束无人机辅助数据收集算法(TCDCA),利用交替优化、连续凸逼近(SCA)和二次逼近方法来实现次优解。随后,大量的仿真结果证实,与常规的固定轨迹或固定时间分配方案相比,TCDCA能够显著提高服务的iotd总数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Time-Constrained UAV-Aided Data Collection for IoT Networks with Energy Harvesting
This work investigates the time-constrained unmanned aerial vehicle (UAV) aided data collection problem for Internet of Thing (IoT) networks, where multiple IoT devices (IoTDs) harvest the solar energy and send their sensed data to the UAV in the uplink by applying the time division multiple access (TDMA) method. Specifically, we propose to maximize the total number of served IoTDs in a finite data gathering period via optimizing the trajectory of UAV, the time allocation and transmitting power of IoTDs under the UAV's maximum flight speed constraint, and the energy harvesting neutralization constraint of every IoTD. To tackle this non-linear integer programming, we first convert it into an equivalent tractable problem by adding the deductive penalty into the target function, and develop the time-constrained UAV-assisted data collection algorithm (TCDCA) to achieve a sub-optimal solution by exploiting the alternating optimization, successive convex approximation (SCA) and quadratic approximation methods. Subsequently, abundant simulations results are provided to confirm that the TCDCA is able to notably enhance the total number of served IoTDs compared to the conventional scheme with constant trajectory or constant time allocation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信