2012 Interational Conference on Computing, Electronics and Electrical Technologies [ICCEET]

A Novel Approach to Increase Overall

Effciency in Wireless Sensor Networks
Kuhunundun.L.
Department of Electronics and Communication
Global Academy of Technology,
(Aliatedto |isvesvarayaIechnological |niversig)
Bangalore, India
Abstract-Wireless Sensor Networks (WSNs) consist of
small nodes with sensing, computation and wireless
communications capabilities. Evolution in wireless
sensor network has broadened its pervasive and
ubiquitous applications in numerous felds. These
applications often require accurate information
collecting as well as uninterrupted, prolonged active
service. Routing protocols have signifcant impact on
the overall energy consumption of sensor networks.
Suitable Energy-efcient routing algorithms are
required to the inherent characteristics of these types of
networks are needed. Due to resource limitations in
wireless sensor networks, prolonging the network
lifetime has been of a great interest. Most of the energy
of sensor nodes is utilized for transmission of data to the
base station. Thus, it makes them to deplete their
energy much faster. In this paper, Centrality based
Cluster approach is used along with a movable base
station to reduce the energy consumption of cluster
heads. According to the simulation results, the proposed
scheme has proved its efciency in the network lifetime,
residual energy of network. The proposed scheme also
shows improvement in performance of WSN compared
to other routing scheme.
gw0rd- wrPlP55 5Pn50r nPlw0rk, Clu5lPr hP0J, r0ulng
]r0l0C0l5.
I. INTRODUCTION
Current developments in the world convey us the
speed at which the enhancements in technologies are
moving. Wireless sensor networks are a bridge to the
physical world. It is a fast growing and existing
research area which has attracted considerable
research attention in the recent past; this is backed by
the recent tremendous technological advancement in
the development of low-cost sensor devices equipped
with wireless network interfaces which are
technically and economically feasible. The sensing
electronics measure ambient conditions related to the
environment surrounding the sensor and transform
them into an electric signals which when processed
reveal some properties about objects located or
events happening in the vicinity of the sensor. A
978-1-4673-0210-4/12/$31.00 2012 IEEE 699
5uurNcIr
Department of Electronics and Communication
Atria Institute of Technology
(Aliatedto |isvesvarayaIechnological |niversig)
Bangalore, India
Wireless Sensor Network (WSN) contains hundreds
or thousands of these sensor nodes which can be
networked in many applications that require
unattended operations, these have the ability to
communicate either among each other or directly to
an exteral base-station and also allows for sensing
over larger geographical regions with greater
accuracy. Each sensor node bases its decisions on its
mission, the information it currently has, knowledge
of its computing, communication, and energy
resources and have capability to collect and route
data either to other sensors or back to an exteral
base station or stations which may be a fxed or a
mobile node capable of connecting the sensor
network to an existing communication infastructure
or to the Interet where users have access to the
reported data. Hierarchical or cluster-based routing,
are well-known techniques with special advantages
related to scalability and efcient communication. As
such, the concept of hierarchical routing is also
utilized to perform energy effcient routing in WSNs.
In a hierarchical architecture, higher energy nodes
can be used to process and send the information
while low energy nodes can be used to perform the
sensing in the proximity of the target. Therefore, it
makes them to deplete their energy much faster. The
main problem statement is more energy consumption
to transfer data fom source to base station.
particularly, if the base station is far away fom
source. Recently, some ideas have been proposed
based on Movable base station. In these algorithms,
the base station moves around mthe network in order
to reduce the distance of communication and thus
decrease the energy consumptions. Utilizing
intelligent techniques improves the effciency of
wireless sensor network. In applications that require
real time decision making, fzzy system is a powerfl
tool that can make decision even if there is
insufcient data. In this paper, centrality based
clustering approach along with movable base station
is used which is managed by a fzzy logic for
performance improvement in WSN. In this paper,
2012 Interational Conference on Computing, Electronics and Electrical Technologies [ICCEET]
Section 2 discusses cluster based routing techniques.
Section 3 describes the centrality based clustering
approach and Section 4 provides simulation results
and discusses the efciency of this proposed scheme.
Finally, Section J gives the conclusion of the paper.
II. CLUSTER BASED ROUTING TECHNIQUES
Routing in sensor networks has attracted a lot of
attention in the recent years and introduced unique
challenges compared to traditional data routing in
wired networks. LEACH, PEGASIS, TEEN
APTEEN are some of hierarchical routing protocols.
In this cluster based routing techniques, it is the
responsibility of cluster heads to send data to the BS.
Clustering can be used as an energy efcient
communication protocol. The main aim of clustering
is to minimize the total transmission power dissipated
over the nodes in the selected path, and to balance the
load among the nodes and to increase the network
lifetime. Clustering is grouping of sensor nodes.
Here, each cluster is managed by a special node or
leader, called cluster head (CH), which is responsible
for coordinating the data transmission activities of all
sensors in its group.CH is decided with a different
probability [7]. All sensors in a cluster communicate
with a cluster head that acts as a local coordinator or
sink for performing intra transmission arrangement
and data aggregation. Cluster heads in tu transmits
the sensed data to the global sink.The operation is
divided into rounds. Each round consists of setup
phase and the steady state phase. In the setup phase,
the clusters are organized and Cluster Heads (CHs)
are selected. Each sensor in generates a random
number between 0 and 1. If this number is less than T
(n) defmed by equation (1), then sensor n would be
selected as a cluster head.
j
'
n'
n = -
'
*(rmod
otherwise
(1)
In this equation, P is the desired percentage of CHs, r
specifes the current round and G is the set of nodes
which are lef afer cluster head election, the CHs
broadcast an advertisement message and other nodes
select the closest CHs based on the received signal
strength. In this paper, we consider more efective
parameters for managing the movements of the base
station.
III. CENTRALITY BASED CLUSTER ApPROACH
Wireless sensor networks is a fast growing and
existing research area which has attracted
considerable research attention in the recent past. In
hierarchical routing algorithms, CHs are responsible
700
for gathering, compressing and forwarding the data to
the base station. Thus, they are responsible for
conveying the entire information of the members of
that cluster. If member of a cluster is Far fom the
CH then energy of such node will be wasted in order
to transmit the data to the CH. In order to overcome
such problems we have centrality based cluster
approach, where node which is at equidistance fom
all the members of the cluster is elected as Cluster
Head. In the proposed algorithm, movement of the
base station is managed in each round so that it can
approach to a specifc CH and reduce the CH's load
in the sense of energy consumption. We have
evaluated the effect of energy and number nodes
(members) w.r.t. critical degree .which gave us the
variations w.r.t energy and number of nodes as
shown in fgurel-2. We formed the clusters based on
LEACH algorithm proposed m [3]. Afer organizing
nodes into clusters and at the beginning of each
round, the CHs report their status (such as location,
number of nodes and energy) to the BS via a single
packet called Status Packet. At this point, BS must
decide to which CH it should approach. In other
words, BS must determine the most critical-status CH
and then approach to it. Based on the received
information fom CHs, the BS is able to determine
the distance to the CHs. Decision making is
performed by a fzzy system at the BS. Therefore,
we defne a fzzy system with following parameters
as inputs:
I, CH's residual energy: this gives the status of
cluster head. If it has less energy than more
preference is given.
2) Number of nodes in the cluster: The more
members in the cluster, the more data processing is
required and thus the more preference is given to
such CH.
3) Distance fom base station to CH: The more
distant the CH is fom the base station, the more
energy is required for data communications. Hence
more preference is given to that CH.
We used distance of the CH fom base station and
number of nodes in a cluster for determining Critical
degree because these parameters play important role
to consume energy of CHs. The membership
fnctions of these parameters are shown in Figures 3
to J. The output of the fzzy system is the Critical
Degree specifed to each CH whose membership
fnction is depicted in Figure J. As a result, the more
critical-status CH would be assigned more Critical
Degree.
2012 Interational Conference on Computing, Electronics and Electrical Technologies [ICCEET]

- "

___1 ___
M

. ...... . ,.. .
~
'".
' ! '

"
`.
,
,
,
..
,
.

. " " " .. .. .. .. .. .. ,
|urc.| LVuIuu|OnO!cHcc|O!cncry
|jurc.2 |VuIuu|IOnO!cHcc|O!numDcrO!nOUcs
Afer assigning a Critical Degree to each CH, the BS
determines the most critical-status CH and moves
towards it. If two or more CH have the same Critical
Degree, BS randomly select one of them. The
movements of the base station are limited to a
predefned step size. Afer cluster formation in each
round and receiving all status packets, the BS
determines its new location and move towards it.
Situating in the position, the BS broadcasts the
location across the network, so that CHs would know
it. Now, CHs can adjust their power control
according to their proximity to the BS and send their
data to it. This is as shown in the fgure 6.The fzzy
system consists of a fuzzifer, fzzy rules, fuzzy
inference engine and a defzzifer. We have used If
then rules to fnd the critical status of the CH. The
membership fnctions of CH's remaining
Figure 3 Membership fnction of Energy
701
Figure 4 Membership function of distance to base station

.
.
I[
=.
"
~
II

"
-
` .
I-
[.....
Figure 5. membership function of number of members

.....'1.
L
Figure 6.membership function of critical degree

energy, distance to base station fom CH and number
of nodes in the cluster depend on initial energy, the
position of BS. The maximum range of membership
fnctions are determined by maximum values of
input parameters. Maximum value of Proximity to
BS parameter can be derived as below,
MPBS=x
, " Js,
(2)
Where (x_, y_) is the pOSitIOn of BS. Maximum
values of energy and cluster members are initial
energy and total nodes minus one node as cluster
head respectively. The movement of the base station
is as shown in the fgure 7.afer collecting the status
information of the CH's base station will move
towards new location which is the step 2.afer that it
is going to broadcast its location to all the CH's.now,
the CH's starts processing of the data packets which
is shown as step 4.
2012 Interational Conference on Computing, Electronics and Electrical Technologies [ICCEET]
Figure . Movement of the base station
IV. SIMULATION RESULTS
In this section, we evaluate the performance of
proposed algorithm in MA TLAB simulator. 100
nodes are randomly distributed in a 100 x 1 00 m
2
network. Simulation was performed for 7000 rounds.
We compare our proposed algorithm with LEACH,
in networks Lifetime, remaining energy of the
0 '
'

`
2
0
0
.
*!
.l\ .

;L-
;

. .
Figure 8. Network lifetime

-"
: \\ . . ................. ...................... .. . . + . .
....... ....................... ...................................

Figure 9.Energy of the network

702
network and variance of energy. Lifetime is
considered as the time when the frst node dies.
Figure 7 shows the number of alive nodes with
respect to the operation of the network in rounds.
Approximately the sensors start dying afer 1000th
round. Therefore, it improves the overall network
lifetime. Residual energy of the network in each
round gives the rate of total energy consumption,
which can be a good metric to measure the energy
efciency of the algorithms. Figure' 8 shows the
comparison of network's energy in four algorithms.
In the proposed algorithm the residual energy of
network is much more than others. The fairess of
energy consumption can be well observed by
measuring the variance of the residual energy of all
nodes in each round. The less variant residual energy
in each consequent round is the reason of the fairer
energy consumption. Contrary, more variance in
energy consumption shows that the network's load is
on some sets of nodes. The more straight line
demonstrates the less variant energy consumption,
which is due to the better energy balancing. Energy
varIance IS as shown In the fgure 10.
_. , .. .. ' .... ,. .....
,, . . .. . .....,....................... . .. ............ . ; ....................... , ............ "=
Figure !0.Variace of energy
V. CONCLUSION
Wireless sensors can communicate between
themselves by transferring data through them and
decides the head of the cluster group based on
centrality approach. This is the major advantage of
this technique in the energy conservation. Data
transfer to the base station consumes more energy of
sensors. Mobility of base station can achieve the
conservation of energy. Also prolonging the network
lifetime has been of a great interest due to resource
limitations in wireless sensor networks. Networks
with movable base station have attracted the interests
of researches as an applicable approach to prolong
the lifetime. In this paper, a movable base station
along with centrality based clustering approach is
used. According to the simulation results, it has
shown effciency in the network lifetime and residual
energy of network. The proposed schemes also have
2012 Interational Conference on Computing, Electronics and Electrical Technologies [ICCEET]
proved considerable effciency in different scenarios.
It has also shown Improvement in performance of
WSN compared to other routing scheme.
REFERENCES
[1j J. N. AI-Karak and A. E.Kamal, "Routing techniques in
wireless sensor network: A survey," IEEE wireless
communications, Vol. II,pp. 6-28, December 2004.
[2j W. Heinzelman, A. Chandrakasan and H. Balakrishnan,
"Energy- Efcient Communication Protocol for
Wireless Microsensor Networks," In proceedings of
the 33rd Hawaii Interational Conference on System
Sciences (HICSS '00), January 2000.
[3j K. Akkaya and M. Younis, "A Survey of Routing
Protocols in Wireless Sensor Networks," In the Elsevier
Ad Hoc Network Joural, Vol. 3/3, pp. 325-349, 2005.
[4j S.lindsey and C. S. Raghavendra, "PEGASIS: Power
efcient gathering in sensor information systems," In
Proceeding of the IEEE Aerospace Conference
,Montana, USA, Vol. 3, pp. 1125-1130, March 2002.
[5j Ying-Hong Wang, Chin-Yung Yu, Wei-Ting Chen,
Chun-Xuan Wang "An Average Energy based Routing
Protocol for mobile sink in Wireless Sensor Networks,"
In proceding of First IEEE Interational Conference on
Ubi-Media Computing, pp. 44-49, August 2008.
[j I. Sun, Y. Bi, J. Ma, " A Moving Strategy for Mobile
Sinks in Wireless Sensor Networks," In proceeding of
2nd IEEE Workshop on Wireless Mesh
Networks(WiMesh), pp. 151-153, September 2006.
[7j Nasrin Abazari Torghabeh, Mohammad Reza
Akbarzadeh, Mohammad Hossein Y aghmaee, "Mobile
base station Management using fz logic in wireless
sensor networks" in the proceedings of 2nd
Interational Conference on Computer Engineering and
Technology,2010 .
[8j Raghunadan.G.H, Lakshmi.B.N "A Taxonomy of
Secure Routing protocols for Wireless Sensor
Networks", Proceedings of the Interational Conference
on Frontiers of computer science, August 2011.
[9j R. Zhang, M. J. Lee, S. Soon Joo, "Distributed mobile
sink support in wireless sensor networks," In
proceeding of IEEE Military Communications
Conference(MILCOM) ,pp. 1-6, November 2008
[1Oj Raghunandan.G.H, "A Comparative Analysis of
Routing Techniques for Wireless Sensor Networks",
Proceedings of the IEEE National Conference on
Innovations in Emerging Technology, IEEE Conference
Proceedings febraury2011.
[11j Vivek Kumar, Raghunandan.G.H, Kiran George "A
Comparative Analysis of Hierarchical Routing
Protocols in WSN" in the proceedings of DRDO
Sponsored 8
t
h Interational Conference on Control and
Instrumentation Sysytem-2011, MIT, 2011.
703