Energy Efficient Routing with a Tree-Based Particle Swarm Optimization Approach

摘要

In contemporary, the energy waste caused by an un-optimized design of network consumed a large part of limited resource. Reduction of unnecessary energy consumption in wired networks has attracted the public's attention. To save energy without affecting performance, many existing studies classified the problem as Mixed Integer Linear Programming problem, which is NP-complete. Following this idea, we propose a novel energy efficient routing algorithm with tree-based particle swarm optimization (EERTPSO) to get a solution covering all the idle-period communication nodes and minimize the number of nodes or links, considering the constraints of bandwidth, delay and link cost, in order to awake the necessary nodes meanwhile get the idles to sleep. By the above sleep-awake mechanism, algorithm obtains an accepted result satisfied the quality of service requirement. Simulation and analytical results show that our algorithm performs efficiently and effectively.