arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.05370math.OC
收藏

用于无人机辅助网络的更新周期Optimization

Age-of-Updates Optimization for UAV-assisted Networks

Mouhamed Naby Ndiaye, El Houcine Bergou, Mounir Ghogho, Hajar El Hammouti

摘要:

无人机(UAV)已被提出作为一种有前途的技术,用于从物联网设备收集数据并将其中继到网络。在这项工作中,我们感兴趣的情况下,数据定期更新,收集的更新时间敏感。特别是,如果不及时收集和分析数据更新,数据更新可能会失去价值。为了最大限度地提高数据的新鲜度,我们优化了一个新的性能指标,即更新周期(AoU)。我们的目标是仔细安排无人机的悬停位置和用户的关联,使AoU最小化。与现有的作品中的关联参数被认为是二进制变量,我们假设设备发送他们的更新根据概率分布。因此,不是优化确定性目标函数,而是用对概率分布的期望来代替目标函数。因此,在服务质量和能量约束下优化预期的AoU。原问题是非凸的,我们提出了一个等价的凸优化,我们解决了使用的邻域点方法。我们的仿真结果表明,所提出的方法对二进制关联的性能。

英文摘要:

Unmanned aerial vehicles (UAVs) have been proposed as a promising technology to collect data from IoT devices and relay it to the network. In this work, we are interested in scenarios where the data is updated periodically, and the collected updates are time-sensitive. In particular, the data updates may lose their value if they are not collected and analyzed timely. To maximize the data freshness, we optimize a new performance metric, namely the Age-of-Updates (AoU). Our objective is to carefully schedule the UAVs hovering positions and the users' association so that the AoU is minimized. Unlike existing works where the association parameters are considered as binary variables, we assume that devices send their updates according to a probability distribution. As a consequence, instead of optimizing a deterministic objective function, the objective function is replaced by an expectation over the probability distribution. The expected AoU is therefore optimized under quality of service and energy constraints. The original problem being non-convex, we propose an equivalent convex optimization that we solve using an interior-point method. Our simulation results show the performance of the proposed approach against a binary association.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑