检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]School of Computer Science and Technology,Shandong Economy University [2]School of Information Science and Engineering,Shandong University [3]Shandong Provincial Key Laboratory of Digital Media Technology
出 处:《Journal of Shanghai Jiaotong university(Science)》2011年第4期429-435,共7页上海交通大学学报(英文版)
基 金:the National Natural Science Foundation of China(No.60675024);the Natural Science Foundation of Shandong(No.Y2008G37) ;the Soft Science Foundation of Shandong(No.2010RKGA1033)
摘 要:In this paper,we propose a novel polling algorithm to decrease the number of idle slots and collission slots during the polling cycle by evaluating the bandwidth request of the subscribe stations(SSs) in the next polling cycle for broadband wireless access(BWA) systems.We firstly analyze the feature of silent time intervals and deduce the Hurst index which symbolizes the degree of self-similarity and long-relative nature.Then we represent the inactive OFF time intervals by the Pareto model and estimate the shape parameterαby the group measured data.Finally we can evaluate the transmission probability of a silent SS before the next polling cycle. By this algorithm,we can find the optimal transmission opportunities for the base station(BS) to achieve the least collision or void timeslots in order to achieve the largest bandwidth efficiency.The theoretical analysis and simulation results show that this polling algorithm can improve the performance for BWA system.In this paper, we propose a novel polling algorithm to decrease the number of idle slots and collission slots during the polling cycle by evaluating the bandwidth request of the subscribe stations (SSs) in the next polling cycle for broadband wireless access (BWA) systems. We firstly analyze the feature of silent time intervals and deduce the Hurst index which symbolizes the degree of self-similarity and long-relative nature. Then we represent the inactive OFF time intervals by the Pareto model and estimate the shape parameter α by the group measured data. Finally we can evaluate the transmission probability of a silent SS before the next polling cycle. By this algorithm, we can find the optimal transmission opportunities for the base station (BS) to achieve the least collision or void timeslots in order to achieve the largest bandwidth efficiency. The theoretical analysis and simulation results show that this polling algorithm can improve the performance for BWA system.
关 键 词:broadband wireless access(BWA) systems polling algorithm bandwidth allocation SELF-SIMILARITY
分 类 号:TP393.1[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49