Two Algorithms for Network Size Estimation for Master-Slave Ad Hoc Networks - Computer Science > Networking and Internet ArchitectureReportar como inadecuado




Two Algorithms for Network Size Estimation for Master-Slave Ad Hoc Networks - Computer Science > Networking and Internet Architecture - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: This paper proposes an adaptation of two network size estimation methods:random tour and gossip-based aggregation to suit master-slave mobile ad hocnetworks. We show that it is feasible to accurately estimate the size of ad hocnetworks when topology changes due to mobility using both methods. Thealgorithms were modified to account for the specific constraints ofmaster-slave ad hoc networks and the results show that the proposedmodifications perform better on these networks than the original protocols.Each of the two algorithms presents strengths and weaknesses and these areoutlined in this paper.



Autor: Redouane Ali, Suksant Sae Lor, Miguel Rio

Fuente: https://arxiv.org/







Documentos relacionados