Mouse colony optimization and simulated annealing algorithm for energy balance routing in wireless sensor networks

Abstract

Purpose

The purpose of this paper is to search an energy balance routing in the wireless sensor networks (WSN) and lengthen the life of the networks.

Design/methodology/approach

To save energy in the WSN, some routing protocols search routing with the minimum total energy consumption of the network, and others reduce data redundancy by data aggregation. But if the distribution of energy consumption was not even, the energy of some nodes would be exhausted rapidly and thus the whole network would break down. Thus, an energy balance routing notion, including communication energy cost of the routing, remaining energy of communication sensors and sensor load have been involved. Then a new algorithm, mouse colony optimization and simulated annealing (SA), is advanced to solve the problem of energy balance routing in the network.

Findings

The energy balance routing, based on mouse colony optimization and SA, performs well and yields better performance than other congener algorithms.

Research limitations/implications

The appointed times of the algorithm is the main limitation which increase the complexity of the algorithm.

Practical implications

A very useful routing in wireless sensor networks.

Originality/value

The new approach of energy balance routing notion, including communication energy cost of the routing, remaining energy of communication sensors and sensor load. The new algorithm, mouse colony optimization algorithm, simulated mice action, was proposed to solve the energy balance routing of the network.

Citation

Liu, X., Cao, Y. and Chen, X. (2009), "Mouse colony optimization and simulated annealing algorithm for energy balance routing in wireless sensor networks", Kybernetes, Vol. 38 No. 3/4, pp. 406-416. https://doi.org/10.1108/03684920910944100