Near optimal bounded route association for drone-enabled rechargeable WSNs

This paper considers the multi-drone wireless charging scheme in large scale wireless sensor networks, where sensors can be charged by the charging drone with wireless energy transfer. As existing studies rarely focus on the route association issue with limited energy capacity, we consider this fund...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer networks (Amsterdam, Netherlands : 1999) Jg. 145; S. 107 - 117
Hauptverfasser: Wu, Tao, Yang, Panlong, Dai, Haipeng, Li, Ping, Rao, Xunpeng
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 09.11.2018
Elsevier Sequoia S.A
Schlagworte:
Algorithms
Approximation
Associations
Drone system
Energy
Knapsack problem
Mathematical analysis
Multiple knapsack problem
Optimization
Polynomials
Remote sensors
Route association
Sensors
Wireless charging
Wireless communication systems
Wireless networks
Wireless power transmission
Wireless sensor networks
Wireless sensor networks
Wireless charging
Multiple knapsack problem
Route association
Drone system
ISSN:1389-1286, 1872-7069
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper considers the multi-drone wireless charging scheme in large scale wireless sensor networks, where sensors can be charged by the charging drone with wireless energy transfer. As existing studies rarely focus on the route association issue with limited energy capacity, we consider this fundamental issue and study how to optimize the route association to maximize the overall charging coverage utility, when charging routes and associated nodes should be jointly selected. We first formulate a bounded route association problem which is proven to be NP-hard. Then we cast it as maximizing a monotone submodular function subject to matroid constraints and devise an efficient and accessible algorithm with a 13α approximation ratio, where α is the bound of Fully Polynomial-Time Approximation Scheme (FPTAS) solving a knapsack problem. Extensive numerical evaluations and trace-driven evaluations have been carried out to validate our theoretical effect, and the results show that our algorithm has near-optimal performance covering at most 85.3% and 70.5% of the surrogate-optimal solution achieved by CPLEX toolbox, respectively.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1389-1286
1872-7069
DOI:10.1016/j.comnet.2018.07.004