By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Wang Jinghua ; Dept. of Comput. Sci., Central China Normal Univ., Wuhan, China ; He Huan ; Chen Bo ; Chen Yuanyuan
more authors

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.

Published in:

Computer Science-Technology and Applications, 2009. IFCSTA '09. International Forum on  (Volume:3 )

Date of Conference:

25-27 Dec. 2009