Geodesic
Quantitative framework of randomly roving agents
Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 2 (2010), pp. 29-34.

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{UZERU_2010_2_a4,
     author = {H. L. Aslanyan},
     title = {Quantitative framework of randomly roving agents},
     journal = {Proceedings of the Yerevan State University. Physical and mathematical sciences},
     pages = {29--34},
     publisher = {mathdoc},
     number = {2},
     year = {2010},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/UZERU_2010_2_a4/}
}
TY  - JOUR
AU  - H. L. Aslanyan
TI  - Quantitative framework of randomly roving agents
JO  - Proceedings of the Yerevan State University. Physical and mathematical sciences
PY  - 2010
SP  - 29
EP  - 34
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/UZERU_2010_2_a4/
LA  - en
ID  - UZERU_2010_2_a4
ER  - 
%0 Journal Article
%A H. L. Aslanyan
%T Quantitative framework of randomly roving agents
%J Proceedings of the Yerevan State University. Physical and mathematical sciences
%D 2010
%P 29-34
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/UZERU_2010_2_a4/
%G en
%F UZERU_2010_2_a4
H. L. Aslanyan. Quantitative framework of randomly roving agents. Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 2 (2010), pp. 29-34. http://geodesic.mathdoc.fr/item/UZERU_2010_2_a4/

[1] C. Krügel, T. Toth, E. Kirda, “SPARTA- A Mobile Agent Based Intrusion Detection System”, First International IFIP TC-11 WG 11.4 Working Conference on Network Security (November 26–27, Leuven, Belgium), 2001

[2] I.S. Moskowitz, M.H. Kang, Ch. L. Wu, G.E. Longdon, “Randomly Roving Agents for Intrusion Detection”, 15th IFIP WG 11.3 Working Conference on Database and Application Security, 2001, 16 pp.

[3] U. Brandes, T. Erlebach (eds.), Network Analysis, Springer-Verlag, Berlin–Heidelberg, 2005, 471 pp. | Zbl

[4] V. Glagolev, “Some bounds of d.n.f.s of boolean functions”, Problemy Kibernetiki, 19, 1967, 75–94 (in Russian) | MR | Zbl

[5] H. Aslanyan, “Greedy Set Cover Estimations”, Int. Conference “Computer Science and Information Technologies” (22-26 Sept. Yer.), 2003,, 143–144

[6] Theory Probab. Appl., 10:1 (1965), 139–144 | DOI | MR | Zbl

[7] R. Chelluri, L.B. Richmond, N.M. Temme, “Asymptotic Estimates for Generalized Stirling Numbers”, Analysis., 20,:1 (2000), 1–14 | DOI | MR