Increasing The Life Time of Hetrogenous WSN Through ACO-MNCC
Increasing the life time of heterogeneous Wireless Sensor Network (WSN) and minimizing the run time of the ACO-MNCC by using implicit parallelism. The computational time is very important for these searching algorithms. In this methodology, finding the maximum number of disjoints connected covers that satisfy both sensing coverage and network connectivity. A construction graph is designed with each vertex denoting the assignment of a device in a subset. Based on pheromone and heuristic information, the ants seek an optimal path on the construction graph to maximize the number of connected covers. The connected covers are building by the pheromone and it serves as metaphor for the searching. The heuristic information is used for the desirability of device assignment.