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

An Energy-Efficient Clustering Routing Protocol Based on Evolutionary Game Theory in Wireless Sensor Networks

Author

Listed:
  • Deyu Lin
  • Quan Wang
  • Deqin Lin
  • Yong Deng

Abstract

The features that sensor nodes are powered by battery and have severe energy constraint make the design of energy-efficient protocol a key task for wireless sensor networks (WSNs). Clustering protocols significantly cut down the energy expenditure of each sensor node. However, hot spots problem occurs in locations close to the sink. Besides, it makes things worse if the nodes with less energy are selected as cluster heads (CHs), because they are often loaded heavier traffic than cluster members (CMs) due to their duty. The issues which exist in WSNs are proposed and the primary reason why cluster head election is hard to control is then presented. A mathematical model aiming to ease the hot spots problem via optimizing the cluster size is proposed and an optimal cluster size (OCS) algorithm is given firstly. Subsequently, an evolutionary game model for the sensor nodes to terminate the anarchism during the process of cluster head selection is presented, and a novel routing protocol named Energy Efficient Routing protocol based on Evolutionary Game (EEREG) theory is proposed. Finally, extensive simulation experiments and performance comparisons with the well-known hierarchical routing protocols are conducted. The experiment results show that a significant improvement in energy efficiency as well as lifetime extension is achieved.

Suggested Citation

  • Deyu Lin & Quan Wang & Deqin Lin & Yong Deng, 2015. "An Energy-Efficient Clustering Routing Protocol Based on Evolutionary Game Theory in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 11(11), pages 409503-4095, November.
    • Handle: RePEc:sae:intdis:v:11:y:2015:i:11:p:409503
    DOI: 10.1155/2015/409503
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/409503
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/409503?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
    ---><---

    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:sae:intdis:v:11:y:2015:i:11:p:409503. 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.