Markov model-based low delay data aggregation tree algorithm
by Huang Luyu
International Journal of Innovative Computing and Applications (IJICA), Vol. 11, No. 2/3, 2020

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.

Online publication date: Mon, 04-May-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com