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, stochastic optimisation, distributed
algorithms, random walks, first-passage percolation.
|Title of host publication||Mathematics in Industry (Proceedings 55th European Study Group Mathematics with Industry, ESGI55/SWI2006, Eindhoven, The Netherlands, January 30-February 3, 2006)|
|Editors||R.W. Hofstad, van der, E.R. Fledderus, E. Jochemsz, J. Molenaar, T.J.J. Mussche, M.A. Peletier, G. Prokert|
|Place of Publication||Eindhoven|
|Publisher||Technische Universiteit Eindhoven|
|Publication status||Published - 2006|