基于ACO和AODV的Ad Hoc网络低时延路由算法

针对Ad Hoc网络中按需路由AODV算法具有较大时延和低能节点死亡,而需频繁路由发现的问题,提出了使用ACO优化AODV的低时延路由算法。首先,加入信息素、节点剩余能量和路径时延,对节点路由表进行改进。通过前向蚂蚁和后向蚂蚁进行路由发现。设计了伪随机分配法选择下一跳节点。在蚂蚁行进的过程中进行局部信息素更新。当前向蚂蚁到达信宿节点时对全局信息素进行更新。同时选择总时延较小的路径分配后向蚂蚁并作为最终路由。仿真实验证明能正确地进行路由发现和路由维护,且与AODV和DSR方法相比,具有较高的数据投递正确率和较小的平均端到端延迟。

Routing Algorism with Low Time Delay Based on ACO and AODV

Aiming at the traditional routing algorism AODV of Ad Hoc having the large time delay and the death of low energy node in the route resulting in the frequent route discovery,a new method based on ACO and AODV is proposed.Firstly,the routing table was changed with adding the pheromone,residual energy of node and the path time delay.Through the front ant and the back ant the route is discoverd.The psedudo-ramdom allocation method is designed to decide the next hop for node.The local pheromone is renewed in the ant processing,and the global pheromone is changed when the front ant reach the goal node.The route has the smallest time delay is used as the finally route.The experiment shows that the method can correctly get the route finding and route maintenance.And compared with the AODV and DSR,it has the higher data delivery accuracy and smaller average end-to-end delay.