基于蚁群的Ad Hoc网络分簇路由算法

Cluster Routing Algorithms for Ad Hoc Network Based on Ant Colony

无线Ad Hoc网络是一个多跳、临时性的对等移动自治系统,它由一组带有无线收发装置的移动节点组成。而路由协议是Ad Hoc网络体系结构中不可或缺的重要组成部分,因此路由协议的研究成为当前Ad Hoc网络研究的重点。针对Ad Hoc网络节点能量有限的特性,提出了一种基于分簇及蚁群的组合路由算法(CRBAC)。给出了分簇策略下的簇内簇间路由机制,簇内采用按需路由策略,将改进的蚁群算法应用到簇内路由机制中,通过扩散信息素选择能量高的邻节点均衡网络节点能量,而簇间采用尽可能简单的表驱动路由策略。仿真结果表明,该算法是合理的,不仅有效地减少了端到端时延,而且提高了网络的生存时间。

Wireless Ad Hoc network is a multi-hop, temporary and peer mobile autonomous system, which is composed of a group of mobile nodes with wireless interfaces. Routing protocol is a indispensable and important component of Ad Hoc network architecture,so the routing protocol of Ad Hoc network becomes the current research focus. According to the Ad Hoc network nodes with limited energy of the chamcteristics,a routing algorithm based on clustering and ant colony algorithm was proposed namely CRBAC （ Cluster Routing Based on Ant Colony ）. It gives the routing mechanism in and between clusters; Improved ant colony algorithm is applied to routing mechanism in cluster, through the diffusion of the pheromone to avoid low energy adjacent nodes. On-demand routing strategies are used in cluster, and simple table driven routing strategies are used between clusters. The simulations results show that this algorithm is reasonable, not only effectively reduce the end-to-end delay, but also improve the network life time.