EDDK: Energy-Efficient Distributed Deterministic Key Management for Wireless Sensor Networks

Zhang, Xing; He, Jingsha; Wei, Qian

doi:10.1155/2011/765143

Cited by 59 publications

(40 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Analysis showed that their method had an extremely low overhead in terms of computation, communication, and storage. Wei et al (2010) [5] presented an energy-efficient distributed deterministic key management method (EDDK) for resource-constrained wireless sensor networks. EDDK generally focuses on the establishment and safeguarding of the pair-wise keys as well as the local cluster keys and can repair some flaws in some existing key management methods.…”

Section: ) Processor Power Managementmentioning

confidence: 99%

Proposed Energy Conservation Technique in Wireless Sensor Network

Kharpate¹

2018

IJRASET

View full text Add to dashboard Cite

Wireless Ad hoc network has a lack of infrastructure and decentralized network. It is a collection of mobile nodes which has energy, some restricted bandwidth and computational functionality also. Due to its mobility behavior rigorous kinds of vulnerabilities may get compromised from the nodes which consumes the energy mostly and exploits the bandwidth of the transmitting node. The energy consumption is momentous issue as mobile nodes have battery power. To extend the lifetime of ad hoc network, it is serious issues to minimize the energy consumption of mobile nodes. In this work, proposes an efficient energy conserving scheme which use election algorithm and key management techniques. This approach is much more efficient in preserving the energy of mobile nodes and also prevents it from the exploitation of bandwidth. The experimental analysis of proposed approach is done in network simulator NS2.34. For measuring the performance of the proposed approach different performance measuring parameter such as Packet Delivery Ratio (PDR), Routing Load and Energy Consumption and Delay is used. Keywords: Bandwidth, Computational Capacity, Energy, Network Simulator, Overhead, PDR, Throughput I. INTRODUCTIONWireless ad hoc network is a self-organized and infrastructure less network which does not have any central coordination. In such network each nodes are free to move and share their link among nodes. Each nodes act as host or routers which has the capability to transmit packets from one end to another end. Wireless network uses the dynamic topology to form the connection and because of this structure of the network changes haphazardly which consumes energy while each node has limited battery power. This network is used in many areas of application such as military application, scientific purpose, research application, Rescue Operations etc. wireless ad hoc network uses routing concepts to transmit the packets which are classified into three categories specifically: proactive routing protocol, reactive routing protocol and hybrid routing protocol. In proactive routing protocol [2] is analogous to the connectionless approach of forwarding packets, with no regard to when and how recurrently such routes are preferred. The routing information is continuously propagated and maintained in table-driven routing protocols; a path to every other node in the ad hoc network is forever available, regardless of whether or not it is needed. Examples of this protocol are DSDV (Destination Sequence Distance Vector), CSGR, GSR (Global State Routing) and FSR (Fisheye State Routing) etc. In reactive protocols [2] are also called on demand routing protocols because they don't uphold routing information or routing movement at the group nodes if there is no announcement. If nodes wish to send a packet to a different node then this protocol investigates for the route in an on-demand method and founds the association in order to broadcast and acknowledge the packet. The examples of this protocol are AODV and DSR etc. Hybrid routing pro...

show abstract

Section: ) Processor Power Managementmentioning

confidence: 99%

Proposed Energy Conservation Technique in Wireless Sensor Network

Kharpate¹

2018

IJRASET

View full text Add to dashboard Cite

show abstract

“…Thus symmetric key encryption is not appropriate for dynamic WSNs. All the more as of late, awry key based approaches have been proposed for dynamic , [10], [15]. These methodologies exploit of public key cryptography (PKC, for example, elliptic bend cryptography (ECC) or Identity based public key cryptography (ID-PKC) so as to streamline key foundation and information validation between hubs.…”

Section: Imentioning

confidence: 99%

EKM-Cl: Novel Framework for Key Management in Dynamic Wireless Sensor Networks

Raksha¹

2017

IJRASET

View full text Add to dashboard Cite

Key management has remained a difficult issue in wireless device networks (WSNs) as a result of the constraints of device node resources. Various key management schemes that trade off security and operational necessities are proposed in recent years .Wireless device Networks (WSNs) comprises tiny sensor nodes with strained energy, memory and computation capabilities. They are typically deployed within the unattended and hostile environment. So device nodes area unit susceptible to attacks such as node capture and collusion attack by adversaries. In this paper, we tend to propose a certificate less-effective key management (CLEKM) protocol for secure communication in dynamic WSNs characterized by node mobility. The sending node first calculates the best shortest path to the base station and sends the key updates. A security analysis of our theme shows that our protocol is effective in defensive against varied attacks. We tend to implement CL-EKM in Conic OS and simulate it exploitation Cola machine to assess its time, energy, communication, and memory performance. Keywords: Key Management; Wireless Sensor; Cola machine; node mobility; I.INTRODUCTION Dynamic wireless sensor networks (WSNs) which empower portability of sensor hubs, encourage more extensive system scope and more precise administration than static WSNs. There-fore, dynamic WSNs are by and large quickly embraced in checking applications, for example, target following in battlefield reconnaissance, social insurance frameworks, traffic flow and vehicle status observing, dairy cows wellbeing observing [9]. In any case, sensor gadgets are powerless against pernicious assaults, for example, pantomime, block attempt, catch or physical decimation, due to their unattended agent conditions and slips by of availability in remote correspondence [20]. Accordingly, security is one of the most imperative issues in numerous basic dynamic WSN applications. Dynamic WSNs in this manner need to address key security prerequisites, for example, hub validation, information confidentiality furthermore, honesty, at whatever point and wherever the hubs move To address security, encryption key administration conventions for dynamic WSNs have been proposed in the past in view of symmetric key encryption [1]- [3]. Such sort of encryption is appropriate for sensor hubs due to their constrained vitality and preparing capacity. Notwithstanding, it experiences high correspondence overhead and requires expansive memory space to store shared pair wise keys. It is likewise not adaptable and not flexible against bargains, and unfit to help hub portability. Thus symmetric key encryption is not appropriate for dynamic WSNs. All the more as of late, awry key based approaches have been proposed for dynamic , [10], [15]. These methodologies exploit of public key cryptography (PKC, for example, elliptic bend cryptography (ECC) or Identity based public key cryptography (ID-PKC) so as to streamline key foundation and information validation between hubs. PKC is generally more costly th...

show abstract

“…Base station will transmit function identifier and random number, encrypted with individual key to individual nodes as shown in equation (3).…”

Section: Key Establishment Phasementioning

confidence: 99%

Energy Efficient Key Management Scheme for Wireless Sensor Networks

Suganthi¹,

Sumathy²

2014

INT J COMPUT COMMUN, Int. J. Comput. Commun. Control

View full text Add to dashboard Cite

Abstract:Designing an efficient key establishment scheme is of great importance to the data security in Wireless Sensor Networks. The traditional cryptographic techniques are impractical in Wireless Sensor Networks because of associated high energy and computational overheads. This algorithm supports the establishment of three types of keys for each sensor node, an individual key shared with the base station, a pair wise key shared with neighbor sensor node, and a group key that is shared by all the nodes in the network. The algorithm used for establishing and updating these keys are energy efficient and minimizes the involvement of the base station. Polynomial function is used in the study to calculate the keys during initialization, membership change and key compromise. Periodically the key will be updated. To overcome the problem of energy insufficiency and memory storage and to provide adequate security, the energy efficient scheme is proposed. It works well in undefined deployment environment. Unauthorized nodes should not be allowed to establish communication with network nodes. This scheme when compared with other existing schemes has a very low overhead in computation, communication and storage.

show abstract

EDDK: Energy-Efficient Distributed Deterministic Key Management for Wireless Sensor Networks

Cited by 59 publications

References 29 publications

Proposed Energy Conservation Technique in Wireless Sensor Network

Proposed Energy Conservation Technique in Wireless Sensor Network

EKM-Cl: Novel Framework for Key Management in Dynamic Wireless Sensor Networks

Energy Efficient Key Management Scheme for Wireless Sensor Networks

Contact Info

Product

Resources

About