通过利用多个能量和存储受限的无人机,无线物联网传感器数据收集奖励最大化

IF 1.1 3区 计算机科学 Q1 BUSINESS, FINANCE Journal of Computer and System Sciences Pub Date : 2023-09-01 DOI:10.1016/j.jcss.2023.103475
Francesco Betti Sorbelli , Alfredo Navarra , Lorenzo Palazzetti , Cristina M. Pinotti , Giuseppe Prencipe
{"title":"通过利用多个能量和存储受限的无人机,无线物联网传感器数据收集奖励最大化","authors":"Francesco Betti Sorbelli ,&nbsp;Alfredo Navarra ,&nbsp;Lorenzo Palazzetti ,&nbsp;Cristina M. Pinotti ,&nbsp;Giuseppe Prencipe","doi":"10.1016/j.jcss.2023.103475","DOIUrl":null,"url":null,"abstract":"<div><p>We consider Internet of Things (IoT) sensors deployed inside an area to be monitored. Drones can be used to collect the data from the sensors, but they are constrained in energy and storage. Therefore, all drones need to select a subset of sensors whose data are the most relevant to be acquired, modeled by assigning a reward. We present an optimization problem called <em>Multiple-drone Data-collection Maximization Problem</em> (<span>MDMP</span>) whose objective is to plan a set of drones' missions aimed at maximizing the overall reward from the collected data, and such that each individual drone's mission energy cost and total collected data are within the energy and storage limits, respectively. We optimally solve <span>MDMP</span> by proposing an Integer Linear Programming based algorithm. Since <span>MDMP</span> is <em>NP</em>-hard, we devise suboptimal algorithms for single- and multiple-drone scenarios. Finally, we thoroughly evaluate our algorithms on the basis of random generated synthetic data.</p></div>","PeriodicalId":50224,"journal":{"name":"Journal of Computer and System Sciences","volume":"139 ","pages":"Article 103475"},"PeriodicalIF":1.1000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs\",\"authors\":\"Francesco Betti Sorbelli ,&nbsp;Alfredo Navarra ,&nbsp;Lorenzo Palazzetti ,&nbsp;Cristina M. Pinotti ,&nbsp;Giuseppe Prencipe\",\"doi\":\"10.1016/j.jcss.2023.103475\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We consider Internet of Things (IoT) sensors deployed inside an area to be monitored. Drones can be used to collect the data from the sensors, but they are constrained in energy and storage. Therefore, all drones need to select a subset of sensors whose data are the most relevant to be acquired, modeled by assigning a reward. We present an optimization problem called <em>Multiple-drone Data-collection Maximization Problem</em> (<span>MDMP</span>) whose objective is to plan a set of drones' missions aimed at maximizing the overall reward from the collected data, and such that each individual drone's mission energy cost and total collected data are within the energy and storage limits, respectively. We optimally solve <span>MDMP</span> by proposing an Integer Linear Programming based algorithm. Since <span>MDMP</span> is <em>NP</em>-hard, we devise suboptimal algorithms for single- and multiple-drone scenarios. Finally, we thoroughly evaluate our algorithms on the basis of random generated synthetic data.</p></div>\",\"PeriodicalId\":50224,\"journal\":{\"name\":\"Journal of Computer and System Sciences\",\"volume\":\"139 \",\"pages\":\"Article 103475\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2023-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computer and System Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0022000023000806\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"BUSINESS, FINANCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer and System Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0022000023000806","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"BUSINESS, FINANCE","Score":null,"Total":0}
引用次数: 0

摘要

我们认为物联网(IoT)传感器部署在要监控的区域内。无人机可以用来收集传感器的数据,但它们在能量和存储方面受到限制。因此,所有无人机都需要选择一个子集的传感器,通过分配奖励来建模,这些传感器的数据最相关。我们提出了一个优化问题,称为多架无人机数据收集最大化问题(MDMP),其目标是规划一组无人机的任务,旨在最大限度地提高收集数据的总体回报,并使每架无人机的飞行任务能量成本和收集的总数据分别在能量和存储限制内。我们通过提出一种基于整数线性规划的算法来优化求解MDMP。由于MDMP是NP难的,我们为单无人机和多无人机场景设计了次优算法。最后,我们在随机生成的合成数据的基础上对我们的算法进行了全面的评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs

We consider Internet of Things (IoT) sensors deployed inside an area to be monitored. Drones can be used to collect the data from the sensors, but they are constrained in energy and storage. Therefore, all drones need to select a subset of sensors whose data are the most relevant to be acquired, modeled by assigning a reward. We present an optimization problem called Multiple-drone Data-collection Maximization Problem (MDMP) whose objective is to plan a set of drones' missions aimed at maximizing the overall reward from the collected data, and such that each individual drone's mission energy cost and total collected data are within the energy and storage limits, respectively. We optimally solve MDMP by proposing an Integer Linear Programming based algorithm. Since MDMP is NP-hard, we devise suboptimal algorithms for single- and multiple-drone scenarios. Finally, we thoroughly evaluate our algorithms on the basis of random generated synthetic data.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Computer and System Sciences
Journal of Computer and System Sciences 工程技术-计算机:理论方法
CiteScore
3.70
自引率
0.00%
发文量
58
审稿时长
68 days
期刊介绍: The Journal of Computer and System Sciences publishes original research papers in computer science and related subjects in system science, with attention to the relevant mathematical theory. Applications-oriented papers may also be accepted and they are expected to contain deep analytic evaluation of the proposed solutions. Research areas include traditional subjects such as: • Theory of algorithms and computability • Formal languages • Automata theory Contemporary subjects such as: • Complexity theory • Algorithmic Complexity • Parallel & distributed computing • Computer networks • Neural networks • Computational learning theory • Database theory & practice • Computer modeling of complex systems • Security and Privacy.
期刊最新文献
Time-sharing scheduling with tolerance capacities Embedding hypercubes into torus and Cartesian product of paths and/or cycles for minimizing wirelength The parameterized complexity of the survivable network design problem Monitoring the edges of product networks using distances Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs
×
引用
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