Lifetime Maximization in Heterogeneous Wireless Sensor Network Based on Metaheuristic Approach

Increasing the lifetime of heterogeneous wireless sensor network (WSN) and minimizing the run time using improved ACO is an important issue. The computational time is very important in case of such searching algorithms. In this methodology, maximum number of disjoints connected covers are found that fulfill coverage in network and connectivity of the network. A construction graph is designed in which each vertex denotes the a device in a subset. The ants find an optimal path on the construction graph which maximizes the number of connected covers based on pheromone and also heuristic information. The connected covers are built by the pheromone and it is used in the searching. The heuristic information satisfies the desirability of device assignment. The proposed metaheuristic approach is to maximize network lifetime and minimize the computational time for the searching process satisfying both sensing coverage and network connectivity.