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

Honey bee algorithm–based efficient cluster formation and optimization scheme in mobile ad hoc networks

Author

Listed:
  • Masood Ahmad
  • Ataul Aziz Ikram
  • Rabo Lela
  • Ishtiaq Wahid
  • Riaz Ulla

Abstract

In mobile ad hoc networks, topology changes very frequently due to node’s mobility. Frequent change in topology increases traffic signaling that may arise energy and scalability issue. Cluster-based routing is the energy-efficient technique in mobile ad hoc networks to address the scalability issue and to minimize control messages. In this article, honey bee algorithm is used for dividing the mobile ad hoc network nodes into different clusters. The bees work to gather in groups to perform their activities. The proposed honey bee algorithm–based clustering forms clusters in an efficient manner with fewer resources such as energy and bandwidth utilization. A node is selected as cluster head based on node degree, neighbor’s behavior, mobility direction, mobility speed, and remaining energy. Due to the efficient nature of bees and maximum parameter’s consideration, the proposed technique inspired from the foraging behavior of honey bees gives efficient and stable cluster formation. The control message overhead is also avoided. The work is validated mathematically, and simulation has been performed for different scenarios. Simulation results are compared with existing clustering schemes. The simulation results show that the honey bee algorithm–based clustering technique used for clustering outperforms the existing schemes under consideration.

Suggested Citation

  • Masood Ahmad & Ataul Aziz Ikram & Rabo Lela & Ishtiaq Wahid & Riaz Ulla, 2017. "Honey bee algorithm–based efficient cluster formation and optimization scheme in mobile ad hoc networks," International Journal of Distributed Sensor Networks, , vol. 13(6), pages 15501477177, June.
  • Handle: RePEc:sae:intdis:v:13:y:2017:i:6:p:1550147717716815
    DOI: 10.1177/1550147717716815
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147717716815
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147717716815?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:6:p:1550147717716815. 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.