Randomized algorithms
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
A Random Graph Model for Optical Networks of Sensors
IEEE Transactions on Mobile Computing
Efficient and robust protocols for local detection and propagation in smart dust networks
Mobile Networks and Applications
Evaluation of basic protocols for optical smart dust networks
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
An adaptive blind algorithm for energy balanced data propagation in wireless sensors networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Numerical estimation of the impact of interferences on the localization problem in sensor networks
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
| Hi-index | 0.00 |
In this paper we show how to use stochastic estimation methods to investigate the topological properties of sensor networks as well as the behaviour of dynamical processes on these networks. The framework is particularly important to study problems for which no theoretical results are known, or can not be directly applied in practice, for instance, when only asymptotic results are available. We also interpret Russo's formula in the context of sensor networks and thus obtain practical information on their reliability. As a case study, we analyse a localization protocol for wireless sensor networks and validate our approach by numerical experiments. Finally, we mention three applications of our approach: estimating the number of pivotal sensors in a real network, minimizing the number of such sensors for robustness purposes during the network design and estimating the distance between successive localized positions for mobile sensor networks.