一种改进的基于最少信道切换的路由算法  

Improved routing algorithm with least channel handoff

作　　者：谢晋[1] 李宗收[1] 朱琦[1,2] 

机构地区：[1]南京邮电大学江苏省无线通信重点实验室,南京210003 [2]东南大学移动通信国家重点实验室,南京210096

出　　处：《计算机应用》2010年第2期295-298,共4页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60772062);国家973计划项目(2007CB310607);国家科技重大专项(2009ZX03003-002);东南大学移动通信国家重点实验室开放研究基金资助项目(N200813)

摘　　要：在Ad Hoc网络中,如何基于多信道有效地利用网络中的频谱资源,提高网络的性能,已经成为近几年来研究的热点。在DSDV路由协议的基础上,提出了一种基于减少网络中的信道切换的路由算法——OLCH-DSDV,该算法采用最小切换时延的信道分配策略,尽量减少信道切换产生的时延,从而降低了网络时延,提高了吞吐量。该算法要求源节点通过自身维护的路由和信道使用信息,选择到达目的节点的最优路径,也就是需要最少信道切换的路径。仿真结果表明该路由改进算法在有效提高系统吞吐量的同时,也有效地减少了网络中的传输时延。How to improve the performance of the wireless Ad Hoc network by utilizing the spectrum resources efficiently based on multi-channel has become a hot research topic in recent years. In this paper, an On-Least Channel Handoff-DSDV （OLCH-DSDV） routing algorithm was proposed, which was based on the traditional DSDV protocol to reduce the channel handoff in the network. This algorithm used a channel allocation strategy with minimum channel handoff, so as to cut down the handoff delay. Thus it could reduce the average delay of the network while improving the system throughput. This routing algorithm requires the source node to select the best route with the minimum handoff channel according to the channel information maintained by itself.

关 键 词：AD HOC网络 多信道 路由算法 目的序列距离矢量 切换时延 

分 类 号：TN929.5[电子电信—通信与信息系统]