2012 Sixth International Conference on Internet Computing for Science and Engineering

A Sensor Network Topology Controlling Algorithm

with Balancing Energy Consumption

Guomin Wu 1, Xiufang Xu1, Sen Xu1, Xiaoxia Wan2

1
School of Information Engineering
Yancheng Institute of Technology, Yancheng, China
2
School of Information Science and Technology
Yancheng Teachers’ University, Yancheng , China

Abstract—Geographical adaptive fidelity (GAF)
algorithm is analyzed theoretically to point out some
reasons for node energy dissipation imbalance. This
paper presents some corresponding solutions. Node
residual energy is taken as one of factors to elect cluster
head, in case that some nodes with low energy will be
dead soon for being cluster head. Data communication is
done by means of single-hop or multi-hop. So some
cluster heads get less chance to consume energy soon,
which is far away with sink node. Simulation results
show that improved geographical adaptive fidelity (IGAF)
algorithm can improve energy consumption balance and
prolong network lifetime, compared with exiting GAF
related algorithms.
Keywords-sensor network; topology control;
geographical adaptive fidelity; cluster election; network life
energy. As to the problem, traditional single hop
communication is transformed to others for node energy
consumption balance, which is mixed single hop with multi
hop data communication.
In order to balance node energy dissipation, some
improvements are given for GAF algorithm. In the cluster
head selection epoch, node residual energy is regarded as one
factor to select cluster head. During data transmission,
network communication is done by mixing single hop and
multi hop. So improved IGAF algorithm can balance node
energy dissipation and prolong network lifetime.
II. GAF ALGORITHM
GAF is topology controlling algorithm as geographic
adaptive fidelity, which network is divided into several
cluster virtual cells. Cluster member can sleep selectively
each cell.

I. INTRODUCTION Running GAF consists of two stages. In the first stage,

As key technology in the sensor network, optimization of
topology controlling can prolong network lifetime, improve
communication efficiency, and provide higher service.
Researching work is carried out in two aspects: power
controlling and hierarchical topology structure. Among
topology controlling algorithms, GAF is one typical
self-organized clustered algorithm, in which cluster head
selection is affected by geographic position [1].
Nowadays, many scholars did a lot of research work in
the researching field. In the literature [2], one hierarchical
topology controlling algorithm is proposed for clustered
sensor network, which can balance node energy dissipation
and prolong network lifetime by rotating cluster head. In the
literature [3-5], node residual energy is regarded as one
factor to elect cluster head node for cluster head locating
unbalance. Selected cluster heads are more applicable for
data transmission. So network energy is consumed with more
balance. In the literature [6], some cluster heads are far away
from Sink node, which are easy to consume too much
network area is separated from many virtual cells by node
location and communication radius on condition that any
nodes in neighbored cells can communicate directly each
other. In the second stage, cluster heads are selected in the
different cells. Cluster member nodes periodically change
their working status alternatively: sleeping and working
status. After node awake, it can exchange some information
with other node in the same cell, which decides whether it
will become cluster head. Stable data transmission is
following.
III. FEATURE ANALYSIS
As typical cell clustered algorithm, GAF is simple, easy
to realize for distributed application, which is suitable for
large scale network. Meanwhile, some shortage exist, the
probability of being selected head is same for all nodes.
Node residual energy is not considered. Cluster member is
selected head at random, which causes some cluster heads
die out easily for too much data processing. Besides, data
communication is done by single hop way. So those cluster

978-0-7695-4705-3/12 $26.00 © 2012 IEEE 208

DOI 10.1109/ICICSE.2012.32
heads are easy to die for consume too much energy, which wireless communication model. The related equation is
are far away from Sink node. following:
IV. RALATIVE SOLUTION
Etr (k , d )  Eelec (k )  E amp (k , d )
As to above existing shortages, some improvements are

following. kEelec  k  fs d 2 d d 0
 kE  k d 4 d d
A. Considering Node residual energy as dicisive factor for  elec  mp 0

cluster head election
In the GAF algorithm, main scheme for cluster head
election is following. In the head election epoch, random
number is given for each node, which ranges 0 and 1. If
random number below threshold T(n), relative node is
selected as cluster head. The equation about T(n) is
following:
 p
 nG
T ( n)  1  p[r mod(1 / p )]
0
 else
Among these parameters, p denotes node percentage, r is
network passed round. G is denoted as unelected node set in
the past 1/p rounds. Improved IGAF algorithm takes node
residual energy as election factor. Value of T(n) is changed
as following:
 p
 * T ' ( n) n G
T (n)  1  p[r mod(1 / p)]
0
 else
and

En _ residual 1  En _ residual 
Eelec denotes node energy dissipation unit from
transmitting or receiving circuit, ¦-fs is denoted as energy
dissipation parameter in free space mode, ¦-mp is denoted
energy dissipation parameter in multi path attenuation
mode. Its unit is J/ (bit.m4).d denotes communication
distance. d0 denotes critical communication distance. In the
mode, data is transmitted from cluster head to base station.
When d below d0, single hop way is taken for data
transmission. Otherwise, multi path way is taken.
(1)
V. IMPROVED ALOGORITHM PROCEDURE
Based on GAF algorithm, two aspects have been
improved. Main procedure is following.
a) In the monitoring area, nodes are deployed at
random.The whole network area is divided into several
subarea.
b) In the cluster head selection, node residual energy is
taken as one factor for dicision. N nodes transmit and receive
message in sequence.
c) All the nodes run with communcation module in the
different cells. Message (E, ID) is sent to inform node which
T (n)'    rs div 1  (2) numbered n.
En _ max

p
En _ max
In the equation (2), En _ residual denotes node residual
energy, En _ max denotes maximal residual energy among the
nodes, also the initial energy, r is passed round.
Considering effect from node residual energy and
threshold, some nodes with low energy can avoid early death
as cluster head.
B. Mixed communication scheme
In the GAF algorithm, single hop is taken as
communication way between cluster head and base station.
In the case, all cluster heads are divided into two parts. The
first one is near to base station. The second one is far away
from base station. The second one will consume more energy
than the first with transmitting same amount of data. The
second is easy to die out for consume more energy. With
network running, node residual energy shows to be
unbalanced. If nodes with below average energy become to
be cluster head, these nodes become blind node instantly.
With blind node increasing, network lifetime will be
affected.
To balance energy dissipation among different clusters,
mixed communication way is taken, which range from single
hop and multi hop. Scholar Heinzelman gives one simple
209
d) When all the nodes get ID and residual energy from
node, the node becomes cluster head informly.
e) The cluster head send some message to surrounding
nodes ,which announces cluster head itself.
f) All the cluster members join their own cluster.
g) During data transmission,the distance between cluster
head and base station is computed, which is noted as
min_dis.
h) If min_dis<= d0, single hop way is taken.Otherwise
multi hop way is taken.
i) If network lifetime ending, exit. Otherwise, jump to
step b.
VI. SIMULATION VALIDATION
A. Senario
One hundred nodes are deployed in the 100*100
monitroing area randomly. Whole area is divided into four
vitual cells. Each node has its own ID and same initial
energy in the cells. Only one sink node is located in the
center of monitoring area, which position is (50,50).Packet
size is 4000bit for data transmission. Controlling packet size
is 32bit as cluster head to broad message. Running process is
following:

Figure 1. Network running process.
In the Figure 1, o represents ordinary node. Node with
star represents cluster head. Node with black o represents
dead node. There is only one cluster head in each cell. In the
network running process, cluster member send some
messages to cluster head. Then cluster head transmit these
messages to sink node.
In the experimental scenario, network performance is
evaluated from two aspects: the number of all live nodes,
network residual energy.
B. The number of all live nodes
In the same running round, the number for all live nodes
are compared with four algorithms in Figure 2.
Figure 2. The number of all live nodes.
With network running round increasing, all four curves
show to be decent obviously. From other aspect, the numbers
for all live nodes decrease continuously. Compared to GAF,
GAF-1and GAF-2, IGAF algorithm owns highest node
living rate among them. With running round increasing,
improved result shows to be more obvious. So improved
IGAF algorithm can further reduce the number of network
dead node, and prolong network lifetime.
C. Network residual energy
Figure 3. Network residual energy.
210
With network running round increasing, all four curves
show to be decreasing, which shows that network residual
energy decreases continuously when network running ahead.
Compared with GAF, GAF-1and GAF-2, IGAF algorithm
improves a lot in the network residual energy. Besides, IGAF
curve decrease steadily, it can provide higher stability for
network running.
VII. CONCLUSION
Feature is analyzed for GAF algorithm. Two aspects are
proposed. Node residual energy is taken as one factor for
cluster head selection. And mixed communication way is
proposed for data transmission, which includes single hop
and multi-hop. Improved IGAF algorithm can better balance
network energy dissipation, decrease the number of dead
nodes in the same running round, and prolong network
lifetime. Future work is focused on cluster head election in
the optimum way.
ACKNOWLEDGMENT
This work was partly funded by the National Natural
Science Foundation of China under Grant No. 60975042 and
61105057, Natural Science Foundation researching project in
Yancheng Institute of Technology No. XKY2011035, and
Talent Introduction Project in Yancheng Institute of
Technology under Grant No. XKR2011019.
REFERENCES
[1] I. F. Akiyldiz, W. Su, Y. Sankarasubramaniam and E. Cayirci,
Ā A survey on sensor networks, ā IEEE Communication
Magazine, 2002, 4(8):102-114.
[2] Wendi.B Heinzelman, P.Chandrakasan, and Hari
Balakrishnan, “An Application-specific Protocol Architecture
for Wireless Microsensor Networks,” IEEE Transactions on
Wireless Communications, 2002, 1(10):660-667.
[3] Ossama, Younis Sonia, and Fahmy, “HEED:Ahybrid,energy-
efficient, distributed clustering approach for Ad hoc sensor
networks,” IEEE Transactions on Mobile Computing, 2004,
3(3):660-669.
[4] N. Dimokas, D. Katsaros, and Y. Manolopoulos,
“Energy-efficient distributed clustering in wireless sensor
networks,” Journal of Parallel and Distributed of Computing,
2010, 70(4):371-383.
[5] Handy M. J, Haase M,and Timmermann D, “Low Energy
Adaptive Clustering Hierarchy with Deterministic
Cluster-head Selection,” in Proceedings of the 4th IEEE Conf.
on Mobile and Wireless CommunicationsNetworks:IEEE
Communications Society, 2002, 10(11):368-372.
[6] Heinzelman,W.B,Chandrakasan, A.P, and Balakrishnan,H,
“Energy- efficient Communication Protocol for Wireless
Microsensor Networks,” in Proceedings of the 33rd Hawaii
International Conference on System Science.Hawaii,USA,
2000, 2(8):1-10.