基于复杂网络理论的移动自组网路由算法研究

Study of Ad Hoc Network Routing Algorithm Based on Complex Network Theory

移动自组网中节点通信时路由开销较大,从而引起整个自组网的能耗过高;为了解决这一问题,针对移动自组网的现实组网特征进行了研究,提出了基于复杂网络理论的移动自组网路由算法;在该路由算法中,路由发现基于源节点到目的节点的梯度方向,源节点选取下一级跳数据转发对象时,在其邻域范围内以选取路径是否符合最速下降法作为判断依据;当源节点和目的节点之间存在的节点个数超过复杂网络理论中的达到条件时,源节点在路由方向上选取其邻域内最接近的节点进行转发后,按照最速下降法继续寻找最优路径;实验表明,该路由算法具有较少的跳级数,可以减轻整个自组网的数据存储压力,路由开销在节点疏密度不同时,介于OLSR协议和AODV协议之间。

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 basis, When the source and destination node exist between the nodes in the network theory to achieve more complicated conditions, the source node in the direction of the route selection of the closest to the neighborhood, according to the nodes are forwarding the steepest descent method to find the optimal path. Experiments show that the algorithm has less land by jumping series, can reduce the pressure from the network data storage, routing overhead in the node porosities, AODV agreement between OLSR agreement and in between.