Skip to main content
SpringerLink
Log in

Scheduling Sensors Activity in Wireless Sensor Networks

  • Conference paper
  • First Online:
Computational Collective Intelligence (ICCCI 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10448))

Included in the following conference series:

Abstract

In this paper we consider Maximal Lifetime Coverage Problem in Wireless Sensor Networks which is formulated as a scheduling problem related to activity of sensors equipped at battery units and monitoring a two-dimensional space in time. The problem is known as an NP-hard and to solve it we propose two heuristics which use specific knowledge about the problem. The first one is proposed by us stochastic greedy algorithm and the second one is metaheuristic known as Simulated Annealing. The performance of both algorithms is verified by a number of numerical experiments. Comparison of the results show that while both algorithms provide results of similar quality, but greedy algorithm is slightly better in the sense of computational time complexity.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Similar content being viewed by others

References

  1. Nesamony, S., Vairamuthu, M.K., Orlowska, M.E., Sadiq, S.W.: On sensor network segmentation for urban water distribution monitoring. In: Zhou, X., Li, J., Shen, H.T., Kitsuregawa, M., Zhang, Y. (eds.) APWeb 2006. LNCS, vol. 3841, pp. 974–985. Springer, Heidelberg (2006). doi:10.1007/11610113_104

    Chapter  Google Scholar 

  2. Pierce, F.J., Elliott, T.V.: Regional and on-farm wireless sensor networks for agricultural systems in Eastern Washington. Comput. Electron. Agric. 61(1), 32–43 (2008)

    Article  Google Scholar 

  3. Cardei, M., Wu, J.: Energy-efficient coverage problems in wireless ad-hoc sensor networks. J. Comput. Commun. Arch. 29, 413–420 (2006)

    Article  Google Scholar 

  4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)

    MATH  Google Scholar 

  5. Sahoo, B., Ravu, V., Patel, P.: Observation on using genetic algorithm for extending the lifetime of wireless sensor networks. In: IJCA Special Issue on 2nd National Conference- Computing, Communication and Sensor Network, pp. 9–13 (2011)

    Google Scholar 

  6. Fayyazi, H., Sabokrou, M., Hosseini, M., Sabokrou, A.: Solving heterogeneous coverage problem in Wireless Multimedia Sensor Networks in a dynamic environment using Evolutionary Strategies. In: ICCKE2011, Mashhad, Iran, 13–14 October 2011

    Google Scholar 

  7. Abbasi, M., Abd Latiff, M.S., Modirkhazeni, A., Anisi, M.H.: Optimization of wireless sensor network coverage based on evolutionary algorithm. IJCCN 1(1), 104 (2011)

    Google Scholar 

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

    Article  Google Scholar 

  9. Tretyakova, A., Seredynski, F.: Application of evolutionary algorithms to maximum lifetime coverage problem in wireless sensor networks. In: 27-th IEEE IPDPS, Boston, USA (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Natural Sciences, Cardinal Stefan Wyszynski University in Warsaw, Warsaw, Poland

    Antonina Tretyakova, Franciszek Seredynski & Frederic Guinand

  2. LITIS Laboratory, University of Le Havre, Le Havre, France

    Frederic Guinand

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. Frederic Guinand
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Frederic Guinand .

Editor information

Editors and Affiliations

  1. Department of Information Systems, Faculty of Computer Science and Management , Wrocław University of Science and Technology, Wrocław, Poland

    Ngoc Thanh Nguyen

  2. Department of Computer Science, University of Cyprus, Nicosia, Cyprus

    George A. Papadopoulos

  3. Department of Information Systems, Gdynia Maritime University, Gdynia, Poland

    Piotr Jędrzejowicz

  4. Department of Information Systems, Faculty of Computer Science and Management, Wrocław University of Science and Technology, Wrocław, Poland

    Bogdan Trawiński

  5. Department of Information Systems, University of Münster, Münster, Germany

    Gottfried Vossen

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Tretyakova, A., Seredynski, F., Guinand, F. (2017). Scheduling Sensors Activity in Wireless Sensor Networks. In: Nguyen, N., Papadopoulos, G., Jędrzejowicz, P., Trawiński, B., Vossen, G. (eds) Computational Collective Intelligence. ICCCI 2017. Lecture Notes in Computer Science(), vol 10448. Springer, Cham. https://doi.org/10.1007/978-3-319-67074-4_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67074-4_43

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67073-7

  • Online ISBN: 978-3-319-67074-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation