首页 | 官方网站   微博 | 高级检索  
     

基于复杂网络理论的移动自组网路由算法研究
引用本文:方园.基于复杂网络理论的移动自组网路由算法研究[J].计算机测量与控制,2011,19(3).
作者姓名:方园
作者单位:北京工业职业技术学院,北京,100042
摘    要:移动自组网中节点通信时路由开销较大,从而引起整个自组网的能耗过高;为了解决这一问题,针对移动自组网的现实组网特征进行了研究,提出了基于复杂网络理论的移动自组网路由算法;在该路由算法中,路由发现基于源节点到目的节点的梯度方向,源节点选取下一级跳数据转发对象时,在其邻域范围内以选取路径是否符合最速下降法作为判断依据;当源节点和目的节点之间存在的节点个数超过复杂网络理论中的达到条件时,源节点在路由方向上选取其邻域内最接近的节点进行转发后,按照最速下降法继续寻找最优路径;实验表明,该路由算法具有较少的跳级数,可以减轻整个自组网的数据存储压力,路由开销在节点疏密度不同时,介于OLSR协议和AODV协议之间.

关 键 词:移动自组网  复杂网络理论  OLSR协议  AODV协议  路由算法

Study of Ad Hoc Network Routing Algorithm Based on Complex Network Theory
Fang Yuan.Study of Ad Hoc Network Routing Algorithm Based on Complex Network Theory[J].Computer Measurement & Control,2011,19(3).
Authors:Fang Yuan
Affiliation:Fang Yuan(Beijing Polytechnic College,Beijing 100042,China)
Abstract:In order to solve the Ad hoc network nodes in the routing overhead,when the high consumption of the network,the Ad hoc network realistic networking features networking was studied,the Ad hoc network routing algorithm based on the complex network theory was proposed.In this routing algorithm,the routing found to destination node based on source node of gradient,source node selecting next level,data forwarding jump in its neighborhood scope to select path meets the steepest descent method for judging the basi...
Keywords:Ad hoc network  complex network theory  OLSR agreement  AODV agreement  routing algorithms  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号