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

Energy-efficient clustering algorithm based on game theory for wireless sensor networks

Author

Listed:
  • Qingwei Liu
  • Mandan Liu

Abstract

Clustering is a popular method to achieve energy efficiency and scalable performance in large-scale sensor networks. Many clustering algorithms were proposed to use energy efficiently, extend network life span, and improve data transfer. Clustered routing for selfish sensors is a recently proposed algorithm based on game theory. In clustered routing for selfish sensors, the sensor nodes campaign to be cluster heads in order to achieve equilibrium probability. However, this algorithm needs global information for the computation of probability and disregard the uneven energy dissipation from different nodes that serve as cluster heads, thereby causing some nodes to die quickly. Therefore, an energy-efficient clustering algorithm based on game theory is proposed in this study. In the cluster head selection phase, each node competes as potential cluster head by joining a localized clustering game, and a potential cluster head is selected to be a real cluster head through a properly designed probability method. Simulation results show that the life span of wireless sensor networks extended by our algorithm becomes longer than those extended by low-energy adaptive clustering hierarchy and clustered routing for selfish sensors when proper parameters are used.

Suggested Citation

  • Qingwei Liu & Mandan Liu, 2017. "Energy-efficient clustering algorithm based on game theory for wireless sensor networks," International Journal of Distributed Sensor Networks, , vol. 13(11), pages 15501477177, November.
  • Handle: RePEc:sae:intdis:v:13:y:2017:i:11:p:1550147717743701
    DOI: 10.1177/1550147717743701
    as

    Download full text from publisher

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

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