Skip to main content
Springer Nature Link
Log in

Cellular Automata Approach to Maximum Lifetime Coverage Problem in Wireless Sensor Networks

  • Conference paper
Cellular Automata (ACRI 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8751))

Included in the following conference series:

  • 3155 Accesses

Abstract

In this paper, we propose a novel distributed algorithm based on Graph Cellular Automata (GCA) concept to solve Maximum Lifetime Coverage Problem (MLCP) in Wireless Sensor Networks (WSNs). The proposed algorithm possesses all advantages of localized algorithm, i.e. using only some knowledge about the neighbors, WSN is able to self-organize in such a way to prolong its lifetime preserving at the same time required coverage ratio of a target field. The paper presents results of experimental study of the proposed algorithm and comparison of them with a centralized genetic algorithm.

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

Access this chapter

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Akyildiz, I., Su, W., Sankarasumbramaniam, Y., Cayirci, E.: Sensor networks: A survey. Computer Networks (4), 393–422 (2002)

    Google Scholar 

  2. Baryshnikov, Y., Coffman, E., Kwak, K.J.: High performance sleep-wake sensor systems based on cyclic cellular automata. In: 2008 International Conference on Information Processing in Sensor Networks, pp. 517–526 (2008)

    Google Scholar 

  3. Cardei, M., Wu, J.: Energy-efficient coverage problems in wireless ad-hoc sensor networks. Comput. Commun. 29(4), 413–420 (2006), http://dx.doi.org/10.1016/j.comcom.2004.12.025

    Article  Google Scholar 

  4. Jones, C.E., Sivalingam, K.M., Agrawal, P., Chen, J.C.: A survey of energy efficient network protocol. Wireless Networks (7), 343–358 (2001)

    Google Scholar 

  5. 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.) ACRI 2008. LNCS, vol. 5191, pp. 60–66. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. O’Sullivan, D.: Graph-cellular automata: a generalised discrete urban and regional model. Environment and Planning B: Planning and Design 28(5), 687–705 (2001)

    Article  Google Scholar 

  7. Rinaldi, P.R., Dalponte, D.D., Venero, M.J., Clausse, A.: Graph-based cellular automata for simulation of surface flows in large plains. Asian Journal of Applied Sciences 5(4), 224–231 (2012)

    Article  Google Scholar 

  8. Tretyakova, A., Seredynski, F.: Application of evolutionary algorithms to maximum lifetime coverage problem in wireless sensor networks. In: 2013 IEEE 27th International Symposium on Parallel and Distributed Processing Workshops and PhD Forum, pp. 445–453 (2013)

    Google Scholar 

  9. Wang, B.: Coverage control in sensor network. Springer (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dep. of Mathematics and Natural Sciences, Cardinal Stefan Wyszynski University in Warsaw, Woycickiego 1/3, 01-938, Warsaw, Poland

    Antonina Tretyakova & Franciszek Seredynski

  2. CSC Research Unit, University of Luxembourg, 6, rue Richard Coudenhoven-Kalergi, L-1359, Luxembourg

    Pascal Bouvry

Authors
  1. Antonina Tretyakova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Franciszek Seredynski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pascal Bouvry
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Applied Computer Science, AGH University of Science and Technology, al. Mickiewicza 30, 30-059, Krakow, Poland

    Jarosław Wąs

  2. Dept. of Electrical and Computer Engineering, Democritus University of Thrace, 67100, Xanthi, Greece

    Georgios Ch. Sirakoulis

  3. CSAI - Complex Systems and Artificial Intelligence Research Center, University of Milano-Bicocca, 20126, Milan, Italy

    Stefania Bandini

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Tretyakova, A., Seredynski, F., Bouvry, P. (2014). Cellular Automata Approach to Maximum Lifetime Coverage Problem in Wireless Sensor Networks. In: Wąs, J., Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2014. Lecture Notes in Computer Science, vol 8751. Springer, Cham. https://doi.org/10.1007/978-3-319-11520-7_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11520-7_45

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11519-1

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics