Data Aggregation and Routing in Wireless Sensor Networks Using Improved Ant Colony Algorithm

Abstract

A wireless sensor network consists of a large number of sensor nodes scattered in the region of the network which have limited energy and limited computational and sensing ability. Data aggregation is important in this kind of network which can make use of the energy of the sensor nodes efficiently, and reduce the traffic in network by utilizing the abilities of the nodes in local computation and storage. Ant colony algorithm is a paradigm for designing meta heuristic algorithm for combinatorial optimization problems. An improved ant colony algorithm is studied and applied it into data aggregation in wireless sensor network for a group of source nodes to send data to a single sink node. Moreover, Dijkstra algorithm is introduced in computing the hop counts for all the nodes to the sink node. Simulation has shown that the amounts of pheromone on the optimal path increase faster than others. At last, we can get the global optimal path.