Skip to content
naulon
Not checkedNot checked for notices yet.

State-of-the-Art Clustering Schemes in Mobile Ad Hoc Networks: Objectives, Challenges, and Future Directions

Masood Ahmad, Abdul Hameed, Ataul Aziz Ikram and 1 more

IEEE Access · 2019

doi:10.1109/access.2018.2885120 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Mobile ad hoc networks (MANETs) are self-organized networks without any fixed infrastructure. The topology changes are very frequent in MANETs due to nodes' mobility. The topology maintenance creates an extra overhead, as the mobility information of a single node is shared with all nodes in the network. To address the topology maintenance overhead problem in MANETs, the researchers proposed different cluster-based algorithms to reduce the size of a routing table. The clusters are formed to locally adjust the topology changes within the cluster. If a node wants to communicate with a node outside the cluster, it only communicates with its cluster head (CH). The CH communicates with other CHs to transmit data toward the destination. To efficiently utilize the clustering mechanism in MANETs, stable and balanced clusters are required. To form good quality and optimized clusters, some metrics, such as relative mobility (node speed and direction), node degree, residual energy, communication workload, and neighbor's behavior, are required. In this paper, we present a comprehensive survey of recent CAs in MANETs. We also present the objectives, goals, and contributions of recent research. Similarly, the findings, challenges, and future directions are stated. The validation of each proposed work is analyzed critically in terms of the mobility model, the simulation tool used during simulation, simulation metrics, and the performance metrics used in the validation process.

Abstract licence: CC BY-NC-ND

References96

    40 more references, whose wording the paper’s licence keeps private.

    All 96 references

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.