Efficient Clustering for Mobile Ad Hoc Network
Main Article Content
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, R., Gupta, R., & Motwani, M. (2010). Efficient Clustering for Mobile Ad Hoc Network. INFOCOMP Journal of Computer Science, 9(2), 49–56. Retrieved from https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/367
Section
Articles
Upon receipt of accepted manuscripts, authors will be invited to complete a copyright license to publish the paper. At least the corresponding author must send the copyright form signed for publication. It is a condition of publication that authors grant an exclusive licence to the the INFOCOMP Journal of Computer Science. This ensures that requests from third parties to reproduce articles are handled efficiently and consistently and will also allow the article to be as widely disseminated as possible. In assigning the copyright license, authors may use their own material in other publications and ensure that the INFOCOMP Journal of Computer Science is acknowledged as the original publication place.