Ad hoc网络中一种新的退避算法  

A Novel Backoff Algorithm for Ad hoc Networks

作　　者：夏海轮[1] 许航天[1] 曾志民[1] 丁炜[1] 

机构地区：[1]北京邮电大学宽带通信网络实验室,北京海淀区100876

出　　处：《电子科技大学学报》2008年第4期602-605,共4页Journal of University of Electronic Science and Technology of China

基　　金：国家自然科学基金(60372101)

摘　　要：为了提高Ad hoc网络中高等级节点的接入能力,提出了一种新的二进制负指数退避算法,该算法中高等级节点在分组发送成功时将竞争窗口设为普通节点的最小竞争窗口,在发生碰撞时竞争窗口随着退避次数的增加而呈负指数规律减小。仿真结果表明,该算法能够显著提高高等级节点的接入能力,提高了其业务吞吐量,并降低了端到端传输时延。In order to increase the access ability of high-level node in wireless ad hoc network, a novel binary negative exponential backoff （BNEB） algorithm is proposed. In this algorithm, the high-level node sets its contention window （CW） to the minimum CW of normal nodes after successful transmission, and reduces its CW as times of retransmission increased. The simulation results show that the BNEB algorithm can remarkably increase the access ability of high-level node and reduce the end-to-end delay.

关 键 词：无线自组网 退避算法 二进制负指数退避 竞争窗口 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]