In this paper, we propose an improved hierarchical routing scheme based on game theory, in which the sensor network is divided into two layers for a hierarchical architecture, routing within and between clusters. Within the clusters, a cluster head (CH) is selected by the game theory and one-hop communication is used from general nodes to the CH; between clusters, a data package is forwarded by the shortest-path algorithm to the base station. The most important features of the proposed scheme include its adaptability, efficiency, and reliability. The simulation results prove that this scheme can effectively prolong the life of a network and offer well-balanced network performance.
CITATION STYLE
Han, W. Q., Wu, H. B., & Lu, Z. J. (2015). Improved hierarchical routing scheme based on game theory in wireless sensor networks. In Lecture Notes in Electrical Engineering (Vol. 355, pp. 1103–1111). Springer Verlag. https://doi.org/10.1007/978-3-319-11104-9_127
Mendeley helps you to discover research relevant for your work.