Performance tuning of Datacenters using

Wireless Sensor Networks

Author 1

Author 2

Dr. A. Malathi M.Sc., M.Phil.,

Ph.D

P. Kalai Kannan MCA., M.Phil

Assistant Professor
PG and Research Department of
Computer Science
Government Arts College
Coimbatore

Abstract:
Data

Assistant Professor
Department of M.Sc [Software Systems
& Computer Science]
KG College Of Arts and Science
Coimbatore

and Virtual datas centers somewhere

centers

and

sensor in the cloud computing.

networks are various disciplines in
computer networks. Implementing the Index
Terms:
Wireless
sensor
efficiency of wireless sensor networks networks (WSN), Datacenters (DC),
in the area of datacenters in an and Cloud computing (CC) and, virtual
enterprise and virtual datacenters in data centers (VDC).
cloud computing.
In this study, we propose the I. INTRODUCTION
concept of virtual data sharing in
As to manage an organization
datacenters based on the data loads and effectively nowadays the datas
data movements around the networks. management is an important thing
Through mathematical analysis and which decides the growth of an
graphical
modeling
techniques organization. All the major industries
splitting up of the data loads in in various disciplines managing their
between data hubs in the data centers datas with utmost care because it
and between the enterprise datacenters decides their future in terms of

predictable growth. Data centers are an not only help us to store the datas in
important area where the datas of an the data hub efficiently but also to
organizations are stored with utmost access the from the data hub to any
care and security.

host

computer

that

access

the

Datacenters are nowadays seems to particular content.

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 II. Data load splitting algorithm
based on the data categorization. As DLSP (lb, mp, hp, sp)
the DLSP algorithm helps us to If the (DL<=LB)
redirect the datas from one data hub to Then
another data hub using sensor nodes Add more datas Sensor allow data
for every data hub, where the (PBRA) movements
priority based routing algorithm helps Else if (DL<=mp)
us to find the nearest data hub within Then
the datacenter network based on the Add more datas
data content categorization or else to Sensor allow data movements
some other virtual datacenter while the Else if (DL <= hp)
datahub within the datacenter reach Then
their saturation point. These algorithms Add more datas

Sensor allow data movements

algorithm fails if a void (a large subarea

Else

without nodes) exists in the forwarding

Route or path the incoming datas to direction that is the message reaches an
the next available data center based on intermediate node that is closer to the
its categorization.

destination than any of its neighbour

nodes.

III. Related Work

1. Location based routing
In these technique every node in a
network is positioned based on its
geographic location when a source
node

transmits

message

to

destination with a known location, the

source and all intermediate forwarding
nodes make their routing decisions
based solely on the destination location i) DLSP algorithm
and
the
location
of
their
In this DLSP algorithm, we have
neighbours.since the nodes are not used various functional parameters to
required to maintain routing tables, the measure the data stored rates in the
routing overhead is significantly data hub, the usage of wireless sensors
reduced.

not only helps in movement of the data

The first formal location based in the data hubs of the data
routing algorithm based on a greedy center(DC).Thus the parameters like
principle, in which each node chooses lowbase,highbase,midpoint
and
the neighbour closest to the destination saturation points are used to calculate
as its next forwarding node. The 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.
Table 1: To show the data types
involved in the data movement within
datacenters
algorithms

with

various

DLSP

ii) DLSP algorithm terminology

A. Lowbase: Its a point which
denotes the lowest level of the data
storage level in the data hub of a
Datacenter.
implementation

In
and

both

the

in

non

implementation of DLSP algorithm

there is no any change in the low

based on the various types of data,

base point

it is to be noted that other than text

B. Midpoint: Its a point which

no any type of data can reach that

denotes the middle level of the data

saturation point in the datahubs,

storage level in the data hub of a

then after implementing the DLSP

Datacenter. In this there is a change

algorithm all the data type reach the

in

the

saturation point. It shows the

non

performance increase in terms of

implementation of DLSP algorithm

data storage and data movements

there is no any change in the low

across

base point

Datacenter

performance

implementation

between
and

the

datahubs

in

the

C. Highpoint: It is an important
point which shows a drastic change iii)

Priority

Based

Routing

in the performance of a data hub in Algorithm:

the Datacenter while implementing

In this algorithm the datas are

the DLSP algorithm. At the same

transferred from the source S to the

time while using a data hub without destination D based on the priority
implementing the DLSP algorithm calculated for the nodes. This priority
it

shows

performance.

decrease

in

its calculation is based on the location

based algorithm, where the typical

D. Saturation point: Saturation changes that we have implemented in

point is the only point which helps this algorithm. This change are instead
to identify the need of DLAP of moving the datas from one node to
algorithm in managing the datahubs each node in the entire network, we
in the Datacenter of a network. used to move the datas to the
While using the datahub to store the particular data hub based on the

categorization

and

location.

For Else

example, if the datas are related to Route to VDC (Virtual Datacenter)

videos and these data movements are (note: The routed datas not only
path to the related data hub based on transfer its data movements based on
its categorization and based on the categorizing datas and finding out the
location

prioirities.these

location LBP,but also route the data to virtual

priorities are calculated based on the DC while all the network DH(Data
distance from the source node S, to the hub) seems to e full.
destination node D.

End.
iv. Performance Analysis for Data

Priority Based Routing Algorithm:

PBRA(S, D, Loc)
Begin

Movements and Data retrieval

As the ultimate purpose of
DLSP and PBRA algorithm, not only

Routing of Datasets D from devise the theory for data movements

source node (Hub) S to destination and data routing efficiently but also
node (D) based on categorization(c)

helps to access the data elements fastly

And Location based priority (LBP).

from the data hubs associated in a

Initial S0

network. These two algorithm which

Categorized D

helps to manage the data flow in the

Path the D to nearest node based on datacenter,

not

only

within

the

LBP using short path first option.

datacenters, but also between the

So, If s 0 then D routed

datacenter and between the datacenter

S=s+1

and virtual datacenter. Where the

While (Loc (n) < Loc (n,n+1..n))

virtual datacenter seems to somewhere

Then

located

Route to loc(n)

networks.

other

than

our

private

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.
Fig 4: showing the data movements
performance

levels

before

implementing DLSP algorithm

CONCLUDING REMARKS
Table 2: To show the data transfer
level

before

algorithms

implementing

In this paper, we propose a

DLSP DLSP and PBRA algorithm, which

guaranteed efficient data storing in

data centers. This DLSP algorithm is REFERENCES

specially constructed for the purpose [1]Y-J Kim, R.Govindan, B.Karp, and
of splitting up of datas within the data S.Shenker,
hubs of the data centers based on
various

parameters

and

level

practical,

Geographic
presented

routing
at

made

the

2nd

USENIX/ACM Symp. Networked System

Design and Implementation (NSDI 05),

indicators. This DLSP algorithm can Boston, MA, May 2005.

be implemented to manage and [2] F.Froozan and K.Tepe, Ahigh
transfer the datas efficiently using performance

cluster-based

broadcasting

wireless sensors between various DH algorithm for wireless ad hoc networks based
of

the

datacenters.

The

PBRA

algorithm which is an associated

on a novel gateway selection approach, in

Proc. ACM Int. workshop on Performance
Evaluation of Wireless and Ad Hoc,Sensor ,

algorithm for routing the datas to its and Ubiquitous Networks,2005,pp. 65 70.
appropriate destination based on the [3] M.Garetto, J.Shi, and E.Knightly,
categorization and nearest data hub Modeling media access in embedded twocalculated using this algorithm.
Among the existing algorithm,
the DLSP and PBRA which helps us to

flow

topologies

networks,in

of

multi-hop

Proc.ACM

wireless

MOBICOM,

Aug.2005, pp.200-214.
[4] J.Lian, S.Naik, Y.Liu and L.Chen,

manage and transferring of datas Virtual surrounding face based geocasting

within the private and public data with guaranteed message delivery for ad hoc
centers efficiently and timingly.These and sensor networks, in Proc. IEEE
algorithm which enables the auto data Int.conf. Network Protocols (ICNP06), Nov,
movements in the data centers within
the data hubs and shows the drastic
increases

in

the

2006, pp. 198-207.

[5] I.Stojmenovic, M. Seddiggh, and J.Zunic,
Dominating sets and nieghbor elimination

of based broadcasting algorithms in wireless

datacenters and virtual data centers in networks, IEEE Trans. Parallel distrib.
Cloud computing.

performance

Syst., vol. 13, no. 1, pp. 14 25, Jan. 2002.

[6]

S.Papavassiliou,

Geomulticasting:

Architectures and protocols for mobile ad

hoc networks, J.Parallel distrib. Comput.
vol. 63, pp. 182-195, 2003.
[7]

Dargie,

w.

and

Poellabauer,

C.,

fundamentals of wireless sensor networks:

theory and pratice, John wiley and sons,
2010 ISBN 978-0-470-99765-9, pp. 168-183,
191 192.
[8] Sohraby, K., Minoli, D., Znati, t.
wireless

sensor

networks:

technology,

protocols, and applications, John Wiley and

Sons, 2007 ISBN 978-0-471-74300-2, pp.
203-209.
[8]Hart, J. K. and Martinez, K.(2006)
Environmental

Sensor

Networks:

revolution in the earth system science ?

Earth-Science Reviews, 78, pp. 177-191.
[9] G.Werner-Alen, K. Lorincz, M. welsh, O.
Marcillo, J. Johnson, M. Ruiz, J. Lees,
Deploying a Wireless Sensor Network on an
Active Volcano, IEEE Internet Computing,
vol. 10,no. 2,pp. 18-25, 2006
[10]I.Vasilescu,K.Kotay,

d.Rus,

M.

Dunbabin, andP.corke. 2005. Data collection,

storage, and retrieval with an underwater
sensor network.In Proceedings of the 3rd
international

conference

om

Embedded

networked sensor systems (Sensys 05. ACM,

New York,) NY,USA, 154-165.