Secure Distributed Cluster Formation in Wireless Sensor Networks

Sun, Kun; Peng, Pai; Ning, Peng; Wang, Cliff

doi:10.1109/acsac.2006.46

Cited by 66 publications

(87 citation statements)

References 25 publications

(42 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This section briefly reviews existing approaches that are developed for sensor clustering in hostile situations [1], [2], [3], [7], [4], [5], [6]. We found that these protocols either ignore or do not effectively solve the security of leader election.…”

Section: Related Workmentioning

confidence: 99%

“…The techniques in [1], [2] focus on the security issues during the formation of initial clusters. They do not consider the security of cluster leader election.…”

Section: Related Workmentioning

confidence: 99%

“…For the sake of presentation, we call the values (on sensor nodes) used for election purpose as the election values. In the above case, the election values will be the remaining energy reported by sensor nodes.A number of secure clustering protocols have been proposed recently for organizing clusters in sensor networks [1], [2]. These protocols significantly improve the security of clustering in the presence of malicious attacks.…”

mentioning

confidence: 99%

“…A number of secure clustering protocols have been proposed recently for organizing clusters in sensor networks [1], [2]. These protocols significantly improve the security of clustering in the presence of malicious attacks.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Resilient Cluster Leader Election for Wireless Sensor Networks

Dong

Liu

2009

2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks

View full text Add to dashboard Cite

Abstract-Sensor nodes are often organized into clusters for efficiency and scalability purposes. Every sensor cluster is managed by a cluster leader during the network operation such as routing and data aggregation. Since managing a cluster consumes substantial energy, the cluster leader needs to be re-elected from time to time for load balancing. In hostile environments, it is critical to ensure the security of such leader election. This paper proposes an efficient, resilient, and fully distributed leader election protocol for sensor networks. It only uses efficient symmetric key operations and guarantees that (i) benign cluster members will elect the same leader as long as they are wellconnected, and (ii) attackers cannot impact the leader election process to increase or decrease the chance of a benign member being elected as a cluster leader. In addition, the proposed method can quickly recover from message loss or malicious attacks. The evaluation results also demonstrate the efficiency and effectiveness of this approach. I. INTRODUCTIONIn a densely-deployed sensor network, sensors are usually organized into clusters for efficiency and scalability purposes. Every cluster contains a number of sensors that are physically close to each other and is managed by a cluster leader to facilitate the network operation such as in-network aggregation and routing. For instance, in data aggregation, a cluster leader can serve as the aggregator that collects the sensing results from other cluster members, computes the aggregation result, and reports the result to the base station.Since managing a cluster consumes substantial energy, the cluster leaders need to be re-elected from time to time for load balancing. The leader election problem is to ensure that each cluster will have a suitable sensor node be selected as the cluster leader whenever needed. A common election metric to determine the new leader of a given cluster is the remaining energy on sensor nodes. For the sake of presentation, we call the values (on sensor nodes) used for election purpose as the election values. In the above case, the election values will be the remaining energy reported by sensor nodes.A number of secure clustering protocols have been proposed recently for organizing clusters in sensor networks [1], [2]. These protocols significantly improve the security of clustering in the presence of malicious attacks. However, they only focus on the formation of clusters and do not consider the security of cluster leader election. Without proper protection, an attacker can easily subvert the intended purpose of clustering. For example, if the protocol selects the node with the most remaining energy as the new cluster leader, an attacker can continuously hijack the leadership by always claiming more remaining energy than anyone else in the cluster.

show abstract

Section: Related Workmentioning

confidence: 99%

“…The techniques in [1], [2] focus on the security issues during the formation of initial clusters. They do not consider the security of cluster leader election.…”

Section: Related Workmentioning

confidence: 99%

mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Resilient Cluster Leader Election for Wireless Sensor Networks

Dong

Liu

2009

2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks

View full text Add to dashboard Cite

show abstract

“…Algorithms for the full (k,r)-clustering problem is presented in [7] and [9], but neither is self-stabilizing. The algorithm presented in [8] groups nodes together without assigning cluster heads. It considers malicious nodes inside the network, but is not self-stabilizing.…”

Section: Introductionmentioning

confidence: 99%

Self-stabilizing (k,r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths

Larsson

Tsigas

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary state, making the system recover from errors and temporarily broken assumptions. Clustering nodes within ad-hoc networks can help in many ways like forming backbones, facilitating routing, improving scaling, aggregating information and saving power. A (k,r)-clustering assigns cluster heads so that exists k cluster heads within r communication hops for all nodes in the network while trying to minimize the total number of cluster heads. We present the first self-stabilizing distributed (k,r)-clustering algorithm. The algorithm uses synchronous communication rounds and uses multiple paths to different cluster heads for providing improved security, availability and fault tolerance. From any starting configuration the algorithm quickly assigns enough cluster heads and stabilizes towards a local minimum using a randomized scheme.

show abstract

Deterministic K‐means secure coverage clustering with periodic authentication for wireless sensor networks

Krishna

Doja²

2015

Int J Communication

View full text Add to dashboard Cite

Innovative and emerging developments in sensor networks are proven to be the backbone for real-time applications such as satellite communications, military and border area surveillance systems, health care systems, traffic monitoring systems, seismic and underwater monitoring systems, and agriculture and habitat environment systems. Coverage and clustering techniques enable the sensor network to operate in groupbased and region-based communication and thus save the node energy. Energy-efficient protocols save the node energy and increase the network life cycle in a resource-constrained sensor network. Cluster head (CH) node manages and controls the operations such as network topology, coverage area, and routing paths (multi-paths and fault-tolerant paths) of the network. In this paper, we present deterministic K-means secure coverage clustering (K-SCC) with periodic authentication. The proposed protocol uses coverage clustering technique with periodic authentication between the CH node and sensor nodes to establish the secure channel in the network. Maximum cover of K nodes is maintained in the secure coverage cluster to achieve authenticated communication between the sensor nodes in the network. The proposed K-SCC protocol is compared with the existing protocols such as deterministic-SCC and random-SCC protocols. Simulation results indicate that the proposed K-SCC protocol achieves an average of 84% coverage ratio (cluster/sensor node ratio) as compared with 62% coverage ratio in the existing SCC protocols. Simulations also indicate that the proposed K-SCC protocol consumes 20% less energy as compared with the existing SCC protocol. Node attributesThe proposed deterministic K-SCC protocol uses the node attributes such as node energy, signal strength, number of adjacent nodes, pair-wise keys, and CH group key.

show abstract

Secure Distributed Cluster Formation in Wireless Sensor Networks

Cited by 66 publications

References 25 publications

Resilient Cluster Leader Election for Wireless Sensor Networks

Resilient Cluster Leader Election for Wireless Sensor Networks

Self-stabilizing (k,r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths

Deterministic K‐means secure coverage clustering with periodic authentication for wireless sensor networks

Contact Info

Product

Resources

About