关于连接时间和空闲度的Ad Hoc网络路由方案  

Ad Hoc routing algorithim based on link expiration time and leisure degree

作　　者：郭胜召[1] 王新华[1] 徐震[1] 苑芳兵[1] 徐建娥[1] 

机构地区：[1]山东师范大学信息科学与工程学院,济南250014

出　　处：《计算机工程与应用》2009年第26期87-89,共3页Computer Engineering and Applications

摘　　要：传统的AdHoc网络路由协议主要是基于"最短路径"来考虑,这样可能使网络中某些节点负载过重,还可能导致延迟、数据丢失等问题。利用非最短路径路由中那些保持连接时间较长,并且通信量较少的节点,将节点的连接时间和空闲度加权和作为选择路径的依据,提出一种新的路由算法LLAODV(Link expiration time and Leisure degree AODV),实验结果表明,改进后的算法改善了网络性能。Traditional Ad Hoe network routing protocol is considering mainly based on ＂the shortest path＂,which may cause some nodes overloaded as well as some issues like delaying and data lost.This paper proposes a new routing algorithm LLAODV （Link expiration time and Leisure degree AODV）,with the weight of nodes＇ link expiration time and leisure degree as the condition for path choosing,using the nodes in non-shortest path that keep longer connection time and less communication.Experimental results indicate that modified algorithm improves the network performance.

关 键 词：AD HOC网络 连接时间 空闲度 网络性能 

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