The proposed security system for the Wireless Sensor Network (WSN) is based on the WSN security design goal that ‘to design a completely secure WSN, security must be integrated into every node of the system’. This paper discusses on two main components of the security framework viz. the secure key management module and the secure routing scheme. The incorporation of security mechanism during the routing protocol design phase is the main focus of this paper. The proposed security framework viz. ‘Secure and Hierarchical, a Routing Protocol’ (SHARP) is designed for the wireless sensor network applications which is deployed particularly for data collection purpose in a battlefield where the security aspect of the network cannot be compromised at any cost. SHARP consists of three basic integrated modules and each module performs a well defined task to make the whole security framework a complete system on its own.
The document describes a pairwise key establishment scheme for ad hoc networks. It proposes using cellular automata rules to dynamically establish shared keys between two nodes. Each node sends either a cellular automata rule or the initialization parameters to the other node. The receiving node then uses the rule and parameters along with cellular automata computations to independently derive the shared key. This allows keys to be established dynamically without transmitting the actual keys or requiring an online server. The scheme aims to provide secure communication through pairwise key establishment while being computationally efficient and not relying on predistributed keys.
Hierarchical Key Agreement Protocol for Wireless Sensor Networksidescitation
This document proposes a hierarchical key agreement protocol for wireless sensor networks that uses both symmetric and asymmetric cryptographic techniques. Specifically, it uses probabilistic key pre-distribution for sensor nodes within clusters to establish secure communication with low computational overhead. It uses identity-based asymmetric key distribution between cluster heads and the base station to achieve secure communication with low communication overhead. The goal is to balance security, resilience, and resource overhead of the key management protocol for the constrained sensor nodes. It provides mathematical background on bilinear pairings and elliptic curves needed to implement the identity-based cryptographic techniques.
Research on key predistribution scheme of wireless sensor networksIAEME Publication
This document summarizes a research paper on a novel key pre-distribution scheme for wireless sensor networks. It begins with an introduction to the challenges of key management in wireless sensor networks. It then describes the proposed scheme which has three phases: setup, direct key establishment, and path key establishment. The setup phase generates a large key pool and distributes keys to each sensor node. Direct key establishment allows sensor nodes to discover if they share keys directly. Path key establishment establishes keys through intermediate nodes if direct sharing fails. Performance analysis shows the scheme has higher local connectivity and stronger resilience against node capture attacks compared to previous schemes.
A survey on wireless sensor networks security with the integration of cluster...csandit
Keying technique in Wireless Sensor Networks(WSNs) is one of the most emerging fields of
WSN security. In order to provide security on WSN, the role of Key distribution technique is
considered to be very significant and thus the key management plays a crucial and fundamental
roles in the security service of WSNs. This paper reviews pairwise key establishment technique
along with the architecture and the environment of WSN. The cluster based group key
agreement protocols for infrastructure base WSN are discussed in this paper. This paper also
reviews how the security can be provided to WSNs with the integration of clustering and keying
techniques. The survey also provides a more detailed discussion on the comparison between
different cluster based group key agreement protocols.
A SURVEY ON WIRELESS SENSOR NETWORKS SECURITY WITH THE INTEGRATION OF CLUSTER...cscpconf
The document discusses key establishment techniques and cluster-based group key agreement protocols for wireless sensor networks. It reviews pairwise keying, clustering, and how integrating the two can provide security. Several cluster-based group key agreement protocols are described, including HKAP, GKA-CH, PB-GKA-HGM, and AP-1 and AP-2. These protocols establish cluster and group keys using different hierarchical structures and key agreement methods. The document concludes by comparing the protocols based on their topology and structure.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
FSDA: Framework for Secure Data Aggregation in Wireless Sensor Network for En...IJECEIAES
An effective key management plays a crucial role in imposing a resilient security technique in Wireless Sensor Network (WSN). After reviewing the existing approaches of key management, it is confirmed that existing approachs does not offer good coverage on all potential security breaches in WSN. With WSN being essential part of Internet-of-Things (IoT), the existing approaches of key management can definitely not address such security breaches. Therefore, this paper introduces a Framework for Secure Data Aggregation (FSDA) that hybridizes the public key encryption mechanism in order to obtain a novel key management system. The proposed system does not target any specific attacks but is widely applicable for both internal and external attacks in WSN owing to its design principle. The study outcome exhibits that proposed FSDA offers highly reduced computational burden, minimal delay, less energy consumption, and higher data transmission perforance in contrast to frequency used encryption schemes in WSN.
Securing cluster based adhoc network through balanced clustering with distrib...eSAT Journals
Abstract In this paper, we address key management in cluster-based mobile ad hoc networks (MANETs). We present a fully-distributed ID-based multiple secrets key management scheme (IMKM). This scheme is implemented via a combination of ID-based multiple secrets and threshold cryptography. Ensuring secure communication in an ad hoc network is extremely challenging because of the dynamic nature of the network and the lack of centralized management. Our proposed analysis includes the effect of packet generation model, random deployment of sensors, dynamic cluster head assignment, data compression, and energy consumption model at the sensors. a new protocol called Equalized Cluster Head Election Routing Protocol (ECHERP), which pursues energy conservation through balanced clustering, is proposed. Performance evaluation of ECHERP is carried out through simulation tests. We also present a novel key predistribution scheme that uses deployment knowledge to divide deployment regions into overlapping clusters, each of which has its own distinct key space. Through careful construction of these clusters, network resilience is improved, we focus on the management of encryption keys in large-scale clustered WSNs. We propose a novel distributed key management scheme based on Exclusion Basis Systems (EBS); a combinatorial formulation of the group key management problem. Initially, clusters are formed in the network and the cluster heads are selected based on the energy cost, coverage and processing capacity. The sink assigns cluster key to every cluster and an EBS key set to every cluster head. The EBS key set contains the pairwise keys for intra-cluster and inter-cluster communication. During data transmission towards the sink, the data is made to pass through two phases of encryption thus ensuring security in the network. Our results include performance evaluation in terms of security metrics in clustered WSN and a detailed analysis of resource utilization. Keywords: cluster, deployment knowledge, energy efficiency key predistribution, event-driven, exclusion basis systems, hierarchical routing, ID-based cryptography, key agreement, key management, lifetime, location-aware protocols, mobile ad hoc network, Network coding, , random deployment, Security, secret sharing, secret key distribution, sensor networks, volatile environments, Wireless sensor networks secure group communications.
The document describes a pairwise key establishment scheme for ad hoc networks. It proposes using cellular automata rules to dynamically establish shared keys between two nodes. Each node sends either a cellular automata rule or the initialization parameters to the other node. The receiving node then uses the rule and parameters along with cellular automata computations to independently derive the shared key. This allows keys to be established dynamically without transmitting the actual keys or requiring an online server. The scheme aims to provide secure communication through pairwise key establishment while being computationally efficient and not relying on predistributed keys.
Hierarchical Key Agreement Protocol for Wireless Sensor Networksidescitation
This document proposes a hierarchical key agreement protocol for wireless sensor networks that uses both symmetric and asymmetric cryptographic techniques. Specifically, it uses probabilistic key pre-distribution for sensor nodes within clusters to establish secure communication with low computational overhead. It uses identity-based asymmetric key distribution between cluster heads and the base station to achieve secure communication with low communication overhead. The goal is to balance security, resilience, and resource overhead of the key management protocol for the constrained sensor nodes. It provides mathematical background on bilinear pairings and elliptic curves needed to implement the identity-based cryptographic techniques.
Research on key predistribution scheme of wireless sensor networksIAEME Publication
This document summarizes a research paper on a novel key pre-distribution scheme for wireless sensor networks. It begins with an introduction to the challenges of key management in wireless sensor networks. It then describes the proposed scheme which has three phases: setup, direct key establishment, and path key establishment. The setup phase generates a large key pool and distributes keys to each sensor node. Direct key establishment allows sensor nodes to discover if they share keys directly. Path key establishment establishes keys through intermediate nodes if direct sharing fails. Performance analysis shows the scheme has higher local connectivity and stronger resilience against node capture attacks compared to previous schemes.
A survey on wireless sensor networks security with the integration of cluster...csandit
Keying technique in Wireless Sensor Networks(WSNs) is one of the most emerging fields of
WSN security. In order to provide security on WSN, the role of Key distribution technique is
considered to be very significant and thus the key management plays a crucial and fundamental
roles in the security service of WSNs. This paper reviews pairwise key establishment technique
along with the architecture and the environment of WSN. The cluster based group key
agreement protocols for infrastructure base WSN are discussed in this paper. This paper also
reviews how the security can be provided to WSNs with the integration of clustering and keying
techniques. The survey also provides a more detailed discussion on the comparison between
different cluster based group key agreement protocols.
A SURVEY ON WIRELESS SENSOR NETWORKS SECURITY WITH THE INTEGRATION OF CLUSTER...cscpconf
The document discusses key establishment techniques and cluster-based group key agreement protocols for wireless sensor networks. It reviews pairwise keying, clustering, and how integrating the two can provide security. Several cluster-based group key agreement protocols are described, including HKAP, GKA-CH, PB-GKA-HGM, and AP-1 and AP-2. These protocols establish cluster and group keys using different hierarchical structures and key agreement methods. The document concludes by comparing the protocols based on their topology and structure.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
FSDA: Framework for Secure Data Aggregation in Wireless Sensor Network for En...IJECEIAES
An effective key management plays a crucial role in imposing a resilient security technique in Wireless Sensor Network (WSN). After reviewing the existing approaches of key management, it is confirmed that existing approachs does not offer good coverage on all potential security breaches in WSN. With WSN being essential part of Internet-of-Things (IoT), the existing approaches of key management can definitely not address such security breaches. Therefore, this paper introduces a Framework for Secure Data Aggregation (FSDA) that hybridizes the public key encryption mechanism in order to obtain a novel key management system. The proposed system does not target any specific attacks but is widely applicable for both internal and external attacks in WSN owing to its design principle. The study outcome exhibits that proposed FSDA offers highly reduced computational burden, minimal delay, less energy consumption, and higher data transmission perforance in contrast to frequency used encryption schemes in WSN.
Securing cluster based adhoc network through balanced clustering with distrib...eSAT Journals
Abstract In this paper, we address key management in cluster-based mobile ad hoc networks (MANETs). We present a fully-distributed ID-based multiple secrets key management scheme (IMKM). This scheme is implemented via a combination of ID-based multiple secrets and threshold cryptography. Ensuring secure communication in an ad hoc network is extremely challenging because of the dynamic nature of the network and the lack of centralized management. Our proposed analysis includes the effect of packet generation model, random deployment of sensors, dynamic cluster head assignment, data compression, and energy consumption model at the sensors. a new protocol called Equalized Cluster Head Election Routing Protocol (ECHERP), which pursues energy conservation through balanced clustering, is proposed. Performance evaluation of ECHERP is carried out through simulation tests. We also present a novel key predistribution scheme that uses deployment knowledge to divide deployment regions into overlapping clusters, each of which has its own distinct key space. Through careful construction of these clusters, network resilience is improved, we focus on the management of encryption keys in large-scale clustered WSNs. We propose a novel distributed key management scheme based on Exclusion Basis Systems (EBS); a combinatorial formulation of the group key management problem. Initially, clusters are formed in the network and the cluster heads are selected based on the energy cost, coverage and processing capacity. The sink assigns cluster key to every cluster and an EBS key set to every cluster head. The EBS key set contains the pairwise keys for intra-cluster and inter-cluster communication. During data transmission towards the sink, the data is made to pass through two phases of encryption thus ensuring security in the network. Our results include performance evaluation in terms of security metrics in clustered WSN and a detailed analysis of resource utilization. Keywords: cluster, deployment knowledge, energy efficiency key predistribution, event-driven, exclusion basis systems, hierarchical routing, ID-based cryptography, key agreement, key management, lifetime, location-aware protocols, mobile ad hoc network, Network coding, , random deployment, Security, secret sharing, secret key distribution, sensor networks, volatile environments, Wireless sensor networks secure group communications.
n-Tier Modelling of Robust Key management for Secure Data Aggregation in Wire...IJECEIAES
Security problems in Wireless Sensor Network (WSN) have been researched from more than a decade. There are various security approaches being evolving towards resisting various forms of attack using different methodologies. After reviewing the existing security approaches, it can be concluded that such security approaches are highly attack-specific and doesnt address various associated issues in WSN. It is essential for security approach to be computationally lightweight. Therefore, this paper presents a novel analytical modelling that is based on n-tier approach with a target to generate an optimized secret key that could ensure higher degree of security during the process of data aggregation in WSN. The study outcome shows that proposed system is computationally lightweight with good performance on reduced delay and reduced energy consumption. It also exhibits enhanced response time and good data delivery performance to balance the need of security and data forwarding performance in WSN.
Refining data security in infrastructurenetworks support of multipath routingeSAT Journals
Abstract An infrastructure network is a self-organizing network with help of Access Point (AP) of wireless links connecting nodes to another. The nodes can communicate without an ad hoc. They form an uninformed topology(BSS/ESS), where the nodes play the role of routers and are free to move randomly. Infrastructure networks proved their efficiency being used in different fields but they are highly vulnerable to security attacks and dealing with this is one of the main challenges of these networks at present.In recent times some clarification are proposed to provide authentication, confidentiality, availability, secure routing and intrusion avoidance in infrastructure networks. Implementing security in such dynamically changing networks is a hard task. Infrastructure network characteristics should be taken into consideration to be clever to design efficient solutions. Here we spotlight on civilizing the flow transmission privacy in infrastructure networks based on multipath routing. Certainly, we take benefit of the being of multiple paths between nodes in an infrastructure network to increase the confidentiality robustness of transmitted data with the help of Access Point. In our approach the original message to secure is split into shares through access point that are encrypted and combined then transmitted along different disjointed existing paths between sender and receiver. Even if an intruderachieve something to get one or more transmitted distribute the likelihood that the unique message will be reconstituted is very squat.
Random Key Pre-distribution Schemes using Multi-Path in Wireless Sensor Networksijceronline
This document summarizes a research paper that proposes a new key pre-distribution and multi-path routing scheme for wireless sensor networks. The paper begins with an introduction that describes the importance of security in wireless sensor networks and challenges with key management. It then reviews existing key pre-distribution and routing schemes. The document proposes a new hexagon-based multi-path routing algorithm combined with a key pre-distribution scheme. It describes the details of the algorithm and compares its performance to other schemes through simulations. The results show the proposed scheme achieves better security, efficiency and message delivery compared to previous works.
A Trust Conscious Secure Route Data Communication in MANETSCSCJournals
The document proposes a mechanism for establishing trust-based secure routes for data communication between mobile nodes in a mobile ad hoc network (MANET). It aims to dynamically increase the trust level between nodes from low to high using proxy nodes. When nodes need to securely communicate, they will generate dynamic secret session keys either directly or through proxy nodes using message digest and Diffie-Hellman protocols. The mechanism is implemented on reactive routing protocols and finds routes through trusted intermediate nodes that share secret keys. This may result in non-optimal routes but guarantees security. It also describes how a new node can join and how trusted nodes can act as proxies to help other nodes establish shared keys.
Distributed Packet Filtering Firewall for Enhanced Security In Mobile Ad-Hoc ...IJERA Editor
The nodes in MANET are free to move in a limited grid layout without the presence of vision of the superior
authority or administration. The nodes in network are free to move in any other network at any time. That means
the nodes are join or leave the network at any instant, that's why the security is the major issue in MANET.
Routing protocols are not able to handle the malicious activities of attacker because their function is to provide
the path in between sender to receiver and route data from the path which is selected for transferring information.
This paper proposed the distributed security scheme for providing reliable path and secure communication. The
proposed bloom filtering technique is not only filtering the unwanted infected packets of routing attacker. It's
also recovered the modified data and protects IP modification with the help of new route establishment
mechanism. The proposed bloom filter is provides the secure communication and stop the attacker infection. The
Bloom filter removes the IP modified packets that shows the presence of malicious routing attacker in dynamic
network. The normal routing performance and proposed bloom filter is almost equivalent. The performance of
network is measured through performance metrics and proposed distributed security scheme provides better
performance.
Analysis and Implementation Wireless Sensor Network of Information Technology...IJERDJOURNAL
ABSTRACT:- This paper, we propose a smart home system based on two approaches. The first approach is topologi architecture mesh and the second is the protocol of Wireless Sensor Network (WSN) are efficient. This system has two working environment, indoor and outdoor. Indoor environment using WSN system, while the external environment usingsystem. internet-cloudThis scheme is known as the Internet-of-Things (IOT). Indoor and outdoor environments connected to each other by means of a connecting bridge. WSN system formed from the components of WSN that uses a mesh topology. Each component of the WSN designed for implementing efficient data protocols are proposed. For outdoor environments, system-cloud Internet that there is a major infrastructure. Thus, the smart home system can be monitored and controlled from a smartphone, anytime and anywhere, as long as access to mobile data is available. For the evaluation of the system, several tests have been done to get the system profile.
A Comparative Study of Group Key Management in MANETIJERA Editor
A Mobile Ad-Hoc Network (MANET) is a self organized network, with no fixed infrastructure, limited
resources and limited physical security. Security in such an environment is an essential requirement. Key
management is a salient element in MANET security. It is responsible for key generation, storage, distribution,
updating, revocation, deleting, and archiving. Key management protocols are classified into symmetric,
asymmetric, group, and hybrid. Group key management is a point of interest for researchers with the growing
usage of mobile devices and the rising of multicast communication. This paper surveys different approaches in
group key management schemes. A comparative study is demonstrated in terms of reliability, computational
complexity, storage cost, communication overheads, pre-requirements, security levels, robustness,
vulnerabilities, scalability, energy and mobility. Finally, the study concludes the pros and cons of each protocol.
An efficient approach for secured communication in wireless sensor networks IJECEIAES
Wireless sensor network (WSN) have limited bandwidth, low computational functions, energy constraints. Inspite of these constraints, WSN is useful where communication happens without infrastructure support. The main concern of WSN is the security as the sensor nodes may be attacked and information may be hacked. Security of WSN should have the capability to ensure that the message received was sent by the particular sent node and not modified during transmission. WSN applications require lightweight and strong authentication mechanisms for obtaining data from unprivileged users. In wireless sensor networks, authentication is the effective method to stop unauthorized and undisrupted communication service. In order to strengthen the authenticated communication, several researchers have developed mechanisms. Some of the techniques work with identifying the attacked node or detecting injected bogus message in the network. Encryption and decryption are the popular methods of providing the security. These are based on either public-key or symmetric-key cryptosystems.Many of the existing solutions have limitations in communication and computational expertise. Also, the existing mechanisms lack in providing strength and scalability of the network. In order address these issues; a polynomial based method was introduced in recent days. Key distribution is a significant aspect in key management in WSNs. The simplest method of distribution of key is by hand which was used in the days of couriers. Now a day, most distribution of keys is done automatically. The automatic distribution of keys is essential and convenient in networks that require two parties to transmit their security keys in the same communication medium. In this work, a new type of key exchange mechanism is proposed. The proposed method for authentication among sensor nodes proves to be promising as per the simulation results. The nodes which are unknown to each other setup a private however arbitrary key for the symmetric key cryptosystem.
The Difference Impact on QoS Parameters between the IPSEC and L2TPAM Publications
Many of the networks are existing but little of them that believe the quality and security together, the secure transmission of the information with high quality remains the primary goal of all engineers, which is considered the ideal goal of this theory either in fact, get a high quality of service comes at the expense of security and vice versa, has been expressed networks fiber optic for the best possible speed while maintaining a good level of security. In the Internet network, person-to-person communication can be enhanced with high quality images and videos, and access to information and services on public and private networks will be enhanced by higher data rates, quality of service (QoS), security measures, location-awareness, energy efficiency, and new flexible communication capabilities. So some networks are characterized by the QOS offered in addition to the security that we will discuss extensively later. This distinction is linked to the quality of communication and service over the network and security[1]. The quality of a network is evaluated on the basis of the quality of service, and especially on its security features. The use of security mechanisms is important in knowing the identity, saving the information, and ensuring that there is no tampering.in this research we try to ensure the security for QoS with two different methods using the Tunnel like the L2TP and IPSec that mean the security of layer two and three of OSI model, and we compared the differential impact between the two types of security on QoS parameters.
This document presents a mathematical approach for calculating reliability in wireless sensor networks (WSN) for security purposes. It discusses three key aspects: 1) calculating the reliability of the interconnected network backbone through factors like bandwidth and signal transmission, 2) calculating the reliability of the overall WSN by considering parameters like performance and total reliability, and 3) classifying data aggregation schemes which can help provide secure and accurate data aggregation. The approach aims to estimate system working quality and design a reliable security system through these reliability calculations.
Secure and efficient handover authentication and detection of spoofing attackeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
AN EFFICIENT KEY AGREEMENT SCHEME FOR WIRELESSSENSOR NETWORKS USING THIRD PAR...ijasuc
This document summarizes a key agreement scheme for wireless sensor networks that uses third party nodes to assist with pair-wise key establishment between sensor nodes. The proposed scheme has several advantages over existing approaches, including high local connectivity between sensor nodes, low memory usage, and resilience against node capture. It utilizes third party nodes, which are additional nodes deployed only to assist with key establishment and do not perform other network functions like sensing or routing. The scheme distributes secret shares to sensor nodes, allows nodes to discover local neighbors, and establishes secure channels in a way that improves performance metrics like connectivity, security, memory efficiency, and computational overhead compared to other key agreement methods.
This document discusses the implementation phase of a project which involves developing a hypothetical outline into a working method. It notes that implementation is often the most challenging stage of getting a new system operational and building confidence that it will work reliably. The implementation stage involves careful planning, analysis of how the system may impact implementation, planning transition procedures, and analyzing transition methods. It then lists six modules for the implementation: set protocol, key management for security, neighborhood authentication, storage cost, network scalability, and communication overhead.
Performance and Simulation Study of TheProposed Direct, Indirect Trust Distri...cseij
ABSTRACT
In this paper, we propose a routing protocol that is based on securing the routing information from
unauthorized users. Even though routing protocols of this category are already proposed, they are not
efficient, in the sense that, they use the same kind of encryption algorithms (mostly high level) for every
Bit of routing information they pass from one intermediate node to another in the routing path. The
proposed mechanism is evaluated against selected alternative trust schemes, with the results showing that
our proposal achieves its goals.Our research aims at providing a secure and distributed
authentication service in the ad hoc networks.
A Survey on Comparisons of Cryptographic Algorithms Using Certain Parameters ...IJECEIAES
he Wireless Sensor Networks (WSNs) have spread its roots in almost every application. Owing to their scattered nature of sensor nodes, they are more prone to attacks. There are certain applications e.g. military, where sensor data‟s confidentiality requirement during transmission is essential. Cryptography has a vital role for achieving security in WSNs.WSN has resource constraints like memory size, processing speed and energy consumption which bounds the applicability of existing cryptographic algorithms for WSN. Any good security algorithms has higher energy consumption by the nodes, so it‟s a need to choose most energy-efficient cryptographic encryption algorithms for WSNs. This paper surveys different asymmetric algorithms such as RSA, Diffie-Hellman, DSA, ECC, hybrid and DNA cryptography. These algorithms are compared based on their key size, strength, weakness, attacks and possible countermeasures in the form of table.
Energy Efficient Key Management Analysis using AVL Trees in Wireless Sensor N...inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Creation of smart spaces and scaling of devices to achieve miniaturization in pervasive computing environments has put forth a question on the degree of security of such devices. Security being a unique challenge in such environments, solution demands scalability, access control, heterogeneity, trust. Most of the existing cryptographic solutions widely in use rely on the hardness of factorization and number theory
problems. With the increase in cryptanalytic attacks these schemes will soon become insecure. We need an alternate security mechanism which is as hard as the existing number theoretic approaches. In this work, we discuss the aspects of Lattice based cryptography as a new dimension of providing security whose strength lies in the hardness of lattice problems. We discuss about a cryptosystem whose security relies on high lattice dimension.
An analysis of security challenges in mobile ad hoc networkscsandit
Mobile Ad Hoc Network (MANET) is a collection of wireless mobile nodes with restricted
transmission range and resources, no fixed infrastructure and quick and easy setup. Because of
special characteristics, wide-spread deployment of MANET faced lots of challenges like
security, routing and clustering. The security challenges arise due to MANETs selfconfiguration
and self-maintenance capabilities. In this paper, we present an elaborate view of
issues in MANET security. We discussed both security services and attacks in detail. Three
important parameters in MANET security are defined. Each attack has been analyses briefly
based on its own characteristics and behaviour. In addition, defeating approaches against
attacks have been evaluated in some important metrics. After analyses and evaluations, future
scopes of work have been presented
Key Management Scheme for Secure Group Communication in WSN with Multiple Gr...csandit
Security is one of the inherent challenges in the area of Wireless Sensor Network (WSN). At
present, majority of the security protocols involve massive iterations and complex steps of
encryptions thereby giving rise to degradation of quality of service. Many WSN applications are
based on secure group communication. In this paper, we have proposed a scheme for secure
group key management with simultaneous multiple groups. The scheme uses a key-based
approach for managing the groups and we show that membership change events can be
handled with less storage, communication and computation cost. The scheme also offers
authentication to the messages communicated within and among the groups.
IRJET- - Implementation of a Secured Approach using Dynamic Key Managemen...IRJET Journal
This document proposes a secure authentication approach for wireless sensor networks using dynamic key management and zero knowledge protocols. It begins with background on wireless sensor networks and security issues. It then describes related work on key predistribution and dynamic key management schemes. A proposed algorithm is described that uses a rekeying mechanism, zero knowledge authentication without directly transmitting secret keys, and dynamic keys that change for each authentication. Simulation results on networks of up to 25 nodes show the approach is efficient and can authenticate nodes while preventing attacks like cloning.
AN ANTI-CLONE ATTACK KEY MANAGEMENT SCHEME FOR WIRELESS SENSOR NETWORKScsandit
Wireless Sensor Networks (WSNs) are subject to various kinds of attacks such as replaying of
messages, battery exhausting, and nodes compromising. While most of these attacks can be
dealt with through cryptographic security protocols provided by key management schemes,
there are always a few that manage to really cause problems. One such attack that is most
common and significant in WSNs is cloning attack. In clone attack, the intruder tries to capture
and compromise some nodes and inject them into several locations throughout the network in
order to conduct other types of attacks. Moreover, if this attack is not detected early, then these
replicated injected nodes will consume a large amount of the network resources. In this paper,
we analyze several key management schemes that can be used for checking integrity and
preventing cloning attacks. After analyzing the problems associated with these schemes, we
propose a model that allows us to distinguish between legitimate nodes and cloned nodes in
such sensor networks.
n-Tier Modelling of Robust Key management for Secure Data Aggregation in Wire...IJECEIAES
Security problems in Wireless Sensor Network (WSN) have been researched from more than a decade. There are various security approaches being evolving towards resisting various forms of attack using different methodologies. After reviewing the existing security approaches, it can be concluded that such security approaches are highly attack-specific and doesnt address various associated issues in WSN. It is essential for security approach to be computationally lightweight. Therefore, this paper presents a novel analytical modelling that is based on n-tier approach with a target to generate an optimized secret key that could ensure higher degree of security during the process of data aggregation in WSN. The study outcome shows that proposed system is computationally lightweight with good performance on reduced delay and reduced energy consumption. It also exhibits enhanced response time and good data delivery performance to balance the need of security and data forwarding performance in WSN.
Refining data security in infrastructurenetworks support of multipath routingeSAT Journals
Abstract An infrastructure network is a self-organizing network with help of Access Point (AP) of wireless links connecting nodes to another. The nodes can communicate without an ad hoc. They form an uninformed topology(BSS/ESS), where the nodes play the role of routers and are free to move randomly. Infrastructure networks proved their efficiency being used in different fields but they are highly vulnerable to security attacks and dealing with this is one of the main challenges of these networks at present.In recent times some clarification are proposed to provide authentication, confidentiality, availability, secure routing and intrusion avoidance in infrastructure networks. Implementing security in such dynamically changing networks is a hard task. Infrastructure network characteristics should be taken into consideration to be clever to design efficient solutions. Here we spotlight on civilizing the flow transmission privacy in infrastructure networks based on multipath routing. Certainly, we take benefit of the being of multiple paths between nodes in an infrastructure network to increase the confidentiality robustness of transmitted data with the help of Access Point. In our approach the original message to secure is split into shares through access point that are encrypted and combined then transmitted along different disjointed existing paths between sender and receiver. Even if an intruderachieve something to get one or more transmitted distribute the likelihood that the unique message will be reconstituted is very squat.
Random Key Pre-distribution Schemes using Multi-Path in Wireless Sensor Networksijceronline
This document summarizes a research paper that proposes a new key pre-distribution and multi-path routing scheme for wireless sensor networks. The paper begins with an introduction that describes the importance of security in wireless sensor networks and challenges with key management. It then reviews existing key pre-distribution and routing schemes. The document proposes a new hexagon-based multi-path routing algorithm combined with a key pre-distribution scheme. It describes the details of the algorithm and compares its performance to other schemes through simulations. The results show the proposed scheme achieves better security, efficiency and message delivery compared to previous works.
A Trust Conscious Secure Route Data Communication in MANETSCSCJournals
The document proposes a mechanism for establishing trust-based secure routes for data communication between mobile nodes in a mobile ad hoc network (MANET). It aims to dynamically increase the trust level between nodes from low to high using proxy nodes. When nodes need to securely communicate, they will generate dynamic secret session keys either directly or through proxy nodes using message digest and Diffie-Hellman protocols. The mechanism is implemented on reactive routing protocols and finds routes through trusted intermediate nodes that share secret keys. This may result in non-optimal routes but guarantees security. It also describes how a new node can join and how trusted nodes can act as proxies to help other nodes establish shared keys.
Distributed Packet Filtering Firewall for Enhanced Security In Mobile Ad-Hoc ...IJERA Editor
The nodes in MANET are free to move in a limited grid layout without the presence of vision of the superior
authority or administration. The nodes in network are free to move in any other network at any time. That means
the nodes are join or leave the network at any instant, that's why the security is the major issue in MANET.
Routing protocols are not able to handle the malicious activities of attacker because their function is to provide
the path in between sender to receiver and route data from the path which is selected for transferring information.
This paper proposed the distributed security scheme for providing reliable path and secure communication. The
proposed bloom filtering technique is not only filtering the unwanted infected packets of routing attacker. It's
also recovered the modified data and protects IP modification with the help of new route establishment
mechanism. The proposed bloom filter is provides the secure communication and stop the attacker infection. The
Bloom filter removes the IP modified packets that shows the presence of malicious routing attacker in dynamic
network. The normal routing performance and proposed bloom filter is almost equivalent. The performance of
network is measured through performance metrics and proposed distributed security scheme provides better
performance.
Analysis and Implementation Wireless Sensor Network of Information Technology...IJERDJOURNAL
ABSTRACT:- This paper, we propose a smart home system based on two approaches. The first approach is topologi architecture mesh and the second is the protocol of Wireless Sensor Network (WSN) are efficient. This system has two working environment, indoor and outdoor. Indoor environment using WSN system, while the external environment usingsystem. internet-cloudThis scheme is known as the Internet-of-Things (IOT). Indoor and outdoor environments connected to each other by means of a connecting bridge. WSN system formed from the components of WSN that uses a mesh topology. Each component of the WSN designed for implementing efficient data protocols are proposed. For outdoor environments, system-cloud Internet that there is a major infrastructure. Thus, the smart home system can be monitored and controlled from a smartphone, anytime and anywhere, as long as access to mobile data is available. For the evaluation of the system, several tests have been done to get the system profile.
A Comparative Study of Group Key Management in MANETIJERA Editor
A Mobile Ad-Hoc Network (MANET) is a self organized network, with no fixed infrastructure, limited
resources and limited physical security. Security in such an environment is an essential requirement. Key
management is a salient element in MANET security. It is responsible for key generation, storage, distribution,
updating, revocation, deleting, and archiving. Key management protocols are classified into symmetric,
asymmetric, group, and hybrid. Group key management is a point of interest for researchers with the growing
usage of mobile devices and the rising of multicast communication. This paper surveys different approaches in
group key management schemes. A comparative study is demonstrated in terms of reliability, computational
complexity, storage cost, communication overheads, pre-requirements, security levels, robustness,
vulnerabilities, scalability, energy and mobility. Finally, the study concludes the pros and cons of each protocol.
An efficient approach for secured communication in wireless sensor networks IJECEIAES
Wireless sensor network (WSN) have limited bandwidth, low computational functions, energy constraints. Inspite of these constraints, WSN is useful where communication happens without infrastructure support. The main concern of WSN is the security as the sensor nodes may be attacked and information may be hacked. Security of WSN should have the capability to ensure that the message received was sent by the particular sent node and not modified during transmission. WSN applications require lightweight and strong authentication mechanisms for obtaining data from unprivileged users. In wireless sensor networks, authentication is the effective method to stop unauthorized and undisrupted communication service. In order to strengthen the authenticated communication, several researchers have developed mechanisms. Some of the techniques work with identifying the attacked node or detecting injected bogus message in the network. Encryption and decryption are the popular methods of providing the security. These are based on either public-key or symmetric-key cryptosystems.Many of the existing solutions have limitations in communication and computational expertise. Also, the existing mechanisms lack in providing strength and scalability of the network. In order address these issues; a polynomial based method was introduced in recent days. Key distribution is a significant aspect in key management in WSNs. The simplest method of distribution of key is by hand which was used in the days of couriers. Now a day, most distribution of keys is done automatically. The automatic distribution of keys is essential and convenient in networks that require two parties to transmit their security keys in the same communication medium. In this work, a new type of key exchange mechanism is proposed. The proposed method for authentication among sensor nodes proves to be promising as per the simulation results. The nodes which are unknown to each other setup a private however arbitrary key for the symmetric key cryptosystem.
The Difference Impact on QoS Parameters between the IPSEC and L2TPAM Publications
Many of the networks are existing but little of them that believe the quality and security together, the secure transmission of the information with high quality remains the primary goal of all engineers, which is considered the ideal goal of this theory either in fact, get a high quality of service comes at the expense of security and vice versa, has been expressed networks fiber optic for the best possible speed while maintaining a good level of security. In the Internet network, person-to-person communication can be enhanced with high quality images and videos, and access to information and services on public and private networks will be enhanced by higher data rates, quality of service (QoS), security measures, location-awareness, energy efficiency, and new flexible communication capabilities. So some networks are characterized by the QOS offered in addition to the security that we will discuss extensively later. This distinction is linked to the quality of communication and service over the network and security[1]. The quality of a network is evaluated on the basis of the quality of service, and especially on its security features. The use of security mechanisms is important in knowing the identity, saving the information, and ensuring that there is no tampering.in this research we try to ensure the security for QoS with two different methods using the Tunnel like the L2TP and IPSec that mean the security of layer two and three of OSI model, and we compared the differential impact between the two types of security on QoS parameters.
This document presents a mathematical approach for calculating reliability in wireless sensor networks (WSN) for security purposes. It discusses three key aspects: 1) calculating the reliability of the interconnected network backbone through factors like bandwidth and signal transmission, 2) calculating the reliability of the overall WSN by considering parameters like performance and total reliability, and 3) classifying data aggregation schemes which can help provide secure and accurate data aggregation. The approach aims to estimate system working quality and design a reliable security system through these reliability calculations.
Secure and efficient handover authentication and detection of spoofing attackeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
AN EFFICIENT KEY AGREEMENT SCHEME FOR WIRELESSSENSOR NETWORKS USING THIRD PAR...ijasuc
This document summarizes a key agreement scheme for wireless sensor networks that uses third party nodes to assist with pair-wise key establishment between sensor nodes. The proposed scheme has several advantages over existing approaches, including high local connectivity between sensor nodes, low memory usage, and resilience against node capture. It utilizes third party nodes, which are additional nodes deployed only to assist with key establishment and do not perform other network functions like sensing or routing. The scheme distributes secret shares to sensor nodes, allows nodes to discover local neighbors, and establishes secure channels in a way that improves performance metrics like connectivity, security, memory efficiency, and computational overhead compared to other key agreement methods.
This document discusses the implementation phase of a project which involves developing a hypothetical outline into a working method. It notes that implementation is often the most challenging stage of getting a new system operational and building confidence that it will work reliably. The implementation stage involves careful planning, analysis of how the system may impact implementation, planning transition procedures, and analyzing transition methods. It then lists six modules for the implementation: set protocol, key management for security, neighborhood authentication, storage cost, network scalability, and communication overhead.
Performance and Simulation Study of TheProposed Direct, Indirect Trust Distri...cseij
ABSTRACT
In this paper, we propose a routing protocol that is based on securing the routing information from
unauthorized users. Even though routing protocols of this category are already proposed, they are not
efficient, in the sense that, they use the same kind of encryption algorithms (mostly high level) for every
Bit of routing information they pass from one intermediate node to another in the routing path. The
proposed mechanism is evaluated against selected alternative trust schemes, with the results showing that
our proposal achieves its goals.Our research aims at providing a secure and distributed
authentication service in the ad hoc networks.
A Survey on Comparisons of Cryptographic Algorithms Using Certain Parameters ...IJECEIAES
he Wireless Sensor Networks (WSNs) have spread its roots in almost every application. Owing to their scattered nature of sensor nodes, they are more prone to attacks. There are certain applications e.g. military, where sensor data‟s confidentiality requirement during transmission is essential. Cryptography has a vital role for achieving security in WSNs.WSN has resource constraints like memory size, processing speed and energy consumption which bounds the applicability of existing cryptographic algorithms for WSN. Any good security algorithms has higher energy consumption by the nodes, so it‟s a need to choose most energy-efficient cryptographic encryption algorithms for WSNs. This paper surveys different asymmetric algorithms such as RSA, Diffie-Hellman, DSA, ECC, hybrid and DNA cryptography. These algorithms are compared based on their key size, strength, weakness, attacks and possible countermeasures in the form of table.
Energy Efficient Key Management Analysis using AVL Trees in Wireless Sensor N...inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
Creation of smart spaces and scaling of devices to achieve miniaturization in pervasive computing environments has put forth a question on the degree of security of such devices. Security being a unique challenge in such environments, solution demands scalability, access control, heterogeneity, trust. Most of the existing cryptographic solutions widely in use rely on the hardness of factorization and number theory
problems. With the increase in cryptanalytic attacks these schemes will soon become insecure. We need an alternate security mechanism which is as hard as the existing number theoretic approaches. In this work, we discuss the aspects of Lattice based cryptography as a new dimension of providing security whose strength lies in the hardness of lattice problems. We discuss about a cryptosystem whose security relies on high lattice dimension.
An analysis of security challenges in mobile ad hoc networkscsandit
Mobile Ad Hoc Network (MANET) is a collection of wireless mobile nodes with restricted
transmission range and resources, no fixed infrastructure and quick and easy setup. Because of
special characteristics, wide-spread deployment of MANET faced lots of challenges like
security, routing and clustering. The security challenges arise due to MANETs selfconfiguration
and self-maintenance capabilities. In this paper, we present an elaborate view of
issues in MANET security. We discussed both security services and attacks in detail. Three
important parameters in MANET security are defined. Each attack has been analyses briefly
based on its own characteristics and behaviour. In addition, defeating approaches against
attacks have been evaluated in some important metrics. After analyses and evaluations, future
scopes of work have been presented
Key Management Scheme for Secure Group Communication in WSN with Multiple Gr...csandit
Security is one of the inherent challenges in the area of Wireless Sensor Network (WSN). At
present, majority of the security protocols involve massive iterations and complex steps of
encryptions thereby giving rise to degradation of quality of service. Many WSN applications are
based on secure group communication. In this paper, we have proposed a scheme for secure
group key management with simultaneous multiple groups. The scheme uses a key-based
approach for managing the groups and we show that membership change events can be
handled with less storage, communication and computation cost. The scheme also offers
authentication to the messages communicated within and among the groups.
IRJET- - Implementation of a Secured Approach using Dynamic Key Managemen...IRJET Journal
This document proposes a secure authentication approach for wireless sensor networks using dynamic key management and zero knowledge protocols. It begins with background on wireless sensor networks and security issues. It then describes related work on key predistribution and dynamic key management schemes. A proposed algorithm is described that uses a rekeying mechanism, zero knowledge authentication without directly transmitting secret keys, and dynamic keys that change for each authentication. Simulation results on networks of up to 25 nodes show the approach is efficient and can authenticate nodes while preventing attacks like cloning.
AN ANTI-CLONE ATTACK KEY MANAGEMENT SCHEME FOR WIRELESS SENSOR NETWORKScsandit
Wireless Sensor Networks (WSNs) are subject to various kinds of attacks such as replaying of
messages, battery exhausting, and nodes compromising. While most of these attacks can be
dealt with through cryptographic security protocols provided by key management schemes,
there are always a few that manage to really cause problems. One such attack that is most
common and significant in WSNs is cloning attack. In clone attack, the intruder tries to capture
and compromise some nodes and inject them into several locations throughout the network in
order to conduct other types of attacks. Moreover, if this attack is not detected early, then these
replicated injected nodes will consume a large amount of the network resources. In this paper,
we analyze several key management schemes that can be used for checking integrity and
preventing cloning attacks. After analyzing the problems associated with these schemes, we
propose a model that allows us to distinguish between legitimate nodes and cloned nodes in
such sensor networks.
Balancing Trade-off between Data Security and Energy Model for Wireless Senso...IJECEIAES
An extensive effort to evolve various routing protocol to ensure optimal data delivery in energy efficient way is beneficial only if there is additional means of security process is synchronized. However, the security process consideration introduces additional overhead thus a security mechanism is needed to accomplish an optimal trade-off that exists in-between security as well as resource utilization especially energy. The prime purpose of this paper is to develop a process of security in the context of wireless sensor networks (WSN) by introducing two types of sensor node deployed with different capabilities. The proposed algorithm Novel Model of Secure Paradigm (N-MSP) which is further integrated with WSN. However, this algorithm uses a Hash-based Message Authentication Code (HMAC) authentication followed by pairwise key establishment during data aggregation process in a WSN. The extensive simulation carried out in a numerical platform called MATLAB that depicts that the proposed N-MSP achieves optimal processing time along with energy efficient pairwise key establishment during data aggregation process.
Advanced Data Protection and Key Organization Framework for Mobile Ad-Hoc Net...AM Publications,India
Key organization and protect routing are two major subjects for Mobile Ad-hoc Networks nonetheless preceding explanations tend to contemplate them distinctly. This indicates to Key organization and protects routing inters dependency cycle problem. In this paper, we recommend a Key organization and protection of routing integrated scheme that speeches Key organization and protection of routing inter dependency cycle problem. By using identity based cryptography this scheme delivers produced including confidentiality, honesty, verification, cleanness, and non-repudiation. Connected to symmetric cryptography and conventional asymmetric cryptography as well as preceding IBC arrangements, this arrangement has developments in many features. We deliver hypothetical resistant of the refuge of the scheme and validate the efficiency of the scheme with applied simulation.
A Key Management Approach For Wireless Sensor NetworksZac Darcy
In this paper we presenta key management approach for wireless sensor networks. This approach
facilitating an efficient scalable post-distribution key establishment that provides different security services.
We have developed and tested this approach under TinyOs. Result shows that this approach provides
acceptable resistance against node capture attacks and replay attacks. The provision of security services is
completely transparent to the user of the WSNs. Furthermore, being highly scalable and lightweight, this
approach is appropriate to be used in a wireless sensor network of hundreds of nodes.
A Key Management Approach For Wireless Sensor NetworksZac Darcy
In this paper we presenta key management approach for wireless sensor networks. This approach
facilitating an efficient scalable post-distribution key establishment that provides different security services.
We have developed and tested this approach under TinyOs. Result shows that this approach provides
acceptable resistance against node capture attacks and replay attacks. The provision of security services is
completely transparent to the user of the WSNs. Furthermore, being highly scalable and lightweight, this
approach is appropriate to be used in a wireless sensor network of hundreds of nodes.
A NEW KEY ESTABLISHMENT SCHEME FOR WIRELESS SENSOR NETWORKSIJNSA Journal
Traditional key management techniques, such as public key cryptography or key distribution center (e.g., Kerberos), are often not effective for wireless sensor networks for the serious limitations in terms of computational power, energy supply, network bandwidth. In order to balance the security and efficiency, we propose a new scheme by employing LU Composition techniques for mutual authenticated pairwise key establishment and integrating LU Matrix with Elliptic Curve Diffie-Hellman for anonymous pathkey establishment. At the meantime, it is able to achieve efficient group key agreement and management. Analysis shows that the new scheme has better performance and provides authenticity and anonymity for sensor to establish multiple kinds of keys, compared with previous related works.
SYMMETRIC KEY MANAGEMENT SCHEME FOR HIERARCHICAL WIRELESS SENSOR NETWORKSIJNSA Journal
Wireless Sensor Networks (WSNs) are critical component in many applications that used for data collection. Since sensors have limited resource, Wireless Sensor Networks are more vulnerable to attacks than other wireless networks. It is necessary to design a powerful key management scheme for WSNs and take in consideration the limited characteristics of sensors. To achieve security of communicated data in the network and to extend the WSNs lifetime; this paper proposes a new scheme called Symmetric Key Management Scheme (SKMS). SKMS used Symmetric Key Cryptography that depends only on a Hash function and XOR operation for securing homogeneous and heterogeneous hierarchical WSNs. Symmetric Key Cryptography is less computation than Asymmetric Key Cryptography. Simulation results show that the proposed scheme provides security, save the energy of sensors with low computation overhead.
SYMMETRIC KEY MANAGEMENT SCHEME FOR HIERARCHICAL WIRELESS SENSOR NETWORKSIJNSA Journal
Wireless Sensor Networks (WSNs) are critical component in many applications that used for data
collection. Since sensors have limited resource, Wireless Sensor Networks are more vulnerable to
attacks than other wireless networks. It is necessary to design a powerful key management scheme for WSNs
and take in consideration the limited characteristics of sensors. To achieve security of communicated
data in the network and to extend the WSNs lifetime; this paper proposes a new scheme called
Symmetric Key Management Scheme (SKMS). SKMS used Symmetric Key Cryptography that depends
only on a Hash function and XOR operation for securing homogeneous and heterogeneous hierarchical
WSNs. Symmetric Key Cryptography is less computation than Asymmetric Key Cryptography. Simulation
results show that the proposed scheme provides security, save the energy of sensors with low
computation overhead.
A key management approach for wireless sensor networksZac Darcy
In this paper we presenta key management approach for wireless sensor networks. This approach
facilitating an efficient scalable post-distribution key establishment that provides different security services.
We have developed and tested this approach under TinyOs. Result shows that this approach provides
acceptable resistance against node capture attacks and replay attacks. The provision of security services is
completely transparent to the user of the WSNs. Furthermore, being highly scalable and lightweight, this
approach is appropriate to be used in a wireless sensor network of hundreds of nodes.
2.espk external agent authentication and session key establishment using publ...EditorJST
Wireless sensor networks (WSNs) have recently attracted a lot of interest in the research community due their wide range of applications. Due to distributed and deployed in a un attend environment, these are vulnerable to numerous security threats. In this paper, describe the design and implementation of public-key-(PK)-based protocols that allow authentication and session key establishment between a sensor network and a third party. WSN have limitations on computational capacity, battery etc which provides scope for challenging problems. We fundamentally focused on the security issue of WSNs The proposed protocol is efficient and secure in compared to other public key based protocols in WSNs.
EVALUATING GALOIS COUNTER MODE IN LINK LAYER SECURITY ARCHITECTURE FOR WIRELE...IJNSA Journal
Due to the severe resource constraints in the Wireless Sensor Networks (WSNs), the security protocols therein, should be designed to optimize the performance maximally. On the other hand a block cipher and the mode of operation in which it operates, play a vital role in determining the overall efficiency of a security protocol. In addition, when an application demands confidentiality and message integrity, the overall efficiency of a security protocol can be improved by using the Authenticated Encryption (AE) block cipher mode of operation as compared to the conventional sequential encryption and authentication. Amongst the AE block cipher modes, the Galois Counter mode (GCM) is the latest recommended AE mode by the NIST. In this paper, we attempt at evaluating the performance of the GCM mode in the link layer security protocol for a WSN viz. TinySec and compare it with the default conventional block cipher modes of operation used therein. To the best of our knowledge ours is the first experimental evaluation of Galois Counter Mode with Advanced Encryption Standard Cipher at the link layer security architecture for WSNs.
Key Management Schemes for Secure Communication in Heterogeneous Sensor NetworksIDES Editor
Hierarchical Sensor Network organization is
widely used to achieve energy efficiency in Wireless Sensor
Networks(WSN). To achieve security in hierarchical WSN,
it is important to be able to encrypt the messages sent
between sensor nodes and its cluster head. The key
management task is challenging due to resource constrained
nature of WSN. In this paper we are proposing two key
management schemes for hierarchical networks which
handles various events like node addition, node compromise
and key refresh at regular intervals. The Tree-Based
Scheme ensures in-network processing by maintaining some
additional intermediate keys. Whereas the CRT-Based
Scheme performs the key management with minimum
communication and storage at each node.
A DEFENSIVE MECHANISM CROSS LAYER ARCHITECTURE FOR MANETS TO IDENTIFY AND COR...IJNSA Journal
The document proposes a defensive cross-layer architecture for MANETs to identify and correct misbehavior in routing. The architecture has four levels: 1) Network topological level outlines basic node connections; 2) Routing level applies security to routing protocols and individual nodes, using a new Time On Demand Distance Vector (TODV) routing; 3) Detection level encrypts packets and uses acknowledgements to detect tampering; 4) Correction level calculates packet loss ratios to identify alternative routes when attacks are detected. The architecture aims to provide end-to-end security across three layers while maintaining network performance.
Enhanced security for non English users of Wireless Sensor NetworksEswar Publications
Wireless Sensor Networks is an infrastructure less, self-configured, reprogrammable, energy-aware network used
in various applications. Many networks works on security of data including mainly ASCII values but not the non English end users. BDNA cryptography describes how to encrypt non English patterns but which leads to propagation of more bits transmitted means indirectly consumes more energy in WSN. In this we propose new steps to reduce the transmission of more bytes in the network. This gives high propagation speed in the network with minimum hash overhead.
This document summarizes a research paper that analyzes and compares the energy consumption of different key management schemes in wireless sensor networks (WSNs). It finds that the NchooseK key management scheme consumes less energy than the pre-shared key (PSK) scheme for various key operations like generation, distribution, encryption, and verification. Through simulations of WSNs of varying sizes, the paper measures the energy used by each scheme during different steps and operations. The results show that NchooseK has more stable and consistent energy patterns compared to PSK, and consumes less energy overall for authentication and communication between sensor nodes. The paper concludes that NchooseK is a more scalable and energy-efficient scheme for key management in W
NEW ALGORITHM FOR WIRELESS NETWORK COMMUNICATION SECURITYijcisjournal
This paper evaluates the security of wireless communication network based on the fuzzy logic in Mat lab. A new algorithm is proposed and evaluated which is the hybrid algorithm. We highlight the valuable assets in designing of wireless network communication system based on network simulator (NS2), which is crucial to protect security of the systems. Block cipher algorithms are evaluated by using fuzzy logics and a hybrid
algorithm is proposed. Both algorithms are evaluated in term of the security level. Logic (AND) is used in the rules of modelling and Mamdani Style is used for the evaluations
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor
SEECH is a secure and energy efficient centralized routing protocol for hierarchical wireless sensor networks. It utilizes a base station to efficiently form clusters based on sensor node energy levels and neighbor information. The base station selects cluster heads that have above average energy and many neighbors. Cluster heads then schedule sensor node transmissions to reduce interference and aggregate and encrypt sensor data before transmitting to the base station or other cluster heads. SEECH aims to prolong network lifetime by minimizing energy consumption through efficient clustering and routing.
A Crypto-System with Embedded Error Control for Secure and Reliable Communica...CSCJournals
In this paper we propose a novel Crypto-System with Embedded Error Control (CSEEC). The system supports data security and reliability using forward error correction codes (FEC). Security is provided through the use of a new symmetric encryption algorithm, while reliability is provided through the support of FEC codes. The system also supports joint security and reliability in which encryption and encoding are performed in a single step. The system aims at speeding up the encryption and encoding operations and reduces the hardware dedicated to each of these operations.In addition, the proposed system allows users to achieve secure and reliable communication in which they can alternate between a priority onsecurity and reliabilityand scale their choice to the desired level in order to attain communication quality and fulfill application needs. The system targets resource constrained nodes such as remote sensor nodes operating in noisy environments.
Similar to Security Model for Hierarchical Clustered Wireless Sensor Networks (20)
हिंदी वर्णमाला पीपीटी, hindi alphabet PPT presentation, hindi varnamala PPT, Hindi Varnamala pdf, हिंदी स्वर, हिंदी व्यंजन, sikhiye hindi varnmala, dr. mulla adam ali, hindi language and literature, hindi alphabet with drawing, hindi alphabet pdf, hindi varnamala for childrens, hindi language, hindi varnamala practice for kids, https://www.drmullaadamali.com
ISO/IEC 27001, ISO/IEC 42001, and GDPR: Best Practices for Implementation and...PECB
Denis is a dynamic and results-driven Chief Information Officer (CIO) with a distinguished career spanning information systems analysis and technical project management. With a proven track record of spearheading the design and delivery of cutting-edge Information Management solutions, he has consistently elevated business operations, streamlined reporting functions, and maximized process efficiency.
Certified as an ISO/IEC 27001: Information Security Management Systems (ISMS) Lead Implementer, Data Protection Officer, and Cyber Risks Analyst, Denis brings a heightened focus on data security, privacy, and cyber resilience to every endeavor.
His expertise extends across a diverse spectrum of reporting, database, and web development applications, underpinned by an exceptional grasp of data storage and virtualization technologies. His proficiency in application testing, database administration, and data cleansing ensures seamless execution of complex projects.
What sets Denis apart is his comprehensive understanding of Business and Systems Analysis technologies, honed through involvement in all phases of the Software Development Lifecycle (SDLC). From meticulous requirements gathering to precise analysis, innovative design, rigorous development, thorough testing, and successful implementation, he has consistently delivered exceptional results.
Throughout his career, he has taken on multifaceted roles, from leading technical project management teams to owning solutions that drive operational excellence. His conscientious and proactive approach is unwavering, whether he is working independently or collaboratively within a team. His ability to connect with colleagues on a personal level underscores his commitment to fostering a harmonious and productive workplace environment.
Date: May 29, 2024
Tags: Information Security, ISO/IEC 27001, ISO/IEC 42001, Artificial Intelligence, GDPR
-------------------------------------------------------------------------------
Find out more about ISO training and certification services
Training: ISO/IEC 27001 Information Security Management System - EN | PECB
ISO/IEC 42001 Artificial Intelligence Management System - EN | PECB
General Data Protection Regulation (GDPR) - Training Courses - EN | PECB
Webinars: https://pecb.com/webinars
Article: https://pecb.com/article
-------------------------------------------------------------------------------
For more information about PECB:
Website: https://pecb.com/
LinkedIn: https://www.linkedin.com/company/pecb/
Facebook: https://www.facebook.com/PECBInternational/
Slideshare: http://www.slideshare.net/PECBCERTIFICATION
Communicating effectively and consistently with students can help them feel at ease during their learning experience and provide the instructor with a communication trail to track the course's progress. This workshop will take you through constructing an engaging course container to facilitate effective communication.
Beyond Degrees - Empowering the Workforce in the Context of Skills-First.pptxEduSkills OECD
Iván Bornacelly, Policy Analyst at the OECD Centre for Skills, OECD, presents at the webinar 'Tackling job market gaps with a skills-first approach' on 12 June 2024
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) CurriculumMJDuyan
(𝐓𝐋𝐄 𝟏𝟎𝟎) (𝐋𝐞𝐬𝐬𝐨𝐧 𝟏)-𝐏𝐫𝐞𝐥𝐢𝐦𝐬
𝐃𝐢𝐬𝐜𝐮𝐬𝐬 𝐭𝐡𝐞 𝐄𝐏𝐏 𝐂𝐮𝐫𝐫𝐢𝐜𝐮𝐥𝐮𝐦 𝐢𝐧 𝐭𝐡𝐞 𝐏𝐡𝐢𝐥𝐢𝐩𝐩𝐢𝐧𝐞𝐬:
- Understand the goals and objectives of the Edukasyong Pantahanan at Pangkabuhayan (EPP) curriculum, recognizing its importance in fostering practical life skills and values among students. Students will also be able to identify the key components and subjects covered, such as agriculture, home economics, industrial arts, and information and communication technology.
𝐄𝐱𝐩𝐥𝐚𝐢𝐧 𝐭𝐡𝐞 𝐍𝐚𝐭𝐮𝐫𝐞 𝐚𝐧𝐝 𝐒𝐜𝐨𝐩𝐞 𝐨𝐟 𝐚𝐧 𝐄𝐧𝐭𝐫𝐞𝐩𝐫𝐞𝐧𝐞𝐮𝐫:
-Define entrepreneurship, distinguishing it from general business activities by emphasizing its focus on innovation, risk-taking, and value creation. Students will describe the characteristics and traits of successful entrepreneurs, including their roles and responsibilities, and discuss the broader economic and social impacts of entrepreneurial activities on both local and global scales.
How to Make a Field Mandatory in Odoo 17Celine George
In Odoo, making a field required can be done through both Python code and XML views. When you set the required attribute to True in Python code, it makes the field required across all views where it's used. Conversely, when you set the required attribute in XML views, it makes the field required only in the context of that particular view.
Gender and Mental Health - Counselling and Family Therapy Applications and In...PsychoTech Services
A proprietary approach developed by bringing together the best of learning theories from Psychology, design principles from the world of visualization, and pedagogical methods from over a decade of training experience, that enables you to: Learn better, faster!
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.
This document provides an overview of wound healing, its functions, stages, mechanisms, factors affecting it, and complications.
A wound is a break in the integrity of the skin or tissues, which may be associated with disruption of the structure and function.
Healing is the body’s response to injury in an attempt to restore normal structure and functions.
Healing can occur in two ways: Regeneration and Repair
There are 4 phases of wound healing: hemostasis, inflammation, proliferation, and remodeling. This document also describes the mechanism of wound healing. Factors that affect healing include infection, uncontrolled diabetes, poor nutrition, age, anemia, the presence of foreign bodies, etc.
Complications of wound healing like infection, hyperpigmentation of scar, contractures, and keloid formation.
Security Model for Hierarchical Clustered Wireless Sensor Networks
1. Kalpana Sharma & M.K. Ghose
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (1) : 2011 85
Security Model for Hierarchical Clustered Wireless Sensor
Networks
Kalpana Sharma kalpanaiitkgp@yahoo.com
Department of CSE, SMIT,
Sikkim, India
M.K. Ghose mkghose2000@gmail.com
Department of CSE, SMIT,
Sikkim, India
Abstract
The proposed security system for the Wireless Sensor Network (WSN) is based on the WSN
security design goal that ‘to design a completely secure WSN, security must be integrated into
every node of the system’. This paper discusses on two main components of the security
framework viz. the secure key management module and the secure routing scheme. The
incorporation of security mechanism during the routing protocol design phase is the main focus of
this paper. The proposed security framework viz. ‘Secure and Hierarchical, a Routing Protocol’
(SHARP) is designed for the wireless sensor network applications which is deployed particularly
for data collection purpose in a battlefield where the security aspect of the network cannot be
compromised at any cost. SHARP consists of three basic integrated modules and each module
performs a well defined task to make the whole security framework a complete system on its own.
Keywords: WSN, Security, Hierarchical Clustering, Cluster Heads, Routing, Key Management
1. INTRODUCTION
Wireless Sensor Networks ( WSN) are a class of mobile ad-hoc network(MANET) which consists
of a hundreds/ thousands of sensor nodes deployed in the area of interest to accomplish a
particular mission like habitat monitoring, agricultural farming , battlefield surveillances etc. The
sensor nodes are resource constraint devices in the sense that they’ve limited memory,
computational capacity, limited transmission range and operate on a battery thus having limited
energy also. Despite these inherent limitations these tiny nodes are used in a variety of
applications as they have the ability to sense the environment, process the captured data,
aggregate the data and send it wirelessly to the destination which is a powerful entity called the
Base Station ( BS). Complex cryptographic solutions which are meant for traditional networks
cannot be used in the WSN because such algorithms demand a huge computation capability, a
large storage space, large bandwidth and unlimited energy supply which a tiny node cannot
provide. So instead of concentrating on such complex security algorithms, a lightweight security
solutions sound more realistic for the resource starved sensor nodes. Further a security solution
concentrating in only one layer, for example physical layer or link layer or network layer, proves to
be insufficient for the WSN because such security solution doesn’t provide sufficient security to all
the layers. So a more practical security solution for WSN would be the development of a security
framework consisting of many security service components to provide multi-level security
services [6, 8]. Such a framework should interact with all the modules of various protocol layers to
provide robust security to the WSN. As per Boyle et al. ‘to achieve a completely secure WSN,
security must be implemented into every node of the system’ [1]. This paper attempts to integrate
services provided to the link layer and the network layer to come up with an integrated security
solution. The integrated framework of this paper consists of three basic modules forming the core
2. Kalpana Sharma & M.K. Ghose
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (1) : 2011 86
of the proposed security platform. Nevertheless these modules can be used as stand alone
modules as well.
There are basically three types of communication in a WSN environment. Theses are one to one
communication, many to one and one to many. To secure these communications, the key
management module establishes various kinds of keys. To secure the whole WSN, all
communication types needs to be secured. Secure keying techniques presented in this paper
provides a combination of different kind of keys for secure communication .The secure routing
scheme presented in this paper ensures that the messages, using these keys,are securely routed
by the nodes and the Cluster Heads (CH) to their final destination i.e. the BS.
The topology that has been considered in this paper is a hierarchical clustering approach. Using
this topology the coupling of the security mechanisms like the key usage as well as the routing
has been proposed. The proposed security framework is composed of three different modules.
These modules are 1) Hierarchical Cluster formation module in which the issues like the
formation of tracks, sectors, cluster heads, and neighbor selection are addressed. 2) Key
Management module which is responsible for the distribution and maintenance of the keys used
in the network. 3) Secure Routing module is responsible for the communication between the BS
and other nodes of the network.
The rest of the paper is organized as follows. Section 2 deals with the overview on the related
work followed by section 3 which deals with the details pertaining to the module which is
responsible for cluster formation. Key management techniques of the proposed framework is
presented in section 4 followed by section 5 in which proposed ‘Routing Scheme’ is discussed.
Finally in section 6I results and discussions are presented followed by conclusions in section 7.
2. RELATED Work
The various efforts to design optimal security architectures for the WSNs that have been
specified/implemented to-date have been described in [1]. The authors have reported that the
symmetric key cryptography based architectures have been the main source of security in the
WSN to date. Key management is an important activity for ensuring sensor data integrity and
securing the WSN communications through cryptographic technique. Design efforts to achieve
optimal security architectures of key management for the WSNs are discussed in [1].Key
management techniques that have been reported so far can be categorized as follows [24, 25]:
a. Random key Pre-distribution scheme: An example of Random-key pre-distribution schemes
is Peer Intermediaries for Key Establishment (PIKE) [26]. PIKE uses probabilistic techniques
to establish pair wise keys between neighboring nodes in the network. However, in this
approach, each node has to store a large number of keys.
b. Master-key-based scheme: In this scheme, the nodes share unique symmetric keys with the
Base station. These keys are assigned before the network is deployed. This involves a
significant pre-deployment overhead which is not scalable. Examples of this scheme are
Security Protocols for Sensor Networks (SPINS) [2] and Localized Encryption and
Authentication Protocol (LEAP) [3], which is discussed in detail in subsequent sections.
c. BS based scheme: Hierarchical Key Establishment Scheme (HIKES) proposed by Ibriq et al.
[27] is an example of BS based scheme. In this scheme, the Base station, acts as the central
trust authority and empowers randomly selected sensors to act as local trust authorities.
These nodes authenticate the cluster members and issue all secret keys on behalf of the
Base station. HIKES uses a partial key scheme that enables any sensor node selected as a
CH to generate all the cryptographic keys needed to authenticate other sensors within its
cluster. The main drawback of this scheme is the storage overhead of the partial key table in
every node.
3. Kalpana Sharma & M.K. Ghose
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (1) : 2011 87
Undercoffer et al. [28] have proposed a security model considering the BS as a trustworthy
authority of the entire framework of the sensor network. In this protocol the BS disallows a sensor
node from participating in the network, if it detects a node behaving anomalously or becomes
compromised. The main drawback of this scheme is the usage of shared keys among the nodes
as Zhu et al. [10] have pointed out that a single keying scheme is not sufficient to secure the
entire WSN.
Four different keying mechanisms have been provided in Localized Encryption and Authentication
Protocol (LEAP) [3], keeping in mind the need for different security requirements for different
types of messages. These include the Individual Keys, Group Keys, Cluster Keys and Pairwise
Shared Keys. The usage of four different keys supports in-network processing and at the same
time restricts the security impact of a node- compromise to only the group members of that node.
LEAP + [4] is an improved version of LEAP. Unlike LEAP, a new node sends a message to
establish both the pairwise key and the cluster key in LEAP +.
The concept of ‘Secure Triple-Key Management Scheme’ is proposed in [6]. The main drawback
of the scheme is that it supports the pre-development key management scheme. TinySec [14]
assumes to have a global common secret key among the nodes that is assigned prior to the
deployment of the network in order to provide encryption and authentication in the link layer. A
standard 8 byte key length is specified for use in the protocol [4], thus making it possible to
address smaller sized messages. In [7] the authors have described a scheme for pre-key
distribution based on the prior deployment knowledge of the sensor nodes. New schemes for key
management for confidential communication between node and its cluster head in hierarchical
sensor networks is discussed in [5] wherein the performance analysis was done which shows that
Tree- Based Scheme exhibits better performance with some additional storage. SHARP is
motivated by the security framework presented by Zia and A.Y. Zomaya, in their research paper
“A Secure Triple-Key Management Scheme for wireless sensor networks” [6]. In their paper the
authors have used the concept of secure triple-key management scheme. In [8] the authors have
presented a security framework discussing the cluster formation and leader election process,
secure key management scheme, secure routing and their algorithms, which is the main
motivation of this research work presented in this paper. TinySec [14] has been the de facto
security solution at Berkeley. The performance of the proposed framework SHARP has been
compared with TinySec and is discussed in section 6. Raman et. al. in their paper [16] has bought
out that WSN protocols are very deeply dependent on application scenarios, but most of
protocols does not use any specific application in its design to achieve this interaction. In [17] the
authors have in general described the relationship between the development of various security
algorithms and the resources constraint nature of the sensor nodes. A Path Redundancy Based
Security Algorithm for Wireless Sensor Networks is discussed in [18] but this security solution is
also not integrated security solution and concentrates only in one aspect of security service for
the WSN. In [19] Khalil et al. have described an interactive solution only for the resource
allocation for the WSN but is not intended for security solution .So it is to be noted that very less
research work is being reported in the integration of the security solution.
3. CLUSTER FORMATION MODULE
The main aim of hierarchical routing is to efficiently maintain the energy consumption of sensor
nodes by involving them in multi-hop communication within a particular cluster and by performing
data aggregation and fusion in order to decrease the number of transmitted messages to the sink.
Cluster formation is typically based on the energy reserve of sensors and sensor’s proximity to
the cluster head [20]. The hierarchical clustering technique proposed is described in this section.
4. Kalpana Sharma & M.K. Ghose
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (1) : 2011 88
FIGURE1: DCH/RCH of a cluster
Division of the whole network is done in terms of track and sector in order to provide energy
efficient and storage efficient key establishment. A detail pertaining to track- sector is available in
[9]. The Base station (BS) would divide the network into tracks and sectors. Tracks are required
in order to reduce the communication with the BS as most of the nodes belonging to track 1
would serve as “Routing CH” (RCH). In this context the BS would be assumed to be in track 0.
Tracks are further divided into sectors. The nodes belonging to the same sector communicate
with each other as buddy and in order to be buddy ,each node after getting its sector information
and track information from the BS, starts “Neighbor finding phase’ or ‘buddy discovery phase’.
Once the neighbors are identified each node stores their neighbor information in ‘buddy info
table’. This work is an extension of [11] in which a naïve idea about the selection of the Data
Cluster Head (DCH) and Routing Cluster Head (RCH) as well as ‘ Neighbor finding” algorithms
are already presented. The reason for dividing the Cluster Heads (CHs) into RCH and DCH is as
follows: Rather than a single CH performing both data aggregation and data transmission to the
BS this load is divided among two sensor nodes which act as the DCH and RCH in a sector. The
BS selects two sensor nodes in each sector as the DCH and the RCH as shown in figure 1. The
node preferably in the centre of each sector is selected as the DCH and the node with the
minimum distance to the BS in that sector is selected as the RCH. Figure 1 has been reproduced
from [13].
DCH is responsible for data aggregation and sending the aggregated data to the RCH. RCH in
turn transmits these data packets to the BS if it is in track1 or else it sends to the nearest
DCH/RCH belonging to a track of higher level in the track-sector hierarchy. When the number of
the nodes in a particular sector is less, then a single CH would act as both RCH/DCH in order to
conserve energy.
Division of the network into track-sector and selection of RCH/DCH is the responsibility of the BS.
The following assumptions are made in the context of the role of BS in the proposed security
framework.
1) Location of each node is known to the BS.
2) Time Division multiplexing (TDM) is used for communication in a group.
3) The BS is very powerful with a huge computational capability.
5. Kalpana Sharma & M.K. Ghose
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (1) : 2011 89
4) Before any transmission takes place, all the nodes have to register themselves with BS.
5) The BS does the clustering on the basis of the location of the nodes thus dividing the
whole network into say ‘n’ tracks and ‘m’ sectors where n>>m. The base station also selects
cluster head for each sector.
6) The responsibility of the Cluster Head is as follows:
i) Data aggregation
ii) Encoding of the message sent by the nodes belonging to its track/sector.
iii) Communication with the base station.
iv) The “key table” maintenance.
7) The role of CH is rotational as CH has additional duties in comparison with other nodes.
This is done in order to conserve energy or to increase the longitivity of the network.
4. KEY MANAGEMENT MODULE
It is a proven fact that a single keying technique is not appropriate to secure all the
communication types of the WSN [10]. So a good keying mechanism should consist of a
combination of variety of keying techniques like ‘in-network generated keys’, ‘pre-deployed keys’
and ‘broadcast keys’ [5]. The key management module of this work does not rely on a single key
type but makes use of all the above mentioned keys.
4.1. Types of Keys of the Proposed Secure Keying Scheme
Once the ‘neighbor discovery ‘phase is over and all the nodes have updated their respective
‘buddy info table’, the BS initiates the key distribution process. In general pair-wise key
distribution scheme is set up between the neighbors [12].
In the key management module of this paper there are three broad categories of key 1. Pre-
deployed keys 2) In network generated keys and 3) BS broadcasted keys. Before introducing the
keys used in this paper, the type of communication of WSN are to be noted. These are as follows:
1. Type 1 communication :Node to Node communication i.e. N:N
2. Type 2 communication :Node to Cluster Head Communication i.e. N : CH
3. Type 3 communication :Cluster Head to BS Communication CH:BS
4. Type 4 communication :Node to BS i.e. N: BS
5. Type 5 communication :BS to Nodes i.e. BS:N
6. Type 6 communication :DCH to RCH Communication i.e. D:R
The following keys are used in the proposed protocol;
1) Buddy key (Kb) is calculated by all the nodes once the neighbor finding work is over. It is
used to communicate by each node within its own sector/cluster i.e. for N: N
communication.
2) My-Own-Key (Ko) is used by each and every node initially. All the nodes are preloaded
with its id and this key is a function of node id, sector-id, track-id, and its residual energy.
Ko is used for N: BS communication.
3) Network key ( Kn) is issued by the BS after authentication to all the nodes. If a node joins
the network it has to send a request to BS for acquiring network key. This request is sent
by all the nodes to the BS encrypting it by Ko. BS sends the ‘Kn’ to the requesting nodes
encrypting it with ‘Ko’ of that particular node. Only the node which is authentic can decrypt
this ‘Kn’. Kn is used for BS: N as well as for N: CH communication.
4) Cluster Key ( Kc) is calculated by CHs for D:R communication.
5) Broadcast Key (Kbro) is issued by the BS after authentication as CHs. Kbro is used for CH:
BS communication.
Node to node communication is nothing but the intra cluster communication which is done using
buddy- Key. For simplicity all the keys used in this proposed security framework is listed in the
table 1 given below.
6. Kalpana Sharma & M.K. Ghose
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (1) : 2011 90
Type of key Composition Origin User/communication
type
My-Own-Key
( Ko)
f(node-id, sector-id,
remaining energy
level)
Node id preloaded,
Nodes calculate it and
BS knows it all
All the nodes of the
Network i.e. N: BS and
BS: N communication.
Buddy-Key
( Kb)
*Idsender +
f(Idreceiver ,track-id)
All the nodes belonging
to the same sector
calculate it. Here
sectorid (i)=sectorid(j)
All the neighboring
nodes belonging to the
same sector. For N: N
Communications
Network key
( Kn)
Calculated by BS BS to all the nodes All the nodes.
Broadcast key
( Kbro)
BS Generated Distributed by BS to
RCH & DCH
RCH to BS.
Cluster key
( Kc)
f(node id, sector-id,
track-id)
Calculated by DCH &
RCH.
DCH and RCH.
TABLE 1: Keys usage in various WSN Communication types
* + indicates concatenation operation
4.2 Achieving Security Through the Usage of the Keys
Four rules have been devised for the usage of the keys and Routing.
1. Key distribution: Not all the keys are distributed by the BS. Keys like Kb, Kc and Ko are
calculated by each node in the network.
2. Key usage : The key usage rules are discussed in section 4.2.1
3. Key refreshment
• Broadcast key (Kbro) as well as Network key (Kn) are refreshed by the BS at regular
interval of time. This refreshment ensures that the nodes belonging to the network is
well authenticated from time to time.
4. Key Maintenance: Each node in the network maintains the databases of the following
• Its own key (Ko).
• Network key ( Kn).
• Buddy key ( Kb).
• Broadcast key (Kbro) and Cluster Key (Kc) (In case of the nodes playing the role of
DCH or RCH).
4.2.1 Key Usage
It is essential for all the nodes to know/ calculate their own key Ko. Also all the nodes should
possess Kn to take part in the communication as Kn is used for encrypting/ decrypting all the
messages broadcasted by the BS from time to time.
Let the initial message to be sent to the DCH by the ordinary node be IM. This first message
format would look like this:
Message( M) = { Kb, TS,MAC, IM}
Here TS is the timestamp used to avoid replaying of the messages, MAC is used for
authenticating the message. This first message is encrypted using Kb because RCH/DCH is
nothing but a buddy to the node in the same sector.
DCH and RCH communicate with each other using cluster key. DCH and RCH compute their
cluster-key which is simply a function of their own id, sector-id and track-id. Here sector id may be
dropped but for generalization sector id is also considered though all the DCH and RCH should
belong to the same sector. But to address the situations where RCH may not be directly
communicating with the BS in hierarchical clustering nature of the network, a DCH may have to
communicate with DCH or RCH of the cluster above it. So sector id is retained. DCH, RCH
communication is encrypted using cluster key. Since DCH is responsible for data aggregation
7. Kalpana Sharma & M.K. Ghose
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (1) : 2011 91
DCH would send the aggregated message to RCH encrypting it using the Kc and the message
format looks like this:
DCH Message( DM) = { Kc,{ Kb, TS,MAC, aggregated (M)}}
Since the number nodes in a particular sector varies and if the number of nodes are less then
RCH will function as both DCH and RCH to save energy.
Now for type 3 communication, apart from Kc, another key called Kbro is needed. To get hold of
Kbro DCH/RCH sends the request message to BS encrypting it using its own-key. BS knows
which node has dual function as RCH, RCH and which all have separate DCH, RCH. Accordingly
it sends Kbro to the requesting CH encrypting them with my-own-key of the requesting nodes. So
once DCH, RCH acquire the Kbro, communication to RCH to BS takes place encrypting the
message by Kbro and the message format looks like this
RCH Message( RM) = { Kbro,{ Kc,{ Kb, TS,MAC, (DM)}}}
The real challenge here is the maintenance of the buddy key. It is already stated that all the
nodes set up their keys by communicating with their neighboring node. If a node has to
communicate with a large number of neighbors then the WSN has to compromise on its space
requirement vs security.
5. SECURE ROUTING MODULE
BS initiates the routing process once the hierarchical clustering topology is fixed and also key
distribution is done. Each node is authenticated by their unique id BS has in depth knowledge
about a) Id of each node b) Sector no of each node. c) Track no of each node d) Energy level of
each node. The BS keeps track of this information in a table which is updated from time to time.
When the sensor nodes send a request to BS to join the network encrypting this request with Ko,
the BS will be able to decrypt the request message of only the genuine nodes of the network.
Once a node is authenticated BS sends the requesting node the network key. When any CH
node makes a request for Kbro the BS sends the authentic node the broadcast key. Message
pertaining to kbro is encrypted using my-own-id key of the requesting CH. If BS needs to
broadcast any message to all the nodes then it encrypts the message using Kn. The ‘data
collection table’ which is maintained by the BS is updated after processing the data and obtaining
the original message sent by the nodes.
The algorithm for ‘Secure Routing’ is presented in 5.1.
5.1 Algorithm BS
Algorithm: Secure Routing
[1] Begin
[2] Step1. if BS receives request for authentication from a node then
[3] goto step2
[4] else
[5] goto step1
[6] end if
[7] Step2. Check the authenticity of the node
[8] Step2.1. Request node sends its request message to BS
[9] Step2.1.1. M’=E (M, K0)
[10] Step2.1.2. SEND M’
[11] Step2.2. BS decrypts the request message
[12] Step2.2.1. RECEIVE M’
[13] Step2.2.2. M = D (M’, K0)
[14] Step3. Send network key after node is authenticated by BS
[15] Step3.1. M’=E (Kn, K0)
[16] Step3.2. Decrypts message to obtain network key
8. Kalpana Sharma & M.K. Ghose
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (1) : 2011 92
[17] Step3.3. Kn=D(M’,K0)
[18] Step4. if CH node makes a request then
[19] BS sends broadcast key
[20] M’=E(Kbro,K0)
[21] end if
[22] Step5. if BS needs to broadcast message then
[23] M’ = E (M, Kn)
[24] else
[25] listen
[26] goto step1
[27] end if
[28] Step6. if decryption successful at node then
[29] goto step7
[30] else
[31] discard M’
[32] goto step10
[33] end if
[34] Step7. Compute M = D (M’, Kn)
[35] Step8. Update ‘data collection table’
[36] Step9. goto step11
[37] Step10. if data retransmission necessary then
[38] Broadcast message
[39] else
[40] goto step1
[41] end if
[42] Step11. End
This algorithm is implemented in C++ and the results have been compared with that of TinySec
[14] and Triple-Key security algorithm [6].
It is also to be noted that the encryption/ decryption technique used in this algorithm is RC5 block
cipher. A detail on feasibility on the RC5 usage in the WSN is available in [21, 22].
6. RESULT ANALYSIS
To analytically evaluate the cost of the security of the proposed security platform computation
overhead, communication overhead and storage overhead for packet processing is considered.
To extend the battery life of resource constraint sensor nodes it is necessary to limit the energy
consumption. But to provide security to the WSN a price have to be paid in terms of significant
amount of energy consumption for bare minimum and unavoidable requirement of security
services like encryption, decryption, and key management. Key management also demands extra
storage space to store the required keys for the secure communication. The performance
comparison provided in this section presents the space and computation overhead.
The packet format for SHARP is shown below. The performance comparison is done with
TinySec [14] and Triple Key [6, 8] the packet format. All the values are in bytes.
6.1 Packet Formats
Dest AM GRP Length Data CRC
2 1 1 1 29 2
Tiny OS
Dest track-
id
keys L sector
id
Src TS Data MAC
1 1 5 1 1 1 1 29 4
Proposed packet format
9. Kalpana Sharma & M.K. Ghose
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (1) : 2011 93
Dest AM Length Data MAC
2 1 1 29 4
TinySec –Auth
Dest AM Length Src Ctr Data MAC
2 1 1 2 2 29 4
TinySec-AE
ID Keys TS Data MAC
5 4 1 29 4
Triple Key
For SHARP since all the keys are the function of node-id, sector-id, track-id, at most (5+1+1+1+1)
bytes i.e. 9 bytes are required for key and ID storage. MAC is used for message authentication
and integrity. All the values are in bytes. In SHARP the data packet is not more than 44 bytes
long and these packets can be transmitted easily in sensor nodes available in the market today.
6.2 Performance Comparison –Computation Overhead
The comparison of packet size overhead for TinySec, TripleKey and SHARP is shown in Table
5.2. The values pertaining to TinySec is obtained from [14] whereas TripleKey values are
obtained from [21].
Application
data
(bytes)
Packet
Overhead
Total
Size
Time to
transmit
( ms)
Increase
over
TinyOS
Stack
(%)
Latency
overhead
(%)
Energy
overhead
(%)
TinySec-
Auth
29 8 37 26.6 1.5 1.7 3
TinySec-
AE
29 12 41 28.8 8 7.3 10
TripleKeys 29 11 40 28.3 6.3 5.9 2.8
SHARP 29 15 44 30.7 12.8 11.5 12.2
TABLE 2: Comparison of SHARP with TinySec & Triple-Keys
There is an increase in the packet size for the proposed security solution. It results in an increase
in the usage of bandwidth and energy needed to send the packets, as evident from Figure 2 and
Table 2. However, this framework provides multiple layers of security. It is also observed that
there is an increase in time to transmit parameter. Accordingly, there is 9% increase over current
TinyOS stack, which can be compensated by multiple-layer of security provided by SHARP.
The energy overhead of TinySec and Triple keys is comparatively lesser than that of SHARP.
However, SHARP overcomes the shortcomings of all these protocol with acceptable energy
overhead. The graphical representation based on the packet sizes are provided in Figure 2.
10. Kalpana Sharma & M.K. Ghose
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (1) : 2011 94
FIGURE 2: Packet size comparison.
6.2.1: Advantages of SHARP over TinySec:
TinySec is not a complete security framework. It is based on a number of assumptions as defined
below:
• TinySec concentrates only on Link Layer Security.
• There is no particular keying mechanism specified for TinySec.
SHARP addresses both these shortcomings but it is at the cost of increased packet size. This
increase in packet size is an acceptable to be used for the sensor nodes available in the market.
6.2.2: Advantages of ISF over TripleKeys
Triple-Keys have shown considerable savings in bandwidth and battery life, thus have energy
advantage over both TinySec and SHARP. However, it has following deficiencies, which have
been addressed in the proposed ISF scheme.
• To reduce the packet size, the AM field of the of the triple-key packet format is dropped.
Hamed et al [26] have observed that the removal of AM type field introduces several
major problems for upper layer services as it directly affects the Active Message Model of
TinyOs.
• The id and key fields are combined. Moreover, the number of bytes reserved for the
source / destination fields of the message are not mentioned.
• The scheme uses three keys, two of which are pre-deployed keys. These important pre-
deployed keys when compromised, the whole network is compromised. ISF being a
multilayered security scheme, the compromise of a key of a particular sector effect only
that cluster but not the entire network.
6.3 Storage Overhead
As it is known that all the nodes in this WSN need to store keys for communication. A simple
node stores at least three keys for encryption process throughout and the minimal keys being my-
own-id key, network key and buddy key (which is with respect to its neighbors).Apart from this if
the node is DCH / RCH it needs to store all the three above mentioned keys as well as cluster
key and Broadcast key. It obviously increases the storage overhead. But not all the keys are pre-
loaded. Two keys i.e. network key, and broadcast keys are always broadcasted by the BS and
my-own-id keys are only pre-loaded. Yet the storage overhead is expressed as (for any node)
Storage overhead= [Size of(Ko)+Kb ( X-Y)+Kn]
where X is the total number of the nodes in the WSN and Y is the subset of X which is nothing but
the population of only those nodes which belong to the same sector i.e. selected neighbors of
that particular node belonging to the same sector. The storage overhead for DCH/RCH would be
11. Kalpana Sharma & M.K. Ghose
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (1) : 2011 95
Storage overhead= [Size of(Ko)+Kb ( X-Y)+Kn+ Kc+ Kbro]
Even if the default key size is considered to be 10 bytes each and the maximum number of
neighbors is taken as 50, the storage overhead for an ordinary node would be 60 bytes and for a
CH it would be at most 90 bytes which is less than 1 KB. This overhead is acceptable as almost
all the sensor nodes available in the market including Berkeley’s motes have a memory size of
more than 4 KB.
Though there is an overhead in storage but on the flip side because of the hierarchical clustering
techniques there’re two CHs in a single cluster which results in a multi-hop communication which
obviously results in energy efficiency in comparisons with those clustering techniques in which
there is only one cluster head, as in [13]. The simulations results reported in [13] are comparable
with that of LEACH [15] in certain cases.
To summarize the overall performance of SHARP it is to be noted that when the algorithm
presented in section 5 is to be implemented in the same environment where TinySec is
implemented and the same sized application data is considered then it can be predicted that
there would be an increase in ‘Time to transmit parameter. It is because of the increase in the
packet size. Thus there would be at most 9% increase over current TinyOS stack. But this
increase is compensated by ‘multiple-layer’ of security provided by SHARP.
Again it is to be noted that the security framework presented in [6] have single point of failure as
there’s only one cluster head. Moreover when the cluster keys are to be stored then it requires
more storage space than SHARP as the clustering in this work is not only hierarchical but also
energy efficient because of the division of the network into tracks and sector .As already stated
the number of neighbors is restricted because of the division of the network into tracks and
sectors. Tracking and sectoring not only restricts the no. of neighbors with whom key
establishment needs to be done but also aids in energy conservation. Energy efficient key
management technique is thus made possible by adapting the concept of sectoring and tracking
which is a new concept in this proposed protocol. In case of a node compromise, the nodes
belonging only to the’ buddy set’ are compromised but not the entire network. To manage the
buddy set, computation is preferred over communication as communication is much more
expensive than computation in WSN.
7. CONCLUSION
This work is motivated by the research work presented in [6, 8]. In this paper an effort has been
made to couple Routing with Secure key management. Track /Sector and selection of two CHs
has been unique features of this paper. The security scheme presented in this paper is energy
efficient and at the same time it ensures that the whole network is never compromised even if
there has been an attack in the network. This is possible because of clustering in terms of
tracking and sectoring. However, there’s a scope of improvement in this framework also. First of
all if the nodes calculate most of the in its own level rather than depending on the BS to
communicate the keys then there would be a lot of energy saving. If the packet size is reduced by
dropping some of the redundant fields by decreasing the size of the keys stored then there would
be less bandwidth usage. Further the whole security framework can be simulated/ implemented
using the ‘real sensor network scenario’ using real sensor nodes. Further, the security framework
can be implemented in Berkeley’s motes for accurate results and for performance comparison
with TinySec.
8. REFERENCES
1. David Boyle and Thomas Newe,” Securing Wireless Sensor Networks: security Architectures”
(2008), Journal of Networks, VOL. 3, NO. 1,pp 65-77.
2. Adrian Perrig, Robert Szewczyk, Victor Wen, David Culler, and J.D.Tygar. Spins: Security
protocols for sensor networks. Wireless Networks, 8:521 – 534, 2002.
12. Kalpana Sharma & M.K. Ghose
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (1) : 2011 96
3. Zhu, S., Setia, S., Jajodia, S. (2003) ‘LEAP: Efficient Security Mechanisms for Large-Scale
Distributed Sensor Networks’, CCS ’03, Washington D.C., USA, 27 – 31 October 2003, New
York, USA: ACM Press, 62-72.
4. Zhu, S., Setia, S., Jajodia, S. (2006) ‘LEAP+: Efficient Security Mechanisms for Large-Scale
Distributed Sensor Networks’, ACM Transactions on Sensor Networks TOSN,2(4), 500-528.
5. A.S.Poornima and B.B.Amberker,” Key Management Schemes for Secure Communication
in Heterogeneous Sensor Networks”, International Journal of Recent Trends in Engineering,
Vol 1, No. 1, May 2009.
6. T.A Zia and A.Y. Zomaya, ‘A Secure Triple-Key Management Scheme for wireless sensor
networks’, in the proceedings of INFOCOM 2006,25th IEEE International Conference on
Computer Communications, Barcelona, pp1-2 ,23-29 April 2006 .
7. W. Du, J. Deng, Y.S. Han, P.K. Varshney, A key predistribution scheme for sensor networks
using deployment knowledge, IEEE Transactions on Dependable and Secure Computing,
Vol. 3, issue 1, Jan-March 2006 pp.62-77.
8. Tanveer Zia and Albert Zomaya,” A Security Framework for Wireless Sensor Networks “,
SAS 2006 – IEEE Sensors Applications Symposium Houston, Texas USA, 7-9 February
2006.
9. Navin Gautam, Won-Il Lee, Jae-Young Pyun, "Track-Sector Clustering for Energy Efficient
Routing in Wireless Sensor Networks," cit, vol. 2, pp.116-121, 2009 Ninth IEEE International
Conference on Computer and Information Technology, 2009.
10. Du X, Xiao Y, M Guizani, Chen H.H, (2007) “Effective key management for sensor networks,
an effective key management scheme for heterogeneous sensor networks”, Ad Hoc
Networks, Volume 5, Issue 1, 1 January 2007, Pages 24-34.
11. Kalpana Sharma, S.K. Ghosh, and M.K. Ghose ‘Establishing an Integrated Secure Wireless
Sensor Network System: A New Approach’, International Journal of Next Generation
Networks ( IJNGN), Sept.2010
12. D. Liu and P. Ning, “Establishing Pairwise Keys in Distributed Sensor Networks”, ACM CCS
2003.
13. Kalpana Sharma, Anurag S. Rathor, S. R. Biradar, M.K Ghose ,‘Power-efficient Routing &
Increased Yield Approach for WSNs ‘,International Journal on Computer Science and
Engineering (IJCSE),Vol. 02, No. 03, 2010, pp 586-592.
14. C. karlof, N. Shastry and D. Wagner, TinySec: A link layer security architecture for wireless
sensor networks, SenSys’04, November 3-5, 2004, Baltimore, Maryland, USA
15. Heinzelman, A. Chandrakasan and A. Balakrishnan,’ Energy-Efficient Communication
Protocol for Wireless Microsensor Networks’, proceedings of the 33rd Hawaii International
Conference on System Science, Jan 2000.
16. Bhaskaran Raman et. al, ‘Censor Networks: A Critique of “Sensor Networks” from a Systems
Perspective’, ACM SIGCOMM Computer Communication Review, Volume 38, Number 3,
July 2008.
17. Al-Sakib Khan Pathan et al. “Security in Wireless Sensor Networks: issues and
Challenges”, ICACT2006 in Feb. 20-22, 2006, ISBN 89-5519-129-4 pp(1043-1048).
13. Kalpana Sharma & M.K. Ghose
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (1) : 2011 97
18. Sami S., Wakeel and Eng. Saad A. AL-Swailem,”PRSA: A Path Redundancy Based Security
Algorithm for Wireless Sensor Networks”, WCNC 2007 Proceedings, pp (4159-4163).
19. Ayman Khalil, Matthieu Crussière and Jean-François Hélard,’Cross Layer Resource
Allocation Scheme under Heterogeneous constraints for Next Generation High Rate WPAN
(2010),International Journal of Computer Networks and Communications( IJCNC) vol 2, No.
3.
20. A.R. Masoum, A.H. Jahangir,Z. Taghikhani, and R. Azarderakhsh, (2008) ”A new multi level
clustering model to increase lifetime in wireless sensor networks”, Proceedings of the
Second International Conference on Sensor Technologies and Applications, pp 185-190.
21. Germano Guimaraes, Eduardo Souto, Djamel Sadok, Judith Kelner (2005), “Evaluation of
Security Mechanisms in Wireless Sensor Networks”, proceedings of the 2005 Systems
Communication ( ICW ’05) ,P 428-438, 0-7695-2422-2/05.
22. Kyung Jun Choi and Jong-In Song (2006), “ Investigation of Feasible Cryptographic
Algorithms for Wireless Sensor Network”, in the proceedings of International Conference of
Advanced Communication Techniques ( ICACT 2006), 89-5519-129-4.
23. Soroush Hamed, Salajegheh Mastooreh and Dimitriou Tassos (2007) “Providing Transparent
Security Services to Sensor Networks” Proceedings of IEEE International Conference on
Communication (ICC’07).24-28 June 2007.
24. Zhou, Y., and Fang, Y. (2007), ‘A two-layer key establishment scheme for WSN’. IEEE trans.
Mobile Computing, Volume 6, No. 9, pp: 1009-1020.
25. Zhou, Y., Fang, Y., and Zhang, Y. (2008), ‘A survey of Securing Wireless Sensor network’.
IEEE communication surveys, Volume 10, No. 3, pp: 6-28.
26. Chan, H.,and Perrig, A., (2005), ‘PIKE: Peer Intermediaries for Key Establishment in Sensor
Networks’. In Proceedings of IEEE Infocom, Miami, Florida, pp: 524-535.
27. Ibriq, J., and Mahgoub, I. (2007), ‘A Hierarchical Key Establishment Scheme for Wireless
Sensor Networks’. 21st International Conference on Advanced Networking and Applications,
pp: 210-219.
28. Undercoffer, J., Ayancha, S., Joshi, A., Pinkston, J. (2004), ‘Security for Wireless Sensor
Networks’, Wireless Sensor Networks, Kluwer Academic Publishers Norwell, USA, pp: 253-
275.