Abstract
Data aggregation is a process of collecting data from all the sensor nodes with a sink node to generate a statistic report in a wireless sensor network. Data aggregation can be performed in various ways that resolves many issues like aggregation delay, collision, security and energy utilization. This paper proposes a Hybrid tree construction (HTC) algorithm to perform the delay efficient data aggregation in wireless sensor network. In HTC a node which has high renewable energy is chosen as root. Each node chooses their corresponding parent and child node among their neighbors by implementing a two-hop tree construction method. In this HTC left child will be selected based on its residual energy and least distance from the other nodes and right child is the second least distance node from the root. By applying a delay efficient data aggregation algorithm on the data aggregation tree constructed by HTC, the performance of the proposed algorithm has been studied. The HTC algorithm has been applied on different network scenarios to improve its performance through the simulation models and the results are verified by comparing with other models.







Similar content being viewed by others
References
Akkaya, K., & Ari, I. (2007). In-network data aggregation in wireless sensor networks. Handbook of Computer Networks: LANs, MANs, WANs, the Internet, and Global, Cellular, and Wireless Networks, 2, 1131–1146.
Akkaya, K., & Younis, M. (2005). A survey on routing protocols for wireless sensor networks. Ad Hoc Networks, 3(3), 325–349.
Arora, A., et al. (2004). A line in the sand: A wireless sensor network for target detection, classification, and tracking. Computer Networks, 46(5), 605–634.
Bagaa, M., Derhab, A., Lasla, N., Ouadjaout, A., & Badache, N. (2012). Semi-structured and unstructured data aggregation scheduling in wireless sensor networks. In INFOCOM, 2012 Proceedings IEEE (pp. 2671–2675). IEEE.
Bagaa, M., et al. (2014). Data aggregation scheduling algorithms in wireless sensor networks: Solutions and challenges. Communications Surveys and Tutorials IEEE, 16(3), 1339–1368.
Chen, C., et al. (2010). Data aggregation technologies of wireless multimedia sensor networks: A survey. In IEEE international conference on vehicular electronics and safety (ICVES), 2010. IEEE.
Chen, X., Hu, X., & Zhu, J. (2005). Minimum data aggregation time problem in wireless sensor networks. Mobile Ad hoc and Sensor Networks (pp. 133–142). Berlin Heidelberg: Springer.
Cheng, C.-T., Leung, H., & Maupin, P. (2013). A delay-aware network structure for wireless sensor networks with in-network data fusion. Sensors Journal IEEE, 13(5), 1622–1631.
Cheng, C.-T., Tse, C. K., & Lau, F. (2011). A delay-aware data collection network structure for wireless sensor networks. Sensors Journal IEEE, 11(3), 699–710.
Dasgupta, K., Kalpakis, K., & Namjoshi, P. (2003). An efficient clustering-based heuristic for data gathering and aggregation in sensor networks. In Wireless communications and networking 2003, WCNC 2003, 2003 IEEE (Vol. 3, pp. 1948–1953). IEEE.
Dudek, D., et al. (2009). A wireless sensor network for border surveillance. In Proceedings of the 7th ACM conference on embedded networked sensor systems. ACM.
Enachescu, M., Goel, A., Govindan, R., & Motwani, R. (2004). Scale free aggregation in sensor networks. In Algorithmic aspects of wireless sensor networks (pp. 71–84). Berlin, Heidelberg: Springer.
Fasolo, E., et al. (2007). In-network aggregation techniques for wireless sensor networks: A survey. IEEE Wireless Communications, 14(2), 70–87.
Goel, A., & Estrin, D. (2003). Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk. In Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms. Society for Industrial and Applied Mathematics.
Hefeeda, M., & Bagheri, M. (2009). Forest fire modeling and early detection using wireless sensor networks. Ad Hoc and Sensor Wireless Networks, 7(3–4), 169–224.
Huang, S. C. H., Wan, P.-J., Vu, C. T., Li, Y., & Yao, F. (2007). Nearly constant approximation for data aggregation scheduling in wireless sensor networks. In INFOCOM 2007. 26th IEEE international conference on computer communications. IEEE, pp. 366–372. IEEE.
Jianming, Z. H. U., & Xiaodong, H. U. (2008). Improved algorithm for minimum data aggregation time problem in wireless sensor networks. Journal of Systems Science and Complexity, 21(4), 626–636.
Kuo, T.-W., & Tsai, M.-J. (2012). On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approximation algorithms. In INFOCOM, 2012 Proceedings IEEE. IEEE.
Lambrou, T. P., & Panayiotou, C. G. (2009). A survey on routing techniques supporting mobility in sensor networks. In Mobile ad-hoc and sensor networks, 2009. MSN'09. 5th international conference on (pp. 78–85). IEEE.
Lee, M., & Wong, V. W. S. (2005). An energy-aware spanning tree algorithm for data aggregation in wireless sensor networks. In 2005 IEEE Pacific Rim conference on communications, computers and signal processing, 2005. PACRIM. IEEE.
Luo, D., Zhu, X., Wu, X., & Chen, G. (2011).Maximizing lifetime for the shortest path aggregation tree in wireless sensor networks. In IEEE INFOCOM.
Patil, N. S., & Patil, P. R. (2010, December). Data aggregation in wireless sensor network. In IEEE international conference on computational intelligence and computing research (pp. 1–6).
Rajagopalan, R., & Varshney, P. K. (2006). Data aggregation techniques in sensor networks: A survey.
Thepvilojanapong, N., Tobe, Y. & Sezaki, K. (2005). On the construction of efficient data gathering tree in wireless sensor networks. In IEEE international symposium on circuits and systems, 2005. ISCAS 2005. IEEE.
Wan, P.-J., Alzoubi, K. M., & Frieder, O. (2004). Distributed construction of connected dominating set in wireless ad hoc networks. Mobile Networks and Applications, 9(2), 141–149.
Wan, P. -J., Huang, S. C. -H., Wang, L., Wan, Z., & Jia, X. (2009). Minimum-latency aggregation scheduling in multihop wireless networks. In Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing, pp. 185–194. ACM.
Wu, Y., Fahmy, S. & Shroff, N. B. (2008). On the construction of a maximum-lifetime data gathering tree in sensor networks: NP-completeness and approximation algorithm. In INFOCOM 2008. The 27th conference on computer communications. IEEE. IEEE.
Xu, X., Li, X.-Y., Mao, X., Tang, S., & Wang, S. (2011). A delay-efficient algorithm for data aggregation in multihop wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems, 22(1), 163–175.
Salam, M. A., & Ferdous, T. Tree-based data aggregation algorithms in wireless sensor networks: A survey.
Yu, B., Li, J., & Li, Y. (2009). Distributed data aggregation scheduling in wireless sensor networks. In INFOCOM 2009, IEEE. IEEE.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gopikrishnan, S., Priakanth, P. Hybrid Tree Construction for Sustainable Delay Aware Data Aggregation in Wireless Sensor Networks. Wireless Pers Commun 90, 923–945 (2016). https://doi.org/10.1007/s11277-016-3287-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-016-3287-8