

浏览全部资源
扫码关注微信
西安电子科技大学ISN国家重点实验室、信息科学研究所、宽带无线通信实验室,陕西,西安,710071
Published Online:25 April 2005,
Published:2005
移动端阅览
SHENG Min, LI Jian-dong, JIANG Fan. Hybrid Collision Splitting Algorithm for Wireless Channel[J]. Acta Electronica Sinica, 2005, 33(4): 692-696.
冲突分解算法是一种能够有效改善无线信道多址接入协议性能的方式.传统的冲突分解算法包括树形分解算法和先到先服务的冲突分解算法
但是这两种分解算法都存在着一定的不足.本文提出了一种新型的混合型冲突分解算法(Hybrid Splitting Algorithm-HSA)
HSA算法继承了树形分解算法和先到先服务冲突分解算法的优点
不仅考虑了碰撞分组的产生时间
使先产生的分组先得到服务
同时当系统中存在产生间隔比较接近的分组时
采用树形分解算法
使整个分解过程不再仅仅局限于分组的产生时间
从而有效地减少了分解所需的总时隙数
提高了冲突分解算法的性能.理论分析和仿真结果显示HSA算法是一种正确可行的算法.
Collision resolution is an effective strategy to improve the performance of medium access control protocol.Both tree splitting algorithm and First Come First Service (FCFS) splitting algorithm are classical algorithms of Splitting algorithm.But both of them have some limitations.In this paper
a novel splitting algorithm - Hybrid Splitting Algorithm (HSA) has been presented.Based on the tree splitting algorithm and FCFS splitting algorithm
the HSA has the packet transmitted in the order of their arrival partially
while if the packet generation time is too near to split using by FCFS
the HSA adopts the tree splitting algorithm.So
the whole splitting procedure has relations with both the generation time and the generation interval of packets.Simulation results show that HSA outperforms tree splitting and FCFS splitting algorithm.
0
Views
815
下载量
1
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution
京公网安备11010802024621