Energy Efficient Density-based Clustering Technique
for Wireless Sensor Network
Walaa Abd Ellatief, Osama Younes, Hatem Ahmed , Mohee Hadhoud
Faculty of Computers and Information, Menoufia University, Egypt
ZDODDDOL#JPDLOFRPRVDPDB\RXQHVV#KRWPDLOFRPKDWHP#\DKRRFRPPPKDGKRXG#\DKRRFRP
Abstract—Sensor nodes are characterized with limited resources
of processing, memory, and battery. These features motivate the
researchers to propose power-aware communication protocols.
Clustering is used to help for this purpose. It is used to organize
the massive number of deployed sensors in the network to
minimize energy consumption. Different categories of clustering
techniques were proposed. One of these categories is density-
based clustering which mainly depends on measuring the density
around nodes before grouping them into clusters. This paper
proposes an Energy-Efficient Density-based clustering technique
which aims to balance the energy consumption among all clusters.
This is done by the adaptation of the transmission range of cluster
heads to use a suitable value according to the density around it.
Simulation results for the proposed technique shows its
effectiveness as it achieves less power consumption and more
network lifetime when compared with other density-based
clustering techniques.
Keywords—WSN; Clustering; Density; Boundary Nodes;
Transmission Range.
I. INTRODUCTION
Clustering is used as a first step before data exchange to
facilitate the communication between these large numbers of
nodes. Many clustering techniques was proposed in this filed
with different concepts. For example: hieratical, partition, and
density-based clustering.
The main concern in this paper is density-based clustering
techniques where decisions depend on node's degree. It is the
number of neighbours around each node. Proposed technique
doesn't depend only on the node's degree, but how far the
neighbours are distributed. Dense areas mean more number of
nodes in small area, i.e. neighbours are near to each other. So
nodes located at the centre of dense area are able to achieve
more connectivity with less power consumption as it can detect
more near neighbours. So it is recommended to be a cluster
head (CH). On the other hand, areas with low density mean
little number of nodes distributed over a large area. So nodes in
these areas have fewer neighbours and need more power to
communicate with them because they reside away from it.
Proposed technique takes these points into consideration. First,
it chooses CHs mostly centred in dense areas. Second, it also
allows CHs in low density areas to use larger transmission
range to be able to communicate with more neighbours.


‹,(((
196
Achieving these conditions produces balanced clusters in size
and therefore balanced energy consumption distributed all over
the area of the network.
The remaining of the paper has been organized as follows:
Section II covers the related work section. In section III, we
discuss the proposed technique. Section IV presents the test
results. And finally, we conclude the proposed work in section
V.
II. RELATED WORK
Many clustering techniques for WSN have been developed.
The first one specially proposed for WSN was Low Energy
Adaptive Clustering Hierarchy (LEACH) [1]. The protocol
consists of two stages which are setup stage and steady-state
stage. Each node passes a round of the two stages to determine
to be a CH or to join a near CH. For this decision, each node
generates a random number and compares it with a threshold
value computed by equation (1).
‫݌‬ (1)
ଵ ݂݅݊‫ܩ א ݁݀݋‬
ܶሺ‫ݏ‬ሻ ൌ ቐͳ െ ‫݌‬Ǥ ሺ‫ ݀݋݉ ݎ‬௣ሻ
Ͳ ‫݁ݏ݅ݓݎ݁ݐ݄݋‬
where ’is a percentage number of nodes from all nodes to
become a CH. After selecting the set of nodes which will be
CHs, they broadcast an advertisement message to all other
nodes. Each other node will join the cluster of the nearest CH.
So many proposals were made based on LEACH to enhance
its performance. But in this paper, we will focus on examples of
density-based ones. In [2], the author proposed Density-based
LEACH (D-LEACH). It uses the same stages of LEACH but
the probability of any node to join a selected CH depends on the
density around that CH. For  nodes and  required clusters,
the expected density around a CH is  ൌ ‫ڿ‬Ȁ‫ۀ‬. The protocol
measures the local degree of each node, then the node tests if it
reaches the desired degree  of the network. If local density is
less than , it indicates that the node should join cluster for
current round. Otherwise, it has less probability to join a cluster
in this round.
Another example of a density-based clustering protocol is
shown in [3]. The author proposed Density-based Energy-
efficient Game-theory Routing Algorithm (DEGRA). He uses
the benefit of the game theory to solve the problem of CHs
selection. Given a network with area equal  ൈ  and  needed
clusters, the transmission range  of eachh node ୧ can be
calculated from equation (2). Then, the nodee's density ‡ሺ•୧ ሻ
is determined by equation (3) which is thee number of all •୶
nodes which has distance to •୧ less than or equal. After that
each node calculates a utility function  as shown in equation
(4). Utility function depends on residual enerrgy of the node and
the average energy consumed by the node if i selected as a CH
among its neighboring nodes. By calculatinng utility values for Fig. 1 Difference betweenn interior and border node
all nodes, k nodes with the largest  value will be selected as
CHs. Any node ܲ is an interior node, if and only if the angles
formed by the node ܲ with otheer three neighbors nodes satisfies
 (2) equation (5):
 ൈ  ൌ Ɏଶ  ൌൌ൐ ܴ ൌ 
ξɎ
ξ ‫ ס‬൅ ‫ ס‬൅ ‫ ס‬ൌ ͵͸Ͳ (5)
‡ሺ•୧ ሻ ൌ  ෍ ͳ (3) This rule can be representeed in the terms of distance as
଴ழ௫ழே Ƭௗሺୱ౟ ǡୱ౮ ሻஸ
ஸୖ shown in equation (6):
୰ୣୱ୧ୢ୳ୟ୪ ሺ•୧ ሻ (4)
୧ ൌ 
୲୭୲ୟ୪ౙ౥౩౪ ሺ•୧ ሻȀ‡ሺ•୧ ሻ ‫ ݔ‬ଶ ൅ ‫ݕ‬ଶ െ ܿଶ ‫ ݔ‬ଶ ൅ ‫ݖ‬ଶ െ ܾଶ (6)
‘• ିଵ ሺ ሻ  ൅  ‘• ିଵ ሺ ሻ
ʹ‫ݕݔ‬ ʹ‫ݖݔ‬
III. PROPOSED TECHNIIQUE ଶ ଶ
‫ݕ‬ ൅ ‫ݖ‬ െ ܽଶ
Sensors in WSN are randomly distributedd in the area of the ൅ ‘• ିଵି
ቆ ቇ
ʹ‫ݖݕ‬
network. In most cases, the distribution is non-uniform
n which
yield areas with different densities startinng from very high ൌ ͵͸ ͸Ͳ
density to holes that don’t contain any nodes. The proposed Before applying this technnique, we need to define the
technique doesn't depend on the degree of eaach individual node transmission range of each node. Upon which it can define the
only, but it tries to discover nodes which border different list of its 1st hop neighbours anda can test the interior rule. In
density areas. This helps in dividing the whoole network to sub- other words, we have to define the transmission range as it will
regions with defined density-level. control the node's degree. To determine
d this value, we use the
probability equation used in [8]. In this paper, the author defines
In the following section, the detailed steeps of the proposed an equation which relates betweeen the transmission range value
technique are presented with the following asssumptions: and the achieved node's degrree upon using this value. He
• The numbers of sensor nodes is definnes as . assumes a network with  nodes n randomly and uniformly
distributed in a simulation area  ൌ  ൈ . So constant density
• The area of the environment is defineed as  ൈ . ୒
can be defined as ɏ ൌ Ǥ Foor all sensor node that has a
୅
• The distribution of nodes is non-unifoorm. transmission range ” covers an area: ൌ Ɏ” ଶ , the probability
that each node has at least  neeighbors, i.e., the network has a
• Every node knows its spatial position
p as ሺšǡ ›ሻ minimum node degree †୫୧୬ ൒  , is given by:
coordinates.
As mentioned, proposed technique depennds on defining sub- ௡
(7)
ሺߩߨ‫ ݎ‬ଶ ሻே ିఘగ௥ మ
௡ିଵ
regions of different density. This is done by defining nodes that ܲሺ݀௠௜௡ ൒ ݊ሻ ൌ ቆ ͳ െ ෍ Ǥ ݁ ቇ
border each sub-region. So, we use a border detection
d technique ேୀ଴ ܰǨ
to determine a set of nodes that borderr sub-regions with To test the interior rule founnd in [7], each node need at least
different densities. Border detection probllem in WSN is a three neighbours. In the propoosed technique, it is needed to
famous problem that has been studied by manny researchers such achieve ሺ†୫୧୬ ൒ ͵ሻto test interrior rule.
as in [4] [5] [6]. We choose a technique prresented in [7]. We ଶ
choose this one because each node needss only the 1st hop ሺɏ Ɏ ” ଶ ሻ୒ (8)
మ
neighbor’s information and by one step it cann determine if it's a ሺͳ െ ෍  ȉ  ‡ି஡஠୰  ሻଷ ൐ ݄ܶ
Ǩ
border or interior node. The author definees a rule to know ଶ
୒ୀ଴
interior nodes. If node satisfies this rule, it will be interior. ሺɏ Ɏ ” ଶ ሻ୒ (9)
మ య
Otherwise, it will be border one. The rule requires that each ෍ ȉ ‡ି஡஠୰
ି
൐ ͳ െ ξ݄ܶ
Ǩ
interior node is surrounded with neighboours distributed in ୒ୀ଴
different directions so that they can construcct a triangle around We choose a threshold vallue Š ൌ ͲǤͻͻͻͻ and ” in the
the tested node. This idea is shown in Fig. 1. range ሾͳǡ ƒšሺǡ ሻሿ to test eqquation (9). As we assumed that
our network has a non-uniform m distribution, i.e. density isn't
constant. So we propose to make m mediation for the resulted
value of transmission range. Thhe value calculated in this step is
the initial transmission range thaat will be used by all nodes.
After setting the initial trannsmission range and testing the
type of each node as interior orr border node, we will calculate

197
the density around each node and then start s the clustering
process. The benefit of the proposed techniquue is that it doesn’t
depend on the number of neighbours around the node only. But
the types of neighbours of the node which can be interior or
border node give more indication abouut how far these
neighbours are distributed. So it can be usedd to determine what
the density of each sub-region is. More interior
i neighbours
around a node indicate higher density region. But the
appearance of more border neighbours indiccates a low density
area. This is shown in Fig. 2. Red nodes aree border ones while
blue nodes are interior ones. Border nodes ofo region 1 define a
hole. Interior nodes of region 2 define dense area. The
appearance of more border nodes means reggion of low density
such as region 3.
During the lifetime of the neetwork, energy of CHs dissipated
more rapidly than other nodes, sos it has to be changed and select
another one. We propose that neew CH node has to be selected if
the current CH's residual energgy is less than 15% of its initial
energy. The new one is the neearest neighbours of the current
CH. Another case, when the current
c distribution of the whole
network becomes dramaticallly different from the initial
distribution which means neew sub-regions with different
densities appears. So, if the BS recognizes that total number of
nodes in the network is less than t 50% of initial number of
nodes, we start the clustering proocess from the beginning.
Our proposed technique can be summarized in the following
steps:
(1) Calculate initial transmissioon range.
(2) Test the type of the node iff it is interior or border.
(3) Calculate node's degree andd type of neighbours for interior
neighbours.
(4) Select CH with higher num mber of interior neighbours.
(5) Increase the transmission raange for CHs with more border
neighbours.
(6) Change CH nodes if CH's residual
r energy < 15% of initial
energy or if 50% of nodes die.
d

IV. SIMU
ULATION RESULT
Simulation was done to coompare the performance of our
Fig. 2 The effect of classifying nodes to interior or border nodes proposed protocol, LEACH,, D-LEACH and DEGRA.
Simulation done for a ͺͲͲ ൈ ͷͲ ͲͲଶ topology with a 250 node
To measure the density around each noode, we start with distributed randomly. In our simmulation, we use the same radio
interior nodes and count its neighbours and test their type. We model of [9]. Node's circuits opeerate and consume ୣ୪ୣୡ –‘send
define levels of density, and each node assiggns itself to one of or receive data. Amplifier connsumes energy ɂ୤ୱ for small
these levels. In our simulation, we define foour levels. Level 1: distances and ɂ୫୮ for large distaances. Nodes also consume ୈ୅
nodes which have 100% of its neighbours arre interior. Level 2:
to aggregate data before being sent
s to BS. So energy consumed
have 75% interior neighbours. Level 3 has 50% interior
to transmit -bit message to a sink located at distance † is
neighbours and level 4 has 25% interior neighhbours.
given by equation (10) and (11)..
Finally, each node uses its degree and levvel to decide to be a
CH or not. Nodes located at the center off dense region are ୘ଡ଼ ൌ ୣ୪ୣୡ ȉ  ൅ ɂ୤ୱ ȉ  ȉ †ଶ ™Š‡† ൏ ଴ (10)
recommended to be a CH because it will w achieve more ୘ଡ଼ ൌ ୣ୪ୣୡ ȉ  ൅ ɂ୫୮ ȉ  ȉ †ସ ™Š‡† ൒ ଴ (11)
connectivity with less transmission range. On O the other hand, And the energy consumed to receive and aggregate -bit
CHs selected in low density regions need to use more message is given by equation (12) and (13) consecutively.
transmission range to balance its size.
ୖଡ଼ଡ଼ ൌ ୣ୪ୣୡ ȉ  (12)
The process of cluster formation begins with CH selection ୅୥୥୥ ൌ  ୈ୅ ȉ  (13)
and configuration then other nodes will join the t nearest CH. CH
nodes are selected as the one with largest deegree and classified In the following table, we
w preview the values of our
in a higher level sub-region. The transmisssion range of the simulation parameters.
selected CHs has to be re-configured to mattch the distribution TAB
BLE 1
of its neighbours. The adaptation of the trannsmission range of
VALUES FOR THE SIMU
ULATION PARAMETERS
CHs controls the size of the cluster and therrefore balances the
energy consumption. The final transmisssion range value Simulation Parameterss Values
depends on the density level of the CH. Thhis means that CHs Initial Energy of nodes 0.5 j
from level 1 use less transmission range thann level 2, and so on.
Eelec 50 nJ/bit
i.e. as the density level increase use larger traansmission range to
cover more neighbours and balance the size of this cluster with ɂ୤ୱ 10pJ/bit/m2
lower levels. After the end of CHs selection, non-selected nodes ɂ୫୮ 0.0013pJ/bit/m4
start to join the cluster under the nearest CH resides in its EDA 5 nj/bit/signal
transmission range. By the end of this stepp, CHs are selected D0 87m
and clusters are formed. Packet size 4000byte

198

We compare between the four protocols to test the total
energy consumed during the connection for the whole network.
The energy consumption in the network is the total value of
energy lost in all nodes. Nodes lose different energy amount
according to its rule in the network. CHs energy consumption is
given by equation (14). Member nodes energy consumption is
given by (15). The total energy consumption in the network is
calculated as in equation (16).
‫ܧ‬஼ுୀ ୈ୅ ȉ  ൅ ୣ୪ୣୡ ȉ  ൅ ɂ୫୮ ȉ  ȉ †ସ୆ୗ
‫ܧ‬ெ௘ ൌ  ୣ୪ୣୡ ȉ  ൅ ɂ୤ୱ ȉ  ȉ †ଶେୌ
160
140
120
100
Energy Consumption
80
jouls
60
40
20
0
-200 0 200
-20
Number of Rounds
Fig. 3 The total energy consumption of all nodes during the rounds of the network
The conserved energy cause a longer lifetime for a network
running the proposed technique. This is shown in Fig. 4 . In this
figure, we compare the four protocols by measuring the total
network lifetime. We simulate a ͶͲͲ ൈ ͶͲͲଶ with different
number of nodes. The proposed protocol achieve longer
network lifetime than the three other protocols. From the figure,
it can be clearly seen that density-based clustering techniques
can achieve good performance especially when the number of
‫ܧ‬௧௢௧௔௟ ൌ ܰǤ ୣ୪ୣୡ ȉ  ൅ Ǥ ɂ୤ୱ ȉ  ȉ †ଶେୌ (16)
൅ Ǥ ୈ୅ ȉ  ൅ Ǥ ୣ୪ୣୡ ȉ  ൅ 
ȉ ɂ୫୮ ȉ  ȉ †ସ୆ୗ
where  is the total number of nodes in the network,  is the
length of packets, and  is the number of CHs. Fig. 3 shows the
total energy consumption during rounds of the network. It
shows that the proposed protocol consumes less power than
especially in the early rounds of the network lifetime. This is
because CHs are chosen as the mostly centred interior nodes in
(14) each sub-region which are able to communicate with more
members with less power. By the time, more nodes die. So CHs
(15) will consume more power as the density of each sub-region
change.
Proposed
LEACH
D-LEACH
DEGRA
400 600 800 1000
nodes isn't sufficient to achieve uniform density. This is shown
when using less than ʹͷͲ node in ͶͲͲ ൈ ͶͲͲଶ network.
Increasing the number of nodes in a network with the same area
which use a density-based clustering technique will not achieve
more rounds, although conversely the distribution of the
network approach a uniform distribution and the benefits of
density-based techniques will not be realized.
199
 3500

3000

2500
Number of Rounds

2000
SDC
1500 LEACH
DLEACH
1000
DEGRA
500

0
0 50 100 150 200 250 300
Number of Nodes

Fig. 4 The lifetime of the network for different number of nodes

V. CONCLUSION
This paper proposes a density-based clustering technique
that achieves a balanced load between all constructed clusters.
The benefits in the proposed protocol that it didn't determine
fixed number of CH like other protocols. The final number of
CHs will depends on the initial distribution of the nodes. Two
reasons cause power conservation. First one is the definition of
different levels of density which enable nodes to choose suitable
transmission range according to the density around it. Second
one is the choice of CHs. It is chosen as interior nodes that are
mostly centered in dense areas. These nodes are able to
communicate with more neighbours using less power. These
two reasons cause a conservation of power during the rounds of
the network and also increase the lifetime of the network.
REFERENCES
[1] W. R. Heinzelman, A. Chandrakasan and H. Balakrishnan,
“Energy-Efficient Communication Protocol for Wireless
Microsensor Networks,” in Proceedings of the 33rd annual
Hawaii international conference on System sciences, IEEE,
2000, pp. 10--pp.
[2] J.-S. Kim and T.-Y. Byun, “A Density-Based Clustering
Scheme for Wireless Sensor Networks,” in Advanced
Computer Science and Information Technology, Springer,
2011, pp. 267--276.
[3] Z. Xu, Y. Yin and J. Wang, “An Density-based Energy-
efficient Routing Algorithm in Wireless Sensor Networks
Using Game Theory,” International Journal of Future
Generation Communication and Networking, vol. 5, pp. 99-
-112, 2012.
[4] M. I. Ham and M. A. Rodriguez, “A boundary
approximation algorithm for distributed sensor networks,”
International Journal of Sensor Networks, vol. 8, pp. 41--
46, 2010.
[5] Y. Wang, J. Gao and J. S. Mitchell, “Boundary recognition
in sensor networks by topological methods,” ACM, 2006,
pp. 122--133.
[6] I. Khan, H. Mokhtar and M. Merabti, “A survey of
boundary detection algorithms for sensor networks,” in
Proceedings of the 9th Annual Postgraduate Symposium on
the Convergence of Telecommunications, Networking and
Broadcasting, 2008.
[7] S. Shukla and R. Misra, “Angle Based Double Boundary
Detection in Wireless Sensor Networks,” Journal of
networks, vol. 9, pp. 612--619, 2014.
[8] C. Bettstetter, “On the Minimum Node Degree and
Connectivity of a Wireless Multihop Network,” in
Proceedings of the 3rd ACM international symposium on
Mobile ad hoc networking computing, ACM, 2002, pp. 80--
91.
[9] T. S. Rappaport and others, Wireless Communications:
Principles & Practice, vol. 2, prentice hall PTR New Jersey,
1996.

200