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

A Faster Convergence Artificial Bee Colony Algorithm in Sensor Deployment for Wireless Sensor Networks

Author

Listed:
  • Xiangyu Yu
  • Jiaxin Zhang
  • Jiaru Fan
  • Tao Zhang

Abstract

In wireless sensor networks (WSN), sensor deployment is one of the main topics for enhancing the sensor's coverage rate. In this paper, by modifying updating equation of onlooker bee and scout bee of original artificial bee colony (ABC) algorithm, a sensor deployment algorithm based on the modified ABC algorithm is proposed. Some new parameters such as forgetting and neighbor factor for accelerating the convergence speed and probability of mutant for maximizing the coverage rate are introduced. Simulation results showed that comparing with the deployment method based on original ABC and particle swarm optimization (PSO) algorithm, the proposed approach can achieve a better performance in coverage rate and convergence speed while needing a less total moving distance of sensors.

Suggested Citation

  • Xiangyu Yu & Jiaxin Zhang & Jiaru Fan & Tao Zhang, 2013. "A Faster Convergence Artificial Bee Colony Algorithm in Sensor Deployment for Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(10), pages 497264-4972, October.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:10:p:497264
    DOI: 10.1155/2013/497264
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/497264
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/497264?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:9:y:2013:i:10:p:497264. 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.