Vote-based clustering algorithm in mobile ad hoc networks

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

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

20 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsHyun-Kook Kahng, Shigeki Goto
PublisherSpringer Verlag
Pages13-23
Number of pages11
ISBN (Print)3540230343
DOIs
Publication statusPublished - 2004
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3090
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Vote-based clustering algorithm in mobile ad hoc networks'. Together they form a unique fingerprint.

Cite this