Year of Publication: Jul - 2013
Page Numbers: 110-123
Authors: R.R. Hordijk, O.J.G. Somsen
Conference Name: The Third International Conference on Digital Information and Communication Technology and its Applications (DICTAP2013)
- Czech Republic


Networks consisting of large number of small sensors can be used to watch over areas for intruders, fires and other threats. In the work presented here, we have used computer simulations to study how a network of randomly distributed sensor motes which know their geometrical location can be used to detect an intruder who is approaching a military base camp. If a mote detects an intruder it has to send an alarm to the base. Because the average distance from mote to base is much larger than the transmitting range these alarm messages must be picked up and forwarded by the direct neighbours of the mote. For an efficient energy usage an altered greedy algorithm is used to send the messages from one mote to the other until it is received by the basis. In order to avoid false alarms we state that a minimum of 3 messages should be received at the base before action is taken. Furthermore to be able to take the necessary measures, the messages should be received before the intruder gets half way to the base. Simulations with a variety of densities are performed to seek an optimum for detection and network load. Our simulations show that the demands can be fulfilled with at least an average number of neighbours of 7.