.png){kind=icon}
.png){kind=icon}
Return
A Top-Down Scheduling for Time Efficient Data Aggregation in WSNs
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-030-35653-8_24.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Time efficient data aggregation is a crucial problem in wireless sensor networks where computational and battery power are limited. In a data aggregation process, intermediate nodes combine all received data and then forward to the next node. Current researches concern energy or time efficient of sensors in wireless sensor networks. The paper proposes a top-down scheduling scheme to minimize the aggregation time. The proposed scheme reduces the possibility of collision when transmitting on a link by considering its adjacent links and neighbors of the receiver. The collision prevention leads to an aggregation time reduction. Simulation results show that the proposed scheme reduces up to 18% compared with the state-of-the-art top-down approach on data aggregation.
Keywords:
Wireless sensor networks
Data aggregation
Top-down approach
Journal
F
IF:
0
Papers:
1
Citations:
0