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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Data-Aggregation Algorithm Based on Adaptive Ant Colony System in Wireless Sensor Networks


    Contributors:
    Li, Zhiyu (author) / Shi, Haoshan (author)


    Publication date :

    2008-05-01


    Size :

    511259 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Minimum Data Aggregation Schedule in Wireless Sensor Networks

    An, M.K. / Lam, N.X. / Huynh, D.T. et al. | British Library Online Contents | 2011


    Performance Analysis of Data Aggregation in Wireless Sensor Mesh Networks

    Liu, Haoying / Shen, Jian / Yuan, Xiaojing et al. | ASCE | 2008


    A novel adaptive cooperative location algorithm for wireless sensor networks

    Feng, W. J. / Bi, X. W. / Jiang, R. | British Library Online Contents | 2012


    Energy and distance adaptive clustering algorithm for 3D wireless sensor networks

    Jiang,N. / Guo,Y. / East China Jiatong Univ.,CN et al. | Automotive engineering | 2013