吉林大学通信工程学院,吉林,长春,130022
纸质出版:2007
移动端阅览
杨 帆, 王 珂, 钱志鸿. 按需轮循的蓝牙微微网调度算法与性能评估[J]. 电子学报, 2007,35(4):647-652.
YANG Fan, WANG Ke, QIAN Zhi-hong. Polling-on-Demand Scheduling Algorithm for Bluetooth Piconet and Performance Evaluation[J]. Acta Electronica Sinica, 2007, 35(4): 647-652.
提出了一种低时延、高信道利用率与公平性好的按需轮循的蓝牙微微网调度算法.首先通过速率估计过程计算出上行链路分组到达率的估计值
然后在主调度过程中分别计算各链路对自上次轮循时刻到当前时刻的分组到达数量的估计值与等待时间
根据提出的动态轮循选择规则选出优先度最高的链路对进行轮循
再根据自适应轮循间隙规则计算出下次轮循应该进行的时间.分别在混合、下行与上行三种传输模型的仿真中进行了与其他经典算法的性能比较.结果表明:算法在前两种传输模型中具有最佳的整体性能
尤其是时延分别降低了24.1%与41.4%以上
在第三种传输模型中也具有较佳的整体性能.该算法效率高、实现复杂度低
可应用于蓝牙与其他无线网络.
A polling-on-demand scheduling algorithm for bluetooth piconet is presented
which has good characters of low delay
high channel utilization and desired fairness.The algorithm computes out estimate of packet arrival rates for upstream links by the rate estimating process
and then it works out the estimate of packet arrival number and latency for every link pair from its last poll time through present moment.According to the dynamic polling selection regulation presented in the paper
the scheduler selects a link pair that has the highest priority to poll
and computes the next polling time according to the adaptive polling interval regulation.The three traffic modes
mixed
downstream and upstream are used to compare the performance between this algorithm and other classical algorithms by simulations.The results indicate that this algorithm has the best integral performance in the first two traffic modes
and particularly
delays decrease by at least 24.1% and 41.4% respectively.The algorithm also has relatively good behaviors in the third traffic mode.This algorithm is efficient and has low complexity
and it can be used for bluetooth and other wireless networks.
0
浏览量
1098
下载量
3
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621