A decision-making analysis in UAV-enabled wireless power transfer for IoT networks

TitreA decision-making analysis in UAV-enabled wireless power transfer for IoT networks
Publication TypeJournal Article
Year of Publication2020
AuthorsLhazmir, S, Oualhaj, OA, Kobbane, A, Mokdad, L
JournalSimulation Modelling Practice and Theory
Volume103
Mots-clésAntennas, Approximate linear programming, Approximation algorithms, Behavioral research, Data communication systems, Data transfer, Data transmission efficiency, Decision making, Decision making analysis, Decision-making problem, Energy harvesting, Energy resources, Energy transfer, Graph theory, Graphic methods, Inductive power transmission, Internet of things, Linear programming, Markov Decision Processes, Markov processes, Mean field approximation, Unmanned aerial vehicles (UAV), Wireless energy transfers, Wireless power transfer (WPT)
Abstract

We consider an IoT network with energy-harvesting capabilities. To extend the network lifetime, we propose a novel unmanned aerial vehicle (UAV)- enabled wireless power transfer (WPT) system, where UAVs move among IoT devices and act as data aggregators and wireless power providers. This paper addresses the decision-making problem since the limited buffer and energy resources constrain all nodes. Each IoT node must decide on whether to request a data transmission, to ask for a wireless energy transfer or to abstain and not take any action. When a UAV receives a request from an IoT device, either for data reception or wireless energy transmission, it has to accept or decline. In this paper, we aim to find a proper packet delivery and energy transfer policy according to the system state that maximizes the data transmission efficiency of the system. We first formulate the problem as a Markov Decision Process (MDP) to tackle the successive decision issues, to optimize a utility for each node upon a casual environment. As the MDP formalism achieves its limits when the interactions between different nodes are considered, we formulate the problem as a Graph-based MDP (GMDP). The transition functions and rewards are then decomposed into local functions, and a graph illustrates the dependency’ relations among the nodes. To obtain the optimal policy despite the system's variations, Mean-Field Approximation (MFA) and Approximate linear-programming (ALP) algorithms were proposed to solve the GMDP problem. © 2020 Elsevier B.V.

URLhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85084066274&doi=10.1016%2fj.simpat.2020.102102&partnerID=40&md5=6a1c9e107244a170a782e61d0f9755cc
DOI10.1016/j.simpat.2020.102102
Revues: 

Partenaires

Localisation

Suivez-nous sur

         

    

Contactez-nous

ENSIAS

Avenue Mohammed Ben Abdallah Regragui, Madinat Al Irfane, BP 713, Agdal Rabat, Maroc

  Télécopie : (+212) 5 37 68 60 78

  Secrétariat de direction : 06 61 48 10 97

        Secrétariat général : 06 61 34 09 27

        Service des affaires financières : 06 61 44 76 79

        Service des affaires estudiantines : 06 62 77 10 17 / n.mhirich@um5s.net.ma

        CEDOC ST2I : 06 66 39 75 16

        Résidences : 06 61 82 89 77

Contacts

    

    Compteur de visiteurs:634,776
    Education - This is a contributing Drupal Theme
    Design by WeebPal.