Secure Cluster Header Election Techniques in Sensor Network

Lee, Pungho; Kim, Jimmook; Han, In-Sung; Ryou, Hwang-Bin; Ahn, Woo Hyun

doi:10.1007/978-3-540-74767-3_3

Cited by 3 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The key used in the network is either distributed among the nodes prior to deployment or is exchanged among the nodes through packet transmission [10,11]. Our query processing scheme exploits the second way of getting the key by the node.…”

Section: Algorithm For Query Phase (Ch-mn)mentioning

confidence: 99%

“…Authors in both [9] and [10] have proposed schemes for selection of secure cluster heads. Both the schemes assume that the BS is trusted and has more resources.…”

Section: Introductionmentioning

confidence: 99%

“…However, maintenance of huge number of keys and evaluation of these trust values require massive overhead for resource-constrained sensor nodes. In [10], all the nodes send AREP (Authentication Reply) messages to base station after receiving AREQ (Authentication Request) messages from the base station for a constant period of time. The BS selects CHs based on a parameter validity authentication rate (VAR) which is computed at BS with the help of round-wise transmitted authentication message of each node from the nodes to BS along with their residual power.…”

Section: Introductionmentioning

confidence: 99%

“…These solutions should not be considered as alternative to the key based authentication solution. The two sets of work [7,[9][10][11][12][13] and [14][15][16] should instead be considered as complimentary to each other. The presence of representative solution from either set provides additional enhancement of wireless network security against eavesdropping.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A dynamic TDMA based scheme for securing query processing in WSN

Ghosal¹,

Halder²,

Bit

2011

Wireless Netw

View full text Add to dashboard Cite

Nodes in a wireless sensor network (WSN) are generally deployed in unattended environments making the nodes susceptible to attacks. Therefore, the need of defending such attacks becomes a big challenge. We propose a scheme to build a security mechanism in a query-processing paradigm within WSN. The scheme is capable of protecting replay attack while preserving essential properties of security such as authentication, data integrity and data freshness. The solution is made lightweight using symmetric key cryptography with very short-length key. Further, the key used in our scheme is neither pre-deployed nor is transmitted directly. The key information is established among nodes through an efficient use of one variant of dynamic TDMA mechanism which ensures security of key. Another variant of dynamic TDMA is used to make the scheme bandwidth saving, an essential quality of WSN. Performance of the scheme is analyzed in terms of storage, computation and communication overhead. Finally the analytical results are compared with two of the existing schemes including the previous version of the present scheme that show significant reduction of all such overheads thereby proving the suitability of the proposed scheme for a resource-constrained network like WSN.

show abstract

Section: Algorithm For Query Phase (Ch-mn)mentioning

confidence: 99%

“…Authors in both [9] and [10] have proposed schemes for selection of secure cluster heads. Both the schemes assume that the BS is trusted and has more resources.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A dynamic TDMA based scheme for securing query processing in WSN

Ghosal¹,

Halder²,

Bit

2011

Wireless Netw

View full text Add to dashboard Cite

show abstract

“…However, they assume a static network in which each node knows its 1-hop neighbors. Other solutions for sensor networks [7,8] involve the existence of a trusted base station that leads the process. None of the approaches is suitable for generic, mobile, and infrastructureless ad hoc networks.…”

Section: Overviewmentioning

confidence: 99%

A Fair and Secure Cluster Formation Process for Ad Hoc Networks

Rifà-Pous

Herrera-Joancomartí

2010

Wireless Pers Commun

View full text Add to dashboard Cite

An efficient approach for organizing large ad hoc networks is to divide the nodes into multiple clusters and designate, for each cluster, a clusterhead which is responsible for holding intercluster control information. The role of a clusterhead entails rights and duties. On the one hand, it has a dominant position in front of the others because it manages the connectivity and has access to other node's sensitive information. But on the other hand, the clusterhead role also has some associated costs. Hence, in order to prevent malicious nodes from taking control of the group in a fraudulent way and avoid selfish attacks from suitable nodes, the clusterhead needs to be elected in a secure way. In this paper we present a novel solution that guarantees the clusterhead is elected in a cheat-proof manner.

show abstract

A lightweight security scheme for query processing in clustered wireless sensor networks

Ghosal¹,

Bit

2015

Computers & Electrical Engineering

View full text Add to dashboard Cite

Secure Cluster Header Election Techniques in Sensor Network

Cited by 3 publications

References 7 publications

A dynamic TDMA based scheme for securing query processing in WSN

A dynamic TDMA based scheme for securing query processing in WSN

A Fair and Secure Cluster Formation Process for Ad Hoc Networks

A lightweight security scheme for query processing in clustered wireless sensor networks

Contact Info

Product

Resources

About