跳至主導覽 跳至搜尋 跳過主要內容

Vote-based clustering algorithm in mobile ad hoc networks

  • Fei Li
  • , Shile Zhang
  • , Xin Wang
  • , Xiangyang Xue
  • , Hong Shen

研究成果: Chapter同行評審

20 引文 斯高帕斯(Scopus)

摘要

Unlike current clustering methods, the presented vote-based clustering (VC) algorithm uses not only node location and ID information, but also battery time information. In VC, each mobile host (MH) counts Hello messages from its neighbors. At the same time it calculates its own vote that is the weighted sum of the normalized number of valid neighbors and its normalized remaining battery time. The one with higher vote than its neighbors will be selected preferentially as a cluster head (CH). When the number of dominated MHs of a CH is more than a balance threshold, neither of new coming MHs will be permitted to participate in the current cluster. Analysis and simulation results show that VC method can improve cluster structure than Lowest ID (LID) algorithm and Highest Degree (HD) algorithm.

原文English
主出版物標題Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
編輯Hyun-Kook Kahng, Shigeki Goto
發行者Springer Verlag
頁面13-23
頁數11
ISBN(列印)3540230343
DOIs
出版狀態Published - 2004
對外發佈

出版系列

名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
3090
ISSN(列印)0302-9743
ISSN(電子)1611-3349

指紋

深入研究「Vote-based clustering algorithm in mobile ad hoc networks」主題。共同形成了獨特的指紋。

引用此