计算机工程与应用
計算機工程與應用
계산궤공정여응용
COMPUTER ENGINEERING AND APPLICATIONS
2013年
22期
72-76
,共5页
交叉冲突%竞争窗口线性变化%分级冲突解析算法%碰撞次数
交扠遲突%競爭窗口線性變化%分級遲突解析算法%踫撞次數
교차충돌%경쟁창구선성변화%분급충돌해석산법%팽당차수
cross collisions%linearly varying contention window%staged collision resolution algorithm%times of collisions
设计合理的冲突解析机制可有效提高无线信道利用率。针对二进制指数退避(Binary Exponential Backoff,BEB)算法及其各种改进算法中普遍存在的节点间交叉冲突问题,提出一种竞争窗口线性变化的分级冲突解析算法(Staged Collision Resolution algorithm with Linearly Varying contention window,LV-SCR)。它通过使处于不同退避阶段节点的退避时隙互相隔离,彻底消除了节点间的交叉冲突;为降低信道空闲概率,还采用了一种竞争窗口的线性调节机制。仿真结果表明,与BEB算法相比,在网络吞吐量和数据帧平均接入时延未明显恶化的情况下,LV-SCR算法可使节点间的碰撞次数减少10%至50%以上。
設計閤理的遲突解析機製可有效提高無線信道利用率。針對二進製指數退避(Binary Exponential Backoff,BEB)算法及其各種改進算法中普遍存在的節點間交扠遲突問題,提齣一種競爭窗口線性變化的分級遲突解析算法(Staged Collision Resolution algorithm with Linearly Varying contention window,LV-SCR)。它通過使處于不同退避階段節點的退避時隙互相隔離,徹底消除瞭節點間的交扠遲突;為降低信道空閒概率,還採用瞭一種競爭窗口的線性調節機製。倣真結果錶明,與BEB算法相比,在網絡吞吐量和數據幀平均接入時延未明顯噁化的情況下,LV-SCR算法可使節點間的踫撞次數減少10%至50%以上。
설계합리적충돌해석궤제가유효제고무선신도이용솔。침대이진제지수퇴피(Binary Exponential Backoff,BEB)산법급기각충개진산법중보편존재적절점간교차충돌문제,제출일충경쟁창구선성변화적분급충돌해석산법(Staged Collision Resolution algorithm with Linearly Varying contention window,LV-SCR)。타통과사처우불동퇴피계단절점적퇴피시극호상격리,철저소제료절점간적교차충돌;위강저신도공한개솔,환채용료일충경쟁창구적선성조절궤제。방진결과표명,여BEB산법상비,재망락탄토량화수거정평균접입시연미명현악화적정황하,LV-SCR산법가사절점간적팽당차수감소10%지50%이상。
Utilization rate of wireless channel can be efficiently improved by designing appropriate collision resolution mecha-nism. Aiming at cross collisions among nodes widely presented at Binary Exponential Backoff(BEB)algorithm and its various improved algorithms, a Staged Collision Resolution algorithm with Linearly Varying contention window(LV-SCR)is proposed in this paper. It thoroughly eliminates cross collisions among nodes by separating the backoff slots of nodes in different backoff stages from each other, and in order to decrease the idle probability of the channel, LV-SCR algorithm also adopts a linear adjust-ment mechanism of contention window. The simulation results show that in the absence of significant deterioration of network throughput and average access delay of data frames, LV-SCR algorithm can reduce the times of collisions among nodes by 10 to more than 50 percent compared with BEB algorithm.