Skip to content
naulon
Not checkedNot checked for notices yet.

An Energy-Efficient Clustering Algorithm Combined Game Theory and Dual-Cluster-Head Mechanism for WSNs

Deyu Lin, Quan Wang

IEEE Access · 2019

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

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

Abstract

A novel energy-efficient clustering algorithm was proposed which aimed at improving the energy efficiency of WSNs via reducing and balancing energy consumption in this paper. The lemma concerning the dual-cluster-head mechanism which was designed to reduce the energy overhead during the process of rotation of Cluster Heads (CHs) was proposed and proven at first. In addition, a non-cooperative game model was presented with the purpose of balancing the energy consumption among the Cluster Heads. Besides, the Nash Equilibrium Point (NEP) of the game model was presented and the corresponding proof was provided. Subsequently, the Energy-efficient Clustering algorithm combined Game theory and Dual-cluster-head (ECGD) mechanism was detailed, which took the energy efficiency in both of the intra-cluster and inter-cluster communication into consideration. Finally, extensive experiments were conducted via simulation and the simulation results were compared with the existing Clustering strategies in terms of energy efficiency and network performance. The analyses of results have shown that the ECGD can improve energy efficiency and extend the network lifespan effectively.

Abstract licence: CC BY-NC-ND

References51

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

    All 51 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.