Markov model-based low delay data aggregation tree algorithm

Abstract

The data aggregation technology can save resources of wireless sensor networks, but it can also add extra delays. To this end, specific to the special scenario where data transmission must be completed under specified delay constraints, the Markov model-based low delay data aggregation tree (MLDGT) algorithm is proposed. Firstly, the formal expression of the problem of constructing data aggregation tree under delay constraints is given. This problem has been con-firmed as a NP problem. Then, the Markov approximate model is used to find a suboptimal solution, and further obtain the low delay data aggregation tree. Finally, the effectiveness of the MLDGT algorithm is analysed by simulation and comparison. The experimental results show that the MLDGT algorithm can reduce the data aggregation delay.