移动无线网最短路径优先协议的设计  

Design of the Shortest Path First Protocolin a Mobile Packet Radio Network

作　　者：杨楠[1] 孙丹[1] 黄建春[1] 宋瀚涛[1] 

机构地区：[1]北京理工大学计算机科学与工程系

出　　处：《北京理工大学学报》1998年第6期761-765,共5页Transactions of Beijing Institute of Technology

基　　金：部级科技预研基金

摘　　要：目的研究和实现分组无线网在移动条件下的应用．方法采用邻接表监视无线链路的连通性，链路状态表跟踪网络拓扑结构的变化，在此基础上采用Ｄｉｊｋｓｔｒａ算法实现了分组的最短路径优先寻径．结果设计的分组无线网最短路径优先协议可提高网络的可靠性和抗毁性，并充分利用了无线信道的广播特性．结论由此验证无线最短路径优先协议适用于分组无线网．Aim To study and design a protocol used in a mobile multihop packet radio network(PRN) Methods Exchanging adjacent tables between nodes monitors the radio connectivity The topological change of network is followed by updating the link state table of nodes The computation of the shortest path makes use of the Dijkstra algorithm Results Implementation of the protocol takes advantage of the property of broadcast channel,improves utility efficiency and enhances the feasibility of the network Conclusion The radio shortest path first routing protocol is available for PRN

关 键 词：分组无线网 路由 移动无线网 最短路径优先 

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