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

Energy optimization of ant colony algorithm in wireless sensor network

Author

Listed:
  • Peng Li
  • Huqing Nie
  • Lingfeng Qiu
  • Ruchuan Wang

Abstract

An energy consumption optimization algorithm based on ant colony algorithm is proposed for wireless sensor network. The proposed algorithm allows each node in wireless sensor network to save the distance and residual energy of neighbor nodes. Furthermore, in terms of probability selection of the nodes and the pheromone update, this algorithm focuses on the next hop node through the comparison of distance between the nodes and the residual energy, which ensures less possibility of nodes with low energy selected as the next hop. Therefore, the proposed algorithm improves energy load balancing, stability of wireless sensor network and, eventually, extends the life span of the wireless sensor network. The simulation results show that the improved ant colony algorithm avoids too much energy consumption of a certain local node resulting in more uniform energy consumption for each node.

Suggested Citation

  • Peng Li & Huqing Nie & Lingfeng Qiu & Ruchuan Wang, 2017. "Energy optimization of ant colony algorithm in wireless sensor network," International Journal of Distributed Sensor Networks, , vol. 13(4), pages 15501477177, April.
    • Handle: RePEc:sae:intdis:v:13:y:2017:i:4:p:1550147717704831
    DOI: 10.1177/1550147717704831
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147717704831
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147717704831?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
    ---><---

    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:13:y:2017:i:4:p:1550147717704831. 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.