一种适用于自组织网的动态时隙分配算法  

A Dynamic Slot Assignment Algorithm for Ad Hoc Networks

作　　者：王宝玺[1] 文运丰[1] 马鹏飞[1] 扈鹏[1] 

机构地区：[1]中国电子科技集团公司第五十四研究所,河北石家庄050081

出　　处：《无线电工程》2014年第10期47-51,共5页Radio Engineering

基　　金：国家部委基金资助项目

摘　　要：传统的固定时分多址(TDMA)和分布式协调功能(DCF)接入协议,无法实现区分优先级的服务质量(QoS)保障,且由于多次握手,DCF存在显著的网络开销。提出一种适用于Ad Hoc网络的动态时隙分配算法,支持网络节点的动态入网退网,对不同优先级业务提供QoS,有较高的时隙利用率,提高了网络系统的吞吐量,减小时延。在EXata网络仿真平台上进行了仿真验证,仿真结果表明,该算法在吞吐量和时延方面都优于TDMA协议和DCF协议。The traditional fixed TDMA and DCF access protocols cannot implement QoS support for traffics of different priorities, and because of many handshakings,there is significant overhead in DCF. A dynamic TDMA algorithm is proposed for ad hoc networks, which supports nodes to dynamically join or quit the net,provides QoS for traffics of different priorities,and has a high utilization of slot. Thus it increases the throughput of network and decreases the delay. Simulations on the Exata network simulation platform show that the algorithm is superior to TDMA and DCF in both throughput and delay.

关 键 词：AD HOC网络 动态时隙分配 QOS 网络仿真 

分 类 号：TN929.5[电子电信—通信与信息系统]