Why is IPSec a viable option for wireless sensor networks

Abstract

Many issues still remain to be addressed in order to achieve acceptable security in Wireless Sensor Networks (WSNs). This necessity, together with the adoption of IPv6 on WSNs being defined at the 610wpan lvorking group of the IETF, motivates our investigation on the feasibility of the application of IPSec on sensor nodes. IPSec is already part of IPv6, which makes it a natural candidate to be directly employed or adapted for WSNs. We discuss results obtained from practical experiments on the usage of cryptographic algorithms typically employed within IPSec in real sensor nodes. We analyze the security and performance tradeoffs involved lvhen employing cryptography measures in WSNs, also in the context of their usage side-by-side with IPv6. The results obtained show that the adoption of a security architecture such as IPSec is viable, and also point towards the successful design and deployment of a security architecture for WSNs.

Collaborative Key Exchange System Based on Chinese Remainder Theorem in Heterogeneous Wireless Sensor Networks

“…Then we are realized that IPSec used in the Internet is more suitable compared to other proposed schemes. This standard has already demonstrated its performances in Internet environment and became mandatory component for IPv6 to ensure the end to end security [6].…”

Statistical Results of IPSec in IPv6 Networks

“…[11]Stealing usernames and passwords during logging activities are vulnerable to attacks during authentication. [12] There are several security threats at different levels such as traffic analysis, spoofing of MAC addresses, flooding attacks etc.…”

A Group Key Distribution Scheme for Wireless Sensor Networks in the Internet of Things Scenario

“…(3) Comparison between our scheme and the TKH scheme: we set the total number in set C(c) to be 32, 64, 128, 256, 512, 1024 by designing (α, β, γ) as (2,5,3), (4,5,3), (2,7,9), (4,7,9), (8,7,9), and (16,7,9), respectively. Let q = 2 128 , t = 0.1c , and |p| = lg c. Each node can be identified by using lg c bits.…”

“…Moreover, the length of B (|B| = (ω j + t + 1)lg p + lg q) is shorter than keys (|keys| = 3lg q). Figure 8 shows the total cost of rekeying group key when l(1 ≤ l ≤ 0.1c ) nodes are revoked for (2,5,3), (4,5,3), (2,7,9), (4,7,9), and (8,7,9) in our scheme. We can see that the total cost of rekeying group key increases as the total number of nodes increases.…”

“…Recently, some secure communication schemes for creating an end-to-end secure channel between an Internet node and a sensor node have been researched in different layers of the Open System Interconnection (OSI) reference model. The research work by Granjal et al [3][4][5] and Raza et al [6,7] is aimed at making the application of IPSec in 6LoWPAN sensor nodes a reality while the idea of providing transport level end-toend security includes modified Secure Socket Layer (SSL) scheme based on Elliptic Curve Cryptography (ECC) [8], Transport Layer Security (TLS) scheme using IBC based on ECC or pairings [9] and the scheme that relies on asymmetric authentication and signcryption [10].…”