Math saves the forest

Peter Korteweg, Misja Nuyens, Rob Bisseling, T.J.M. Coenen, Henri van den Esker, Bart Frenk, Roland de Haan, Birgit Heydenreich, Remco van der Hofstad, Jos in 't Panhuis, Lieneke Spanjers, Maarten van Wieren, Aiko Pras, M.R.H. Mandjes, L.J.M. Nieuwenhuis

Research output: Contribution to conferencePaperAcademicpeer-review

20 Downloads (Pure)

Abstract

Wireless sensor networks are decentralised networks consisting of sensors that can detect events and transmit data to neighbouring sensors. Ideally, this data is eventually gathered in a central base station. Wireless sensor networks have many possible applications. For example, they can be used to detect gas leaks in houses or fires in a forest. In this report, we study data gathering in wireless sensor networks with the objective of minimising the time to send event data to the base station. We focus on sensors with a limited cache and take into account both node and transmission failures. We present two cache strategies and analyse the performance of these strategies for specific networks. For the case without node failures we give the expected arrival time of event data at the base station for both a line and a 2D grid network. For the case with node failures we study the expected arrival time on two-dimensional networks through simulation, as well as the influence of the broadcast range.
Original languageUndefined
Pages117-140
Number of pages24
Publication statusPublished - 2006
EventMathematics in Industry; Scientific 55th European Study Group Mathematics with Industry (SWI 2006) - Eindhoven
Duration: 30 Jan 20063 Feb 2006

Conference

ConferenceMathematics in Industry; Scientific 55th European Study Group Mathematics with Industry (SWI 2006)
Period30/01/063/02/06
Other30 Jan - 3 Feb 2006

Keywords

  • Sensor Networks
  • Data gathering
  • EWI-16530
  • Stochastic optimisation
  • Random walks
  • Distributed algorithms
  • IR-70337
  • First-passage percolation

Cite this