计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (26): 87-89.DOI: 10.3778/j.issn.1002-8331.2009.26.026

• 网络、通信、安全 • 上一篇    下一篇

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

郭胜召,王新华,徐 震,苑芳兵,徐建娥   

  1. 山东师范大学 信息科学与工程学院,济南 250014
  • 收稿日期:2009-01-06 修回日期:2009-03-27 出版日期:2009-09-11 发布日期:2009-09-11
  • 通讯作者: 郭胜召

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   

  1. College of Information Science and Engineering,Shandong Normal University,Jinan 250014,China
  • Received:2009-01-06 Revised:2009-03-27 Online:2009-09-11 Published:2009-09-11
  • Contact: GUO Sheng-zhao

摘要: 传统的Ad Hoc网络路由协议主要是基于“最短路径”来考虑,这样可能使网络中某些节点负载过重,还可能导致延迟、数据丢失等问题。利用非最短路径路由中那些保持连接时间较长,并且通信量较少的节点,将节点的连接时间和空闲度加权和作为选择路径的依据,提出一种新的路由算法LLAODV(Link expiration time and Leisure degree AODV),实验结果表明,改进后的算法改善了网络性能。

关键词: Ad Hoc网络, 连接时间, 空闲度, 网络性能

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.

Key words: Ad Hoc network, link expiration time, leisure degree, network performance

中图分类号: