IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v10y2014i4p457402.html
   My bibliography  Save this article

Intercluster Ant Colony Optimization Algorithm for Wireless Sensor Network in Dense Environment

Author

Listed:
  • Jung-Yoon Kim
  • Tripti Sharma
  • Brijesh Kumar
  • G. S. Tomar
  • Karan Berry
  • Won-Hyung Lee

Abstract

Wireless sensor networks have grown rapidly with the innovation in Information Technology. Sensor nodes are distributed and deployed over the area for gathering requisite information. Sensor nodes possess a negative characteristic of limited energy which pulls back the network from exploiting its peak capabilities. Hence, it is necessary to gather and transfer the information in an optimized way which reduces the energy dissipation. Ant Colony Optimization (ACO) is being widely used in optimizing the network routing protocols. Ant Based Routing can play a significant role in the enhancement of network life time. In this paper, Intercluster Ant Colony Optimization algorithm (IC-ACO) has been proposed that relies upon ACO algorithm for routing of data packets in the network and an attempt has been made to minimize the efforts wasted in transferring the redundant data sent by the sensors which lie in the close proximity of each other in a densely deployed network. The IC-ACO algorithm was studied by simulation for various network scenarios. The results depict the lead of IC-ACO as compared to LEACH protocol by indicating higher energy efficiency, prolonged network lifetime, enhanced stability period, and the elevated amount of data packets in a densely deployed wireless sensor network.

Suggested Citation

  • Jung-Yoon Kim & Tripti Sharma & Brijesh Kumar & G. S. Tomar & Karan Berry & Won-Hyung Lee, 2014. "Intercluster Ant Colony Optimization Algorithm for Wireless Sensor Network in Dense Environment," International Journal of Distributed Sensor Networks, , vol. 10(4), pages 457402-4574, April.
    • Handle: RePEc:sae:intdis:v:10:y:2014:i:4:p:457402
    DOI: 10.1155/2014/457402
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/457402
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/457402?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:10:y:2014:i:4:p:457402. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.