Decentralised Control of Adaptive Sampling in Wireless Sensor Networks

The efficient allocation of the limited energy resources of a wireless sensor network in a way that maximises the information value of the data collected is a significant research challenge. Within this context, this paper concentrates on adaptive sampling as a means of focusing a sensor's ener...

Full description

Bibliographic Details
Main Authors: Kho, Johnsen (Author), Rogers, Alex (Author), Jennings, Nick (Author)
Format: Article
Language:English
Published: 2009.
Subjects:
Online Access:Get fulltext
LEADER 01773 am a22001453u 4500
001 266579
042 |a dc 
100 1 0 |a Kho, Johnsen  |e author 
700 1 0 |a Rogers, Alex  |e author 
700 1 0 |a Jennings, Nick  |e author 
245 0 0 |a Decentralised Control of Adaptive Sampling in Wireless Sensor Networks 
260 |c 2009. 
856 |z Get fulltext  |u https://eprints.soton.ac.uk/266579/1/TOSN11August2008.pdf 
520 |a The efficient allocation of the limited energy resources of a wireless sensor network in a way that maximises the information value of the data collected is a significant research challenge. Within this context, this paper concentrates on adaptive sampling as a means of focusing a sensor's energy consumption on obtaining the most important data. Specifically, we develop a principled information metric based upon Fisher information and Gaussian process regression that allows the information content of a sensor's observations to be expressed. We then use this metric to derive three novel decentralised control algorithms for information-based adaptive sampling which represent a trade-off in computational cost and optimality. These algorithms are evaluated in the context of a deployed sensor network in the domain of flood monitoring. The most computationally efficient of the three is shown to increase the value of information gathered by approximately 83%, 27%, and 8% per day compared to benchmarks that sample in a naive non-adaptive manner, in a uniform non-adaptive manner, and using a state-of-the-art adaptive sampling heuristic (USAC) correspondingly. Moreover, our algorithm collects information whose total value is approximately 75% of the optimal solution (which requires an exponential, and thus impractical, amount of time to compute). 
655 7 |a Article