.png){kind=icon}
.png){kind=icon}
Return
Data Aggregation Scheduling in Battery-Free Wireless Sensor Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TMC.2020.3035671.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To break through the limitation of battery-powered wireless sensor networks, a novel kind of network, named battery-free wireless sensor network (BF-WSN), is proposed. Battery-free sensor nodes in BF-WSNs harvest energy from power sources in their ambient environment, such as solar power, wind power and radio frequency (RF) signal power, etc., instead of batteries. Therefore, the energy consumption of battery-free sensor nodes are not limited by the battery capacity anymore. However, they still have limited energy harvesting rates and energy capacities. Data aggregation is a fundamental operation in sensor networks where the sensory data gathered by the relay nodes can be merged by in-network computation, such as taking the maximum, average, or sum, etc., of them. Due to the energy features of BF-WSNs, the data aggregation scheduling problem in BF-WSNs is more complicated and the previous aggregation scheduling algorithms designed for battery-powered WSNs are no longer applicable. This paper investigates the Minimum-Latency Aggregation Scheduling problem in BF-WSNs, which is proved to be NP-hard. Then, we propose the Data Aggregation Scheduling algorithm to solve the problem. Finally, the theoretical analysis and extensive simulation results are provided to verify the performance of the proposed algorithm.
Keywords:
Wireless sensor networks
Schedules
Data aggregation
Interference
Energy harvesting
Scheduling
Batteries
Battery-free wireless sensor networks
data aggregation scheduling
interference-free scheduling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.2
Papers:
5.6K
Citations:
1.8W