RUS  ENG
Full version
JOURNALS // Proceedings of the Yerevan State University, series Physical and Mathematical Sciences // Archive

Proceedings of the YSU, Physical and Mathematical Sciences, 2010 Issue 2, Pages 29–34 (Mi uzeru212)

This article is cited in 1 paper

Informatics

Quantitative framework of randomly roving agents

H. L. Aslanyan

Chair of Discrete Mathematics and Theoretical Informatics YSU, Armenia University

Abstract: Quantitative characterization of randomly roving agents in wireless sensor networks $\mathrm{(WSN)}$ is studied. Above the formula simplifications, regarding the known results, it is shown that the basic agent model is stochastically equivalent to a similar simpler model. Then a formula for frequencies is achieved in terms of combinatorial second kind Stirling numbers. At allows to justify the roving agents quantitative characteristics.

Keywords: wireless, sensor, network, roving agent.

Received: 21.01.2010
Accepted: 01.03.2010

Language: English



© Steklov Math. Inst. of RAS, 2026