PERFORMANCE TUNING OF

DATA CENTERS USING

WIRELESS SENSOR NETWORKS

P.Kalai Kannan
Asst.Professor

KG College Of Arts & Science

Abstract
Data centers and sensor networks are various disciplines
in computer networks. Implementing the efficiency of wireless
sensor networks in the area of datacenters in an enterprise and
virtual datacenters in cloud computing.
In this study, we propose the concept of virtual data
sharing in datacenters based on the data loads and data
movements around the networks. Through mathematical analysis
and graphical modeling techniques splitting up of the data loads in
between data hubs in the data centers and between the enterprise
datacenters and Virtual datas centers somewhere in the cloud
computing.
Index Terms: Wireless sensor networks (WSN), Datacenters (DC),
and Cloud computing (CC) and, virtual data centers (VDC).

INTRODUCTION
As to manage an organization effectively nowadays the
datas management is an important thing which decides the growth
of an organization. All the major industries in various disciplines
managing their datas with utmost care because it decides their
future in terms of predictable growth. Data centers are an important
area where the datas of an organizations are stored with utmost care
and security.
Datacenters are nowadays seems to be an important place
where the datas are stored in terms of numerous data hub which can
be countable in number. Here in this paper the derivation of DLSP
algorithm which helps us to increase the performance of datahubs
in the datacenters in terms of data movements and data splitting
among the datahubs within the data centers based on the data
categorization. As the DLSP algorithm helps us to redirect the datas
from one data hub to another data hub using sensor nodes for every
data hub, where the (PBRA) priority based routing algorithm
helps us to find the nearest data hub within the datacenter network
based on the data content categorization or else to some other
virtual datacenter while the datahub within the datacenter reach
their saturation point. These algorithms not only help us to store the
datas in the data hub efficiently but also to access the from the data
hub to any host computer that access the particular content.

Data load splitting algorithm

DLSP (lb, mp, hp, sp)
If the (DL<=LB)
Then
Add more datas Sensor allow data movements
Else if (DL<=mp)
Then
Add more datas
Sensor allow data movements
Else if (DL <= hp)
Then
Add more datas
Sensor allow data movements
Else
Route or path the incoming datas to the next available data center
based on its categorization.

Location based routing

In these technique every node in a network is
positioned based on its geographic location when a
source node transmits a message to a destination
with a known location, the source and all
intermediate forwarding nodes make their routing
decisions based solely on the destination location
and the location of their neighbours.since the
nodes are not required to maintain routing tables,
the routing overhead is significantly reduced.
The first formal location based routing
algorithm based on a greedy principle, in which
each node chooses the neighbour closest to the
destination as its next forwarding node. The
algorithm fails if a void (a large subarea without
nodes) exists in the forwarding direction that is the
message reaches an intermediate node that is

DLSP algorithm
In this DLSP algorithm, we have used various functional
parameters to measure the data stored rates in the data hub,
the usage of wireless sensors not only helps in movement of
the data in the data hubs of the data center(DC).Thus the
parameters like lowbase,highbase,midpoint and saturation
points are used to calculate and measure the data storage
levels in datahubs. If the data stored levels attain certain
parameters then datas will be routed to some other nearest
DH(data hub) of datacenter present within the network, else
the datas will be transferred to the virtual Datacenters(VDC)
co-ordinated with a secured networks.
The parameters lb and mp are seems to be good for a
data hub(dh) to add much more datas to it, but when the
datas attain the level of hp,it indicates a monitoring level and
when the datas nearing the sp,the sensors will path the datas
to some other data hub.

A.Low base: Its a point which denotes the lowest level of the data
storage level in the data hub of a Datacenter. In both the
implementation and in non implementation of DLSP algorithm there is
no any change in the low base point
B. Midpoint: Its a point which denotes the middle level of the data
storage level in the data hub of a Datacenter. In this there is a
change in performance between the implementation and non
implementation of DLSP algorithm there is no any change in the low
base point
C. Highpoint: It is an important point which shows a drastic change
in the performance of a data hub in the Datacenter while
implementing the DLSP algorithm. At the same time while using a
data hub without implementing the DLSP algorithm it shows a
decrease in its performance.
D. Saturation point: Saturation point is the only point which helps
to identify the need of DLAP algorithm in managing the datahubs in
the Datacenter of a network. While using the datahub to store the
based on the various types of data, it is to be noted that other than
text no any type of data can reach that saturation point in the
datahubs, then after implementing the DLSP algorithm all the data
type reach the saturation point. It shows the performance increase in
terms of data storage and data movements across the datahubs in

Priority Based Routing Algorithm

In this algorithm the datas are transferred from
the source S to the destination D based on the priority
calculated for the nodes. This priority calculation is based
on the location based algorithm, where the typical
changes that we have implemented in this algorithm.
This change are instead of moving the datas from
one node to each node in the entire network, we used to
move the datas to the particular data hub based on the
categorization and location. For example, if the datas are
related to videos and these data movements are path to
the related data hub based on its categorization and
based on the location prioirities,these location priorities
are calculated based on the distance from the source
node S, to the destination node D.

Priority Based Routing Algorithm:

PBRA(S, D, Loc)
Begin

Routing of Datasets D from source node (Hub) S to

destination node (D) based on categorization(c)
And Location based priority (LBP).
Initial S0
Categorized D
Path the D to nearest node based on LBP using short
path first option.
So, If s 0 then D routed
S=s+1
While (Loc (n) < Loc (n,n+1..n))
Then
Route to loc(n)
Else
Route to VDC (Virtual Datacenter)
(note: The routed datas not only transfer its data
movements based on categorizing datas and finding out the
LBP,but also route the data to virtual DC while all the network
DH(Data hub) seems to e full.

Performance Analysis for Data Movements and

Data retrieval
As the ultimate purpose of DLSP and PBRA algorithm,
not only devise the theory for data movements and
data routing efficiently but also helps to access the
data elements fastly from the data hubs associated in a
network. These two algorithm which helps to manage
the data flow in the datacenter, not only within the
datacenters, but also between the datacenter and
between the datacenter and virtual datacenter. Where
the virtual datacenter seems to somewhere located
other than our private networks.
The various levels indicators and graphical models,
that helps to have a clear cut ideas to measure the
data movements and efficiency of data management
using the wireless sensors and their associated wireless
sensor nodes.

CONCLUSION
In this paper, we propose a DLSP and PBRA algorithm,
which guaranteed efficient data storing in data centers.
This DLSP algorithm is specially constructed for the
purpose of splitting up of datas within the data hubs of
the data centers based on various parameters and level
indicators. This DLSP algorithm can be implemented to
manage and transfer the datas efficiently using wireless
sensors between various DH of the datacenters. The
PBRA algorithm which is an associated algorithm for
routing the datas to its appropriate destination based on
the categorization and nearest data hub calculated using
this algorithm.
Among the existing algorithm, the DLSP and PBRA which
helps us to manage and transferring of datas within the
private and public data centers efficiently and
timingly.These algorithm which enables the auto data
movements in the data centers within the data hubs and
shows the drastic increases in the performance of
datacenters and virtual data centers in Cloud computing .

THANK
YOU