Multicast-Energy-Cooperation-Assisted Time-Efficient Data Collection Scheduling in WSNs

In wireless sensor networks (WSNs), enabling nodes to harvest energy from the environment and facilitating energy sharing among nodes through wireless power transfer (WPT) technology, known as energy cooperation, can alleviate energy scarcity issues and effectively prolong the lifespan of WSNs. Although previous research has investigated various forms of energy cooperation, recent developments have underscored the potential of Multicast Energy Cooperation (M-EC) in supporting efficient multinode energy sharing. This approach leverages the broadcast nature of wireless signals, potentially offering greater efficiency compared to traditional point-to-point style Unicast Energy Cooperation (U-EC). In this article, We focus on the M-EC Assisted Data Collection paradigm for energy harvesting-WSNs (EH-WSNs) and investigate the underlying M-EC assisted data collection scheduling (MECADCS) problem, aiming to minimize the data collection completion time by jointly optimizing the schedule decisions for energy cooperation and data collection. We formulate the MECADCS problem as a mixed integer nonlinear programming (MINLP) problem and establish its NP-hardness. We also simplified the MECADCS problem into a mixed integer linear programming (MILP) formulation via piecewise linear approximation, yet solving it using existing mature MILP solvers is still computationally expensive. To promptly return good solutions, we propose an efficient greedy-based data transmission scheduling algorithm (GDTS),heuristically determines energy cooperation and data transmission schedules and achieves a computational speedup of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$10^{4}$ </tex-math></inline-formula> times compared to exact solvers. Simulation results demonstrate that GDTS significantly reduces the data collection completion time compared to both algorithms without energy cooperation and those utilizing U-EC.

Authors

Institutions

Publication Details

Journal
IEEE Internet of Things Journal
Published
2024-12-30
DOI
https://doi.org/10.1109/jiot.2024.3524060
Citations
2
Primary Topic
Energy Efficient Wireless Sensor Networks
Type
article
Field-Weighted Citation Impact
0.70

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multicast-Energy-Cooperation-Assisted Time-Efficient Data Collection Scheduling in WSNs

Yunlong Zhao, Zhenguo Gao, Hsiao‐Chun Wu, Wenxian Jiang et al.
2 citations
IEEE Internet of Things Journal
Energy Efficient Wireless Sensor Networks
0.70
article

Multicast-Energy-Cooperation-Assisted Time-Efficient Data Collection Scheduling in WSNs

Yunlong Zhao, Zhenguo Gao, Hsiao‐Chun Wu, Wenxian Jiang, Yang Jiang, Amar Kaswan
article en
2 citations

Abstract

In wireless sensor networks (WSNs), enabling nodes to harvest energy from the environment and facilitating energy sharing among nodes through wireless power transfer (WPT) technology, known as energy cooperation, can alleviate energy scarcity issues and effectively prolong the lifespan of WSNs. Although previous research has investigated various forms of energy cooperation, recent developments have underscored the potential of Multicast Energy Cooperation (M-EC) in supporting efficient multinode energy sharing. This approach leverages the broadcast nature of wireless signals, potentially offering greater efficiency compared to traditional point-to-point style Unicast Energy Cooperation (U-EC). In this article, We focus on the M-EC Assisted Data Collection paradigm for energy harvesting-WSNs (EH-WSNs) and investigate the underlying M-EC assisted data collection scheduling (MECADCS) problem, aiming to minimize the data collection completion time by jointly optimizing the schedule decisions for energy cooperation and data collection. We formulate the MECADCS problem as a mixed integer nonlinear programming (MINLP) problem and establish its NP-hardness. We also simplified the MECADCS problem into a mixed integer linear programming (MILP) formulation via piecewise linear approximation, yet solving it using existing mature MILP solvers is still computationally expensive. To promptly return good solutions, we propose an efficient greedy-based data transmission scheduling algorithm (GDTS),heuristically determines energy cooperation and data transmission schedules and achieves a computational speedup of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$10^{4}$ </tex-math></inline-formula> times compared to exact solvers. Simulation results demonstrate that GDTS significantly reduces the data collection completion time compared to both algorithms without energy cooperation and those utilizing U-EC.

IEEE Internet of Things JournalVol. 12(10)
Huaqiao University (CN), Louisiana State University (US), Indian Institute of Technology Dhanbad (IN), Nanjing University of Aeronautics and Astronautics (CN)
National Natural Science Foundation of China
Affordable and clean energy
Openalex Percentile: Top 26%
Energy Efficient Wireless Sensor Networks
0.70
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.