• DocumentCode
    2458268
  • Title

    An Improved Ant-Based Algorithm for Data Aggregation in Wireless Sensor Networks

  • Author

    Wang, HongPeng ; Luo, Neng

  • Author_Institution
    Dept. of Comput. Sci., Harbin Inst. of Technol., Shenzhen, China
  • Volume
    3
  • fYear
    2010
  • fDate
    12-14 April 2010
  • Firstpage
    239
  • Lastpage
    243
  • Abstract
    Data aggregation is an important issue in wireless sensor networks which gathers and routes information through a multi-hop network and processes data at intermediate nodes. This paper considers how to construct data aggregation tree in wireless sensor network where there are several source nodes and a single sink. Ant Colony Optimization algorithm is an effective distributed approach. It has been applied to the design of data-centric routing algorithm and got many achievements, but still have some shortcomings. To overcome the flaws of current ant-based data-centric routing algorithms, we proposed an improved algorithm to provide the least nodes involved in data transmission and get aggregation nodes as much as possible. The simulation results in TOSSIM show that the proposed algorithm reduces routing overhead, transmitting overhead and average delay greatly.
  • Keywords
    optimisation; telecommunication network routing; trees (mathematics); wireless sensor networks; TOSSIM; ant colony optimization algorithm; ant-based data-centric routing algorithm; data aggregation tree; data transmission; distributed approach; multihop network; wireless sensor networks; Ant colony optimization; Computer networks; Computer science; Costs; Military computing; Mobile communication; Protocols; Robustness; Routing; Wireless sensor networks; Colony Optimization algorithm; data aggregation; routing algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications and Mobile Computing (CMC), 2010 International Conference on
  • Conference_Location
    Shenzhen
  • Print_ISBN
    978-1-4244-6327-5
  • Electronic_ISBN
    978-1-4244-6328-2
  • Type

    conf

  • DOI
    10.1109/CMC.2010.183
  • Filename
    5471567