Skip to main content
SpringerLink
Log in

A time efficient aggregation convergecast scheduling algorithm for wireless sensor networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

We investigated the aggregation convergecast scheduling problem in wireless sensor networks. In order to reduce the time needed for data collection through aggregation convergecast, we propose a scheduling algorithm based on an aggregation tree which enables a small delay lower bound and a time slot allocation method which uses the time slots efficiently. To achieve a small delay lower bound, we take the sum of the receiver’s depth and child number as the cost of the transmission links and then construct an aggregation tree gradually by adding to it a link with the minimum cost iteration by iteration. To use the time slots efficiently, we use a neighbor degree ranking algorithm together with a supplementary scheduling algorithm to allocate time slot for the sensor nodes. Experiments show that the proposed scheduling algorithm outperforms other work in most cases by reducing the number of time slots needed for data collection by more than 10 %, which indicates the feasibility of our approach for data collection in wireless sensor networks.

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
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

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

    Article  Google Scholar 

  2. Hong, L., Huixiang, T., Huadong, M., & Das, S. K. (2011). Data fusion with desired reliability in wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems, 22(3), 501–513.

    Article  Google Scholar 

  3. Srisooksai, T., Keamarungsi, K., Lamsrichan, P., & Araki, K. (2012). Practical data compression in wireless sensor networks: A survey. Journal of Network and Computer Applications, 35(1), 37–59.

    Article  Google Scholar 

  4. Madden, S., Franklin, M. J., Hellerstein, J. M., Wei, H., & Usenix, U. (2002). TAG: A tiny aggregation service for ad-hoc sensor networks. In Usenix Association Proceedings of the Fifth Symposium on Operating Systems Design and Implementation (pp. 131–146).

  5. Yu, B., Li, J., Li, Y., & Ieee, (2009). Distributed data aggregation scheduling in wireless sensor networks. Proceedings of IEEE Conference on Computer Communications, 1–5, 2159–2167.

    Google Scholar 

  6. Chen, X. J., Hu, X. D., & Zhu, J. M. (2005). Minimum data aggregation time problem in wireless sensor networks. Proceedings of Mobile Ad-Hoc and Sensor Networks, 3794, 133–142.

    Article  Google Scholar 

  7. de Souza, E., & Nikolaidis, I. (2013). An exploration of aggregation convergecast scheduling. Ad Hoc Networks, 11(8), 2391–2407.

    Article  Google Scholar 

  8. Incel, O. D., Ghosh, A., Krishnamachari, B., & Chintalapudi, K. (2012). Fast data collection in tree-based wireless sensor networks. IEEE Transactions on Mobile Computing, 11(1), 86–99.

    Article  Google Scholar 

  9. Harvey, N. J. A., Ladner, R. E., Lovász, L., & Tamir, T. (2006). Semi-matchings for bipartite graphs and load balancing. Journal of Algorithms, 59(1), 53–78.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  11. 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–193).

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

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

  14. Edmonds, J. (1967). Optimum branchings. Journal of Research of the National Bureau of Standards B, 71(4), 233–240.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  16. Prim, R. C. (1957). Shortest connection networks and some generalizations. Bell System Technical Journal, 36(6), 1389–1401.

    Article  Google Scholar 

Download references

Acknowledgments

This research was supported by the National Natural Science Foundation of China under Grant 61174179 and 60874079 and the Science and Technology Development Project of China Railway Corporation under Grant 2015Z005-D.

Author information

Authors and Affiliations

  1. School of Electrical Engineering, Beijing Jiaotong University, Beijing, China

    Cheng Pan & Hesheng Zhang

Authors
  1. Cheng Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hesheng Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hesheng Zhang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pan, C., Zhang, H. A time efficient aggregation convergecast scheduling algorithm for wireless sensor networks. Wireless Netw 22, 2469–2483 (2016). https://doi.org/10.1007/s11276-016-1337-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-016-1337-5

Keywords

Search

Navigation