A Secure Cluster Formation Scheme in Wireless Sensor Networks
In wireless sensor networks, clustering expedites many desirable functions such as load balancing, energy savings, and distributed key management. For secure clustering, it is very important to find compromised nodes and remove them during the initial cluster formation process. If some nodes are com...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi - SAGE Publishing
2012-10-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2012/301750 |
| _version_ | 1797709172349861888 |
|---|---|
| author | Gicheol Wang Dongkyun Kim Gihwan Cho |
| author_facet | Gicheol Wang Dongkyun Kim Gihwan Cho |
| author_sort | Gicheol Wang |
| collection | DOAJ |
| description | In wireless sensor networks, clustering expedites many desirable functions such as load balancing, energy savings, and distributed key management. For secure clustering, it is very important to find compromised nodes and remove them during the initial cluster formation process. If some nodes are compromised and survive the censorship process, they can make some nodes have a different cluster view and can split a cluster into multiple clusters to deteriorate cluster quality as a whole. To resolve these problems, we propose a robust scheme against such attacks in this paper. First, our scheme generates large-sized clusters where any two nodes are at most two hops away from each other to raise the quality of clusters. Second, our scheme employs the verification of two-hop distant nodes to preserve the quality of the large-sized clusters and refrains from splitting the clusters. Last, our scheme prefers broadcast transmissions to save the energy of nodes. Security analysis proves that our scheme can identify compromised nodes and preserves the cluster membership agreement against the compromised nodes. In addition, simulation results prove that our scheme generates fewer clusters and is more secure and energy efficient than the scheme producing only small-sized clusters. |
| first_indexed | 2024-03-12T06:33:33Z |
| format | Article |
| id | doaj.art-e45f158c0c4d42e2898c838bced6825b |
| institution | Directory Open Access Journal |
| issn | 1550-1477 |
| language | English |
| last_indexed | 2024-03-12T06:33:33Z |
| publishDate | 2012-10-01 |
| publisher | Hindawi - SAGE Publishing |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj.art-e45f158c0c4d42e2898c838bced6825b2023-09-03T01:30:55ZengHindawi - SAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772012-10-01810.1155/2012/301750A Secure Cluster Formation Scheme in Wireless Sensor NetworksGicheol Wang0Dongkyun Kim1Gihwan Cho2 Department of Advanced KREONET Service, Korea Institute of Science and Technology Information, Daejeon 305-806, Republic of Korea Department of Advanced KREONET Service, Korea Institute of Science and Technology Information, Daejeon 305-806, Republic of Korea Division of Computer Engineering, Jeonbuk National University, Jeonju 561-756, Republic of KoreaIn wireless sensor networks, clustering expedites many desirable functions such as load balancing, energy savings, and distributed key management. For secure clustering, it is very important to find compromised nodes and remove them during the initial cluster formation process. If some nodes are compromised and survive the censorship process, they can make some nodes have a different cluster view and can split a cluster into multiple clusters to deteriorate cluster quality as a whole. To resolve these problems, we propose a robust scheme against such attacks in this paper. First, our scheme generates large-sized clusters where any two nodes are at most two hops away from each other to raise the quality of clusters. Second, our scheme employs the verification of two-hop distant nodes to preserve the quality of the large-sized clusters and refrains from splitting the clusters. Last, our scheme prefers broadcast transmissions to save the energy of nodes. Security analysis proves that our scheme can identify compromised nodes and preserves the cluster membership agreement against the compromised nodes. In addition, simulation results prove that our scheme generates fewer clusters and is more secure and energy efficient than the scheme producing only small-sized clusters.https://doi.org/10.1155/2012/301750 |
| spellingShingle | Gicheol Wang Dongkyun Kim Gihwan Cho A Secure Cluster Formation Scheme in Wireless Sensor Networks International Journal of Distributed Sensor Networks |
| title | A Secure Cluster Formation Scheme in Wireless Sensor Networks |
| title_full | A Secure Cluster Formation Scheme in Wireless Sensor Networks |
| title_fullStr | A Secure Cluster Formation Scheme in Wireless Sensor Networks |
| title_full_unstemmed | A Secure Cluster Formation Scheme in Wireless Sensor Networks |
| title_short | A Secure Cluster Formation Scheme in Wireless Sensor Networks |
| title_sort | secure cluster formation scheme in wireless sensor networks |
| url | https://doi.org/10.1155/2012/301750 |
| work_keys_str_mv | AT gicheolwang asecureclusterformationschemeinwirelesssensornetworks AT dongkyunkim asecureclusterformationschemeinwirelesssensornetworks AT gihwancho asecureclusterformationschemeinwirelesssensornetworks AT gicheolwang secureclusterformationschemeinwirelesssensornetworks AT dongkyunkim secureclusterformationschemeinwirelesssensornetworks AT gihwancho secureclusterformationschemeinwirelesssensornetworks |