Multi-UAV Data Collection Framework for Wireless Sensor Networks

被引:41
作者
Alfattani, Safwan [1 ]
Jaafar, Wael [2 ]
Yanikomeroglu, Halim [2 ]
Yongacoglu, Abbas [3 ]
机构
[1] King Abdulaziz Univ, Jeddah, Saudi Arabia
[2] Carleton Univ, Ottawa, ON K1S 5B6, Canada
[3] Univ Ottawa, Ottawa, ON K1N 6N5, Canada
来源
2019 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM) | 2019年
基金
加拿大自然科学与工程研究理事会;
关键词
TRAVELING SALESMAN PROBLEM; ALGORITHMS;
D O I
10.1109/globecom38437.2019.9014306
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we propose a framework design for wireless sensor networks based on multiple unmanned aerial vehicles (UAVs). Specifically, we aim to minimize deployment and operational costs, with respect to budget and power constraints. To this end, we first optimize the number and locations of cluster heads (CHs) guaranteeing data collection from all sensors. Then, to minimize the data collection flight time, we optimize the number and trajectories of UAVs. Accordingly, we distinguish two trajectory approaches: 1) where a UAV hovers exactly above the visited CH; and 2) where a UAV hovers within a range of the CH. The results of this include guidelines for data collection design. The characteristics of sensor nodes' K-means clustering are then discussed. Next, we illustrate the performance of optimal and heuristic solutions for trajectory planning. The genetic algorithm is shown to be near-optimal with only 3.5% degradation. The impacts of the trajectory approach, environment, and UAVs' altitude are investigated. Finally, fairness of UAVs trajectories is discussed.
引用
收藏
页数:6
相关论文
共 14 条
[1]   Clustering in sensor networks: A literature survey [J].
Afsar, M. Mehdi ;
Tayarani-N, Mohammad-H. .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2014, 46 :198-226
[2]   Optimal LAP Altitude for Maximum Coverage [J].
Al-Hourani, Akram ;
Kandeepan, Sithamparanathan ;
Lardner, Simon .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2014, 3 (06) :569-572
[3]   3-D Placement of an Unmanned Aerial Vehicle Base Station (UAV-BS) for Energy-Efficient Maximal Coverage [J].
Alzenad, Mohamed ;
El-Keyi, Amr ;
Lagum, Faraj ;
Yanikomeroglu, Halim .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2017, 6 (04) :434-437
[4]   APPROXIMATION ALGORITHMS FOR THE GEOMETRIC COVERING SALESMAN PROBLEM [J].
ARKIN, EM ;
HASSIN, R .
DISCRETE APPLIED MATHEMATICS, 1994, 55 (03) :197-218
[5]   The multiple traveling salesman problem: an overview of formulations and solution procedures [J].
Bektas, T .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2006, 34 (03) :209-219
[6]  
BORYALINIZ RI, 2016, P IEEE INT C COMM IC, P1, DOI DOI 10.1109/ICC.2016.7510820
[7]   An efficient k-means clustering algorithm:: Analysis and implementation [J].
Kanungo, T ;
Mount, DM ;
Netanyahu, NS ;
Piatko, CD ;
Silverman, R ;
Wu, AY .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (07) :881-892
[8]   THE VEHICLE-ROUTING PROBLEM - AN OVERVIEW OF EXACT AND APPROXIMATE ALGORITHMS [J].
LAPORTE, G .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1992, 59 (03) :345-358
[9]   Genetic algorithms for the travelling salesman problem:: A review of representations and operators [J].
Larrañaga, P ;
Kuijpers, CMH ;
Murga, RH ;
Inza, I ;
Dizdarevic, S .
ARTIFICIAL INTELLIGENCE REVIEW, 1999, 13 (02) :129-170
[10]  
Mozaffari M., 2016, IEEE GLOBAL COMMUNIC, P1