Skip to main content

Learning Automata for Wireless Sensor Networks

  • Chapter
  • First Online:
Recent Advances in Learning Automata

Abstract

Wireless senor networks (WSN) are collections of tiny and low-cost sensors, capable of wirelessly communicating and cooperating with each other to fulfill intended network duties. The environment of a WSN is highly dynamic due to a number of reasons, topological changes, wireless errors, autonomity of sensor nodes which results in ad hoc changes in their behaviors, resource limitations, and so on. Considering such dynamism, it is evident that the algorithms and protocols designed for WSNs should be made adaptive so that they can cope with the environmental changes occur in such networks. Considering the above mentioned characteristics of WSNs, this chapter aimed at justifying the suitability of the learning automaton (LA) model in designing algorithms and protocols for WSNs. There are strong evidences which support this idea. First, LA is proved to perform well in distributed environments like the environments of WSNs, where the number of distributed elements is very large and the overhead of using centralized algorithms is very high. Second, LA has a very low computational and communicational overhead which makes it an outstanding model to be used in resource limited environments as of WSNs. Third, LA model is highly adaptive to the environmental changes, and hence, is well-suited to highly dynamic environments like the environments of WSNs. Finally, the reinforcement signal used by the LA is considered as a random variable and hence, its instant values do not affect the performance of the LA in the long run. To justify the idea, a number of learning automata-based algorithms will be proposed for addressing five different problems within the area of WSNs; data aggregation, clustering, deployment, k-coverage, and dynamic point coverage. For any of the proposed algorithms, extensive simulation studies will be reported to elaborate the performance of the algorithm. Results of these studies strongly support the idea that LA is a suitable problem solving model for the area of WSNs.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    http://isi.edu/nsnam/ns/.

  2. 2.

    http://www.nytimes.com/2008/07/12/business/12newpark.html.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alireza Rezvanian .

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Rezvanian, A., Saghiri, A.M., Vahidipour, S.M., Esnaashari, M., Meybodi, M.R. (2018). Learning Automata for Wireless Sensor Networks. In: Recent Advances in Learning Automata. Studies in Computational Intelligence, vol 754. Springer, Cham. https://doi.org/10.1007/978-3-319-72428-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-72428-7_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-72427-0

  • Online ISBN: 978-3-319-72428-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics