Data aggregation is an essential paradigm for energy efficient routing in energy constraint wireless sensor networks (WSN). Data aggregation in WSN can be treated as searching for the Minimum Steiner Tree (MST) including source nodes and sink node. In this paper, we propose a Data-aggregation Algorithm based on Adaptive Ant Colony System (AACS) algorithm. In this algorithm, Directed Diffusion (DD) is used to deliver interest message, and AACS algorithm is used to construct MST. The data sent by the source nodes is transmitted to the constructed MST and then is retransmitted to the sink node after aggregation. Compared with Destination Driven Shortest Path (DDSP) algorithm, NS2 simulation result shows that this algorithm can help reduce network energy consumption and prolong the life span of the network.
A Data-Aggregation Algorithm Based on Adaptive Ant Colony System in Wireless Sensor Networks
2008 Congress on Image and Signal Processing ; 4 ; 449-453
2008-05-01
511259 byte
Conference paper
Electronic Resource
English
Minimum Data Aggregation Schedule in Wireless Sensor Networks
British Library Online Contents | 2011
|A novel adaptive cooperative location algorithm for wireless sensor networks
British Library Online Contents | 2012
|Energy and distance adaptive clustering algorithm for 3D wireless sensor networks
Automotive engineering | 2013
|