Efficient Clustering for Mobile Ad Hoc Network

Main Article Content

Ratish Agarwal Roopam Gupta Mahesh Motwani

Abstract

This paper proposes a thechnique for election od nodes called clusterhead to cordinate the cluster activities. There are a number of algorithms for election of clusterhead; some of them consider only one specific property oof node such as node's id or degree for clusterhead selection. Some of the algorithms take in to account several performance factors such as node degree, mobility, and enegy requirement and battery power of nodes. However, the entire cluster based protocol and cluster  formation algorithm that have been proposed assume thet the wireless nodes are trustworthy. This assumption may naturally lead to the selection of a compromised or malicious node  to be the cluster head. Having a malicious cluster-head severely compromises the security and usability of the network. This paper proposes  a method which calculates the trustworthiness of a node and takes it as a performance factor while electing clusterhead.

Article Details

How to Cite
AGARWAL, Ratish; GUPTA, Roopam; MOTWANI, Mahesh. Efficient Clustering for Mobile Ad Hoc Network. INFOCOMP Journal of Computer Science, [S.l.], v. 9, n. 2, p. 49-56, jan. 2010. ISSN 1982-3363. Available at: <http://www.dcc.ufla.br/infocomp/index.php/INFOCOMP/article/view/367>. Date accessed: 16 june 2019.
Keywords
Ad Hoc Networks, Clusterhead, Dominating set, Mobility, Trust
Section
Articles