检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《北京邮电大学学报》2009年第5期88-92,113,共6页Journal of Beijing University of Posts and Telecommunications
摘 要:为降低短波令牌协议(HFTP)令牌中继延迟,提高中继成功率,提出一种新型无冲突的分布式令牌中继协议(SQ-DTRP).该协议通过引入令牌中继子队列,提出增加通信对象项以最大限度保存网络实时状态信息,实现动态搜索令牌中继路径,克服了HFTP令牌中继机制存在的应答冲突和公平性问题.仿真结果表明,该协议令牌中继时延和中继成功概率明显优于HFTP,适合包括短波(HF)网络在内的各种无线网络使用.In order to improve the relay delay and successful relay probability performances of high frequency token protocol(HFTP),derived from HFTP token relay protocol,a distributed collision-free token relay protocol named sub queue-dynamic token relay protocol(SQ-DTRP) is presented,Through the introduction of the communication object column in the relay sub-queue,the real-time network status are reserved as much as possible for the dynamic searching of token relay paths. As a result, potential collisions in acknowledgement to SOLICIT_ RELAY and the token passing impartiality problems are well corrected by this protocol. Simulations indicate that the token relay delay and token relay success probability of SQ-DTRP are better than HFTP, which makes it very suit for high frequency (HF) network and other kinds of wireless networks, too.
关 键 词:媒体访问控制 短波令牌协议 令牌中继 子队列 中继延迟 中继成功概率
分 类 号:TN919.72[电子电信—通信与信息系统] TN915.04[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.14.150.131