应用于无线信道的混合型冲突分解算法  

Hybrid Collision Splitting Algorithm for Wireless Channel

作　　者：盛敏[1] 李建东[1] 江帆[1] 

机构地区：[1]西安电子科技大学ISN国家重点实验室,信息科学研究所,宽带无线通信实验室,陕西西安710071

出　　处：《电子学报》2005年第4期692-696,共5页Acta Electronica Sinica

基　　金：国家自然科学基金和微软亚洲研究院联合资助项目(No.60372048);国家自然科学基金重大项目(No.60496316);高等学校优秀青年教师教学科研奖励计划

摘　　要：冲突分解算法是一种能够有效改善无线信道多址接入协议性能的方式.传统的冲突分解算法包括树形分解算法和先到先服务的冲突分解算法,但是这两种分解算法都存在着一定的不足.本文提出了一种新型的混合型冲突分解算法(HybridSplittingAlgorithm 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. A 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.

关 键 词：冲突分解算法 树形分裂算法 先到先服务 分组产生间隔 重尾分布 

分 类 号：TN919[电子电信—通信与信息系统]