International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Secure and efficient key pre distribution schemes for wsn using combinatorial...eSAT 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
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.
Random Key Pre-distribution Schemes using Multi-Path in Wireless Sensor Networksijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Enhancing the Security in WSN using Three Tier Security ArchitectureAM Publications,India
Security is the main issue while setting up the WSN network for node communication. This report describes the efficient mechanism for achieving the security between node communications by creating three tier security architecture. This system implements three tier architecture with the use of two polynomial pools having sensor nodes, mobile sinks and some access points that are also sensor nodes, to get better security. Two pools are common mobile polynomial pool and common static polynomial pool. Mobile sinks and access point carries keys from common mobile polynomial pool were as, access points and sensor nodes carries keys from common static polynomial pool. Communication gets established from mobile sink to access point then from access point to sensor node that shows three tier architecture Authentication is the main aspect of the system, that is achieved by pairwise key predistribution methods and authentication of the nodes with the use of polynomial keys. Here, Mobile sink replication attack is implemented against the network. The malicious node, it is blocked. If it wants to communicate within the network then it needs to capture large no of keys from both the pools for authentication. But as the sufficient keys are not available with it, it cannot communicate with the other nodes in the network
Network coding combined with onion routing for anonymous and secure communica...IJCNCJournal
This paper presents a novel scheme that provides high level of security and privacy in a Wireless Mesh
Network (WMN). We combine an approach of Network Coding with multiple layered encryption of onion routing for a WMN. An added superior feature provides higher level of security and privacy. Sensitive network information is confined to 1-hop neighborhood which is available anyways in a wireless medium with nodes using a bivariate polynomial. The only routing information divulged to a relay node is about next hop. No plain text is ever transmitted and all data can only be decrypted by its source and destination.Prior work finds it difficult to enforce encryption with network coding without divulging in complete
routing information,hence losing privacy and anonymity. We compare our scheme with other existing approach for several networks. The preliminary results show this work to provide superior security and anonymity at low overhead cost.
Wireless Sensor Network (WSN) consists of sensor nodes which interact with each other through physical parameters like sunlight, wind, vibration, humidity etc. Routing protocols provide an optimal data transmission route from sensor nodes to sink node to save energy of nodes. From Base Station (BS) Sensor node sends and receives data to or from wireless stations. Clustering mechanism is one of the popular routing mechanisms used in WSN for optimizing the problem in sensor nodes. There are two types of clustering schemes known as homogeneous schemes and heterogeneous schemes. In Homogeneous scheme initial energy is same for each node but in heterogeneous scheme initial energy is different for each node and also used to determine the efficiency of sensor networks. Enhanced Modified LEACH (EMODLEACH) is a reactive protocol which is implemented for homogeneous network model. We have implemented the concept of Efficient Cluster head Replacement scheme and Dual transmitting power level scheme of MODLEACH along with the concept of Efficient Intra Cluster transmission Scheme of TEEN in LEACH. We analyze the PEGASIS protocol and modified the exiting protocol called improved energy balanced routing protocol (IEBRP).This IEBRP is based on cluster formation, cluster routing and other aspects of LEACH protocol.
Secure and efficient key pre distribution schemes for wsn using combinatorial...eSAT 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
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.
Random Key Pre-distribution Schemes using Multi-Path in Wireless Sensor Networksijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Enhancing the Security in WSN using Three Tier Security ArchitectureAM Publications,India
Security is the main issue while setting up the WSN network for node communication. This report describes the efficient mechanism for achieving the security between node communications by creating three tier security architecture. This system implements three tier architecture with the use of two polynomial pools having sensor nodes, mobile sinks and some access points that are also sensor nodes, to get better security. Two pools are common mobile polynomial pool and common static polynomial pool. Mobile sinks and access point carries keys from common mobile polynomial pool were as, access points and sensor nodes carries keys from common static polynomial pool. Communication gets established from mobile sink to access point then from access point to sensor node that shows three tier architecture Authentication is the main aspect of the system, that is achieved by pairwise key predistribution methods and authentication of the nodes with the use of polynomial keys. Here, Mobile sink replication attack is implemented against the network. The malicious node, it is blocked. If it wants to communicate within the network then it needs to capture large no of keys from both the pools for authentication. But as the sufficient keys are not available with it, it cannot communicate with the other nodes in the network
Network coding combined with onion routing for anonymous and secure communica...IJCNCJournal
This paper presents a novel scheme that provides high level of security and privacy in a Wireless Mesh
Network (WMN). We combine an approach of Network Coding with multiple layered encryption of onion routing for a WMN. An added superior feature provides higher level of security and privacy. Sensitive network information is confined to 1-hop neighborhood which is available anyways in a wireless medium with nodes using a bivariate polynomial. The only routing information divulged to a relay node is about next hop. No plain text is ever transmitted and all data can only be decrypted by its source and destination.Prior work finds it difficult to enforce encryption with network coding without divulging in complete
routing information,hence losing privacy and anonymity. We compare our scheme with other existing approach for several networks. The preliminary results show this work to provide superior security and anonymity at low overhead cost.
Wireless Sensor Network (WSN) consists of sensor nodes which interact with each other through physical parameters like sunlight, wind, vibration, humidity etc. Routing protocols provide an optimal data transmission route from sensor nodes to sink node to save energy of nodes. From Base Station (BS) Sensor node sends and receives data to or from wireless stations. Clustering mechanism is one of the popular routing mechanisms used in WSN for optimizing the problem in sensor nodes. There are two types of clustering schemes known as homogeneous schemes and heterogeneous schemes. In Homogeneous scheme initial energy is same for each node but in heterogeneous scheme initial energy is different for each node and also used to determine the efficiency of sensor networks. Enhanced Modified LEACH (EMODLEACH) is a reactive protocol which is implemented for homogeneous network model. We have implemented the concept of Efficient Cluster head Replacement scheme and Dual transmitting power level scheme of MODLEACH along with the concept of Efficient Intra Cluster transmission Scheme of TEEN in LEACH. We analyze the PEGASIS protocol and modified the exiting protocol called improved energy balanced routing protocol (IEBRP).This IEBRP is based on cluster formation, cluster routing and other aspects of LEACH protocol.
Significant Storage on Sensor Storage Space, Energy Consumption and Better Se...ijasuc
WSNs are characterized by limited resources in terms of communication, computation and energy supply.
A critical constraint on sensors networks is that sensor nodes employ batteries. A second constraint is that
sensors will be deployed unattended and in large numbers, so that it will be difficult to change or recharge
batteries in the sensors .The Energy Consumption in wireless sensor networks varies greatly based on the
protocols the sensors use and computations used to generate keys for communication among neighbor
nodes. Previous research on sensor network security mainly considers homogeneous sensor networks,
where all sensor nodes have the same capabilities. Research has shown that homogeneous ad hoc networks
have poor performance and scalability. The many-to-one traffic pattern dominates in sensor networks, and
hence a sensor may only communicate with a small portion of its neighbors. Key Management is a
fundamental security operation. Most existing key management schemes try to establish shared keys for all
pairs of neighbor sensors, no matter whether these nodes communicate with each other or not, and this
causes large overhead and more energy consumption and more storage requirement. In this paper, we
adopt a Hybrid Sensor Network (HSN) model for better performance and security. We propose a novel
routing-driven key establishment scheme, which only establishes shared keys for neighbor sensors that
communicate with each other. We utilize Elliptic Curve Cryptography in the design of an efficient key
Establishment scheme for sensor nodes. The performance evaluation and security analysis show that our
key Establishment scheme can provide better security with significant reductions on communication
overhead, storage space and energy consumption than other key Establishment schemes.
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.
ER Publication,
IJETR, IJMCTR,
Journals,
International Journals,
High Impact Journals,
Monthly Journal,
Good quality Journals,
Research,
Research Papers,
Research Article,
Free Journals, Open access Journals,
erpublication.org,
Engineering Journal,
Science Journals,
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.
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
Efficient distributed detection of node replication attacks in mobile sensor ...eSAT 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
Secure & Energy Efficient Scheme against Denial-of-Sleep Attack in WSNIJMTST Journal
Security breaches and energy consumption issues are indispensable in WSN (wireless sensor networks). Considering attacks like Denial-of-Service (DoS) where not only the service is not provided but in addition to that unwanted power is also consumed.“Denial-of-Sleep attack" (type of DoS attack) also results in unnecessary power exhaustion. This paper briefs
A group key generation algorithm investigates group secret key generation problems for
different types of wireless networks, by exploiting physical layer characteristics of wireless channels. A
new group key generation strategy with low complexity is proposed, which combines the wellestablished
point-to-point pair wise key generation technique, the multisegment scheme, and the onetime
pad. In particular, this group key generation process is studied for three types of communication
networks: 1) A three-node network; 2) A multi node ring network; and 3) A multi node mesh network.
Three group key generation algorithms are developed for these communication networks, respectively.
The analysis8 shows that the first two algorithms yield optimal group key rates, whereas the third
algorithm achieves the optimal multiplexing gain. Next, for the first two types of networks, we address
the time allocation problem in the channel estimation step to maximize the group key rates. This nonconvex
max – min time allocation problem is first reformulated into a series of geometric programming,
and then, a single-condensation method based iterative algorithm is proposed. Numerical results are also
provided to validate the performance of the proposed key generation algorithms and the time allocation
algorithm.
Node clone detection using a stable overlay network IJECEIAES
Wireless sensor networks consist of number of sensor nodes widely distributed in particular region to communicate and sharing the environmental information and also these data‟s are stored in central location for further data prediction. Such nodes are susceptible to cloning attack where the adversary captures a node, replicates with the same identity as that of the captured node and deploys the clone back into the network, causing severe harm to the network. Hence to thwart such attacks, a distributed detection protocol is used with initiator-observer-inspector roles assigned randomly for the nodes to witness the clone and thereby broadcast the evidence through a balanced overlay network. Use of such balanced network provides high security level and reduces the communication cost when compared to other overlay networks with a reasonably less storage consumption.
Intrusion detection in heterogeneous network by multipath routing based toler...eSAT Journals
Abstract The key theory of our redundancy management is to achieve the tradeoff between energy consumption vs. the gain in timeliness, security, and reliability to increase the system useful lifetime. A Innovative probability model to analyze the best redundancy level in terms of source redundancy, path redundancy and as well as the best intrusion detection settings in terms of the number of voters and the intrusion invocation break under which the lifetime of a HWSN [Heterogeneous Wireless Sensor Network] is maximized. In redundancy management “badmouthing” is the major problem in managing the redundancy. This badmouthing is malicious node which will never drop the packet even after knowing that the packet has been sent already. In this paper we propose a new scheme to overcome the problem of badmouthing by weighted based voting, this protocol will weight (Success Rate) all the nodes in the network to find the non-malicious node in the network which having more packet drop. In “weighted voting” main function is to find trust/reputation of neighbor nodes, as well as to tackle the “what paths to use” problem in multipath routing decision making for intrusion tolerance in WSNs. Keywords: Bad mouthing, Wireless Sensor Network, Weighted Based Voting, HWSN.
Intrusion detection in heterogeneous network by multipath routing based toler...eSAT 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
Security based Clock Synchronization technique in Wireless Sensor Network for...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
International Refereed Journal of Engineering and Science (IRJES)irjes
International Refereed Journal of Engineering and Science (IRJES) is a leading international journal for publication of new ideas, the state of the art research results and fundamental advances in all aspects of Engineering and Science. IRJES is a open access, peer reviewed international journal with a primary objective to provide the academic community and industry for the submission of half of original research and applications.
Discovering adaptive wireless sensor network using eSAT Journals
Abstract When we consider the standard Bellman-Ford algorithm, it uses static values of link cost function and distance function. These static values are stored in sink node so that the sink node requires memory to keep data safe. Therefore the space, message and time complexity of a network and node increases. To overcome this we discover Fast Time Dependent Shortest Path algorithm with message and used in network with β synchronizer. The FTSP algorithm uses dynamic values of link cost function and distance function and to store these values we are using vector compression method so that there is no need to store the data into the sink node. Because of this the message, time and space complexity of node will be decreases. Keywords- Duty cycle, Time dependent, β synchronizer
Discovering adaptive wireless sensor network using β synchronizereSAT 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
misrouting attack in wireless sensor networks under replication attack. agent based security schemes in Security schemes for wireless sensor networks. International journal paper on wireless sensor networks.
Cluster Head and RREQ based Detection and Prevention of Gray hole and Denial ...IJSRD
Wireless sensor network is a type of network which have no communications pattern for communication between nodes, any node can easily join the network and leave the network so attacks are more probable. Gray hole is one of such attacks and it is tough to detect since malicious node switches behavior between normal node and malicious node. For detection and prevention of gray hole attacks our proposed technique is based on Cluster head and RREQ based approach in WSN. In our proposed technique we select a node which has the highest energy as a cluster head and remaining node are marked as work as cluster member. For each node we decide a threshold for sending RREQ if any node generate RREQ more than threshold then we check its RREP threshold value if it’s less than one than cluster head will conclude this node as a malicious node and broadcast its node id so that all other nodes also mark it as malicious node and drop the request arrive from this malicious node and for gray hole detection.
REVIEW ON KEY PREDISTRIBUTION SCHEMES IN WIRELESS SENSOR NETWORKSijassn
A wireless sensor network consist distributed sensors which are used to monitor physical or environmental conditions like temperature, sound, pressure and so on. Wireless sensor network are used in future in many applications like military, investigation teams, researches and so on. Security is the main issue in wireless sensor network. Sensor network arrange several types of data packets, packets of routing protocols and packets of key management protocols. Key management is the most effective method for providing better security against several types of attacks. This paper discusses the various key pre-distribution approaches along with their advantages and disadvantages.
Review on key predistribution schemes in wireless sensor networksijassn
A wireless sensor network consist distributed sensors which are used to monitor physical or environmental
conditions like temperature, sound, pressure and so on. Wireless sensor network are used in future in many
applications like military, investigation teams, researches and so on. Security is the main issue in wireless
sensor network. Sensor network arrange several types of data packets, packets of routing protocols and
packets of key management protocols. Key management is the most effective method for providing better
security against several types of attacks. This paper discusses the various key pre-distribution approaches
along with their advantages and disadvantages.
Significant Storage on Sensor Storage Space, Energy Consumption and Better Se...ijasuc
WSNs are characterized by limited resources in terms of communication, computation and energy supply.
A critical constraint on sensors networks is that sensor nodes employ batteries. A second constraint is that
sensors will be deployed unattended and in large numbers, so that it will be difficult to change or recharge
batteries in the sensors .The Energy Consumption in wireless sensor networks varies greatly based on the
protocols the sensors use and computations used to generate keys for communication among neighbor
nodes. Previous research on sensor network security mainly considers homogeneous sensor networks,
where all sensor nodes have the same capabilities. Research has shown that homogeneous ad hoc networks
have poor performance and scalability. The many-to-one traffic pattern dominates in sensor networks, and
hence a sensor may only communicate with a small portion of its neighbors. Key Management is a
fundamental security operation. Most existing key management schemes try to establish shared keys for all
pairs of neighbor sensors, no matter whether these nodes communicate with each other or not, and this
causes large overhead and more energy consumption and more storage requirement. In this paper, we
adopt a Hybrid Sensor Network (HSN) model for better performance and security. We propose a novel
routing-driven key establishment scheme, which only establishes shared keys for neighbor sensors that
communicate with each other. We utilize Elliptic Curve Cryptography in the design of an efficient key
Establishment scheme for sensor nodes. The performance evaluation and security analysis show that our
key Establishment scheme can provide better security with significant reductions on communication
overhead, storage space and energy consumption than other key Establishment schemes.
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.
ER Publication,
IJETR, IJMCTR,
Journals,
International Journals,
High Impact Journals,
Monthly Journal,
Good quality Journals,
Research,
Research Papers,
Research Article,
Free Journals, Open access Journals,
erpublication.org,
Engineering Journal,
Science Journals,
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.
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
Efficient distributed detection of node replication attacks in mobile sensor ...eSAT 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
Secure & Energy Efficient Scheme against Denial-of-Sleep Attack in WSNIJMTST Journal
Security breaches and energy consumption issues are indispensable in WSN (wireless sensor networks). Considering attacks like Denial-of-Service (DoS) where not only the service is not provided but in addition to that unwanted power is also consumed.“Denial-of-Sleep attack" (type of DoS attack) also results in unnecessary power exhaustion. This paper briefs
A group key generation algorithm investigates group secret key generation problems for
different types of wireless networks, by exploiting physical layer characteristics of wireless channels. A
new group key generation strategy with low complexity is proposed, which combines the wellestablished
point-to-point pair wise key generation technique, the multisegment scheme, and the onetime
pad. In particular, this group key generation process is studied for three types of communication
networks: 1) A three-node network; 2) A multi node ring network; and 3) A multi node mesh network.
Three group key generation algorithms are developed for these communication networks, respectively.
The analysis8 shows that the first two algorithms yield optimal group key rates, whereas the third
algorithm achieves the optimal multiplexing gain. Next, for the first two types of networks, we address
the time allocation problem in the channel estimation step to maximize the group key rates. This nonconvex
max – min time allocation problem is first reformulated into a series of geometric programming,
and then, a single-condensation method based iterative algorithm is proposed. Numerical results are also
provided to validate the performance of the proposed key generation algorithms and the time allocation
algorithm.
Node clone detection using a stable overlay network IJECEIAES
Wireless sensor networks consist of number of sensor nodes widely distributed in particular region to communicate and sharing the environmental information and also these data‟s are stored in central location for further data prediction. Such nodes are susceptible to cloning attack where the adversary captures a node, replicates with the same identity as that of the captured node and deploys the clone back into the network, causing severe harm to the network. Hence to thwart such attacks, a distributed detection protocol is used with initiator-observer-inspector roles assigned randomly for the nodes to witness the clone and thereby broadcast the evidence through a balanced overlay network. Use of such balanced network provides high security level and reduces the communication cost when compared to other overlay networks with a reasonably less storage consumption.
Intrusion detection in heterogeneous network by multipath routing based toler...eSAT Journals
Abstract The key theory of our redundancy management is to achieve the tradeoff between energy consumption vs. the gain in timeliness, security, and reliability to increase the system useful lifetime. A Innovative probability model to analyze the best redundancy level in terms of source redundancy, path redundancy and as well as the best intrusion detection settings in terms of the number of voters and the intrusion invocation break under which the lifetime of a HWSN [Heterogeneous Wireless Sensor Network] is maximized. In redundancy management “badmouthing” is the major problem in managing the redundancy. This badmouthing is malicious node which will never drop the packet even after knowing that the packet has been sent already. In this paper we propose a new scheme to overcome the problem of badmouthing by weighted based voting, this protocol will weight (Success Rate) all the nodes in the network to find the non-malicious node in the network which having more packet drop. In “weighted voting” main function is to find trust/reputation of neighbor nodes, as well as to tackle the “what paths to use” problem in multipath routing decision making for intrusion tolerance in WSNs. Keywords: Bad mouthing, Wireless Sensor Network, Weighted Based Voting, HWSN.
Intrusion detection in heterogeneous network by multipath routing based toler...eSAT 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
Security based Clock Synchronization technique in Wireless Sensor Network for...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
International Refereed Journal of Engineering and Science (IRJES)irjes
International Refereed Journal of Engineering and Science (IRJES) is a leading international journal for publication of new ideas, the state of the art research results and fundamental advances in all aspects of Engineering and Science. IRJES is a open access, peer reviewed international journal with a primary objective to provide the academic community and industry for the submission of half of original research and applications.
Discovering adaptive wireless sensor network using eSAT Journals
Abstract When we consider the standard Bellman-Ford algorithm, it uses static values of link cost function and distance function. These static values are stored in sink node so that the sink node requires memory to keep data safe. Therefore the space, message and time complexity of a network and node increases. To overcome this we discover Fast Time Dependent Shortest Path algorithm with message and used in network with β synchronizer. The FTSP algorithm uses dynamic values of link cost function and distance function and to store these values we are using vector compression method so that there is no need to store the data into the sink node. Because of this the message, time and space complexity of node will be decreases. Keywords- Duty cycle, Time dependent, β synchronizer
Discovering adaptive wireless sensor network using β synchronizereSAT 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
misrouting attack in wireless sensor networks under replication attack. agent based security schemes in Security schemes for wireless sensor networks. International journal paper on wireless sensor networks.
Cluster Head and RREQ based Detection and Prevention of Gray hole and Denial ...IJSRD
Wireless sensor network is a type of network which have no communications pattern for communication between nodes, any node can easily join the network and leave the network so attacks are more probable. Gray hole is one of such attacks and it is tough to detect since malicious node switches behavior between normal node and malicious node. For detection and prevention of gray hole attacks our proposed technique is based on Cluster head and RREQ based approach in WSN. In our proposed technique we select a node which has the highest energy as a cluster head and remaining node are marked as work as cluster member. For each node we decide a threshold for sending RREQ if any node generate RREQ more than threshold then we check its RREP threshold value if it’s less than one than cluster head will conclude this node as a malicious node and broadcast its node id so that all other nodes also mark it as malicious node and drop the request arrive from this malicious node and for gray hole detection.
REVIEW ON KEY PREDISTRIBUTION SCHEMES IN WIRELESS SENSOR NETWORKSijassn
A wireless sensor network consist distributed sensors which are used to monitor physical or environmental conditions like temperature, sound, pressure and so on. Wireless sensor network are used in future in many applications like military, investigation teams, researches and so on. Security is the main issue in wireless sensor network. Sensor network arrange several types of data packets, packets of routing protocols and packets of key management protocols. Key management is the most effective method for providing better security against several types of attacks. This paper discusses the various key pre-distribution approaches along with their advantages and disadvantages.
Review on key predistribution schemes in wireless sensor networksijassn
A wireless sensor network consist distributed sensors which are used to monitor physical or environmental
conditions like temperature, sound, pressure and so on. Wireless sensor network are used in future in many
applications like military, investigation teams, researches and so on. Security is the main issue in wireless
sensor network. Sensor network arrange several types of data packets, packets of routing protocols and
packets of key management protocols. Key management is the most effective method for providing better
security against several types of attacks. This paper discusses the various key pre-distribution approaches
along with their advantages and disadvantages.
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.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
International Journal of Engineering Research and Development is an international premier peer reviewed open access engineering and technology journal promoting the discovery, innovation, advancement and dissemination of basic and transitional knowledge in engineering, technology and related disciplines.
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 Modified Pair Wise Key Distribution Schemes and There Effect On Network Per...IJERA Editor
Key distribution schemes has always played a pivotal role in the security of wireless sensor networks. In this research work we focus mainly on the security aspect of WSN . We have developed a modified key distribution scheme which uses the concepts of post as well as pre distribution scheme and thus he proved to be a better alternative then the rest of two schemes. Simulation study has been carried out using matlab. The effort turned out to be fruitful s our modified scheme showed less dead nodes per round of data transfer as compared to post deployment scheme.
Securing Many-To- Many Wireless Sensor Networks With Unique Dynamic KeyEditor IJMTER
Due to the sensitive nature of the data transmitted by applications ranging from mobile target
surveillance to intelligent home networking, through Wireless sensor networks, (WSNs) appropriate
protection mechanisms are needed to prevent attackers from exploiting the weaknesses of the radio links.
In this paper, we propose a novel group key management scheme. This paper investigates the use of secure
tunnels as a solution to improve the protection of WSNs. We propose a tunneling scheme that conforms
to the security requirements of WSNs while having less computational and network overhead. Our
protocol considerably can reduce the number of transmitted messages as well as the computational load,
which makes it suitable for WSNs. We tested the proposed protocol considering two models of mobility
of the targets which are respectively the Random Walk model and the Gauss Markov model.
Hierarchical Key Agreement Protocol for Wireless Sensor Networksidescitation
Wireless sensor network promises ubiquitous data
collection and processing for variety of commercial, healthcare
and military applications. Practical realization of WSN
applications is possible only after assuring network security.
Cryptographic key distribution is an important phase in
network security which establishes initial trust in the network.
Security protocol implementation in WSN is limited by
resource constrained nature of sensor nodes. The key
distribution algorithm satisfying security requirements of
given WSN application should be implemented with minimum
communication and memory overhead. As a solution to this
problem, hierarchical key management technique is proposed
in this paper. Symmetric key pre-distribution technique with
less computational overhead and ID-based asymmetric key
(IBK) distribution technique with less communication
overhead are applied simultaneously in the network at
different levels. Resilience strength and resource overhead of
the proposed scheme is compared with both symmetric and
asymmetric techniques.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Secure and Reliable Data Routing in Wireless Sensor Networkdbpublications
Wireless Sensor Networks (WSNs) are materializing as one of the dominant technologies of the future because of their large range of applications in military and civilian fields. Because of their operating behavior, they are often neglected and thus vulnerable to various types of attacks. For instance, an attacker could catch sensor nodes, getting all the information saved therein-sensor nodes are generally considered to not be temper-proof. Hence, an attacker may clone cached sensor nodes and use them in the network to conduct a variety of mischievous activities. As the decisions taken by a sensor network rely on the information gathered by the sensor nodes, if an adversary inhibits the necessary or confidential data from being forwarded to the BS/ target, this will cause the whole breakdown of the network or outcomes in the wrong judgment being made, possibly causing deliberate loss. There are many types of attacks such as compromised node, denial of service attack, black hole attack, etc. Hence there is a necessity to find all such attacks in WSN, and to safely route our sensitive information to the target. This paper represents the survey of some types of attacks and there detection techniques. Also the survey includes different techniques for secure and reliable data collection in Wireless Sensor Networks.
ENERGY EFFICIENT, LIFETIME IMPROVING AND SECURE PERIODIC DATA COLLECTION PROT...ijcsa
The most emerging prominent sensor network applications collect data from sensor nodes and monitors
periodically. Resource constraint Sensor motes sense the environment and transit data to the remote sink
via multiple hops. Minimum energy dissipation and secure data transmission are crucial to such
applications. This paper delivers an energy efficient, lifetime improving, secure periodic Data Gathering
scheme that is a hybrid of heuristic path establishment and secure data transmission. This protocol uses
artificial intelligence (AI) based A* heuristic search algorithm to establish energy efficient admissible
optimal path to sink in terms of high residual energy, minimum hop counts and high link quality. This
scheme also adopts block encryption Rivest Cipher (RC6) Algorithm to secure the transmission of packets.
This code and speed optimized block encryption provides confidentiality against critical data and
consumes less energy for encryption. This proposed method increases the network lifetime there by
reducing the total traffic load. Evaluation of performance analysis of this algorithm using Network
Simulator (NS2) shows the superiority of the proposed scheme
ENHANCED THREE TIER SECURITY ARCHITECTURE FOR WSN AGAINST MOBILE SINK REPLI...ijwmn
Recent developments on Wireless Sensor Networks have made their application in a wide range
such as military sensing and tracking, health monitoring, traffic monitoring, video surveillance and so on.
Wireless sensor nodes are restricted to computational resources, and are always deployed in a harsh,
unattended or unfriendly environment. Therefore, network security becomes a tough task and it involves
the authorization of admittance to data in a network. The problem of authentication and pair wise key
establishment in sensor networks with mobile sink is still not solved in the mobile sink replication attacks.
In q-composite key pre distribution scheme, a large number of keys are compromised by capturing a
small fraction of sensor nodes by the attacker. The attacker can easily take a control of the entire network
by deploying a replicated mobile sinks. Those mobile sinks which are preloaded with compromised keys
are used authenticate and initiate data communication with sensor node. To determine the above problem
the system adduces the three-tier security framework for authentication and pair wise key establishment
between mobile sinks and sensor nodes. The previous system used the polynomial key pre distribution
scheme for the sensor networks which handles sink mobility and continuous data delivery to the
neighbouring nodes and sinks, but this scheme makes high computational cost and reduces the life time of
sensors. In order to overcome this problem a random pair wise key pre distribution scheme is suggested
and further it helps to improve the network resilience. In addition to this an Identity Based Encryption is
used to encrypt the data and Mutual authentication scheme is proposed for the identification and
isolation of replicated mobile sink from the network.
An Efficient Security Way of Authentication and Pair wise Key Distribution wi...IJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Neuro-symbolic is not enough, we need neuro-*semantic*Frank van Harmelen
Neuro-symbolic (NeSy) AI is on the rise. However, simply machine learning on just any symbolic structure is not sufficient to really harvest the gains of NeSy. These will only be gained when the symbolic structures have an actual semantics. I give an operational definition of semantics as “predictable inference”.
All of this illustrated with link prediction over knowledge graphs, but the argument is general.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
FIDO Alliance Osaka Seminar: The WebAuthn API and Discoverable Credentials.pdf
Key Establishment using Selective Repeat Automatic Repeat Request Mechanism for Wireless Sensor Networks
1. ISSN (e): 2250 – 3005 || Volume, 05 || Issue, 04 || April – 2015 ||
International Journal of Computational Engineering Research (IJCER)
www.ijceronline.com Open Access Journal Page 20
Key Establishment using Selective Repeat Automatic Repeat
Request Mechanism for Wireless Sensor Networks
IshwaryaMathi Manickavasagam1
, Madan Mohan Anbalagan2
, InduMathi
Manickavasagam3
Department of ECE, IT, Tamil Nadu, India
I. INTRODUCTION
The Wireless sensor network (WSN) is built of "nodes" – from a few to several hundreds or even
thousands, where each node is connected to one (or sometimes several) sensors. Each such sensor network node
has typically several parts: a radio transceiver with an internal antenna or connection to an external antenna, a
microcontroller, an electronic circuit for interfacing with the sensors and an energy source, usually a battery or
an embedded form of energy harvesting. A sensor node might vary in size from that of a shoebox down to the
size of a grain of dust, although functioning "motes" of genuine microscopic dimensions have yet to be created.
The cost of sensor nodes is similarly variable, ranging from a few to hundreds of dollars, depending on the
complexity of the individual sensor nodes. Secret key establishment is a fundamental requirement for private
communication between two entities. Currently, the most common method for establishing a secret key is by
using public key cryptography. However, public key cryptography consumes significant amount of computing
resources and power which might not be available in certain scenarios. A less expensive and more flexible
solution to the problem of sharing secret keys between wireless nodes is to use the inherent randomness in the
wireless channel between them as the source for extracting bits of the secret key between these nodes.
Size and cost constraints on sensor nodes result in corresponding constraints on resources such as
energy, memory, computational speed and communications bandwidth. The topology of the WSNs can vary
from a simple star network to an advanced multi-hop wireless mesh network. The propagation technique between
the hops of the network can be routing or flooding.
ABSTRACT:
In Key pre-distribution techniques for security provision of Wireless Sensor Networks, a diminutive
number of keys are randomly chosen from a large key pool and loaded on the sensors prior to
deployment such that they have a common key. Secret keys generated are then placed in sensor nodes,
and each sensor node ransacks the area in its communication range to find another node to
communicate. A secure link is established when two nodes discover one or more common keys, and
communication is done on that link between those two nodes. Few neighboring sensors do not share any
common key. To establish secure link in such networks, a secret key is exchanged via a multi-hop secure
path. But sensors may be compromised on the path rendering process insecure. This paper sets forth a
research plan for an enhanced Modified Incremental Redundancy Transmission scheme that uses
Selective Repeat Automatic Repeat Request mechanism to address the problem. Through multiple multi-
hop paths, the information is transmitted. Only when the destination fails to decode the information,
erroneous frame are transmitted to reduce the transmission overhead.
INDEX TERMS—Wireless sensor networks, key predistribution, randomness, selective repeat
automatic repeat request
2. Key Establishment using Selective Repeat Automatic Repeat…
www.ijceronline.com Open Access Journal Page 21
II. PROBLEM FORMULATION
Figure 1: Illustration of path establishment
The key pre-distribution schemes such as [1],[2] and [3] provide memory-efficient and resilient ways of
establishing common keys for information transmission for a fraction of potential communication links. The rest
of the communication links need to establish their common keys between each pair of nodes by other means such
as multihop delivery.
A network topology with few sensor nodes is shown in Figure 1. Each line segment connecting two
nodes represents that these two nodes share at least a common key. For example, nodes 1 and 4 share at least a
key. Note that nodes 3 and 6 do not share any common key. Now, assume that nodes 1 and 6, as source and
destination respectively. They need to establish a secure communication that requires a common key between
each pair of nodes in the path established. As suggested in [1],[2] and [3], in order to establish a path with
common keys between each pair of nodes between the nodes 1 and 6, a multihop secure path may be used to
deliver the message.
The nodes first perform key-discovery to find out with which of their neighbors they share a key. The
shared key then becomes the key for that link. After key-setup phase is completed, a connected graph of secure
links is formed. If the graph is connected, a path can be found from a source node to its neighbor. For example,
we assume nodes 1 and 6 do not share any common keys and therefore the message cannot be transmitted
through that path. Node 2 may be used to relay the message between nodes 1 and 6. Since only one multihop
path is used, we term it as Single-Path(SP) scheme. Some examples of multihop paths in Figure 1 are 1-6, 1-2-6,
1-4-5-6, 1-3-4-5-6. The dotted line denotes the various paths from the source to the destination node.In general,
random key pre-distribution schemes may experience some communication links being exposed when some
sensors are compromised. A compromised sensor may modify or drop the secret information passing through the
multihop path. This leads to the following problem:
Problem Statement: In key pre-distribution schemes for WSNs, some neighboring sensors do not share any
common key. To establish secure link in such networks, multi-hop secure paths are used. However, when any of
the sensors on the multi-hop secure path is compromised or captured by the adversary, the part of the information
is disclosed. A compromised sensor may also modify or drop the key information passing through itself. What
fault-tolerant mechanism should we use to send the information between two physical neighbors efficiently and
securely? Note that we work on the problem of sending information between two neighbors that do not share a
common key after the key pre-distribution process.
III. BASIC SCHEMES AND MATHEMATICAL MODELS
Key pre-distribution is the method of distribution of keys into nodes before deployment. The network is
formed using the secret keys deployed to each node. Key pre-distribution techniques for security provision of
Wireless Sensor Networks (WSNs) have attracted significant interests recently.
A key pre-distribution scheme has 3 phases: Key pre-distribution, Shared key discovery, Path-key
establishment. In these schemes, a relatively small number of keys are randomly chosen from a large key pool
and loaded on the sensors prior to deployment. After being deployed, each sensor tries to find a common key
shared by itself and each of its neighbors [1].
1
4
2
5
3
6
3. Key Establishment using Selective Repeat Automatic Repeat…
www.ijceronline.com Open Access Journal Page 22
Due to the randomness of the key selection process in key pre-distribution, few communication links do
not have any common key shared by the two neighboring nodes. Hence a secret link key delivery technique
using a multi-hop secure path was proposed: one of the two neighboring nodes finds a multi-hop secure path
towards the other node. Each pair of neighboring nodes on the secure path shares at least a common key, which
could be different throughout the path.
Such a multi-hop secure path scheme works quite well when all sensor nodes forward the secret key
honestly and none of the nodes on the path is compromised. However, the scheme has security problems if any
of the nodes is compromised. Such a compromise affects the multi-hop secure path scheme.
In random key pre-distribution, a network need not be fully connected for effective communication to
take place. Therefore this technique ensures good connectivity in the network at the same time requires lesser
memory space. The EG and Hexagon based deployment model schemes follow random key pre-distribution. [2].
EG Scheme: Eschenauer and Gligor proposed a random key pre-distribution scheme,which is also referred as
basic scheme. Let m denote the number of distinct cryptographic keys that can be stored on a node. The basic
scheme works as follows. In the initialisation phase a keypool is picked from the key space. Then a set of m key
rings are assigned to each node. In the next phase , after the nodes are deployed , the nodes look for shared keys
among them and then a link is established upon the discovery of common keys.
Eschenauer and Gligor calculate the necessary expected node degree d in terms of the size of the network n as:
(2.1)
For a given density of network deployment, let n be the expected number of neighbors within
communication range of a node. Since the expected node degree must be atleast as calculated, the required
probability p of successfully performing key-setup with some neighbor is:
'n
d
p (2.2)
Improving Key predistribution Using Hexagon Based Deployment Model: The centre of a grid is a
deployment point, which is the desired location of a group of nodes. The location of node over the entire node
field follows some distribution with a probability density function. In hexagon-based scheme, all adjacent sensor
nodes have the same distance.
In the hexagon system, first, when a node transmits data over wireless links, its signal range would form
a circle that is centered around its deployment location with the radius being the distance of signal propagation.
Therefore, a hexagon can be used to express and simulate the signal range more approximately. Second, a
hexagon can be used to describe equal distance between two neighboring nodes. Under the hexagonal coordinate
system, all adjacent sensor nodes have the same distance which is normally 1 unit.
If the number of nodes is too large, we may divide them into groups and deploy one group each time.
Each group of nodes may be deployed into a local area or to just a single deployment point, which is the desired
location of nodes. In a group-based deployment model, there are two generally used distributions: In most cases,
nodes are often assumed to be uniformly deployed i.e. Uniform distribution. The actual model for the
deployment distribution depends on the deployment method.
In the hexagon-based scheme, each nodes center is its deployment hexagon. It shares keys with the
nodes deployed in its 19 adjacent hexagons. In Figure.2 all nodes deployed in shaded hexagon can share key with
the sensor nodes deployed in hexagon 5. The hexagon based pre-distribution scheme has three phases.
Figure 2: Hexagon co-ordinate system
cn
n
n
d lnlnln
1
4. Key Establishment using Selective Repeat Automatic Repeat…
www.ijceronline.com Open Access Journal Page 23
Proposed scheme: Typically, data transmission is not strictly delay-sensitive but requires a virtually error-free
link. To provide reliability over wireless channels, in this work we analyze the modified Incremental
Redundancy Transmission scheme,i.e., IRT scheme based on the Selective Repeat protocol allowing
transmission of packets without waiting for acknowledgement. In this ARQ, the sender and receiver window size
must be equal, and half the maximum sequence number to avoid miscommunication.
Selective Repeat ARQ protocol may be used as a protocol for the delivery and acknowledgement of
message units, or it may be used as a protocol for the delivery of subdivided message sub-units.
In this work, we propose a key pre-distribution scheme which improves the resilience of the network
with decrease in the fraction of nodes compromised compared to previous schemes and supports flexibility in
terms of connectivity. The proposed scheme also enhances the average rate of successful message delivery over a
communication channel.
Initially, after the deployment of keys to each node the network is formed. Path is established from the
source to the destination between nodes with common keys and the corresponding hop count of each path is
obtained.
When Selective Repeat ARQ is used as a protocol for the delivery of messages, even after a frame loss,
the sender continues to send frames specified by a window size. Unlike Go-Back-N ARQ, the receiver will
continue to accept and acknowledge frames sent after an initial error.
The receiver keeps track of the sequence number of the last frame it has not received. Even if the
receiver does not receive a frame, the ender keeps sending subsequent frames until it has sent all the frames in
the window. The receiver accepts the subsequent frames and replies with an acknowledgement containing the
sequence number of the last missing frame. After all the frames in the window are sent, the sender re-sends the
frame number given by the ACKs, and then proceeds where it left off.
Selective Repeat ARQ is used as a protocol for delivery of subdivided messages, where messages are
variable in length. For this selective retransmission may be employed in conjunction with the basic ARQ
mechanism.
The original variable length message is a concatenation of a variable number of sub-blocks. The
message is first subdivided into sub-blocks based on hop count of the established paths, in a process called
packet segmentation. The number of frames transmitted is based on the window size. In ARQ with selective
transmission the negatively acknowledged response would carry a bit flag indicating the identity of each sub-
block successfully received. If the received frame is erroneous, it is rejected and selectively re-transmitted. When
frame is received successfully it is acknowledged. Selective re-transmission applied to variable length messages
completely eliminates the difficulty in delivering longer messages, as successfully received sub-blocks are
retained after each transmission and outstanding sub-blocks in following transmissions diminishes.
IV. PERFORMANCE EVALUATION
Simulations have been performed in Matlab to evaluate the efficiency of the proposed scheme. We
investigate the performance of the modified IRT scheme and other related schemes. These schemes include the
Incremental Redundancy Transmission scheme, the SP scheme, Hexagonal based deployment model scheme and
the random key pre-distribution scheme.
100 150 200 250 300 350
0
100
200
300
400
500
600
700
800
900
1000
No. of keys per node
No.ofconnectednodes
Connectivity analysis
Basic scheme
Multipath Key Reinforcement
5. Key Establishment using Selective Repeat Automatic Repeat…
www.ijceronline.com Open Access Journal Page 24
Path Availabilities: In Figure 3, we show the number of paths with secure connections that are exactly h
hops from a source to a destination (assuming that they do not share a common key). The average number of
paths is presented, corresponding to various local connectivity. We also present the number of paths for a similar
network with half the nodes for comparison purposes. As shown in Figure 3, the number of available paths
increases with the local connectivity. When the node density increases, there are more paths as well. The number
of h-hop paths also increases with h. Note that these paths may have common nodes other than the source and the
destination.
Transmission Overhead: When there are compromised nodes on the paths used to deliver the information and
these compromised nodes modify the passing information, extra symbols need to be transmitted. The SP scheme
randomly chooses one out of the available paths to send the information.
The sender sends a number of frames specified by a window size even without the need to wait for
individual ACK from the receiver. The receiver accepts out-of-order frames and buffers them. The sender
individually retransmits frames that have timed out and erroneous frames. To reduce the total information that
needs to be transmitted, the redundant symbols are transmitted only if the destination fails to decode the
information successfully. Therefore reducing the transmission overhead and increasing the performance
efficiency.
Security Analysis: The fraction of total keys being compromised can be expressed as,
x
s
m
p
11 4.1
The equation 4.1 implies smaller the value of m, better the resilience. |s| is the size of the key pool.
The security analysis of the Basic scheme is calculated with memory as 3 and the key pool size as 900.
As the number of nodes increases in the network, it is more probable that number of nodes being compromised
also increases. Therefore, the resilience of the network increases with the decrease in the fraction of the nodes
compromised.
Figure 4: Security Analysis of Basic Scheme
Figure 5: Security Analysis of Multipath Key Reinforcement
6. Key Establishment using Selective Repeat Automatic Repeat…
www.ijceronline.com Open Access Journal Page 25
Figure 6: Security analysis comparisons
Figure 6 shows the comparison of security analysis of the basic scheme and multipath key
reinforcement with memory as 3 and the key pool size as 1600. It is inferred that the resilience has increased as
the number of nodes being compromised has decreased; eventually the security of the network also increases.
The security of the Multipath Key Reinforcement is better than that of the Basic scheme.
From the results we infer that, the basic scheme is vulnerable to security threats leading to poor
resilience. Whereas in the proposed scheme, the security is enhanced.
V. CONCLUSIONS
We have proposed and investigated a modified Incremental Redundancy Transmission (IRT) scheme
for the secret common key establishment process of key pre-distribution techniques. The modified IRT scheme
uses Selective Repeat ARQ mechanism to send the information through multiple multi-hop paths. An important
feature of the IRT scheme is the flexibility of trading transmission for lower information disclosure. From the
analysis, it can be inferred that multipath key reinforcement has proved to be a more tangible solution than the
basic scheme in terms of resilience against node capture.
From the results and graphs it is inferred that the path availability is improved in the network,
transmission overhead is reduced and security is enhanced in the proposed scheme.
In the future work we will consider transmission between multiple sources and multiple destinations and
the effect of node disjoint paths will be investigated as well.
REFERENCES
[1] Eschenauer, L., Gligor, V.D. “A key-management scheme for distributed sensor networks,” In: Proc. Of the 9th ACM conference
on Computer and communications security, Washington, DC, USA (2002)pp. 41–47
[2] Chan, H., Perrig, A., Song, D. “Random key predistribution schemes for sensor networks” In: Proc. Of IEEE Symposium on
Security and Privacy, Berkeley, California (2003)pp.197–213
[3] Du, W., Deng, J., Han, Y.S., Varshney, P.K., Katz, J., Khalili, A. “A pairwise key pre-distribution scheme for wireless sensor
networks,” ACM Trans. on Information and System Security 8 (2005) pp.228–258
[4] Jing Deng; Han, Y.S. “Multipath key Establishment for Wireless Sensor Networks Using Just-Enough Redundancy
Transmission,” Dependable and Secure Computiong,IEEE Transactions(2008)pp.177-190