Skip to main content

Heuristic Optimization of a Sensor Network Lifetime Under Coverage Constraint

  • Conference paper
  • First Online:

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

Abstract

Control of a set of sensors disseminated in the environment to monitor activity is a subject of the presented research. Due to redundancy in the areas covered by sensor monitoring ranges a satisfying level of coverage can be obtained even if not all the sensors are on. Sleeping sensors save their energy, thus, one can propose schedules defining activity for each of sensors over time which offer a satisfying level of coverage for a period of time longer than a lifetime of a single sensor. A new heuristic algorithm is proposed which searches for such schedules maximizing the lifetime of the sensor network under a coverage constraint. The algorithm is experimentally tested on a set of test cases and effectiveness of its components is presented and statistically verified.

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

References

  1. Cardei, I., Cardei, M.: Energy-efficient connected-coverage in wireless sensor networks. IJSNet 3(3), 201–210 (2008)

    Article  Google Scholar 

  2. Halton, J.H.: Algorithm 247: radical-inverse quasi-random point sequence. Commun. ACM 7(12), 701–702 (1964)

    Article  Google Scholar 

  3. Tian, D., Georganas, N.D.: A coverage-preserving node scheduling scheme for large wireless sensor networks. In: Proceedings of the First ACM International Workshop on Wireless Sensor Networks and Applications (WSNA-02), pp. 32–41. ACM Press (2002)

    Google Scholar 

  4. Tretyakova, A., Seredynski, F.: Application of evolutionary algorithms to maximum lifetime coverage problem in wireless sensor networks. In: IPDPS Workshops, pp. 445–453. IEEE (2013)

    Google Scholar 

  5. Tretyakova, A., Seredynski, F.: Simulated annealing application to maximum life- time coverage problem in wireless sensor networks. In: Global Conference on Artificial Intelligence, GCAI, vol. 36, pp. 296–311. EasyChair (2015)

    Google Scholar 

  6. Tretyakova, A., Seredynski, F., Bouvry, P.: Graph cellular automata approach to the maximum lifetime coverage problem in wireless sensor networks. Simulation 92(2), 153–164 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Artur Mikitiuk .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Trojanowski, K., Mikitiuk, A., Guinand, F., Wypych, M. (2017). Heuristic Optimization of a Sensor Network Lifetime Under Coverage Constraint. 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_41

Download citation

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

  • 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