Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
