文章基本信息

标题：REVIEW OF WEIGHTED CLUSTERING ALGORITHMS FOR MOBILE AD HOC NETWORKS
本地全文：下载
作者：Ratish Agarwal
期刊名称：Computer Sciences and Telecommunications
印刷版ISSN：1512-1232
出版年度：2012
卷号：33
期号：1
页码：71-78
出版社：Internet Academy
摘要：A research issue in design of ad hoc networks is deployment of dynamic routing protocols that can find routes effectively between communicating nodes. Clustering is a solution to limit the amount of information that propagates inside the network. The idea behind clustering to group the network nodes in to number of overlapping clusters and routes are recorded between clusters instead of nodes. Several algorithms have been proposed by researchers for formation of cluster and election of clusterhead. Most of these algorithms consider a performance factor for election of clusterhead; these performance factors may be identification number, connectivity, mobility, battery power etc. But considering only one performance factor for calculating quality of nodes as a clusterhead may results in degradation of performance of the network. Some work has been done in the area where a number of performance factors are used to find qualification of nodes as clusterheads. This paper presents a review of the clustering algorithms, in which different weights are given to different performance factors and clustering decisions are taken after calculating the combined weights of nodes.
关键词：Mobile ad hoc network; clustering; clusterhead; gateway; mobility; ; connectivity.