earticle

논문검색

Dynamic Entropy Based Combination Weighted Clustering Approach for High-Speed Ad hoc Network

초록

영어

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
  • Hui Zhou School of Electronics and Information Engineering, Lanzhou Jiaotong University

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.