KDSR

2018 ◽  
Vol 14 (1) ◽  
pp. 27-45
Author(s):  
Abderrahmen Guermazi ◽  
Abdelfettah Belghith ◽  
Mohamed Abid
Keyword(s):  
Large Scale ◽  
Secure Routing ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Storage Space ◽  
Computation Complexity ◽  
Replay Attacks ◽  
Node Capture ◽  
Secure Network ◽  
Global Broadcast

This article deals with a key distribution protocol to secure routing in large-scale Wireless Sensor Networks (WSNs) and proposes a new protocol called KDSR. The authors' protocol has two originalities: to provide a secure network structure for large-scale WSNs, and to use lightweight local process to share efficiently the Local Broadcast Keys, the Pairwise Keys and the Global Broadcast Key. These keys are useful to secure several communication patterns in WSNs: one-to-many, one-to-one and one-to-all. Security analyses show that KDSR can withstand several attacks against WSNs. Through fast node revocation process, KDSR offers a good resilience against node capture. Immunity against MiM and replay attacks are well checked with the AVISPA tools. The experimentations are done on real TelosB motes and through the TOSSIM simulator. Simulation results confirm that KDSR is scalable, provides a good key connectivity and a good resilience. Comparison to earlier work shows that KDSR causes less computation complexity, less communication overhead and much less storage space even for large-scale WSNs.

KDSR

2020 ◽  
pp. 301-320 ◽  
Author(s):  
Abderrahmen Guermazi ◽  
Abdelfettah Belghith ◽  
Mohamed Abid
Keyword(s):  
Large Scale ◽  
Secure Routing ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Storage Space ◽  
Replay Attacks ◽  
Node Capture ◽  
Simulation Results ◽  
Secure Network ◽  
Global Broadcast

This article deals with a key distribution protocol to secure routing in large-scale Wireless Sensor Networks (WSNs) and proposes a new protocol called KDSR. The authors' protocol has two originalities: to provide a secure network structure for large-scale WSNs, and to use lightweight local process to share efficiently the Local Broadcast Keys, the Pairwise Keys and the Global Broadcast Key. These keys are useful to secure several communication patterns in WSNs: one-to-many, one-to-one and one-to-all. Security analyses show that KDSR can withstand several attacks against WSNs. Through fast node revocation process, KDSR offers a good resilience against node capture. Immunity against MiM and replay attacks are well checked with the AVISPA tools. The experimentations are done on real TelosB motes and through the TOSSIM simulator. Simulation results confirm that KDSR is scalable, provides a good key connectivity and a good resilience. Comparison to earlier work shows that KDSR causes less computation complexity, less communication overhead and much less storage space even for large-scale WSNs.

Wireless Sensor Network Mobile Agent Routing Based on the Improved Ant Colony Algorithm

2014 ◽  
Vol 587-589 ◽  
pp. 2339-2345
Author(s):  
Jia Yan Li ◽  
Jun Ping Wang
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Mobile Agent ◽  
Large Scale ◽  
Ant Colony Algorithm ◽  
Routing Algorithm ◽  
Ant Colony ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Redundant Data

This paper proposes a new wireless sensor routing algorithm by combining the ant colony algorithm with the mobile agent technology. This algorithm considers the distance and path energy overhead among nodes and residual node energy, equalizes the energy overhead in the network, improves the update rule of the ant colony information elements and speeds up convergence of the ant colony algorithm to get the optimal values. The simulation results indicate that this algorithm can improve the globalization and convergence speed, effectively reduce redundant data transmission and communication overhead, extend the network lifecycle and be very suitable for a large-scale wireless sensor network compared to other mobile agent routing algorithms.

scholarly journals A Point-to-Point Interference Measurement Approach for Large-Scale Wireless Sensor Networks

2012 ◽  
Vol 8 (10) ◽  
pp. 919815
Author(s):  
Bo Zeng ◽  
Yabo Dong ◽  
Dongming Lu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Large Scale ◽  
Wireless Sensor ◽  
Control Factor ◽  
Communication Overhead ◽  
Distribution Method ◽  
Interference Measurement ◽  
Point To Point ◽  
Measurement Approach

Interference measurement is an important part for use in links scheduling protocol in wireless sensor networks (WSNs). To know wireless interference among nodes in the network is essential to guarantee the efficiency of links scheduling protocol. This work presents a point-to-point interference measurement approach based on time division technique for large-scale low-power WSNs. We first propose an optimized time-slots assignment to reduce the time-slot requirement of interference measurement for large-scale WSNs. We then mitigate the problem of communication by using a subtree-based information distribution method. The accuracy of interference measurement is controlled by a control factor that can be specified by user based on the application requirement to achieve a tradeoff between the overhead of measuring interference and measurement accuracy. Our simulation results indicate that our approach has low-energy and-communication overhead when compared with baseline.

scholarly journals An Efficient Key Management Scheme for Wireless Sensor Networks

2012 ◽  
Vol 8 (1) ◽  
pp. 406254 ◽  
Author(s):  
Dahai Du ◽  
Huagang Xiong ◽  
Hailiang Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Key Management ◽  
Large Scale ◽  
Modular Arithmetic ◽  
Wireless Sensor ◽  
Storage Space ◽  
Management Scheme ◽  
Wide Range ◽  
Key Management Scheme

Wireless sensor networks (WSNs) can be used in a wide range of environments. Due to the inherent characteristics of wireless communications, WSNs are more vulnerable to be attacked than conventional networks. Authentication and data confidentiality are critical in these settings. It is necessary to design a useful key management scheme for WSNs. In this paper, we propose a novel key management scheme called MAKM (modular arithmetic based key management). The proposed MAKM scheme is based on the congruence property of modular arithmetic. Each member sensor node only needs to store a key seed. This key seed is used to compute a unique shared key with its cluster head and a group key shared with other nodes in the same cluster. Thus, MAKM minimizes the key storage space. Furthermore, sensor nodes in the network can update their key seeds very quickly. Performance evaluation and simulation results show that the proposed MAKM scheme outperforms other key-pool-based schemes in key storage space and resilience against nodes capture. MAKM scheme can also reduce time delay and energy consumption of key establishment in large-scale WSNs.

A Novel Blockchain Approach for Improve the Performance of Network Security Using Polynomial Ephemeral Blockchain-Based Secure Routing in Wireless Sensor Network

2020 ◽  
Vol 17 (12) ◽  
pp. 5598-5604
Author(s):  
R. Bharanidharan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Performance ◽  
Communication Complexity ◽  
Network Control ◽  
Secure Routing ◽  
Wireless Sensor ◽  
Control Overhead ◽  
Node Location ◽  
Secure Network

Wireless sensor networks are networks that include hundreds to thousands of autonomous distributed devices. These sensors are used to monitor physical and environmental conditions. Reliable routing protocols are designed to build a reliable and secure network with power management and control overhead and congestion. The wireless medium allows malicious user?s wireless sensor networks (WSN) to take part in actions to get a damaging attack on network control nodes. Due to the proprietary nature of such networks, they are more complex and lack tamper-resistant hardware. Security mechanisms are more wit due to the wireless and transient computing or communication complexity of communication relationships between nodes in a network. The existing method doesn?t provide security in inconvenient network performance, and the attackers modify the data and damage it. The proposed blockchain method is fixed at the same level of security, such as Polynomial Ephemeral Blockchain-based Secure Routing (PEBSR) encryption, to create a secure network. In this method, first, to authenticate the neighbor node validate using a Polynomial Ephemeral key-based Neighbor node authentication method. It evaluates the node location trust node and distributes the Ephemeral key in this key established between the nodes to communicate securely. The second method provides a cryptography chain network, and it maintains each node information in the sink database in this process if any attacker or anyone modifies the data is stored on each individual database. Finally, to find the route between each sink and participate nodes in the network. In this proposed PEBSR method, simulation results in providing efficient security, throughput, and less response time; they are compared to the existing method.

Optimal Multilevel Link Extend Umpiring Routing Based Secure Routing Protocol for Improving Privacy Standard in Wireless Sensor Networks

2020 ◽  
Vol 17 (12) ◽  
pp. 5543-5549
Author(s):  
N. SangeethaPriya ◽  
L. Bharathi ◽  
S. Dola Sanjay ◽  
N. V. D. P. Murthy ◽  
A. N. L. Harisha
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Secure Communication ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Communication Overhead ◽  
Secure Routing Protocol ◽  
Privacy Standard

Generally wireless sensor networks (WSN) are connected via a wireless medium to form a large amount of cooperative sensor nodes. Monitoring control is an important aspect of monitoring users in monitoring applications, such as wireless sensor networks, because of security. There are countless applications to pay for themselves but at the same time, their special properties offer a number of challenges, such as security and surveillance, control, and operation and complex system maintenance. WSN has already seen it on the Internet, from face-to-face security attacks. To propose an Optimal Multilevel Link extend umpiring routing (OML-EUR) based secure routing protocol for improving privacy standard in wireless sensor networks. Secure communication is also important in providing accurate and resource constraints at the sensor node at the moment. In this study, there are three of our contributions. Initially it monitors the neighbor network layer attacks for browsing the WSN on the transmission medium. Followed subscription a link establishment to monitoring the request packets through key transmission of WSN with secure routing protocols. By finding the secure communication as qualities of service verification among the modes to authenticate to transfer. The proposed system produce high secure performance by the result proves energy consumption and communication overhead as higher efficient than previous system.

Sign in / Sign up

Export Citation Format

Share Document