Abstract

Energy saving is a major requirement in the design of routing algorithms to maximize the throughput and lifetime of wireless sensor networks. To address this requirement, this work proposes a routing algorithm based on a novel Reposition Particle Swarm Optimization (RPSO) algorithm and a new fitness function. The role of the RPSO algorithm is to salvage particles that may have fallen into local minima, if any. The algorithm is evaluated using three types of benchmark functions, namely unimodal, multimodal, and rotated multimodal. The evaluation results demonstrate that RPSO outperforms native Particle Swarm Optimization and Particle Swarm Optimization with Levy Flight in terms of convergence speed and global optimum identification. The proposed RPSO is then employed to develop an efficient routing algorithm. The routing algorithm is tested in terms network lifetime, number of dead sensor nodes, energy consumption, and number of packets delivered to base station, against four competitive Meta-Heuristic algorithms. The test results clearly indicate that the routing algorithm outperforms all the competitive algorithms for all the performance metrics. In particular, it achieves 14% to 29% higher network lifetime, 52% to 58% less dead sensor nodes, 61% to 70% less energy consumption, and 13% to 36% more throughput.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call