当前位置: X-MOL 学术Peer-to-Peer Netw. Appl. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A precision adjustable trajectory planning scheme for UAV-based data collection in IoTs
Peer-to-Peer Networking and Applications ( IF 4.2 ) Pub Date : 2020-11-05 , DOI: 10.1007/s12083-020-01006-0
Zuyan Wang , Jun Tao , Yang Gao , Yifan Xu , Weice Sun , Xiaoyan Li

With the increasing popularity of the IoTs (Internet of Things), the efficient data collection with Unmanned Aerial Vehicles (UAVs) is demanded by numerous applications. The technical challenge, which restricts the deployment of the UAVs, is the high latency of the data collection. In this paper, we focus on the problem of trajectory planning, specifically, determination of how the UAVs traverse through the sensing field and the scheduling of the communication tasks with the IoT nodes. We first ignore the energy consumpti on of IoT nodes but relax it eventually. Therefore, the trajectory planning problem can be formulated as a special case of the traveling salesman problem with neighborhoods (TSP-N). We propose a Precision Adjustable Trajectory Planning (PATP) scheme, which can calculate the k-communication area based on the stratified grid approach and shorten the traveling trajectory of the UAV by reducing the data collection sites, to enable a tradeoff between execution time and calculation precision. We then take the realistic energy consumption of wireless communications into account, which is one of the key questions in researches of IoTs, to extend the network lifetime with the On-Demand PATP (OD-PATP) scheme. The simulation results show that the PATP scheme can obtain a 15% reduction in number of visiting point at least and the trajectory length obtained by the OD-PATP scheme can be shortened about 45%.



中文翻译:

用于物联网中基于无人机的数据收集的精确可调轨迹规划方案

随着物联网(IoT)的日益普及,无数飞行器(UAV)需要高效的数据收集。限制无人机部署的技术挑战是数据收集的高延迟。在本文中,我们关注于轨迹规划问题,特别是确定无人机如何穿越感测场以及与物联网节点的通信任务的调度。我们首先忽略物联网节点的能源消耗,但最终将其放宽。因此,可以将轨迹规划问题表述为带邻居的旅行推销员问题(TSP-N)的特例。我们提出了一种精确可调轨迹规划(PATP)方案,该方案可以计算出k-基于分层网格方法的通信区域,并通过减少数据收集站点来缩短无人机的飞行轨迹,从而在执行时间和计算精度之间进行权衡。然后,我们考虑了无线通信的实际能耗(这是物联网研究的关键问题之一),以通过按需PATP(OD-PATP)方案来延长网络寿命。仿真结果表明,PATP方案至少可减少15 的访问点,而OD-PATP方案获得的轨迹长度可缩短约45

更新日期:2020-11-05
down
wechat
bug