【24h】

A Data-link Dynamic Slot Allocation Algorithm

机译:数据链路动态插槽分配算法

获取原文

摘要

Aiming at the problem of time slot resource allocation in tactical data link network, combining FPRP algorithm and P-TDMA algorithm, the exponential incremental exponential decrease (EEED) backoff algorithm is introduced, and the competition access probability is improved, propose a dynamic time slot allocation algorithm TDMA based on Adaptable Probability Contention (APC-TDMA). The algorithm collects two hop adjacent node information through multiple exchange information, and performs time slot allocation in two hop adjacent nodes, realizes the time slot space division multiplexing outside two hops, and solves the problem of node hiding and node exposure. The algorithm is simulated and analyzed using OPNET software. The simulation results show that the algorithm performs well in the end delay, network throughput and time slot utilization in large-scale network environment, and can meet the requirement of battlefield actual information transmission.
机译:针对战术数据链路网络中时隙资源分配问题,结合FPRP算法和P-TDMA算法,介绍了指数增量指数减小(EEF)退避算法,提高了竞争访问概率,提出了一种动态的时隙基于适应性概率争用(APC-TDMA)的分配算法TDMA。该算法通过多个交换信息收集两个跳相邻节点信息,并且在两个跳相邻节点中执行时隙分配,实现外部两个跳跃的时隙空间分割复用,并解决节点隐藏和节点曝光的问题。使用OPNET软件模拟和分析该算法。仿真结果表明,该算法在大规模网络环境中的最终延迟,网络吞吐量和时隙利用中表现良好,可以满足战场实际信息传输的要求。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号