Efficient Nearest Neighbor Heuristic TSP Algorithms for Reducing Data Acquisition Latency of UAV Relay WSN

• Published in: Wireless personal communications Vol. 95; no. 3; pp. 3271 - 3285
• Main Authors: Alemayehu, Temesgen Seyoum, Kim, Jai-Hoon
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.08.2017; Springer Nature B.V
• Subjects: Algorithms; Communications Engineering; Computation; Computer Communication Networks; Computer simulation; Elongation; Energy consumption; Engineering; Heuristic; Networks; Relay; Remote sensors; Signal,Image and Speech Processing; Traveling salesman problem; Unmanned aerial vehicles; Wireless sensor networks; NN; Sensor networks; UAV; Data delivery latency; Travel salesman
• ISSN: 0929-6212; 1572-834X
• DOI: 10.1007/s11277-017-3994-9

The use of unmanned aerial vehicle (UAV) as a relay in wireless sensor networks significantly reduces sensor nodes’ energy consumption as the UAV replaces the multi-hop communication among nodes. As a consequence, the functional lifetime of the network is elongated in exchange for higher data delivery latency. Due to the NP-hardness of the travelling salesman problem (TSP) whose computational complexity increases exponentially as an increment of number of nodes, heuristic algorithms, such as nearest neighbor (NN) heuristic TSP algorithm, have been developed for reducing this data delivery latency in shortest possible time. In this paper, we proposed three efficient algorithms that modify the existing NN algorithm to gain a reduction in the data delivery latency with no significant change in computational time. Analytical and simulation results demonstrated that our proposed algorithms outperform the existing NN algorithm in reducing the data delivery latency, especially for nodes that are densely deployed and having relatively larger transmission ranges.