一种基于双令牌的蓝牙调度算法  

A Bluetooth Scheduling Algorithm Based on Both Tokens

作　　者：任秀丽[1] 全成斌[2] 范力军[2] 栾贵兴[3] 

机构地区：[1]吉林师范大学计算机学院,四平136000 [2]东北大学信息科学与工程学院,沈阳110004 [3]中国科学院沈阳计算技术研究所,沈阳110004

出　　处：《计算机科学》2004年第4期47-49,88,共4页Computer Science

基　　金：国家科技部科技型中小企业技术创新基金(01C26212110295)

摘　　要：调度算法是短距离无线通信技术的主要问题。蓝牙网络中使用的Round Robin(RR)轮询调度算法严重影响了系统的性能.本文针对这个问题提出了一种改进的蓝牙调度算法——双令牌随机(DTPR)轮询算法,此算法有两个重要特点:一是访问采用随机次序解决从设备之间的不公平性;二是采用优先级调度策略,对拥有令牌的主从设备对进行调度,缩短了轮询周期。并对本文提出的算法与现已提出的算法进行了仿真实验,结果表明,本文提出的算法在系统的吞吐量、传输时延和公平性方面都优于现有的其它算法。Scheduling algorithm is a primary question in short range wireless communication. The Round Robin polling algorithm of Bluetooth significantly impacts on the system performance. In this paper Double Token Pseudo Random polling algorithm is proposed . The algorithm has two important characteristics. The first one is that all slaves are visited by the Pseudo-Random order to solve the unfairness for all slaves. The second one is that a pair of the master-slave devices holding two Tokens is firstly scheduled. The length of the polling cycles is reduced. The simulation results show that the proposed algorithm is outperformed in throughput and delay behavior and has a fairness among all slaves comparing with these practical algorithm presented in this paper.

关 键 词：短距离无线通信 蓝牙调度算法 双令牌随机轮询算法 微微网 

分 类 号：TN92[电子电信—通信与信息系统]