REputation based Clustering Algorithm for security management in ad hoc networks with liars
by Mohamed Elhoucine Elhdhili, Lamia Ben Azzouz, Farouk Kamoun
International Journal of Information and Computer Security (IJICS), Vol. 3, No. 3/4, 2009

Abstract: Clustering in ad hoc networks consists of dividing the network into clusters managed by clusterheads. This technique has been used for different goals. However, as far as we know, no existing clustering algorithms have considered the existence of malicious nodes for clusterheads election and maintenance. Consequently, we propose a REputation based Clustering Algorithm (RECA) that aims to elect trustworthy, stable and high energy clusterheads that can be used to manage the security of the network. Simulation results have shown that RECA converges to a stable and convenient network division into clusters with no untrustworthy clusterheads and mainly one hop members.

Online publication date: Mon, 18-Jan-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Computer Security (IJICS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com