Power-saving Routing Based on Improved Ant Colony Algorithm for Ad Hoc Networks

被引：0

作者：

Shao, Han ^{[1
]}

Sun, Yan-Ge ^{[1
]}

机构：

[1] Xinyang Normal Univ, Dept Comp & Informat Technol, Xinyang, Henan, Peoples R China

来源：

2011 INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND MULTIMEDIA COMMUNICATION | 2011年

关键词：

Ad Hoc Networks; Ant Colony Algorithm; power-saving; Routing;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Due to limited power, so how to design an effective power saving routing protocol is an important issue in Ad Hoc networks. This paper proposes a power-saving Routing Based on Improved Ant Colony Algorithm for Ad Hoc Networks. The performance of IACA is approved by dynamically adjusting evaporation rate of pheromone and applying the global updating rule of the best path. The improved algorithm can find the global optimum at higher convergence speed. Moreover, it regards the remaining battery power and transmission power ratio as the objective function. Simulation results show the algorithmis can obviously save power and further prolong the lifetime of networks.

引用

页码：279 / 281

页数：3