Notice

This is not the latest version of this item. The latest version can be found at: https://repository.kaust.edu.sa/handle/10754/629388

Show simple item record

dc.contributor.authorBushnaq, Osama M.
dc.contributor.authorCelik, Abdulkadir
dc.contributor.authorElSawy, Hesham
dc.contributor.authorAl-Naffouri, Tareq Y.
dc.contributor.authorAlouini, Mohamed-Slim
dc.date.accessioned2018-10-18T07:53:01Z
dc.date.available2018-10-18T07:53:01Z
dc.date.issued2018
dc.identifier.urihttp://hdl.handle.net/10754/629388.1
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 imposes stringent constraints on the network operation. In this regards, this paper proposes an 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, a UAV flies over the field and collects the required data. Particularly, the field is divided into several subregions where the UAV hover over each subregion 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 between hovering locations such that an average number of samples are collected from the field in minimal time. The proposed the 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 the hovering and traveling times such that the total time for collecting the required samples is minimized.
dc.publisherIEEE
dc.subjectUnmanned aerial vehicle (UAV); Internet of things (IoT); stochastic geometry; coverage problem, travel salesman.
dc.titleAerial Data Aggregation in IoT Networks: Hovering & Traveling Time Dilemma
dc.typeConference Paper
dc.contributor.departmentCEMSE
dc.conference.dateDec. 2018
dc.conference.nameIEEE Global Communications Conference (GLOBECOM)
dc.conference.locationAbu Dhabi, UAE
dc.eprint.versionPost-print
refterms.dateFOA2018-10-18T07:55:10Z


Files in this item

Thumbnail
Name:
1570453372.pdf
Size:
838.7Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record

VersionItemEditorDateSummary

*Selected version