Research on energy-efficient inter-cluster routing algorithm based on non-cooperative game
CSTR:
Author:
Affiliation:

(School of Computer Science and Technology, Xidian University, Xi’an 710071, China)

Clc Number:

TP393

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Detailed research focusing on the inter-cluster routing for wireless sensor networks (WSNs) is given first. The energy consumption imbalance problem and its cause are presented through a simple example. The paper points out the fact via an example that, the selfish of each cluster head leads to the imbalanced distribution of data flow and the data distribution imbalance then results in energy consumption imbalance. Subsequently, the non-cooperative game model aiming at regulating the behavior of the cluster heads is proposed. The Nash Equilibrium Point (NEP) of the game model is then obtained and proved. According to this game model, an energy-efficient Inter-cluster Routing algorithm based on Non-cooperative Game (EIRNG) is presented, which is the key contribution of the paper. Finally, extensive simulation experiments are conducted and the horizontal and vertical contrast in terms of energy efficiency and network performance are also made. The results show that the cluster heads tend to dissipate energy evenly via determining the optimal amount of the traffic based on a balance factor θi. Compared with the classic clustering routing PEGASIS and the authors' former work EEREG, the network lifespan can be extended by 74.1% and 8.6% respectively. Therefore, the proposed EIRNG can improve the energy efficiency and the network performance of the network effectively.

    Reference
    Related
    Cited by
Get Citation
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 15,2016
  • Revised:
  • Adopted:
  • Online: November 06,2017
  • Published:
Article QR Code