Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Data Collection Utility Maximization in Wireless Sensor Networks via Efficient Determination of UAV Hovering Locations

Loading...
Thumbnail Image

Date

Authors

Liang, Weifa
Chen, Mengyu
Das, Sajal

Journal Title

Journal ISSN

Volume Title

Publisher

IEEE

Abstract

Data collection in Wireless Sensor Networks (WSNs) has been a hot research topic owing to the accelerated development in the Internet of Things (IoT). With high agility, mobility and flexibility, the Unmanned Aerial Vehicle (UAV) is widely considered as a promising technology for data collection in WSNs. Under the one-to-many data collection scheme, where a UAV is able to collect data from multiple sensors simultaneously within its reception range, the identification of hovering locations of the UAV impacts the efficiency of data collection significantly. Most existing studies either neglect this critical issue or discretize the UAV serving area into small regions with a given size, which results in the inevitable utility loss of data collection. In this paper, we jointly consider the hovering location positioning of the UAV and the utility maximization of data collection. Specifically, we first formulate a novel data collection utility maximization problem (UMP) and show that it is an NP-hard problem. We then devise an efficient algorithm for precisely positioning (potential) UAV hovering locations, which improves the data collection utility significantly. We also propose an approximation algorithm for UMP with approximation ratio $\left( {1 - \frac{1}{e}} \right)$, where e is the base of the natural logarithm. We finally evaluate the performance of the proposed algorithms through simulation experiments, and demonstrate that the proposed algorithms significantly outperform four heuristics.

Description

Keywords

Citation

Source

Book Title

Entity type

Access Statement

License Rights

Restricted until

2099-12-31
abcd