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

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

Stochastic Operations Research

Research output: Contribution to conference › Paper › peer-review

36 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 language	Undefined
Pages	117-140
Number of pages	24
Publication status	Published - 2006
Event	Mathematics in Industry; Scientific 55th European Study Group Mathematics with Industry (SWI 2006) - Eindhoven Duration: 30 Jan 2006 → 3 Feb 2006

Conference

Conference	Mathematics in Industry; Scientific 55th European Study Group Mathematics with Industry (SWI 2006)
Period	30/01/06 → 3/02/06
Other	30 Jan - 3 Feb 2006

Keywords

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

Access to Document

Cite this

Korteweg, P., Nuyens, M., Bisseling, R., Coenen, T. J. M., van den Esker, H., Frenk, B., de Haan, R., Heydenreich, B., van der Hofstad, R., in 't Panhuis, J., Spanjers, L., van Wieren, M., Pras, A., Mandjes, M. R. H., & Nieuwenhuis, L. J. M. (2006). Math saves the forest. 117-140. Paper presented at Mathematics in Industry; Scientific 55th European Study Group Mathematics with Industry (SWI 2006).

@conference{8ee79712e20542fbbe6fc12bd082da40,

title = "Math saves the forest",

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.",

keywords = "Sensor Networks, Data gathering, EWI-16530, Stochastic optimisation, Random walks, Distributed algorithms, IR-70337, First-passage percolation",

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

year = "2006",

language = "Undefined",

pages = "117--140",

note = "null ; Conference date: 30-01-2006 Through 03-02-2006",

}

Korteweg, P, Nuyens, M, Bisseling, R, Coenen, TJM, van den Esker, H, Frenk, B, de Haan, R, Heydenreich, B, van der Hofstad, R, in 't Panhuis, J, Spanjers, L, van Wieren, M, Pras, A, Mandjes, MRH & Nieuwenhuis, LJM 2006, 'Math saves the forest', Paper presented at Mathematics in Industry; Scientific 55th European Study Group Mathematics with Industry (SWI 2006), 30/01/06 - 3/02/06 pp. 117-140.

TY - CONF

T1 - Math saves the forest

AU - Korteweg, Peter

AU - Nuyens, Misja

AU - Bisseling, Rob

AU - Coenen, T.J.M.

AU - van den Esker, Henri

AU - Frenk, Bart

AU - de Haan, Roland

AU - Heydenreich, Birgit

AU - van der Hofstad, Remco

AU - in 't Panhuis, Jos

AU - Spanjers, Lieneke

AU - van Wieren, Maarten

AU - Pras, Aiko

AU - Mandjes, M.R.H.

AU - Nieuwenhuis, L.J.M.

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

KW - Sensor Networks

KW - Data gathering

KW - EWI-16530

KW - Stochastic optimisation

KW - Random walks

KW - Distributed algorithms

KW - IR-70337

KW - First-passage percolation

M3 - Paper

SP - 117

EP - 140

Y2 - 30 January 2006 through 3 February 2006

ER -