A Top-Down Scheduling for Time Efficient Data Aggregation in WSNs
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.
KeywordsWireless sensor networks Data aggregation Top-down approach
This work was supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No.2019-0-00421, AI Graduate School Support Program).
- 2.Yu, B., Choi, W., Lee, T., Kim, H.: Clustering algorithm considering sensor node distribution in wireless sensor networks. J. Inf. Process. Syst. 14, 926–940 (2018)Google Scholar
- 6.Maraiya, K., Kant, K., Gupta, N.: Wireless sensor network: a review on data aggregation. Int. J. Sci. Eng. Res. 2, 1–6 (2011)Google Scholar
- 7.Jakob, M., Nikolaidis, I.: A top-down aggregation convergecast schedule construction. In: 2016 9th IFIP Wireless and Mobile Networking Conference (WMNC), Colmar, pp. 17–24 (2016)Google Scholar