Show simple item record

dc.contributor.authorBushnaq, Osama
dc.contributor.authorCelik, Abdulkadir
dc.contributor.authorElSawy, Hesham
dc.contributor.authorAlouini, Mohamed-Slim
dc.contributor.authorAl-Naffouri, Tareq Y.
dc.date.accessioned2019-04-10T07:39:25Z
dc.date.available2018-10-18T07:53:01Z
dc.date.available2019-04-10T07:39:25Z
dc.date.issued2019-02-21
dc.identifier.citationBushnaq OM, Celik A, ElSawy H, Alouini M-S, Al-Naffouri TY (2018) Aerial Data Aggregation in IoT Networks: Hovering & Traveling Time Dilemma. 2018 IEEE Global Communications Conference (GLOBECOM). Available: http://dx.doi.org/10.1109/GLOCOM.2018.8647311.
dc.identifier.doi10.1109/GLOCOM.2018.8647311
dc.identifier.urihttp://hdl.handle.net/10754/629388
dc.description.abstractThe next era of information revolution will rely on aggregating big data from massive numbers of devices that are widely scattered in our environment. The majority of these devices are expected to be of low-complexity, low-cost, and limited power supply, which impose stringent constraints on the network operation. In this regards, this paper proposes aerial data aggregation from a finite spatial field via an unmanned aerial vehicle (UAV). Instead of fusing, relaying, and routing the data across the wireless nodes to fixed locations access points, an UAV flies over the field and collects the required data. Particularly, the field is divided into several subregions over which the UAV hovers to collect samples from the underlying nodes. To this end, an optimization problem is formulated and solved to find the optimal number of subregions, the area of each subregion, the hovering locations, the hovering time at each location, and the trajectory traversed between hovering locations such that an average number of samples are collected from the field in minimal time. The proposed formulation is shown to be np-hard mixed integer problem, and hence, a decoupled heuristic solution is proposed. The results show that there exists an optimal number of subregions that balance the tradeoff between hovering and traveling times such that the total time for collecting the required samples is minimized.
dc.description.sponsorshipThis work is supported by the KAUST-MIT-TUD consortium under grant OSR-2015-Sensors-2700.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relation.urlhttps://ieeexplore.ieee.org/document/8647311
dc.subjectcoverage problem
dc.subjectInternet of things (IoT)
dc.subjectstochastic geometry
dc.subjecttravel salesman
dc.subjectUnmanned aerial vehicle (UAV)
dc.titleAerial Data Aggregation in IoT Networks: Hovering & Traveling Time Dilemma
dc.typeConference Paper
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentElectrical Engineering Program
dc.identifier.journal2018 IEEE Global Communications Conference (GLOBECOM)
dc.conference.date2018-12-09 to 2018-12-13
dc.conference.name2018 IEEE Global Communications Conference, GLOBECOM 2018
dc.conference.locationAbu Dhabi, ARE
dc.eprint.versionPost-print
dc.contributor.institutionDepartment of Electrical Engineering, King Fahd University of Petroleum Minerals, Dhahran, , Saudi Arabia
pubs.publication-statusPublished
kaust.personBushnaq, Osama
kaust.personCelik, Abdulkadir
kaust.personAlouini, Mohamed-Slim
kaust.personAl-Naffouri, Tareq Y.
kaust.grant.numberOSR-2015-Sensors-2700
refterms.dateFOA2018-10-18T07:55:10Z
dc.date.published-online2019-02-21
dc.date.published-print2018-12


Files in this item

Thumbnail
Name:
UAV_cam_ready.pdf
Size:
585.5Kb
Format:
PDF
Description:
Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record

VersionItemEditorDateSummary

*Selected version