View : 762 Download: 0
DroneNetX: Network Reconstruction Through Connectivity Probing and Relay Deployment by Multiple UAVs in Ad Hoc Networks
- Title
- DroneNetX: Network Reconstruction Through Connectivity Probing and Relay Deployment by Multiple UAVs in Ad Hoc Networks
- Authors
- Park, So-Yeon; Shin, Christina Suyong; Jeong, Dahee; Lee, HyungJune
- Ewha Authors
- 이형준
- SCOPUS Author ID
- 이형준
- Issue Date
- 2018
- Journal Title
- IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
- ISSN
- 0018-9545
1939-9359
- Citation
- IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY vol. 67, no. 11, pp. 11192 - 11207
- Keywords
- Network reconstruction; route topology discovery; coverage path planning; network hole detection; relay deployment; self-organizing networks; unmanned aerial vehicles (UAVs)
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Indexed
- SCIE; SCOPUS
- Document Type
- Article
- Abstract
- In this paper, we consider a network reconstruction problem using unmanned aerial vehicles (UAVs) where stationary ad hoc networks are severely damaged in a post-disaster scenario. The main objective of this paper is to repair the network by supplementing aerial wireless links into the isolated ground network using UAVs. Our scheme performs network probing from the air and finds out crucial spots where both local and global routing performance can significantly be recovered if deployed. First, we propose a novel distributed coverage path planning algorithms with independent and computationally lightweight navigation based on adaptive zigzag patterns. Second, we present route topology discovery schemes that capture both local and non-local network connectivity by extracting inherent route skeletons via stitching partial local paths obtained from the simple packet probing by UAVs. Finally, we find the optimal UAV relay deployment positions that can improve network-wide data delivery most effectively based on three novel approaches of an optimization technique, an iterative heuristic algorithm, and a topology partitioning of strongly connected component. Simulation results demonstrate that our distributed traversing algorithms reduce the complete coverage time, the travel distance, and the duplicate coverage compared to other counterpart algorithms. Our deployment algorithms recover severely impaired routes, incurring reasonable computational overhead.
- DOI
- 10.1109/TVT.2018.2870397
- Appears in Collections:
- 인공지능대학 > 컴퓨터공학과 > Journal papers
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML