Skip to main content

Advertisement

SpringerLink
Log in

A Location-Independent Energy Balanced Node-Covered Scheduling Algorithm

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Considering that existing node coverage scheduling algorithms are mostly based on the accurate location information and have the problems of higher overlap in coverage and lower regional coverage quality, a location-independent energy balanced node-covered scheduling algorithm is proposed. First, the discrimination method for the redundant nodes is emphasized. On this basis, the procedure of the algorithm is given. The simulation results indicate that the proposed algorithm can effectively promote the coverage quality with less number of the active nodes compared with the Gao and the LDAS algorithm.

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

Similar content being viewed by others

References

  1. Parikh, S., Vokkarane, V. M., Xing, L., & Kasilingam, D. (2007). Node-replacement policies to maintain threshold-coverage in wireless sensor networks. In Proceedings of the 16th international conference of computer communications and networks, pp. 760–765.

  2. Gu, X., Sun, L., & Guo, J. (2011). Wireless sensor network coverage quality and mode dormancy optimization strategy. Journal of Computer Simulation, 28(9), 127–131.

    Google Scholar 

  3. Beakcheol, J., Jun, B. L., & Mihail, L. S. (2013). An asynchronous scheduled MAC protocol for wireless sensor networks. Computer Networks, 57(1), 85–98.

    Article  Google Scholar 

  4. Xu, Y., & Zeng, Z. (2015). A low redundancy and high coverage node scheduling algorithm for wireless sensor networks. Communications in Computer and Information Science, 501, 42–51.

    Article  Google Scholar 

  5. Pazand, B., Datta, A., & Cardell-Oliver, R. (2010). A review of redundancy elimination protocols for wireless sensor networks. Proceedings of the International Conference of Computational Science and Its Applications, 6018, 336–351.

    Google Scholar 

  6. Younis, O., Krunz, M., & Ramasubramanian, S. (2008). Location-unaware coverage in wireless sensor networks. Ad Hoc Networks, 6(7), 1078–1097.

    Article  Google Scholar 

  7. Zhu, C., Zheng, C., Shu, L., et al. (2012). A survey on coverage and connectivity issues in wireless sensor networks. Journal of Network and Computer Applications, 35(2), 619–632.

    Article  Google Scholar 

  8. Sahoo, P. K., & Tsao, J. Z. (2010). Vector method based coverage hole recovery in wireless sensor. In Proceedings of the communication systems and networks, pp. 243–251.

  9. Ma, H., Kumar Sahoo, P., & Chen, Y. (2011). Computational geometry based distributed coverage hole detection protocol for the wireless sensor networks. Journal of Network and Computer Applications, 34(5), 1743–1756.

    Article  Google Scholar 

  10. Su, H., & Wang, Y. (2009). Without location information in hole filling algorithm of sensor networks. Journal of Computer, 32(10), 158–170.

    Google Scholar 

  11. Gao, Y., Wu, K., & Li, F. (2003). Analysis on the redundancy of wireless sensor networks. In Proceedings of the 2nd ACM international conference on wireless sensor networks and applications, pp. 108–114.

  12. Wu, K., Gao, Y., Li, F., & Xiao, Y. (2005). Lightweight deployment-aware scheduling for wireless sensor networks. Mobile Networks and Applications, 10(6), 837–852.

    Article  Google Scholar 

  13. Zebbane, B., Chenait, M., & Badache, N. (2016). A distributed lightweight redundancy aware topology control protocol for wireless sensor networks. Wireless Networks, 2016, 1–14. doi:10.1007/s11276-016-1248-5.

    Article  Google Scholar 

  14. Bhattacharjee, M., & Gupta, S. (2014). Determining redundant nodes in a location unaware wireless sensor network. In Proceedings of 2014 IEEE international conference on advanced communication, control and computing technologies, pp. 858–862.

  15. Gupta, H. P., Rao, S. V., & Venkatesh, T. (2013). Analysis of the redundancy in coverage of a heterogeneous wireless sensor network. In Proceedings of 2013 IEEE international conference on communications, pp. 1904–1909.

  16. Liu, F., & Zhang, D. (2012). Computer centroid localization algorithm for wireless sensor network based on RSSI. Journal of Computer Science, 39(6A), 96–98.

    MathSciNet  Google Scholar 

Download references

Acknowledgements

This work is supported by the Provincial Foundation for Excellent Young Talents of Liaoning Province (CN) (2014921042). The authors also gratefully acknowledge the helpful comments and suggestions of the reviewers, which have improved the presentation.

Author information

Authors and Affiliations

  1. Shenyang Ligong University, Shenyang, China

    Yanhui Lv, Sitong Meng, Deyu Zhang & Lili Ma

Authors
  1. Yanhui Lv
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sitong Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Deyu Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lili Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Deyu Zhang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lv, Y., Meng, S., Zhang, D. et al. A Location-Independent Energy Balanced Node-Covered Scheduling Algorithm. Wireless Pers Commun 96, 2667–2680 (2017). https://doi.org/10.1007/s11277-017-4318-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-017-4318-9

Keywords

Search

Navigation