首页 | 本学科首页   官方微博 | 高级检索  
     

Ad hoc网络的局部最优路由选择策略
引用本文:张吉赞,李洪波,王峰.Ad hoc网络的局部最优路由选择策略[J].计算机工程与应用,2007,43(26):144-148.
作者姓名:张吉赞  李洪波  王峰
作者单位:鲁东大学,数学与信息学院,山东,烟台,264025
摘    要:在Ad hoc网络中,由于节点的移动性及拓扑结构的易变性,路由成为最受关注的问题。提出了一种局部最优路由策略(LOR)。在该策略中,有两个节点需要通信时,根据节点存储的路由信息选择路径,如果有节点移动/删除,则就近选择合适的路径。仿真结果表明,LOR策略在工作过程中能使用较少的信息量和较小的时延来建立路径,明显提高了网络的性能。

关 键 词:Ad  hoc网  公共邻居节点  局部最优  开销
文章编号:1002-8331(2007)26-0144-05
修稿时间:2007-01

Local optimum routing scheme in Ad hoc network
ZHANG Ji-zan,LI Hong-bo,WANG Feng.Local optimum routing scheme in Ad hoc network[J].Computer Engineering and Applications,2007,43(26):144-148.
Authors:ZHANG Ji-zan  LI Hong-bo  WANG Feng
Affiliation:School of Mathematics and Information,Ludong University,Yantai,Shandong 264025,China
Abstract:In Ad hoc,routing has been the most focused area for its nodes’ mobility and topology variability.Proposes a Local Optimum Routing scheme(LOR).In LOR,when two nodes want to communicate each other,the nodes choose path based the routing information is held.During forming path,LOR chooses path round the nodes that has moved or deleted.Simulation results show that the algorithm can use less information and less delay to choose path,improves the performance of Ad hoc.
Keywords:Ad hoc  public-neighbor  local optimum  cost
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号