A SECURE DATA AGGREGATION TECHNIQUE IN WIRELESS SENSOR NETWORK

By Dr Chaitra HV

The availability of low cost and tiny sensor devices have resulted increased adoption of wireless sensor network (WSN) in various industries and organization. The WSN is expected to play a significant role in future internet-based application service and increased use of wireless devices such as Bluetooth, Wi-Fi etc which requires efficient security and routing design. Due to battery constrained the network performance such as security and device lifetime will get reduced, recharging and providing security of the sensor nodes in unattended environment is very difficult. Routing the Data in sensor nodes plays a vital role in transferring the data to the base station (BS). Different types of routing algorithm have been used such multi hopping, grid based, hierarchical based and clustering based such LEACH, HEED etc... The existing LEACH protocol is designed so far does not consider security as an issue. In this we have focused on incorporating clustering technique based on hierarchy technique namely EEHC-ECC clusters optimization to provide security and improve the lifetime of the sensor nodes. We compare our proposed clustering model with LEACH protocol and analyze its efficiency.

• Language: English
• Publisher: Lulu.com
• Release date: May 30, 2022
• ISBN: 9781387915057

Book preview

ABSTRACT

The availability of low cost and tiny sensor devices have resulted increased adoption of wireless sensor network (WSN) in various industries and organization. The WSN is expected to play a significant role in future internet-based application service and increased use of wireless devices such as Bluetooth, Wi-Fi etc which requires efficient security and routing design. Due to battery constrained the network performance such as security and device lifetime will get reduced, recharging and providing security of the sensor nodes in unattended environment is very difficult. Routing the Data in sensor nodes plays a vital role in transferring the data to the base station (BS). Different types of routing algorithm have been used such multi hopping, grid based, hierarchical based and clustering based such LEACH, HEED etc... The existing LEACH protocol is designed so far does not consider security as an issue. In this we have focused on incorporating clustering technique based on hierarchy technique namely EEHC-ECC clusters optimization to provide security and improve the lifetime of the sensor nodes. We compare our proposed clustering model with LEACH protocol and analyze its efficiency.

Recently, many approaches have been presented to improve lifetime of sensor network adopting clustering technique. For improving cluster head selection multi-objective function are presented in recent time by adopting evolutionary computing and metaheuristic algorithm. However, the existing model incurs computation overhead due to NP-Hard problem and connectivity issues. To address the research issues, this work presents a novel Multi-objective imperialist competitive algorithm (MOICA) for cluster head selection and routing optimization. Experiment are conducted to evaluate the performance of MOICA over LEACH in term of lifetime performance considering first sensor node death and 75% sensor node death. The outcome shows MOICA achieves significant improvement over LEACH based protocols.

Further, for providing secure communication the existing model are designed using public key cryptography such as RSA and Diffe-Hellman etc. As a result, incurs communication overhead and increase packet processing delay. Further, very limited work is done using Elliptical curve cryptography (ECC). The SEEDT model presents an energy efficient cluster head (CH) selection algorithm using multi-objective parameter by enhancing Imperialist Competitive Algorithm (ICA) and employ ECC for providing secure routing. The SEEDT model attain significant performance improvement in terms of communication overhead, packet processing time and lifetime.

For improving energy efficiency of existing model adopted cluster-based routing model. However, it incurs energy overhead among cluster head. This work presents an energy efficient cluster selection algorithm using multi-objective function using enhanced Imperialist Competitive Algorithm. Further, for providing secure communication the existing model is designed using asymmetric cryptography such as RSA and Diffe-Hellman etc. As a result, incurs communication overhead and increase packet processing delay. For overcoming research challenges this work present symmetric Elliptical curve cryptography. The proposed secure and efficient symmetric based ECC (SESECC) attained significant performance improvement in terms of communication overhead, packet processing time and lifetime.

Contents

Chapter 1

1      Introduction

1.1      Introduction

1.2      Issues and challenges

1.3      Motivation and Problem Statement

1.4      Research objectives

1.4.1      General Objectives

1.4.2      Specific objective

1.5      Proposed System

1.6      Research Significance

1.7      Thesis Contribution

1.8      Thesis Organization

Chapter-2

2      Literature survey

2.1      Clustering-based routing model for wireless sensor network

2.2      Cross layer and multi-hop routing model

2.3      Multi-objective optimization and evolutionary computing routing model for clustered network

2.4      Secure routing model for wireless sensor network

2.5      Research gap

Chapter-3

3      A secure and energy efficient cluster optimization by using hierarchial clustering technique

3.1      Introduction

3.2      Overview

3.3      Architecture

3.4      Advantages

3.5      Features

3.6      Energy efficient hierarchical clustering model

3.6.1      Sensor network model

3.6.2      First stage clustering model

3.6.3      Second stage clustering model

3.6.4      Re-clustering model

3.6.5      Data Gathering Model

3.6.6      Elliptical curve cryptography-based routing model

3.7      Result Analysis

3.7.1      Network lifetime performance evaluation:

3.7.2      Communication overhead performance evaluation:

3.8      Summary

Chapter-4

4      Energy Efficient Clustering Optmization using Evolutionary Computing for Wireless Sensor Network

4.1      Introduction

4.2      Overview

4.3      Architecture

4.4      Advantages

4.5      Features

4.6      Multi objective imperialist competitive algorithm

4.6.1      System model and dataset description:

4.7      Result Analysis

4.7.1      Network lifetime performance considering first node death

4.7.2      Network lifetime performance considering 75% sensor node death

4.8      Summary

Chapter-5

5      Secure and Energy Efficient Data Transmission Model for Wireless Sensor Network

5.1      Introduction

5.2      Overview

5.3      Architecture

5.4      Advantages

5.5      Features

5.6      Secure and Energy Efficient Transmission Design for WSN

5.6.1      Multi-objective optimization problem for energy efficient cluster-based routing

5.6.2      System model for SEEDT design

5.7      Result Analysis

5.7.1      Communication overhead performance:

5.7.2      Packet processing time performance evaluation for varied sensor nodes:

5.7.3      Lifetime performance evaluation considering varied sensor node:

5.8      Summary

Chapter-6

6      Secure and Efficient Cluster based  Routing Model for Wireless Sensor Network

6.1      Introduction

6.2      Overview

6.3      Architecture

6.4      Advantages

6.5      Features

6.6      Secure and Energy Efficient Transmission Design

6.6.1      Multi-objective optimization problem description for energy efficient cluster-based routing design

6.6.2      System model for Symmetric ECC security model for cluster based WSN

6.6.3      Symmetric ECC security for cluster-based routing model

6.6.4      Sensor Device Setup Stage:

6.6.5      Secure communication stage:

6.7      Result Analysis

6.7.1      Communication overhead performance

6.7.2      Packet processing time performance evaluation for varied sensor nodes:

6.7.3      Lifetime performance evaluation considering varied sensor nodes:

6.8      Summary

Chapter-7

7      Conclusion and Future Scope

Chapter 8

8      Publication Work

List of Tables

Table 3.1: Simulation parameter

Table 4.1: Simulation parameter

Table 6.1: Abbreviations for symbols and notations used in equations

Table 6.2: Simulation parameter considered

Table 7.1: Results of proposed protocols for total node death

Table 7.2: Results of proposed protocols for first node death

List of Figures

Figure 1.1 : Architecture of Wireless Sensor Clustering Network

Figure 3.1 Architecture of secure and energy efficient hierarchical clustering Model

Figure 3.2 Network lifetime analysis for 500 nodes

Figure 3.3 Network lifetime analysis for 600 nodes

Figure 3.4 Network lifetime analysis for 700 nodes

Figure 3.5 Communication overhead

Figure 4.1 Architecture of proposed energy efficient clustering optimization using MOICA

Figure 4.2 Network lifetime performance of 400 sensor node for first sensor node death

Figure 4.3 Network lifetime performance of 600 node for first sensor node death

Figure 4.4 Network lifetime performance for 800 sensor node first sensor node death

Figure 4.5 Network lifetime performance of 400 nodes for 75% node death

Figure 4.6 Network lifetime performance of 600 nodes for 75% node death

Figure 4.7 Network lifetime performance of 800 nodes for 75% node death

Figure 5.1 Architecture of Proposed SEEDT Model

Figure 5.2 Elliptical curve cryptography

Figure 5.3 Communication overhead performance evaluation for varied sensor nodes

Figure 5.4 Packet processing time performance evaluation for varied sensor nodes

Figure 5.5 Lifetime performance evaluation considering varied sensor nodes

Figure 6.1 Architecture of Proposed SESECC Model

Figure 6.2 Performance of communication overhead for varied sensor nodes

Figure 6.3 Packet processing time performance for varied sensor node

Figure 6.4 Lifetime performance evaluation utilizing varied sensor nodes

List of Abbreviations