ADiDA: adaptive differential data aggregation for cluster based wireless sensor networks Online publication date: Wed, 27-Jun-2018
by Rabia Noor Enam; Rehan Qureshi
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 28, No. 2, 2018
Abstract: It has been observed in large scale dynamic cluster based wireless sensor networks that the size of clusters vary significantly in terms of number of nodes. In these networks, data aggregation at cluster heads do not adapt adequately to such variances in cluster sizes. In this paper, we propose a novel and an adaptive differential data aggregation (ADiDA) method that can minimise the complexity of aggregating large amount of data into small sized data packets. ADiDA: in addition to reducing the cost of redundant data transfer in the network, also optimally utilises the available space in data packets at each cluster head. We have analysed ADiDA on different types of sensing environments. The results have shown that ADiDA can reduce the payload size requirement to almost one-fourth of the non-compressed payload and the distortion percentage in aggregated data decreases by 16-41%, compared to the summary-based aggregated data.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook