Earticle

초록

영어

Weight based clustering has become the mainstream clustering algorithm in low-speed Ad hoc networks because of its excellent cluster stability. However, due to the dynamic topology changing in high-speed Ad hoc network, the cluster stability (network stability) decreased and the cluster maintenance costs increased sharply. To solve the problem, we propose a dynamic entropy based combination weighted clustering approach (DECW). First, according to the history messages of an evaluation node in the network, the upper bound and the lower bound value of each clustering index will be recorded, so the information entropy deviation of the indexes and dynamic entropy weight of each node can be obtained. After, the linear combination weights set of evaluation nodes is modeled as the second-order norm game , and the weight vector deviation is minimized as the optimization goal to get the multi-node dynamic entropy weights. In the cluster maintenance, a new Monte Carlo optimization is proposed to avoid the frequent cluster-heads (CHs) replacement induced of high node mobility of. Simulation results reveal that the proposed approach has the better adaptability in high-speed mobile environment.

목차

Abstract
 1. Introduction
 2. Dynamic Entropy Based Combination Weighted Clustering
  2.1 Clustering Indexes
  2.2 CH Election
  2.3 Cluster Maintenance
 3. Performance Evaluations
 4. Conclusions
 References

키워드

저자

• Jianli Xie [ School of Electronics and Information Engineering, Lanzhou Jiaotong University ]
• Cuiran Li [ School of Electronics and Information Engineering, Lanzhou Jiaotong University ] Corresponding Author
• Hui Zhou [ School of Electronics and Information Engineering, Lanzhou Jiaotong University ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605