Efficient Clustering for Mobile Ad Hoc Network
Autor(a) principal: | |
---|---|
Data de Publicação: | 2010 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | INFOCOMP: Jornal de Ciência da Computação |
Texto Completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/367 |
Resumo: | 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. |
id |
UFLA-5_7287ac6f23145edb75110e46177d34d0 |
---|---|
oai_identifier_str |
oai:infocomp.dcc.ufla.br:article/367 |
network_acronym_str |
UFLA-5 |
network_name_str |
INFOCOMP: Jornal de Ciência da Computação |
repository_id_str |
|
spelling |
Efficient Clustering for Mobile Ad Hoc NetworkAd Hoc NetworksClusterheadDominating setMobilityTrustThis 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.Editora da UFLA2010-01-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/367INFOCOMP Journal of Computer Science; Vol. 9 No. 2 (2010): June, 2010; 49-561982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/367/351Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessAgarwal, RatishGupta, RoopamMotwani, Mahesh2015-07-29T11:42:20Zoai:infocomp.dcc.ufla.br:article/367Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:34.712965INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true |
dc.title.none.fl_str_mv |
Efficient Clustering for Mobile Ad Hoc Network |
title |
Efficient Clustering for Mobile Ad Hoc Network |
spellingShingle |
Efficient Clustering for Mobile Ad Hoc Network Agarwal, Ratish Ad Hoc Networks Clusterhead Dominating set Mobility Trust |
title_short |
Efficient Clustering for Mobile Ad Hoc Network |
title_full |
Efficient Clustering for Mobile Ad Hoc Network |
title_fullStr |
Efficient Clustering for Mobile Ad Hoc Network |
title_full_unstemmed |
Efficient Clustering for Mobile Ad Hoc Network |
title_sort |
Efficient Clustering for Mobile Ad Hoc Network |
author |
Agarwal, Ratish |
author_facet |
Agarwal, Ratish Gupta, Roopam Motwani, Mahesh |
author_role |
author |
author2 |
Gupta, Roopam Motwani, Mahesh |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Agarwal, Ratish Gupta, Roopam Motwani, Mahesh |
dc.subject.por.fl_str_mv |
Ad Hoc Networks Clusterhead Dominating set Mobility Trust |
topic |
Ad Hoc Networks Clusterhead Dominating set Mobility Trust |
description |
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. |
publishDate |
2010 |
dc.date.none.fl_str_mv |
2010-01-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/367 |
url |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/367 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/367/351 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Editora da UFLA |
publisher.none.fl_str_mv |
Editora da UFLA |
dc.source.none.fl_str_mv |
INFOCOMP Journal of Computer Science; Vol. 9 No. 2 (2010): June, 2010; 49-56 1982-3363 1807-4545 reponame:INFOCOMP: Jornal de Ciência da Computação instname:Universidade Federal de Lavras (UFLA) instacron:UFLA |
instname_str |
Universidade Federal de Lavras (UFLA) |
instacron_str |
UFLA |
institution |
UFLA |
reponame_str |
INFOCOMP: Jornal de Ciência da Computação |
collection |
INFOCOMP: Jornal de Ciência da Computação |
repository.name.fl_str_mv |
INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA) |
repository.mail.fl_str_mv |
infocomp@dcc.ufla.br||apfreire@dcc.ufla.br |
_version_ |
1799874741423570944 |