Abstract
Data aggregation is one of the challenging issues in Wireless Sensor Networks (WSNs). Traditionally, sensor nodes are assumed to be in the active state all the time, which leads to undesirable energy consumption. Moreover, most of the duty-cycle protocols are proposed to reduce energy consumption. However, the aggregation delay has been ignored during saving energy. This paper focuses on the problem of minimum-delay aggregation schedule in duty-cycled WSNs under the protocol interference model. To solve the problem, we propose an algorithm by firstly construct an aggregation tree based on the connected dominating set (CDS). Then we propose an aggregation schedule algorithm to avoid the interference, which is Leaves Schedule (LS). Different from existing works, we believe that nodes in different layers can transmit concurrently, thus it will greatly increase the number of nodes transmit concurrently and minimize the total transmission times in order to minimize the aggregation delay. Through extensive simulations, we found that the proposed scheduling method outperforms the state-of-the-art schemes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Ren, M., Li, J., Guo, L., Cai, Z.: Data collection with probabilistic guarantees in opportunistic wireless networks. Int. J. Sensor Netw. (accepted)
Du, H., Hu, X., Jia, X.: Energy efficient routing and scheduling for real-time data aggregation in WSNs. Comput. Commun. 29, 3527–3535 (2006)
Du, H., Luo, H.: Routing-cost constrained connected dominating set. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms, pp. 1–5. Springer, New York (2014)
Du, H., Wu, W., Ye, Q., Li, D., Lee, W., Xu, X.: CDS-based virtual backbone construction with guaranteed routing cost in wireless sensor networks. IEEE Trans. Parallel Distrib. Syst. 24(4), 652–661 (2013)
Du, H., Ye, Q., Zhong, J., Wang, Y., Lee, W., Park, H.: Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks. Theor. Comput. Sci. 447, 38–43 (2011)
Du, H., Ye, Q., Wu, W., Lee, W., Li, D., Du, D., et al.: Constant approximation for virtual backbone construction with guaranteed routing cost in wireless sensor networks. In: Proceedings - IEEE INFOCOM, vol. 28, pp. 1737–1744 (2011)
Chen, X., Xu, M.: A geographical cellular-like architecture for wireless sensor networks. In: Jia, X., Wu, J., He, Y. (eds.) MSN 2005. LNCS, vol. 3794, pp. 249–258. Springer, Heidelberg (2005)
Huang, S.C., Wan, P.J., Vu, C.T., Li, S., Yao, F.: Nearly constant approximation for data aggregation scheduling in wireless sensor networks. In: Proceedings - IEEE INFOCOM, pp. 366–372 (2007)
Wan, P.J., Huang, C.H., Wang, L., Wan, Z., Jia, X.: Minimum-latency aggregation scheduling in multihop wireless networks. In: Proceedings - MOBIHOC, pp. 185–194 (2009)
Nguyen, T.D., Zalyubovskiy, V., Choo, H.: Efficient Time Latency of Data Aggregation Based on Neighboring Dominators in WSNs. In: GLOBECOM, pp. 1–6 (2011)
Du, H., Zhang, Z., Wu, W., Wu, L., Xing, K.: Constant-approximation for optimal data aggregation with physical interference. J. Global Optim. 56(4), 1653–1666 (2013)
He, Z., Cai, Z., Cheng, S., Wang, X.: Approximate aggregation for tracking quantiles and range countings in wireless sensor networks. Theor. Comput. Sci. 607, 381–390 (2015)
Yu, B., Li, J.Z.: Minimum-time aggregation scheduling in dutycycled wireless sensor networks. J. Comput. Sci. Technol. 26(6), 962–970 (2011)
Xiao, S., Huang, J., Pan, L., Cheng, Y., Liu, J.: On centralized and distributed algorithms for minimizing data aggregation time in duty-cycled wireless sensor networks. Wireless Netw. 20(7), 1729–1741 (2014)
Chen, Q., Gao, H., Cheng, S., Cai, Z.: Approximate scheduling and constructing algorithms for minimum-energy multicasting in duty-cycled sensor networks. In: IIKI, pp. 163–168 (2015)
Gu, Y., He, T.: Dynamic switching-based data forwarding for low-duty-cycle wireless sensor networks. IEEE Trans. Mob. Comput. 10(12), 1741–1754 (2011)
Acknowledgments
This work was supported by the National Natural Science Foundation of China under grant 61370216.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Yan, X., Du, H., Ye, Q., Song, G. (2016). Minimum-Delay Data Aggregation Schedule in Duty-Cycled Sensor Networks. In: Yang, Q., Yu, W., Challal, Y. (eds) Wireless Algorithms, Systems, and Applications. WASA 2016. Lecture Notes in Computer Science(), vol 9798. Springer, Cham. https://doi.org/10.1007/978-3-319-42836-9_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-42836-9_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42835-2
Online ISBN: 978-3-319-42836-9
eBook Packages: Computer ScienceComputer Science (R0)