Skip to main content
Springer Nature Link
Log in

A learning automata-based algorithm for solving coverage problem in directional sensor networks

  • Published:
Computing Aims and scope Submit manuscript

Abstract

Wireless sensor networks have been used in a wide variety of applications. Recently, networks consisting of directional sensors have gained prominence. An important challenge facing directional sensor networks (DSNs) is maximizing the network lifetime while covering all the targets in an area. One effective method for saving the sensors’ energy and extending the network lifetime is to partition the DSN into several covers, each of which can cover all targets, and then to activate these covers successively. This paper first proposes a fully distributed algorithm based on irregular cellular learning automata to find a near-optimal solution for selecting each sensor’s appropriate working direction. Then, to find a near-optimal solution that can cover all targets with the minimum number of active sensors, a centralized approximation algorithm is proposed based on distributed learning automata. This algorithm takes advantage of learning automata (LA) to determine the sensors that must be activated at each stage. As the presented algorithm proceeds, the activation process is focused on the sensor nodes that constitute the cover set with the minimum number of active sensors. Through simulations, we indicate that the scheduling algorithm based on LA has better performance than the greedy algorithm-based scheme in terms of maximizing network lifetime.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Amac Guvensan M, Gokhan Yavuz A (2011) On coverage issues in directional sensor networks: a survey. Ad Hoc Netw 9(7):1238–1255

    Article  Google Scholar 

  2. Zorbas D, Glynos D, Kotzanikolaou P, Douligeris C (2010) Solving coverage problems in wireless sensor networks using cover sets. Ad Hoc Netw 8(4):400–415

    Article  Google Scholar 

  3. Yanli C, Wei L, Minglu L, Xiang-Yang L (2007) Target-oriented scheduling in directional sensor networks. In: INFOCOM 2007. 26th IEEE international conference on computer communications. IEEE, New York, 6–12 May 2007, pp 1550–1558

  4. Gil J-M, Kim C-M, Han Y-H (2010) A greedy algorithm for target coverage scheduling in directional sensor networks. J Wirel Mob Netw Ubiquitous Comput Dependable Appl 1:96–106

    Google Scholar 

  5. Cardei M, Du D-Z (2005) Improving wireless sensor network lifetime through power aware organization. Wirel Netw 11(3):333–340. doi:10.1007/s11276-005-6615-6

    Article  Google Scholar 

  6. Cardei M, Thai MT, Yingshu L, Weili W (2005) Energy-efficient target coverage in wireless sensor networks. In: Proceedings of 24th annual joint conference of the IEEE computer and communications societies (INFOCOM). Miami, FL, USA, pp 1976–1984

  7. Ma H, Liu Y (2005) On coverage problems of directional sensor networks. In: Lecture Notes in Computer Science: Mobile Ad-hoc and Sensor, Networks, vol 3794, pp 721–731

  8. Ai J, Abouzeid A (2006) Coverage by directional sensors in randomly deployed wireless sensor networks. J Comb Optim 11(1).pp 21–41

    Google Scholar 

  9. Wang J, Niu C, Shen R (2009) Priority-based target coverage in directional sensor networks using a genetic algorithm. Comput Math Appl 57:1915–1922

    Article  MathSciNet  MATH  Google Scholar 

  10. Akbari Torkestani J, Meybodi MR (2010) An efficient cluster-based CDMA/TDMA scheme for wireless mobile ad-hoc networks: A learning automata approach. J Netw Comput Appl 33(4):477–490

    Article  Google Scholar 

  11. Akbari Torkestani J, Meybodi MR (2010) An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata. Comput Netw 54(5):826–843

    Article  MATH  Google Scholar 

  12. Akbari Torkestani J, Meybodi MR (2010) Clustering the wireless Ad Hoc networks: a distributed learning automata approach. J Parallel Distrib Comput 70(4):394–405

    Article  MATH  Google Scholar 

  13. Akbari Torkestani J (2012) An adaptive backbone formation algorithm for wireless sensor networks. Comput Commun 35(11):1333–1344

    Google Scholar 

  14. Akbari Torkestani J (2012) LAAP: A Learning automata-based adaptive polling scheme for clustered wireless Ad-Hoc networks. Wirel Pers Commun. pp 1–15. doi:10.1007/s11277-012-0615-5

  15. Esnaashari M, Meybodi MR (2010) A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks. Comput Netw 54(14):2410–2438. doi:10.1016/j.comnet.2010.03.014

    Article  MATH  Google Scholar 

  16. Torkestani JA, Meybodi MR (2012) A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs. J Supercomput 59(2):1035–1054. doi:10.1007/s11227-010-0484-1

    Article  Google Scholar 

  17. Akbari Torkestani J, Meybodi MR (2011) A cellular learning automata-based algorithm for solving the vertex coloring problem. Expert Syst Appl 38(8):9237–9247

    Article  Google Scholar 

  18. Akbari Torkestani J (2011) A new approach to the job scheduling problem in computational grids. Cluster Computing. pp 1–10. doi:10.1007/s10586-011-0192-5

  19. Akbari Torkestani J (2012) An adaptive learning automata-based ranking function discovery algorithm. J Intell Inf Syst:1–19. doi:10.1007/s10844-012-0197-4

  20. Zorbas D, Douligeris C (2011) Connected coverage in WSNs based on critical targets. Comput Netw 55(6):1412–1425

    Article  Google Scholar 

  21. Fredkin E (1990) Digital mechanics: an informational process based on reversible universal cellular automata. Phys D 45(1–3):254–270. doi:10.1016/0167-2789(90)90186-s

    Article  MathSciNet  MATH  Google Scholar 

  22. Packard NH, Wolfram S (1985) Two-dimensional cellular automata. J Stat Phys 38(5):901–946. doi:10.1007/bf01010423

    Google Scholar 

  23. Najim K, Poznyak AS (1994) Learning automata: theory and applications. Printice-Hall, New York

    Google Scholar 

  24. Beigy H, Meybodi MR (2004) A mathematical framework for cellular learning automata. Adv Complex Syst 7(3–4):295–320

    Google Scholar 

  25. Beigy H, Meybodi MR (2009) Cellular learning automata based dynamic channel assignment algorithms. Int J Comput Intell Appl 8:287–314

    Article  MATH  Google Scholar 

  26. Beigy H, Meybodi M (2003) A self-organizing channel assignment algorithm: a cellular learning automata approach. Lecture notes in computer science, vol 2690. Springer, pp 119–126

  27. Thathachar MAL, Harita BR (1987) Learning automata with changing number of actions. IEEE Trans Syst Man Cybern 17(6):1095–1100

    Google Scholar 

  28. Nicopolitidis P, Papadimitriou GI, Pomportsis AS, Sarigiannidis P, Obaidat MS (2011) Adaptive wireless networks using learning automata. Wirel Commun IEEE 18(2):75–81

    Article  Google Scholar 

  29. Mostafaei H, Meybodi MR, Esnaashari M (2010) EEMLA: energy efficient monitoring of wireless sensor network with learning automata. In: Signal acquisition and processing, 2010. ICSAP ’10. pp 107–111

  30. Yanli C, Wei L, Minglu L, Xiang-Yang L (2009) Energy efficient target-oriented scheduling in directional sensor networks. Comput IEEE Transact 58(9):1259–1274

    Article  Google Scholar 

  31. Gil J-M, Han Y-H (2011) A target coverage scheduling scheme based on genetic algorithms in directional sensor networks. Sensors 11(2):1888–1906

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Department, Faculty of Computer Science and Information, Universiti Teknologi Malaysia, 81310, Johor Bahru, Malaysia

    Hosein Mohamadi & Abdul Samad Bin Haji Ismail

  2. Mathematics Department, Faculty of Science, Universiti Teknologi Malaysia, 81310, Johor Bahru, Malaysia

    Shaharuddin Salleh

Authors
  1. Hosein Mohamadi
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Abdul Samad Bin Haji Ismail
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Shaharuddin Salleh
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Hosein Mohamadi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mohamadi, H., Ismail, A.S.B.H. & Salleh, S. A learning automata-based algorithm for solving coverage problem in directional sensor networks. Computing 95, 1–24 (2013). https://doi.org/10.1007/s00607-012-0208-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-012-0208-x

Keywords

Mathematics Subject Classification