首页> 外文会议>Advanced Networks and Telecommunication Systems (ANTS), 2009 >Two algorithms for network size estimation for master/slave ad hoc networks
【24h】

Two algorithms for network size estimation for master/slave ad hoc networks

机译:主/从ad hoc网络的两种网络大小估计算法

获取原文

摘要

This paper proposes an adaptation of two network size estimation methods: random tour and gossip-based aggregation to suit master/slave mobile ad hoc networks. We show that it is feasible to accurately estimate the size of ad hoc networks when topology changes due to mobility using both methods. The algorithms were modified to account for the specific constraints of master/slave ad hoc networks and the results show that the proposed modifications perform better on these networks than the original protocols. Each of the two algorithms presents strengths and weaknesses and these are outlined in this paper.
机译:本文提出了两种网络规模估计方法的改编:随机游览和基于八卦的聚合,以适应主/从移动自组织网络。我们表明,当使用这两种方法的拓扑结构由于移动性而发生变化时,准确估计自组织网络的大小是可行的。对算法进行了修改,以解决主从Ad hoc网络的特定约束,结果表明,所提出的修改在这些网络上的性能要优于原始协议。两种算法中的每一种都有优点和缺点,本文概述了这些优点和缺点。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号