The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Em redes de sensores agrupadas, como os CHs (Cluster Heads) são os pontos de coleta de dados, é provável que sejam alvos de comprometimento dos invasores. Portanto, eles precisam ser alterados através de um esquema eleitoral de CH com a maior frequência possível. Além disso, como os nós comprometidos devem tentar se tornar um CH, um esquema de eleição de CH deve impedir que eles se tornem um CH. Este artigo apresenta um esquema de eleição CH seguro para redes de sensores agrupados, que altera os nós de função CH de forma segura, excluindo os nós comprometidos dos candidatos CH. No esquema proposto, cada nó dá notas para o comportamento de todos os outros nós na mesma região de eleição CH e troca a lista de marcas com eles. Em seguida, cada nó calcula as notas médias de todos os nós da região, e os nós cuja nota média é inferior a um limite específico são excluídos dos candidatos CH. Um CH é eleito entre os restantes candidatos. Os resultados da simulação mostram que nosso esquema oferece forte resiliência contra o mau comportamento de nós comprometidos e reduz o consumo de energia dos nós. Outros resultados de simulação mostram que nosso esquema funciona bem em ambientes onde alguns pacotes são frequentemente perdidos.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Gicheol WANG, Gihwan CHO, "Secure Cluster Head Election Using Mark Based Exclusion in Wireless Sensor Networks" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 11, pp. 2925-2935, November 2010, doi: 10.1587/transcom.E93.B.2925.
Abstract: In clustered sensor networks, because CHs (Cluster Heads) are the collection points of data, they are likely to be compromise targets of attackers. So, they need to be changed through a CH election scheme as frequently as possible. Besides, because the compromised nodes must try to become a CH, a CH election scheme should prevent them from being a CH. This paper presents a secure CH election scheme for clustered sensor networks, which changes the CH role nodes securely by excluding the compromised nodes from CH candidates. In the proposed scheme, each node gives marks for behavior of all other nodes in the same CH election region and exchanges the mark list with them. Then, each node computes the average marks for all nodes in the region, and nodes whose average mark is less than a specific threshold are excluded from CH candidates. A CH is elected among the remaining candidates. Simulation results show that our scheme provides strong resilience against misbehavior of compromised nodes and reduces energy consumption of nodes. Another simulation results show that our scheme well operates in the environment where some packets are often lost.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.2925/_p
Copiar
@ARTICLE{e93-b_11_2925,
author={Gicheol WANG, Gihwan CHO, },
journal={IEICE TRANSACTIONS on Communications},
title={Secure Cluster Head Election Using Mark Based Exclusion in Wireless Sensor Networks},
year={2010},
volume={E93-B},
number={11},
pages={2925-2935},
abstract={In clustered sensor networks, because CHs (Cluster Heads) are the collection points of data, they are likely to be compromise targets of attackers. So, they need to be changed through a CH election scheme as frequently as possible. Besides, because the compromised nodes must try to become a CH, a CH election scheme should prevent them from being a CH. This paper presents a secure CH election scheme for clustered sensor networks, which changes the CH role nodes securely by excluding the compromised nodes from CH candidates. In the proposed scheme, each node gives marks for behavior of all other nodes in the same CH election region and exchanges the mark list with them. Then, each node computes the average marks for all nodes in the region, and nodes whose average mark is less than a specific threshold are excluded from CH candidates. A CH is elected among the remaining candidates. Simulation results show that our scheme provides strong resilience against misbehavior of compromised nodes and reduces energy consumption of nodes. Another simulation results show that our scheme well operates in the environment where some packets are often lost.},
keywords={},
doi={10.1587/transcom.E93.B.2925},
ISSN={1745-1345},
month={November},}
Copiar
TY - JOUR
TI - Secure Cluster Head Election Using Mark Based Exclusion in Wireless Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2925
EP - 2935
AU - Gicheol WANG
AU - Gihwan CHO
PY - 2010
DO - 10.1587/transcom.E93.B.2925
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2010
AB - In clustered sensor networks, because CHs (Cluster Heads) are the collection points of data, they are likely to be compromise targets of attackers. So, they need to be changed through a CH election scheme as frequently as possible. Besides, because the compromised nodes must try to become a CH, a CH election scheme should prevent them from being a CH. This paper presents a secure CH election scheme for clustered sensor networks, which changes the CH role nodes securely by excluding the compromised nodes from CH candidates. In the proposed scheme, each node gives marks for behavior of all other nodes in the same CH election region and exchanges the mark list with them. Then, each node computes the average marks for all nodes in the region, and nodes whose average mark is less than a specific threshold are excluded from CH candidates. A CH is elected among the remaining candidates. Simulation results show that our scheme provides strong resilience against misbehavior of compromised nodes and reduces energy consumption of nodes. Another simulation results show that our scheme well operates in the environment where some packets are often lost.
ER -