本文结合蚁群算法的理论,提出了改进的能量有效路由算法(IEEABR),该算法在蚂蚁数据包结构、概率选择公式及信息素更新公式等方面做了改进.通过为前向蚂蚁与后向蚂蚁设计不同的报文结构提高了传输效率.概率选择过程中考虑邻居剩余能量的相对大小,能够避免蚂蚁选择能量较小的邻居作为下一跳,均衡了网络能量的消耗.让前向蚂蚁在路径搜索过程中释放信息素能够优化路径.同时,前向蚂蚁数据包中增加了节点的邻居地址表,能够有效的避免路由回路的发生.本文中使用NS2仿真工具对1EEABR协议进行了仿真,仿真结果表明该算法延长了网络寿命和提高了能量有效性.%In this paper,an improved energy-efficient ant-based routing algorithm(IEEABR) is proposed according to the theory of ant colony optimization. In the proposed algorithm, the improved aspects include ant packet structure, formulas of probability selection and 'pheromone updating. The data transmission efficiency is increased by designing different packet structures for forward ants and backward ants. In the procedure of probability selection, considering the residual energy of an ant's neighbor,it is impossible that the neighbor node with less residual energy is selected as its next hop node,which balances the energy cost of a network. The path optimization is performed in the new approach by making a forward ant release pheromone in the path search process which accelerates convergence process of the algorithm. At the same time, a list of neighbor nodes address is added into forward ant packets for reducing the occurrence probability of routing loops. A series of simulations for IEEABR are performed by using NS2. The simulation results show that the proposed algorithm can prolong the network lifetime,and reduce the average energy consumption effectively.
展开▼
