Polling Algorithm Based on Traffic Burst Characteristics of Broadband Wireless Access Systems

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 fea...

Full description

Saved in:
Bibliographic Details
Published in:Shanghai jiao tong da xue xue bao 2011-08, Vol.16 (4), p.429-435
Main Author: 李秀媛 李炜 吴晓娟 张云峰
Format: Article
Language:English
Subjects:
Algorithms
Architecture
Bandwidth
Broadband
Bursting
Computer Science
Electrical Engineering
Engineering
Intervals
Life Sciences
Materials Science
Optimization
Pareto optimality
Stations
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1007-1172
1995-8188
DOI:10.1007/s12204-011-1169-5