首页> 中文期刊> 《计算机工程》 >基于TDMA的无冲突动态时隙分配算法

基于TDMA的无冲突动态时隙分配算法

         

摘要

针对分簇Ad Hoc网络中固定时隙分配算法信道资源浪费和竞争时隙分配算法传输延迟不固定的问题,提出一种基于时分多址接入的无冲突动态时隙分配算法。该算法根据网络负载动态调整帧长,即当网络负载增大时,增加帧长,提高信道利用率;当网络负载减小时,减少帧长,降低信道申请时延。仿真结果表明,与NEBS算法和时隙ALOHA算法相比,该算法可根据网络负载动态调整资源分配,从而提高系统的吞吐量。%Concerning the problem of resource waste in fixed assignment algorithm and uncertain transmission delay in contention assignment algorithm, a dynamic slot assignment algorithm of contention-avoid based on Time Division Multiple Address( TDMA) for clustered Ad Hoc network is proposed. The length of frame can be adapted to the net traffic. When the net traffic increases, the frame length increases to improve channel utilization; when the net traffic reduces,the frame length reduces to reduce the delay of accessing. It is proved by simulation results that the algorithm can increase throughput of the system,compared with NEBS and slot-ALOHA.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号