Ad Hoc网络中一种基于邻节点活跃度的自适应退避算法  

Dynamic Tuning Algorithm of Contention Window for Mobile Ad Hoc Networks Based on Active State of Neighboring Nodes

作　　者：冯军焕[1] 张燕[1] 范平志[1] 

机构地区：[1]西南交通大学信息科学与技术学院,四川成都610031

出　　处：《系统仿真学报》2008年第5期1348-1352,共5页Journal of System Simulation

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

摘　　要：基于无线AdHoc网络中信道共享的特性,通常采用具有退避机制的MAC接入协议。由于网络节点的各邻居节点在前一段时间的活跃状态在一定程度上反映了网络的繁忙状况,活跃的邻居节点越多,表示信道竞争越激烈,网络越繁忙,反之网络比较空闲。据此,提出了一种基于邻居节点活跃状态的时延退避算法,根据邻居节点活跃数量自适应地调整时延退避窗口,从而提高了网络吞吐率。Based on the characteristics that the channel is shared in the wireless Ad Hoc networks, the MAC access protocol with delayed backoff window scheme is commonly adopted. The active states of the neighboring nodes in some extent reflect how busy the networks is. The more active the neighboring nodes are, the more fierce the channel competition is, and the busier the networks is. Contrarily, the networks would be more free. A delayed backoff window adjustment algorithm was proposed based on the active states of the neighboring nodes. The competition windows could be adaptively adjusted based on the number of the active neighboring nodes. Throughput performances of the networks are shown to be significantly increased.

关 键 词：AD HOC网络 退避算法 活跃节点 MAC协议 

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