Communication Networks: Fundamental Concepts and Key Architectures
Communication Networks: Fundamental Concepts and Key Architectures
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Contour maps: monitoring and diagnosis in sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
ACM Transactions on Sensor Networks (TOSN)
Efficient gathering of correlated data in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Sensor Selection for Minimizing Worst-Case Prediction Error
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
| Hi-index | 0.00 |
This paper develops a stochastic model for data in a Wireless Sensor Network using random field theory. The model captures the space-time behavior of the underlying phenomenon being observed by the network. We then study the size and spatial distribution of the regions of the network that sense statistically extreme values using the theory of extreme excursion regions. Analytical expressions are found for the average size of the data load in a variety of scenarios. These expressions compliment many existing works in the literature that describe algorithms to reduce the data load but cannot evaluate the size and spatial distribution of this load except through simulation. We show that if only the statistically extreme data is transmitted in the network, then the data load can be significantly reduced. Analytical expressions for the total data load are confirmed with simulation. Finally, a simple performance model of a WSN is developed based on a collection of asynchronous M/M/1 servers working in parallel. We derive several performance measures from this performance model. The presented results will be useful in the design of large scale sensor networks.