分组无线网的路由选择算法研究  

Study of the Routing Algorithms for Packet Radio Network

作　　者：刘建峰[1] 宋文涛[1] 

机构地区：[1]上海交通大学

出　　处：《通信学报》1996年第3期15-20,共6页Journal on Communications

摘　　要：探讨了分组无线网的分布式路由远择算法，分析了以往ＤＡＲＰＡ网中的ＤＡＲ算法存在的缺陷，提出了一种新的ＬＮＲ分布式路由选择算法，并在性能上与ＤＡＲ算法进行了比较。结果表明，由于ＬＮＲ算法克服了环路及无限计数问题，因而ＬＮＲ算法无论在选择最佳路由上，还是在总体开销上，都优于以往以ＤＡＲ为代表的分布式路由选择算法。This Paper discusses the distributed routing algorithms for Packet Radio Network. It analyses the limitations existing in the previous algorithms (especially the DAR algorithm for DARPA network), and proposes a new distributed routing algorithm called LNR, finally, it gives the performance comparison of LNR with that of DAR. Results show, since LNR algorithm has overcome the problems of looping and counting-to-infinity, therefore, it's superior to all the previous distributed routing algorithms such as DAR in respect of both optimal routing and overall routing overhead.

关 键 词：分组无线网 路由选择 铁路 算法 无线网 

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