کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10139325 | 1645955 | 2018 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Near optimal bounded route association for drone-enabled rechargeable WSNs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Near optimal bounded route association for drone-enabled rechargeable WSNs Near optimal bounded route association for drone-enabled rechargeable WSNs](/preview/png/10139325.png)
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Networks - Volume 145, 9 November 2018, Pages 107-117
Journal: Computer Networks - Volume 145, 9 November 2018, Pages 107-117
نویسندگان
Tao Wu, Panlong Yang, Haipeng Dai, Ping Li, Xunpeng Rao,