摘要
针对无线传感器网络资源受限、能量约束问题,提出了ESRAC算法.该算法综合PEGASIS算法及蚁群算法的优点,考虑到全网的能量消耗,将能量因子加入到概率选择模型和信息素更新机制中,构造最短路由.并且利用混沌扰动,使蚁群算法跳离局部最优解,避免路由过程中的热点问题.仿真实验表明该算法更好地节约了全网能量,延长了网络的生命周期.
As the limitation of resources of wireless sensor networks, an adaptive energy-saving routing oriented ant mechanism is proposed which synthesizes the concept of ACO and PEGASIS protocol. In the algorithm, it uses the probability model which adds the energy factor to construct the shortest route by taking account of the energy consumption of the whole network. In addition, it uses chaotic disturbance to jump off a local optimal solution and avoid the hot spots in the routing process. Simulation results show that it can save the energy and prolong the life cycle of the whole network better.
出处
《微电子学与计算机》
CSCD
北大核心
2012年第8期15-18,共4页
Microelectronics & Computer
基金
国家自然科学基金(60876077)
