IDEAS home Printed from https://ideas.repec.org/a/igg/jsir00/v13y2022i2p1-19.html
   My bibliography  Save this article

A Voronoi-Ant Colony-Based Routing (VoR-Ant-R) Algorithm for WMSNs

Author

Listed:
  • Suseela S.

    (Periyar Maniammai Institute of Science and Technology, India)

  • Eswari R.

    (National Institute of Technology, Tiruchirappalli, India)

  • Nickolas Savarimuthu

    (National Institute of Technology, Tiruchirappalli, India)

Abstract

Wireless Multimedia Sensor Networks (WMSNs) have been used in many applications and powerful distributed systems. But the performance of WMSNs is suffering from the occurrence of energy holes. To improve the performance of the network and packet delivery ratio, a Voronoi-Ant colony based Routing (VoR-Ant-R) algorithm is proposed for WMSNs to discover the energy holes and finds the shortest path from the source to destination in the WMSNs even though faces some obstacles. The WMSNs are constructed using the Voronoi structure to bypass energy holes. After bypassing the energy hole in the path; an ACO is introduced to select a neighborhood node for data forwarding. This ACO constructs the shortest optimized path to enhance the performance of the WMSNs. The proposed work is experimentally compared with other algorithms such as IEEABR, EEABR, SC, and BEES. The simulation results show that VoR-Ant-R can increase energy efficiency, success rate, reduces energy consumption, and latency.

Suggested Citation

  • Suseela S. & Eswari R. & Nickolas Savarimuthu, 2022. "A Voronoi-Ant Colony-Based Routing (VoR-Ant-R) Algorithm for WMSNs," International Journal of Swarm Intelligence Research (IJSIR), IGI Global, vol. 13(2), pages 1-19, April.
    • Handle: RePEc:igg:jsir00:v:13:y:2022:i:2:p:1-19
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSIR.287546
    Download Restriction: no
    ---><---

    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:igg:jsir00:v:13:y:2022:i:2:p:1-19. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.