The Three-Tier Security Scheme in Wireless

Sensor Networks with Mobile Sinks

Abstract:

As we face many vulnerabilities and high traffic in the wireless network, we need

to build a efficient mechanism to the sink mobility to utilize it for rapid change in the network

through load and other factor. So we propose a novel dynamic load handling algorithm based on

the density distribution function and probability distribution for evolution of the computation

ability of the wireless nodes, as implementing this technique, the information delay caused by

moving the sink has been bounded. In simulations, we show the benefits of involving a mobile

sink and the impact of network parameters (e.g., the number of sensors, the delay bound, etc.) on

the network lifetime. Furthermore, we study the effects of different trajectories of the sink and

provide important insights for designing mobility schemes in real-world mobile WNNs.
Hardware software requeriment:

HARDWARE REQUIREMENTS:

Processor : Pentium 4 Cpu 2.40ghz or above

Ram : 512 Mb Ram or above
Hard Disk : 40 Gb or above
Keyboard : Standard
Monitor : 15

SOFTWARE REQUIREMENTS:

Front End : JAVA

Operating System : Windows XP / 7
Back End : SQL Server
5.3 MODULE DESCRIPTION

Construction of Model
Estimation of the network factors in sink mobility
Establishing a DeSM PROBLEM with delay constraints and data routing technique
Implementing the Algorithm in the Energy Efficient Communication protocol
Performance Evaluation

5.3.1 Construction of Model

The construction of nodes and the network model is done in this module. In traditional
Wireless nodes, a sensor node is severely constrained in terms of computation capability and
energy reserves. Wireless nodes will play a significant role at the edge of the future Internet
of Things. Wireless node applications normally contain hundreds of sensor nodes whose
ultimate goal is simply to report sensed data to the sink periodically, without need for any
external control.

5.3.2 Estimation of the network factors in sink mobility

Sinks are capable machines with rich resources. Sensors that are generating data are called
sources. They transmit their data to one or more sinks for analysis and processing. In this
Module, we consider data gathering from sensors, where sensor data are not aggregated on the
way to the sink. That is, each sensor measurement arrives at the sink without any changes. Data
transmission could take place either in a push mode or in a pull mode. In the push mode, sources
actively send data to sinks; in the pull model, they transmit only upon sinks request. The main
source-to-sink communication pattern is multi-hop message rely, as sinks are out of the
transmission ranges of most of sources.

The communication paths from reporting sources to a sink form a reverse multi-cast tree
rooted at the sink. Uneven energy depletion causes energy holes and leads to degraded network
performance. If sensors around a sink all run out of energy, the sink will be isolated from the
network; if all sink are isolated, then entire network fails. Since manual replacement/recharge of
sensor batteries is often infeasible due to operational factors, it is desired to minimize and
balance energy usage among sensors.

5.3.3 Establishing a DeSM PROBLEM with delay constraints and data routing technique
In this module describes the Induced sub problems of DeSM Problem.

Delay of data: The delay of data is defined as the time spent by the mobile sink moving from one
sink site to the next sink site.

Zero Delay: A Sensor node has longest lifetime in one sink site is called zero delay. For the Z-
DeSM, we can apply ZERO to all sink sites and pick up the one with the longest lifetime as the
site for mobile sink.

Infinite Speed: where the sink can move at a high speed (approximately infinite). We name this
sub problem as the I-DeSM problem. It is worth noting that assuming that all sensors stop
monitoring the surrounding environment and no longer generate data during the movement of the
sink will also result in the I-DeSM problem.

Connected Sink Sites: where the sink sites are connected. In this case, sink sites form a graph.
We name the induced sub problem where the sink site graph is connected as C-DeSM. We
develop an optimal algorithm named Sink-Scheduling and Data-Routing algorithm (SSDR),
which runs in polynomial time.

5.3.4 Implementing the Algorithm in the Energy Efficient Communication protocol

In this module delay constraints problem is analyzed. An entire sink site graph G0 is not
connected; we can divide G0 into connected sub graphs, each of which can be solved optimally
by the SSDR. The overall optimal solution for this instance is the same solution of the sub graph
with the longest network lifetime. We have an optimal solution which involves two sites from
two different sub graphs. This means that we find a sink path including these two sites that meets
the delay constraint. Thus, these two sites are connected and should be in the same sub graph.

1. Linear trajectory: This case simulates that the sink travels along one predefined path, for
example, a vehicle carrying a sink moves along the only path across the forest to gather sensed
data daily.

2. Boundary trajectory: It is the most efficient way to collect data in a dense network.

3. Arbitrary trajectory: In this case, we have little control over the distribution of sink sites.
5.3.5 Performance Evaluation

Experimental results show the used maps and the number of feasible cells to be covered.
The performance of the algorithms is measured by the average convergence speed with respect to
the number of sensors while retaining the long lifetime state and by the number of fitness
evaluations. We presented a mathematical formulation that jointly considers different issues such
as sink scheduling, data routing, bounded delay, and so on. The formulation is general and can be
extended. However, this formulation is a MINLP and is time consuming to solve directly. As a
result, the performance of the algorithm can be represented by the involving a mobile sink and
the impact of network parameters e.g., the number of sensors, the delay bound on the network
lifetime. The linear trajectory significantly outperforms the other two and would save a
relatively long computational time.

For example, if n 80, on average, the linear trajectory only needs 3 seconds,
corresponding to 2 percent of the time the other two trajectories need. The reason is quite
straightforward. Since the network topology is the same for all three trajectories, the complexity
is determined by the number of sites. Therefore, the linear trajectory has the best performance.
The Experimental results show, the effects of different trajectories of the sink and important
insights for designing mobility schemes in real world mobile WSNs.