Skip to main content

Advertisement

SpringerLink
Log in

On centralized and distributed algorithms for minimizing data aggregation time in duty-cycled wireless sensor networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

We study the problem of minimizing data aggregation time in wireless sensor networks (WSNs) under the practical duty-cycle scenario where nodes switch between active states and dormant states periodically for energy efficiency. Under the protocol interference model, we show that the problem is NP-hard and present a lower bound of delay for any data aggregation scheme. To solve the problem efficiently, we then construct a routing tree based on connected dominator set and propose two aggregation scheduling algorithms, which are the centralized Greedy Aggregation Scheduling (GAS) and the distributed Partitioned Aggregation Scheduling (PAS), so as to generate collision-free transmission schedules for data aggregation in duty-cycled WSNs. To minimize the total delay, GAS tries to achieve maximal concurrent transmissions in each time-slot during each frame by using global information, while PAS leverages a network partition based strategy and local information to ensure the largest degree of channel reuse across space and time domains. Theoretical analysis indicates that each algorithm consumes at most \(O(R+\varDelta)\) frames and achieves nearly constant factor approximation on the optimal delay. Here R and \(\varDelta\) are the network radius and the maximum node degree, respectively. We also evaluate the practicability of our algorithms by extensive simulations under various network conditions and the results corroborate our theoretical analysis.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. An, M. K., Lam, N. X., Huynh, D. T., & Nguyen, T. N. (2012). Minimum latency data aggregation in the physical interference model. Computer Communications, 35(18), 2175–2186.

    Article  Google Scholar 

  2. Bagaa, M., Derhab, A., Lasla, N., Ouadjaout, A., & Badache, N. (2012). Semi-structured and unstructured data aggregation scheduling in wireless sensor networks (pp. 2671–2675). In INFOCOM, 2012 Proceedings IEEE. IEEE.

  3. Cao, Y., Guo, S., & He, T. (2012). Robust multi-pipeline scheduling in low-duty-cycle wireless sensor networks (pp. 361–369). In INFOCOM, 2012 Proceedings IEEE. IEEE.

  4. Cao, Z., He, Y., & Liu, Y. (2012). L2: Lazy forwarding in low duty cycle wireless sensor networks (pp. 1323–1331). In INFOCOM, 2012 Proceedings IEEE. IEEE.

  5. Chen, S., Wang, Y., Li, X. Y., & Shi, X. (2009). Order-optimal data collection in wireless sensor networks: Delay and capacity. In Sensor, Mesh and Ad Hoc Communications and Networks, 2009 (SECON’09). 6th Annual IEEE Communications Society Conference on, pp. 1–9. IEEE.

  6. Chen, X., Hu, X., & Zhu, J. (2005). Minimum data aggregation time problem in wireless sensor networks. In: Mobile Ad-hoc and Sensor Networks (pp. 133–142). Berlin: Springer.

  7. Fasolo, E., Rossi, M., Widmer, J., & Zorzi, M. (2007). In-network aggregation techniques for wireless sensor networks: a survey. Wireless Communications IEEE, 14(2), 70–87.

    Article  Google Scholar 

  8. Goussevskaia, O., Wattenhofer, R., Halldórsson, M. M., & Welzl, E. (2009). Capacity of arbitrary wireless networks (pp. 1872–1880). In INFOCOM 2009, IEEE. IEEE.

  9. Guo, S., Gu, Y., Jiang, B., & He, T. (2009). Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links (pp. 133–144). In Proceedings of the 15th annual international conference on Mobile computing and networking. New York: ACM.

  10. Gupta, P., & Kumar, P. R. (2000). The capacity of wireless networks. Information Theory on IEEE Transactions, 46(2), 388–404.

    Article  MathSciNet  MATH  Google Scholar 

  11. Han, K., Luo, J., Liu, Y., & Vasilakos, A. (2013). Algorithm design for data communications in duty-cycled wireless sensor networks: A survey. Communications Magazine IEEE, 51(7), 103–116.

    Article  Google Scholar 

  12. Huang, S. H., Wan, P. J., Jia, X., Du, H., & Shang, W. (2007). Minimum-latency broadcast scheduling in wireless ad hoc networks (pp. 733–739). In INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE. IEEE.

  13. Huang, S. H., Wan, P. J., Vu, C. T., Li, Y., & Yao, F. (2007). Nearly constant approximation for data aggregation scheduling in wireless sensor networks (pp. 366–372). In INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE. IEEE.

  14. Ji, S., & Cai, Z. (2013). Distributed data collection in large-scale asynchronous wireless sensor networks under the generalized physical interference model. ACM Transactions on Networking IEEE, 21(4), 1270–1283.

    Article  Google Scholar 

  15. Jiao, X., Lou, W., Wang, X., Ma, J., Cao, J., & Zhou, X. (2013). On interference-aware gossiping in uncoordinated duty-cycled multi-hop wireless networks. Ad Hoc Networks, 11(4), 1319–1330

    Article  Google Scholar 

  16. Krishnamachari, B., Estrin, D., & Wicker, S. (2002). Modelling data-centric routing in wireless sensor networks. IEEE Infocom, 2, 39–44.

    Google Scholar 

  17. Li, D., Zhu, Q., Du, H., Wu, W., Chen, H., & Chen, W. (2011). Conflict-free many-to-one data aggregation scheduling in multi-channel multi-hop wireless sensor networks (pp. 1–5). In 2011 IEEE international conference on communications (ICC). IEEE.

  18. Li, H., Wu, C., Hua, Q. S., & Lau, F. (2011). Latency-minimizing data aggregation in wireless sensor networks under physical interference model. Ad Hoc Networks, 23(2), 123–135.

    Google Scholar 

  19. Li, Y., Guo, L., & Prasad, S. K. (2010). An energy-efficient distributed algorithm for minimum-latency aggregation scheduling in wireless sensor networks. In 2010 IEEE 30th international conference on distributed computing systems (ICDCS), pp 827–836. IEEE.

  20. Malhotra, B., Nikolaidis, I., & Nascimento, M. A. (2011). Aggregation convergecast scheduling in wireless sensor networks. Wireless Networks, 17(2), 319–335.

    Article  Google Scholar 

  21. Nguyen, T. D., Zalyubovskiy, V., Choo, H. (2011). Efficient time latency of data aggregation based on neighboring dominators in wsns (pp. 1–6). In Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE. IEEE.

  22. Wan, P. J., Alzoubi, K. M., Frieder, O. (2002). Distributed construction of connected dominating set in wireless ad hoc networks (pp. 1597–1604). In INFOCOM 2002. Twenty-First annual joint conference of the IEEE computer and communications societies. Proceedings. IEEE, 3. IEEE.

  23. Wan, P. J., Huang, S. C. H., Wang, L., Wan, Z., Jia, X. (2009). Minimum-latency aggregation scheduling in multihop wireless networks (pp. 185–194). In Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing. New York: ACM.

  24. Wang, F., Liu, J. (2009). Duty-cycle-aware broadcast in wireless sensor networks (pp. 468–476). In: INFOCOM 2009, IEEE. IEEE.

  25. Xiao, S., Pan, L., Liu, J., Li, B., Yuan, X. (2013). Distributed broadcast with minimum latency in asynchronous wireless sensor networks under sinr-based interference. International Journal of Distributed Sensor Networks.

  26. 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.

    Article  Google Scholar 

  27. Xu, X., Li, X. Y., Song, M. (2013). Efficient aggregation scheduling in multihop wireless sensor networks with sinr constraints. IEEE Transactions on Mobile Computing, 12(12), 2518–2528.

    Article  Google Scholar 

  28. Yu, B., Li, J., Li, Y. (2009). Distributed data aggregation scheduling in wireless sensor networks (pp. 2159–2167). In: INFOCOM 2009, IEEE. IEEE.

  29. Zhao, D., Chin, K. W. (2013). Approximation algorithm for data broadcasting in duty cycled multi-hop wireless networks. EURASIP Journal on Wireless Communications and Networking, 2013(1), 1–14.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, No. 365, Changning Street, Changning District, 200050, Shanghai, China

    Shiliang Xiao, Jingchang Huang, Lebing Pan, Yongbo Cheng & Jianpo Liu

Authors
  1. Shiliang Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jingchang Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lebing Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yongbo Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jianpo Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shiliang Xiao.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xiao, S., Huang, J., Pan, L. et al. On centralized and distributed algorithms for minimizing data aggregation time in duty-cycled wireless sensor networks. Wireless Netw 20, 1729–1741 (2014). https://doi.org/10.1007/s11276-014-0706-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-014-0706-1

Keywords

Search

Navigation