Skip to main content
Log in

Selective α-Coverage Based Heuristic in Wireless Sensor Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

In order to fulfill the coverage requirement, Maximum Network Lifetime Problem (MLP) is to maximize the network lifetime while providing full coverage over a predefined set of targets. There is a variant of coverage problem called α-coverage, where a fraction of targets allowed to be left uncovered to provide partial coverage. This variant of coverage is presented by Maximum Network α-Lifetime Problem (α-MLP) that is the special case of classical MLP. During α-coverage, there has been no choice over targets which are going to be left uncovered, instead, a random set of targets are left uncovered. If we can wisely select the set of targets which are going to be left uncovered, then, the network lifetime can be prolonged further. In this paper, we propose an energy-efficient heuristic to solve α-MLP. Our heuristic not only supports partial coverage, but, it also put a valuable observation on the targets which are left uncovered. Our simulation outcomes show that the network lifetime achieved by our heuristic is far better than those achieved with many existing heuristics for α-coverage.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Alemdar, H., & Ersoy, C. (2010). Wireless sensor networks for healthcare: A survey. Computer Networks, 54(15), 2688–2710.

    Article  Google Scholar 

  2. Slijepcevic, S., & Potkonjak, M. (2001). Power efficient organization of wireless sensor networks. In Proceedings of the IEEE International Conference on Communications, (pp. 472–476).

  3. Cardei, M., Thai, M.T., Li Y.,Wu W. et al. (2005). Energy-efficient target coverage in wireless sensor networks. In Proceedings of the 24th Conference of the IEEE Communications Society (pp. 1976–84).

  4. Deschinkel, K. (2011). A column generation based heuristic for maximum lifetime coverage in wireless sensor networks. In SENSOR COMM11, 5th International Conference on Sensor Technologies and Applications (pp. 209–214).

  5. Pujari, A.K., Mini, S., Padhi, T., Sahoo, P., et al. (2015). Polyhedral approach for lifetime maximization of target coverage problem. In ICDCN (pp. 14:1–14:8).

  6. Bajaj, D., & Manju (2014). Maximum coverage heuristic (MCH) for target coverage problem in WSN. In IACC (pp. 300–305).

  7. Castaño, F., Rossi, A., Sevaux, M., Velasco, N., et al. (2014). A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints. Computers & Operations Research, 52(B), 220–230.

    Article  MATH  MathSciNet  Google Scholar 

  8. Zhao, Q., & Gurusamy, M. (2008). Lifetime maximization for connected target coverage in wireless sensor networks. IEEE/ACM Trans Netw, 16(6), 1378–1391.

    Article  Google Scholar 

  9. Chaudhary, M., & Pujari, A.K. (2009). Q-coverage problem in wireless sensor networks. In Proceedings International Conference on Distributed Computing and Networking (pp. 325–330).

  10. Mini, S., Udgata, Siba K., Sabat, Samrat L., et al. (2014). Sensor deployment and scheduling for target coverage problem in wireless sensor networks. IEEE Sensors Journal, 14(3), 636–644.

    Article  Google Scholar 

  11. Cerulli, R., de Donato, R., Raiconi, A., et al. (2012). Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges. European Journal of Operational Research, 220(1), 58–66.

    Article  MATH  MathSciNet  Google Scholar 

  12. Cerulli, R., Gentili, M., Raiconi, A., et al. (2014). Maximizing lifetime and handling reliability in wireless sensor networks. Networks, 64(4), 321–338.

    Article  MathSciNet  Google Scholar 

  13. Zhang, H., Hou, J. C., et al. (2006). Maximizing α-lifetime for wireless sensor networks. International Journal of Sensor Networks, 1(1), 64–71.

    Article  Google Scholar 

  14. Gentili, M., & Raiconi, A. (2013). Alpha-coverage to extend network lifetime on wireless sensor networks. Optimization Letters, 7(1), 157–172.

    Article  MATH  MathSciNet  Google Scholar 

  15. Cerulli, Francesco Carrabs Raffaele, D’Ambrosio, Ciriaco, Raiconi, Andrea, et al. (2015). A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints. Journal of Network and Computer Applications, 58, 12–22.

    Article  Google Scholar 

  16. Cheng, M.X., Ruan, L., Wu, W., et al (2005). Achieving minimum coverage breach under bandwidth constraints in wireless sensor networks. In Proceedings of the 24th conference of the IEEE Communications Society (INFOCOM) (vol. 4, pp. 2638–2645).

  17. Wang, C., Thai, M. T., Li, Y., Wang, F., Wu, W., et al. (2009). Optimization scheme for sensor coverage scheduling for bandwidth constraints. Optimization Letters, 3(1), 63–75.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Manju.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Manju, Chand, S. & Kumar, B. Selective α-Coverage Based Heuristic in Wireless Sensor Networks. Wireless Pers Commun 97, 1623–1636 (2017). https://doi.org/10.1007/s11277-017-4589-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-017-4589-1

Keywords

Navigation