Skip to main content

Towards Self–optimizing Sensor Networks: Game–Theoretic Second–Order CA–Based Approach

  • Conference paper
  • First Online:
Cellular Automata (ACRI 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13402))

Abstract

We propose a second–order Cellular Automata (CA)–based approach to solve a problem of lifetime optimization in Wireless Sensor Networks (WSN). A WSN graph created for a given deployment of WSN in monitored area is considered as a multiagent system, where agents take part in a spatial Prisoner’s Dilemma game. We propose a local, agent–player oriented criterion which incorporates issues of area coverage and sensors energy spending. Agents act in such a way to maximize their profits what results in achieving by them a solution corresponding to Nash equilibrium. We show that the system is self–optimizing, i.e. is able to optimize a global criterion not known for players, related to a Nash equilibrium, which provides a balance between requested coverage and spending energy, and results in expanding WSN lifetime. The proposed approach is validated by a number of experimental results.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight 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.

    The WSN graph in Fig. 1(b) was obtained under the assumption that the number M of PoI is equal to \( 21 \times 21 = 441 \) as explained in the following section.

References

  1. Berman, P., Calinescu, G., Shah, C., Zelikovsky, A.: Power efficient monitoring management in sensor networks. In: 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733), pp. 2329–2334 (2004)

    Google Scholar 

  2. Cardei, M., Du, D.-Z.: Improving Wireless Sensor Network Lifetime through Power Aware Organization. Wireless Netw. 11(3), 333–340 (2005)

    Article  Google Scholar 

  3. Cerruti, U., Dutto, S., Murru, N.: A symbiosis between cellular automata and genetic algorithms. Chaos, Solitons Fractals 134, 109719 (2020)

    Google Scholar 

  4. Gąsior, J., Seredyński, F., Hoffmann, R.: Towards self-organizing sensor networks: game-theoretic \(\epsilon \)-learning automata-based approach. In: Cellular Automata, ACRI 2018, pp. 125–136 (2018)

    Google Scholar 

  5. Hoffmann, R., Désérable, D., Seredyński, F.: Cellular Automata Rules Solving the Wireless Sensor Network Coverage Problem. Nat. Comput. (to appear)

    Google Scholar 

  6. Katsumata, Y., Ishida, Y.: On a Membrane Formation in a Spatio-temporally generalized prisoner’s dilemma. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds.) Cellular Automata, ACRI 2008, pp. 60–66 (2008)

    Google Scholar 

  7. Manju, Chand, S., Kumar, B.: Genetic algorithm-based meta-heuristic for target coverage problem. IET Wireless Sen. Syst. 8(4), 170–175 (2018)

    Google Scholar 

  8. Musilek, P., Krömer, P., Bartoň, T.: Review of nature-inspired methods for wake-up scheduling in wireless sensor networks. Swarm Evol. Comput. 25, 100–118 (2015)

    Article  Google Scholar 

  9. Östberg, P., Byrne, J., et al.: Reliable capacity provisioning for distributed cloud/edge/fog computing applications. In: European Conference on Networks and Communications (EuCNC 2017), pp. 1–6 (2017)

    Google Scholar 

  10. Pereira, R.L., et al.: Game theory and social interaction for selection and crossover pressure control in genetic algorithms: an empirical analysis to real real-valued constrained optimization. IEEE Access 8, 144839–144865 (2020)

    Article  Google Scholar 

  11. Rathee, M., Kumar, S., Gandomi, A.H., Dilip, K., Balusamy, B., Patan, R.: Ant colony optimization based quality of service aware energy balancing secure routing algorithm for wireless sensor networks. IEEE Trans. Eng. Management 68(1), 170–182 (2021)

    Article  Google Scholar 

  12. Seredyński, F., Gąsior, J., Hoffmann, R.: The second order CA-based multiagent systems with income sharing. In: Cellular Automata ACRI 2020, pp. 134–145

    Google Scholar 

  13. Zhong, J., Huang, Z., Feng, L., Du, W., Li, Y.: A hyper-heuristic framework for lifetime maximization in wireless sensor networks with a mobile sink. IEEE/CAA J. Automatica Sinica 7(1), 223–236 (2020)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tomasz Kulpa .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Seredyński, F., Kulpa, T., Hoffmann, R., Désérable, D. (2022). Towards Self–optimizing Sensor Networks: Game–Theoretic Second–Order CA–Based Approach. In: Chopard, B., Bandini, S., Dennunzio, A., Arabi Haddad, M. (eds) Cellular Automata. ACRI 2022. Lecture Notes in Computer Science, vol 13402. Springer, Cham. https://doi.org/10.1007/978-3-031-14926-9_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-14926-9_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-14925-2

  • Online ISBN: 978-3-031-14926-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics