Randomly Roving Agents in Wireless Sensor Networks
Discrete Mathematics
2011-05-18 v1
Abstract
Quantitative characterization of randomly roving agents in wireless sensor networks (WSN) is studied. Below the formula simplifications, regarding the known results and publications, it is shown that the basic agent model is probabilistically equivalent to a similar simpler model and then a formula for frequencies is achieved in terms of combinatorial second kind Stirling numbers. Stirling numbers are well studied and different estimates are known for them letting to justify the roving agents quantitative characteristics.
Keywords
Cite
@article{arxiv.1105.3346,
title = {Randomly Roving Agents in Wireless Sensor Networks},
author = {Hakob Aslanyan and Jose Rolim},
journal= {arXiv preprint arXiv:1105.3346},
year = {2011}
}