作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程

• 移动互联与通信技术 • 上一篇    下一篇

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

崔可嘉,孙 昕   

  1. (北京交通大学电子信息工程学院,北京100044)
  • 收稿日期:2013-10-08 出版日期:2014-10-15 发布日期:2014-10-13
  • 作者简介:崔可嘉(1988 - ),男,硕士研究生,主研方向:Ad Hoc 网络,无线接入技术;孙 昕,教授。
  • 基金资助:
    北京交通大学校基金资助项目(2012JBZ015)。

Dynamic Slot Assignment Algorithm of Contention-avoid Based on TDMA

CUI Ke-jia,SUN Xin   

  1. (School of Electronic and Information Engineering,Beijing Jiaotong University,Beijing 100044,China)
  • Received:2013-10-08 Online:2014-10-15 Published:2014-10-13

摘要: 针对分簇Ad Hoc 网络中固定时隙分配算法信道资源浪费和竞争时隙分配算法传输延迟不固定的问题,提出一种基于时分多址接入的无冲突动态时隙分配算法。该算法根据网络负载动态调整帧长,即当网络负载增大时,增加帧长,提高信道利用率;当网络负载减小时,减少帧长,降低信道申请时延。仿真结果表明,与NEBS 算法和时隙ALOHA 算法相比,该算法可根据网络负载动态调整资源分配,从而提高系统的吞吐量。

关键词: 时分多址, 时隙分配算法, 时隙回收算法, 无冲突, Ad Hoc 网络, 吞吐量

Abstract: 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.

Key words: Time Division Multiple Address(TDMA), slot assignment algorithm, slot reuse algorithm, contentionavoid, Ad Hoc network, throughput

中图分类号: