| 关于连接时间和空闲度的Ad Hoc网络路由方案 |
| |
| 引用本文： | 郭胜召,王新华,徐震,苑芳兵,徐建娥.关于连接时间和空闲度的Ad Hoc网络路由方案[J].计算机工程与应用,2009,45(26):87-89. |
| |
| 作者姓名： | 郭胜召 王新华 徐震 苑芳兵 徐建娥 |
| |
| 作者单位： | 山东师范大学 信息科学与工程学院，济南 250014 |
| |
| 摘 要： | 传统的Ad Hoc网络路由协议主要是基于“最短路径”来考虑，这样可能使网络中某些节点负载过重，还可能导致延迟、数据丢失等问题。利用非最短路径路由中那些保持连接时间较长，并且通信量较少的节点，将节点的连接时间和空闲度加权和作为选择路径的依据，提出一种新的路由算法LLAODV（Link expiration time and Leisure degree AODV），实验结果表明，改进后的算法改善了网络性能。
|
| 关 键 词： | AdHoc网络 连接时间 空闲度 网络性能 |
| 收稿时间： | 2009-1-6 |
| 修稿时间： | 2009-3-27
|
Ad Hoc routing algorithim based on link expiration time and leisure degree |
| |
| GUO Sheng-zhao,WANG Xin-hua,XU Zhen,YUAN Fang-bing,XU Jian-e.Ad Hoc routing algorithim based on link expiration time and leisure degree[J].Computer Engineering and Applications,2009,45(26):87-89. |
| |
| Authors: | GUO Sheng-zhao WANG Xin-hua XU Zhen YUAN Fang-bing XU Jian-e |
| |
| Affiliation: | College of Information Science and Engineering，Shandong Normal University，Jinan 250014，China |
| |
| Abstract: | Traditional Ad Hoc 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. |
| |
| Keywords: | Ad Hoc network link expiration time leisure degree network performance |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
