DOI: 10.7763/IJCTE.2013.V5.789
Randomly Roving Agents in Wireless Sensor Networks
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 Stirling numbers of the second kind. Stirling numbers are well studied and different estimates are known for them letting to justify the roving agents quantitative characteristics.
Index Terms—Intrusion detection system, wireless sensor network, roving agents.
The authors are with Theoretical Computer Science group at University of Geneva (e-mail: hakob.aslanyan@unige.ch).
Cite:Hakob Aslanyan and Jose Rolim, "Randomly Roving Agents in Wireless Sensor Networks," International Journal of Computer Theory and Engineering vol. 5, no. 5, pp. 750-753, 2013.