检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:黄玉兰[1] 刘健[1] 刘子川[1] 迟学芬[1]
出 处:《北京邮电大学学报》2015年第4期74-78,共5页Journal of Beijing University of Posts and Telecommunications
基 金:吉林省科技发展计划项目(20130413052GH)
摘 要:为保证群组时延敏感业务的传输时间限制,提出了基于马尔可夫决策过程(MDP)的群组时延约束随机接入控制算法.与现有文献对保证单个数据包时延或平均包时延的研究不同,以分组的整体时延为研究对象,且首次将群组时延约束作为该类业务的服务质量指标.该算法动态估计介质访问控制层参数和MDP决策门限,权衡当前最大回报和未来可能更大的回报制定传输策略.终端选择性地参与信道资源竞争,缓解数据突发造成的信道拥塞.仿真结果表明在业务负荷较大时,所提算法更能有效保证群组时延敏感业务的服务质量需求.To guarantee the transmission time constraints of group delay constrained services,a group delay constrained random medium access control algorithm for IEEE 802. 15. 4 was proposed based on Markov decision process( MDP). Different from the existing researches,the delay experienced by a group of packets instead of one single packet in a group was paid attentions. Also,the group delay constraints was used as quality of service indicators for the first time. In the algorithm,the medium access control layer parameters and decision threshold are estimated dynamically,and the optimal policy is used as a trade-off between the highest immediate rewards in the present and a possibly higher reward in the future. With the proposed algorithm,the terminal device will choose the best transmission strategy to overcome the channel congestion resulting from burst data. Simulation results show the efficiency of the proposed algorithm when the traffic load becomes heavy.
关 键 词:IEEE 802.15.4 马尔可夫决策过程 群组时延敏感业务 群组时延约束
分 类 号:TN929.53[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.32