| Autor: |
Han, Young-Ju, Park, Min-Woo, Chung, Tai-Myoung |
| Zdroj: |
Computational Science & Its Applications - Iccsa 2010 (9783642121784); 2010, p142-157, 16p |
| Abstrakt: |
Clustering scheme enabling the efficient utilization of the limited energy resources of the deployed sensor nodes can effectively prolong lifetime of wireless sensor networks. Like most of the protocols for wireless sensor networks, a clustering scheme is vulnerable to a number of security attacks. Especially, attacks involving cluster-heads are the most damaging since cluster-based schemes rely on their cluster-heads for routing and data aggregation. Several studies have proposed a secure clustering scheme and a resilient cluster leader election protocol in wireless sensor networks. However, most of resilient clustering schemes do not support dynamic clustering and most of secure clustering schemes are not robust and resilient against node(specially, cluster-heads) capture. In this paper, we present a secure and resilient clustering protocol on the basis of dynamic clustering protocol. Our scheme provides both a secure clustering and a resilient cluster-head election preserving dynamic clustering unlike the existing secure clustering schemes. In addition, our scheme provides data privacy through the concealed data aggregation. The analysis shows that our scheme offers the security services against both an inside attack and an outside attack while having the little memory, computation and communication overheads. The comparison with related works shows that our scheme has a great improvement in security and the reduction of the overheads compared to the existing schemes. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
