计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (26): 144-148.

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

Ad hoc网络的局部最优路由选择策略

张吉赞,李洪波,王 峰   

  1. 鲁东大学 数学与信息学院,山东 烟台 264025
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-09-11 发布日期:2007-09-11
  • 通讯作者: 张吉赞

Local optimum routing scheme in Ad hoc network

ZHANG Ji-zan,LI Hong-bo,WANG Feng   

  1. School of Mathematics and Information,Ludong University,Yantai,Shandong 264025,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-09-11 Published:2007-09-11
  • Contact: ZHANG Ji-zan

摘要: 在Ad hoc网络中,由于节点的移动性及拓扑结构的易变性,路由成为最受关注的问题。提出了一种局部最优路由策略(LOR)。在该策略中,有两个节点需要通信时,根据节点存储的路由信息选择路径,如果有节点移动/删除,则就近选择合适的路径。仿真结果表明,LOR策略在工作过程中能使用较少的信息量和较小的时延来建立路径,明显提高了网络的性能。

关键词: Ad hoc网, 公共邻居节点, 局部最优, 开销

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.

Key words: Ad hoc, public-neighbor, local optimum, cost