4.7 Article

Near optimal bounded route association for drone-enabled rechargeable WSNs

Journal

COMPUTER NETWORKS
Volume 145, Issue -, Pages 107-117

Publisher

ELSEVIER
DOI: 10.1016/j.comnet.2018.07.004

Keywords

Wireless sensor networks; Wireless charging; Drone system; Route association; Multiple knapsack problem

Funding

  1. NSF of Jiangsu [BK20150030]
  2. NSFC [61632010, 61232018, 61371118]
  3. China National Funds for Distinguished Young Scientists [61625205]
  4. Key Research Program of Frontier Sciences, CAS [QYZDY-SSWJSC002, 61402009, 61672038, 61520106007]
  5. NSF [CNS 1526638, ECCS-1247944, CMMI 1436786]

Ask authors/readers for more resources

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 1/3 alpha approximation ratio, where a 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. (C) 2018 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
Article Computer Science, Hardware & Architecture

TEA-RFFI: Temperature adjusted radio frequency fingerprint-based smartphone identification

Xiaolin Gu, Wenjia Wu, Yusen Zhou, Aibo Song, Ming Yang, Zhen Ling, Junzhou Luo

Summary: This study proposes a radio frequency fingerprint identification solution based on crystal oscillator temperature adjustment, which enhances the differences between Wi-Fi device fingerprints and mitigates collision. Experimental results demonstrate the effectiveness of the system in identifying smartphones under different scenarios.

COMPUTER NETWORKS (2024)

Article Computer Science, Hardware & Architecture

QoS-based resource allocation for uplink NOMA networks

Yutong Wu, Jianyue Zhu, Xiao Chen, Yu Zhang, Yao Shi, Yaqin Xie

Summary: This paper proposes a quality-of-service-based SIC order method and optimizes power allocation for maximizing the rate in the uplink NOMA system. The simulation results demonstrate the superiority of the proposed method compared to traditional orthogonal multiple access and exhaustive search.

COMPUTER NETWORKS (2024)

Article Computer Science, Hardware & Architecture

Mitigating the impact of controller failures on QoS robustness for software-defined wide area networks

Songshi Dou, Li Qi, Zehua Guo

Summary: Emerging cloud services and applications have different QoS requirements for the network. SD-WANs play a crucial role in QoS provisioning by introducing network programmability, dynamic flow routing, and low data transmission latency. However, controller failures may degrade QoS. To address this, we propose PREDATOR, a QoS-aware network programmability recovery scheme that achieves fine-grained per-flow remapping without introducing extra delays, ensuring QoS robustness for high-priority flows.

COMPUTER NETWORKS (2024)

Article Computer Science, Hardware & Architecture

An efficient topology partitioning algorithm for system-level parallel simulation of mega satellite constellation communication networks

Ke Wang, Xiaojuan Ma, Heng Kang, Zheng Lyu, Baorui Feng, Wenliang Lin, Zhongliang Deng, Yun Zou

Summary: This paper proposes a method based on a parallel network simulation architecture to improve the simulation efficiency of satellite networks. By effectively partitioning the network topology and using algorithms such as resource assessment and load balancing, the simulation performance is enhanced. Experimental results demonstrate the effectiveness of this method.

COMPUTER NETWORKS (2024)

Article Computer Science, Hardware & Architecture

Reuse-based online joint routing and scheduling optimization mechanism in deterministic networks

Sijin Yang, Lei Zhuang, Julong Lan, Jianhui Zhang, Bingkui Li

Summary: This paper proposes a reuse-based online scheduling mechanism that achieves deterministic transmission of dynamic flows through dynamic path planning and coordinated scheduling of time slots. Experimental results show that the proposed mechanism improves the scheduling success rate by 37.3% and reduces time costs by up to 66.6% compared to existing online scheduling algorithms.

COMPUTER NETWORKS (2024)