一个自组网中基于局部状态位置已知的分布式QoS路由算法  

A distributed location-aware QoS routing algorithm based on local states in self-organized network

作　　者：沈晖[1,2] 石冰心[1] 邹玲[1] 石坚[1] 周建新[1] 

机构地区：[1]华中科技大学电子与信息工程系 [2]中兴通讯股份公司技术中心研究部,广东深圳518057

出　　处：《通信学报》2004年第10期58-66,共9页Journal on Communications

基　　金：国家自然科学基金资助项目(60172077);国家"863"基金资助项目(2002AA121012);武汉青年科技晨光计划基金资助项目(20015005038)

摘　　要：在分析自组网的单播 QoS 路由问题的基础上,提出了一种位置信息已知的利用局部状态信息进行路由选择的的分布式 QoS 路由算法——LILAGR 算法。LILAGR 路由算法的基本思想是逐段优化费用和尽快到达目的节点,即在决定节点之间是选择带宽约束费用最小的路径而各个决定节点则是按照贪婪地尽快到达目的节点的原则进行选择。仿真结果表明:LILAGR 算法能够以适度的路由消息开销取得较高的路由成功率。此外,LILAGR 算法具有可扩展性,可以应用于较大规模的自组网中。On the basis of analyzing the problem of unicasting QoS routing in the self-organizing networks, a distributed location-aware QoS routing algorithm based on local state was proposed. The basic idea is to optimize cost piece by piece and greedily reach the destination node as soon as possible in geography. That is to say, LILAGR select the least cost path between the adjacent decision nodes, and select the next decision node by the greedy principle. The simulation shows that the LILAGR algorithm can acquire the higher routing success ratio with the moderate message overhead. In addition, the LILAGR algorithm is scalable and applicable to large-scale self-organized network.

关 键 词：自组网 QOS路由 基于局部状态 

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