Earticle

초록

영어

In hierarchical structures determined by traditional routing protocols of wireless sensor networks, clustering is not structured and the networks prone to generate scatters, leading to some nodes die quickly. So this paper presents a cluster head preferred hierarchical clustering routing protocol based on G-Means (GHPHC). It uses G-Means algorithm to detect each clustering structure, so that each cluster is Gaussian distribution and it avoids the generation of scatters. At the same time, the cluster head preferred algorithm proposed in this paper gives the corresponding weight for each node of all clusters, thus select a suitable cluster head node for every cluster. Experimental results show that compared to traditional routing protocols, the death rate of nodes in a wireless sensor network which uses GHPHC protocol is more slow, and has a longer life cycle.

목차

Abstract
 1. Introduction
 2. Prior Knowledge
  2.1. Network Topology
  2.2. LEACH based on the "Round" Thinking
  2.3. Gaussian Distribution Test Algorithm: Gaussian(X)
  2.4. G-Means Clustering Algorithm
 3. GHPHC Algorithm
  3.1. Use G-Means to Get Network Clustering
  3.2. Determine Cluster Heads by Cluster Head Preferred Algorithm
 4. Algorithm Simulation
 5. Conclusions
 References

키워드

저자

• Tianshu Wang [ Department of Computer Science and Engineering, Nanjing University of Science and Technology, China ]
• Gongxuan Zhang [ Department of Computer Science and Engineering, Nanjing University of Science and Technology, China ]
• Xichen Yang [ Department of Computer Science and Engineering, Nanjing University of Science and Technology, China ]
• Yang Lv [ Department of Computer Science and Engineering, Nanjing University of Science and Technology, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605