An AVL Tree-Based Dynamic Key Management in Hierarchical Wireless Sensor Network

Wireless sensor networks are ubiquitous in monitoring applications, medical control, environmental control and military activities... In fact, a wireless sensor network consists of a set of communicating nodes distributed over an area in order to measure a given magnitude, or receive and transmit data independently to a base station which is connected to the user via the Internet or a satellite, for example. Each node in a sensor network is an electronic device which has calculation capacity, storage, communication and power. However, attacks in wireless sensor networks can have negative impacts on critical network applications leading to the minimization of security within these networks. So it is important to secure these networks in order to maintain their effectiveness. In this paper, we have initially attempted to study approaches oriented towards cryptography and based on elliptic curves, then we have compared the performance of each method relative to others. This approach has a key management model based on the ECC clustering principle using an appropriate algorithm for deployment associated with a secure data transmission [16] in wireless sensor networks.CECKM implements asymmetric key systems using ECC on sensor networks and provides dynamic key synchronization mechanism, fast and effective in network nodes without reconfiguration of all nodes when new nodes arrive or leave from the sensor network. This approach is proposed for dynamic wireless sensor networks and on a larger scale. C. ECC key management based on an A VL treeKey management should provide a key establishment between all nodes, and must work even if the network topology is not predefmed. Unauthorized nodes cannot perform communication with network nodes.

show abstract

“…When messages have to be sent to all the nodes, we use the A VL tree root key because this key is known to everyone [17].…”

Section: Avl Treementioning

confidence: 99%

Security approaches based on elliptic curve cryptography in wireless sensor networks

Salah

Maizate

Ouzzif

2015

2015 27th International Conference on Microelectronics (ICM)

View full text Add to dashboard Cite

show abstract

“…The approach based on M‐arry tree is not strong, but the number of exchanged messages to install keys is of logarithmic order. Also, in the approach based on the AVL tree , the number of exchanged messages to install keys is of logarithmic order, but an approach such as micro public key requires a large number of updates. With the SecCOSEN approach, it is not possible to establish secured links when a new sensor node is added to the network because the existing nodes have already deleted the remaining keys.…”

Section: State Of the Artmentioning

confidence: 99%

A lightweight key management scheme based on an Adelson‐Velskii and Landis tree and elliptic curve cryptography for wireless sensor networks

Boumerzoug

Bensaber

Biskri

2013

Concurrency and Computation

View full text Add to dashboard Cite

Wireless sensor networks are increasingly used in most varied fields such as environment, health, and military. Often, information transmitted on these networks requires encryption to maintain confidentiality, integrity, and non-repudiation. But encryption techniques used to encrypt data on wired networks are not suitable for sensor networks that consist of small nodes equipped with limited resources. In this paper; we propose a security method for wireless sensor networks that provides good protection while taking into account the limited resources of the sensors. This method is based on an effective key management scheme with a minimum storage of keys. It is based on the combination and improvement of two approaches already proposed by the research community: cryptography based on elliptic curves and key management based on an Adelson-Velskii and Landis tree. Compared with RECC 'a routing-driven elliptic curve cryptography based key management scheme for heterogeneous sensor networks' and CECKM 'high-effect key management associated with secure data transmission approaches in sensor networks using a hierarchical-based cluster elliptic curve key agreement', two methods based on Diffie-Hellman elliptic curve cryptography method, our method reduces energy consumption, storage memory, and extends the lifetime of the sensor network. Our simulation results illustrate that our approach saves significant time and memory and reduces the number of exchanged packets during keys installation phase. Also, it requires fewer processing operations and maintains the scalability of the network. Concurrency and Computation: Practice and Experience, 2013

show abstract

“…Also, the scheme in [10] suffers from poor resilience under node compromises and all keys have to be refreshed very quickly. In [11], a new protocol for cluster-head selection is proposed, and ideas are proposed for key additions and revocations under network dynamics via one-way hash functions. Trust protocols are also designed during initial cluster setup.…”

Section: A Rkp Based Schemesmentioning

confidence: 99%

Providing End-to-End Secure Communications in Wireless Sensor Networks

Dutta

Chellappan

et al. 2011

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

Abstract-In many Wireless Sensor Networks (WSNs), providing end to end secure communications between sensors and the sink is important for secure network management. While there have been many works devoted to hop by hop secure communications, the issue of end to end secure communications is largely ignored. In this paper, we design an end to end secure communication protocol in randomly deployed WSNs. Specifically, our protocol is based on a methodology called differentiated key pre-distribution. The core idea is to distribute different number of keys to different sensors to enhance the resilience of certain links. This feature is leveraged during routing, where nodes route through those links with higher resilience. Using rigorous theoretical analysis, we derive an expression for the quality of end to end secure communications, and use it to determine optimum protocol parameters. Extensive performance evaluation illustrates that our solutions can provide highly secure communications between sensor nodes and the sink in randomly deployed WSNs. We also provide detailed discussion on a potential attack (i.e. biased node capturing attack) to our solutions, and propose several countermeasures to this attack.

show abstract

An AVL Tree-Based Dynamic Key Management in Hierarchical Wireless Sensor Network

Cited by 19 publications

References 7 publications

Security approaches based on elliptic curve cryptography in wireless sensor networks

Security approaches based on elliptic curve cryptography in wireless sensor networks

A lightweight key management scheme based on an Adelson‐Velskii and Landis tree and elliptic curve cryptography for wireless sensor networks

Providing End-to-End Secure Communications in Wireless Sensor Networks

Contact Info

Product

Resources

About