首页 | 官方网站   微博 | 高级检索  
     

基于时隙调度的DTRA改进协议
引用本文:李洪生,李颖,王维.基于时隙调度的DTRA改进协议[J].计算机工程,2011,37(5):118-120,123.
作者姓名:李洪生  李颖  王维
作者单位:重庆通信学院数据链教研室,重庆,400035
摘    要:提出一种基于时隙调度的DTRA改进协议——SDTRA协议。在邻节点发现阶段,通过发送时间随机抖动,减少发现过程中的冲突;在时隙调度阶段,提出基于贪婪算法的边着色法,调度节点的可用时隙,同步的时隙调度方案更好地保证了对Qos的支持。仿真结果表明,与DTRA协议相比,改进协议在邻节点发现效率、时隙利用率和吞吐量上有较大改进。

关 键 词:DTRA协议  邻节点发现  时隙调度  边着色

Improved DTRA Protocol Based on Slot Schedule
LI Hong-sheng,LI Ying,WANG Wei.Improved DTRA Protocol Based on Slot Schedule[J].Computer Engineering,2011,37(5):118-120,123.
Authors:LI Hong-sheng  LI Ying  WANG Wei
Affiliation:(Datalink Staff Room,Chongqing Communication Institute,Chongqing 400035,China)
Abstract:This paper proposes an improved Directional Transmission and Reception Algorithm(DTRA) named SDTRA protocol based on slot schedule.In the process of neighbor discovery stage,the protocol decreases the collision through sending time random delay.In the process of slot schedule stage,it adopts greedy edge coloring algorithm to control the time the node can use.The protocol can assure the QoS support through synchronous slot schedule algorithm.Simulation results show that the improved DTRA protocol is much better than DTRA protocol in neighbor discovery,time utility and throughput.
Keywords:DTRA protocol  neighbor discovery  slot schedule  edge coloring
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号