Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

wireless sensor network, Exercises of Wireless Sensor Networks

wireless sensor network project introduction about project

Typology: Exercises

2019/2020

Uploaded on 11/24/2020

rajabhaiya69
rajabhaiya69 🇮🇳

1 document

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Experiment No. 1
Project Title: Broadcast using RSA
Introduction:
Wireless sensor networks (WSNs) are widely used in various
applications, such as building automation, mobile object tracking,
and habitat monitoring. A WSN usually consists of one or more
base stations and a large number of sensor nodes. Because the
sensor nodes are resource-constrained and usually deployed in
hostile environments, they are vulnerable to malicious attacks.
Thus, broadcast authentication becomes a critical issue in WSNs,
which can prevent adversaries from injecting bogus queries.
Traditional schemes applied the key pools, space pools of matrix
or polynomials to establish the pairwise key between any two
neighboring sensor nodes. Although these schemes can establish
a secure communication channel, they cannot withstand injecting
bogus queries.
Thus, three scenarios are considered in this paper. The first
scenario is that users broadcast messages to WSNs using their
own mobile device dynamically, and then each sensor node will
verify these messages. The second scenario is that once malicious
users are revoked by the base station, the action of rekeying will
be triggered by the base station. The third scenario is that when
new users join WSNs, the base station will take some appropriate
actions for these users.
In this project, an RSA-like scheme is employed to construct a
multiuser broadcast authentication mechanism. Although it is
usually thought that RSA is expensive for sensor nodes in terms of
computational overhead, however, the authors in the work in
showed that the cost of the RSA signature verification is not really
pf2

Partial preview of the text

Download wireless sensor network and more Exercises Wireless Sensor Networks in PDF only on Docsity!

Experiment No. 1

Project Title: Broadcast using RSA Introduction: Wireless sensor networks (WSNs) are widely used in various applications, such as building automation, mobile object tracking, and habitat monitoring. A WSN usually consists of one or more base stations and a large number of sensor nodes. Because the sensor nodes are resource-constrained and usually deployed in hostile environments, they are vulnerable to malicious attacks. Thus, broadcast authentication becomes a critical issue in WSNs, which can prevent adversaries from injecting bogus queries. Traditional schemes applied the key pools, space pools of matrix or polynomials to establish the pairwise key between any two neighboring sensor nodes. Although these schemes can establish a secure communication channel, they cannot withstand injecting bogus queries. Thus, three scenarios are considered in this paper. The first scenario is that users broadcast messages to WSNs using their own mobile device dynamically, and then each sensor node will verify these messages. The second scenario is that once malicious users are revoked by the base station, the action of rekeying will be triggered by the base station. The third scenario is that when new users join WSNs, the base station will take some appropriate actions for these users. In this project, an RSA-like scheme is employed to construct a multiuser broadcast authentication mechanism. Although it is usually thought that RSA is expensive for sensor nodes in terms of computational overhead, however, the authors in the work in showed that the cost of the RSA signature verification is not really

expensive. Because each sensor node only needs to verify the RSA signature, the computational cost for a sensor node to verify a message is acceptable. As reported in, public key cryptography is viable on an Atmel ATmega128 at 8 MHz for resource- constrained sensor nodes. The authors tested and implemented elliptic curve point multiplication and RSA operations on two 8-bit microcontrollers with assembly languages. Elliptic Curve Cryptography (ECC) is more computationally efficient than RSA, but RSA can still be implemented for sensor nodes, such as Crossbow MICA Motes. For example, in the implementation of, it requires 0.81 s for 160-bit ECC point multiplication and 0.43 s and 10.99 s for RSA-1024 public key operation and private key operation, respectively. Furthermore, the Chinese Remainder Theorem (CRT) can accelerate RSA private key operations, namely, decryption and signature generation. Broadcast authentication enables each sensor node to verify the received messages which are originated with the authorized source and were not modified. In our scheme, when a user broadcasts a query message to WSNs, each sensor node only has to verify the signature attached in the message using the public key computed by the base station. At the beginning of network initialization, the base station generates RSA public key and private key for each sensor node and each user, respectively. Once a user is revoked, the base station has to regenerate a new RSA public key for each sensor node. At the same time, other users do not have to change their own private key. So, sensor nodes do not have to store a revocation list in their own memory.