...
首页> 外文期刊>International journal of wireless and mobile computing >Topology algorithm based on link maintenance time for mobile ad hoc using directional antennas
【24h】

Topology algorithm based on link maintenance time for mobile ad hoc using directional antennas

机译:基于链路维护时间的定向自发移动ad hoc拓扑算法

获取原文
获取原文并翻译 | 示例
           

摘要

Regarding the network instability of mobile ad hoc that is caused by nodes' mobility and use of directional antennas, this paper aims to establish a computational formula of the neighbourhood topology maintenance time based on an improved mobile model to forecast the average link maintenance time using the principle of probability. According to the principle of maximum spanning tree, to propose a topology generation algorithm, we derive a topology reconstruction circle by using the neighbourhood topology maintenance time. This algorithm ensures network connection and distributed operation. The simulation's result shows that this algorithm simplifies network topology and can effectively decrease the topology reconfiguration times by link disconnection.
机译:针对由节点的移动性和定向天线的使用引起的移动自组网的网络不稳定性,本文旨在基于改进的移动模型建立邻域拓扑维护时间的计算公式,以使用概率原理。根据最大生成树的原理,提出一种拓扑生成算法,利用邻域拓扑维护时间推导一个拓扑重构圈。该算法可确保网络连接和分布式操作。仿真结果表明,该算法简化了网络拓扑结构,可以通过断开链路有效地减少拓扑结构重新配置的时间。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号