An Entropy-based Weighted Clustering Algorithm and Its Optimization for Ad hoc Networks

被引:0
作者
Wang, Yu-Xuan [1 ]
Bao, Forrest Sheng [2 ]
机构
[1] Nanjing Univ Posts & Telecommun, Sch Commun & Informat Engn, Nanjing, Peoples R China
[2] Texas Tech Univ, Dept Comp Sci, Lubbock, TX 79409 USA
来源
THIRD IEEE INTERNATIONAL CONFERENCE ON WIRELESS AND MOBILE COMPUTING, NETWORKING AND COMMUNICATIONS - WIMOB 2007 | 2007年
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
As a newly-proposed weighing-based clustering algorithm, WCA has improved performance compared with other previous clustering algorithms. But the high mobility of nodes will lead to high frequency of reaffiliation which will increase the network overhead. To solve this problem, we propose an entropy-based WCA (EWCA) which can enhance the stability of the network. Meanwhile, in order better to facilitate the optimal operation of the MAC protocol and to further stabilize the network structure, this paper applies tabu search onto EWCA to choose a near optimal dominant set. Consequently, less clusterheads are required to manage the network. Simulation study indicates that the revised algorithm (EWCA-TS) has improved performance with respect to the original WCA, especially on the number of clusters and the reaffiliation frequency.
引用
收藏
页数:6
相关论文
共 19 条
  • [1] An B., 2002, IEEE COMMUNICATIONS, V6
  • [2] [Anonymous], P SBT IEEE INT TEL S
  • [3] [Anonymous], P INT S PAR ARCH ALG
  • [4] [Anonymous], CLUSTER COMPUTING
  • [5] [Anonymous], WIRELESS NETWORKS
  • [6] [Anonymous], P 2 INT C DISTR COMP
  • [7] [Anonymous], P VEH TECHN C
  • [8] Arostegui M. A., 2006, INT J PRODUCTION EC, V103
  • [9] Baker D., 1981, IEEE T COMMUNICATION, V29
  • [10] Basagni S., 1997, P WORKSH ALG ASP COM