International Journal of Parallel, Emergent and Distributed Systems

Fo
rP

A Novel Cluster-head Selection Algorithm for Wireless

Sensor Networks
ee

Journal: International Journal of Parallel, Emergent and Distributed Systems

rR

Manuscript ID: GPAA-2009-0090

Manuscript Type: Original paper

ev

Date Submitted by the

01-Dec-2009
Author:

Complete List of Authors: Ding, Rong; Beihang University, Computer Science

ie

Yang, Bing; Beihang University, Computer Science

Yang, Lei; Beihang University, Computer Science
Wang, Jiawei; Beihang University, Computer Science
w

cluster-head selection algorithm, clustering algorithm, soft

Keywords:
threshold, wireless sensor networks
On
ly

URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo

Page 1 of 19 International Journal of Parallel, Emergent and Distributed Systems

1
2
3
4
5
6
7
8
9
10
11
12
13
14
Fo
15
16
17
18
rP
19
20
21
22
ee
23
24
25
26
rR

27
28
29
30
ev

31
32
33
34
ie

35
36
37
w

38
39
40
On

41
42
43
44
45
ly

46
A brief flowchart of LEACH algorithm
47
133x188mm (96 x 96 DPI)
48
49
50
51
52
53
54
55
56
57
58
59
60
URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo
 International Journal of Parallel, Emergent and Distributed Systems Page 2 of 19

1
2
3
4
5
6
7
8
9
10
11
12
13
14
Fo
15
16
17
18
rP
19
20
21
22
ee
23
24
25
26
rR

27
28
29
30
ev

31
32 The flowchart of soft threshold calculation
33 139x99mm (96 x 96 DPI)
34
ie

35
36
37
w

38
39
40
On

41
42
43
44
45
ly

46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo
Page 3 of 19 International Journal of Parallel, Emergent and Distributed Systems

1
2
3
4
5
6
7
8
9
10
11
12
13
14
Fo
15
16
17
18
rP
19
20
21
22
ee
23
24
25
26
rR

27
28
29
30
ev

31
32 The lifetime of 100-node network with initial energy 2J/node.
33 169x127mm (72 x 72 DPI)
34
ie

35
36
37
w

38
39
40
On

41
42
43
44
45
ly

46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo
 International Journal of Parallel, Emergent and Distributed Systems Page 4 of 19

1
2
3
4
5
6
7
8
9
10
11
12
13
14
Fo
15
16
17
18
rP
19
20
21
22
ee
23
24
25
26
rR

27
28
29
30 Performance comparison when 1%, 50% and 100% of nodes died.
127x84mm (96 x 96 DPI)
ev

31
32
33
34
ie

35
36
37
w

38
39
40
On

41
42
43
44
45
ly

46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo
Page 5 of 19 International Journal of Parallel, Emergent and Distributed Systems

1
2
3
4
5
6
7
8
9
10
11
12
13
14
Fo
15
16
17
18
rP
19
20
21
22
ee
23
24
25
26
rR

27
28
29
30
ev

31
32 Comparison for STCS algorithm with parameter of p2, p2/2 and p2/4.
33 169x127mm (72 x 72 DPI)
34
ie

35
36
37
w

38
39
40
On

41
42
43
44
45
ly

46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo
 International Journal of Parallel, Emergent and Distributed Systems Page 6 of 19

1
2
3
4
5
6
7
8
9
10
11
12
13
14
Fo
15
16
17
18
rP
19
20
21
22
ee
23
24
25
26
rR

27
28
29
30
ev

31
32 The Comparison of STCS with different initial probability and LEACH.
33 169x127mm (72 x 72 DPI)
34
ie

35
36
37
w

38
39
40
On

41
42
43
44
45
ly

46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo
Page 7 of 19 International Journal of Parallel, Emergent and Distributed Systems

1
2
3
4
5
6
7
8
9
10
11
12
13
14
Fo
15
16
17
18
rP
19
20
21
22
ee
23
24
25
26
rR

27
28
29
30
ev

31
32 Comparison of STCS and LEACH for 200 nodes network.
33 169x127mm (72 x 72 DPI)
34
ie

35
36
37
w

38
39
40
On

41
42
43
44
45
ly

46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo
 International Journal of Parallel, Emergent and Distributed Systems Page 8 of 19

1
2
3
4 A Novel Cluster-head Selection Algorithm for Wireless Sensor
5 Networks
6
7
8
Rong Ding, Bing Yang, Lei Yang, Jiawei Wang
9
10 State Key Laboratory of Software Development Environment, Beihang University,
11 Beijing, China,
12
13
14
dingr@buaa.edu.cn, {ybing, rockyanglei, wangjiawei}@cse.buaa.edu.cn
15
16 In recent years, many clustering algorithms have been proposed. Among them, LEACH
Fo

17 is the most famous one. However, in LEACH, within each 1/p rounds, once a node has
18 been selected as a cluster-head (CH), its threshold will be set to 0, and thus it will lose
19 the chance to participate cluster-head selection, even if it still has enough energy. In this
20 paper, we present a novel cluster-head selection algorithm. Instead of changing the
rP

21 threshold to 0 directly, the proposed algorithm adjusts the threshold of each node
22 gradually according to the roles they have played in the last round, so more nodes could
23 have the opportunity to be CHs. Simulation results show that the proposed algorithm
24 outperforms LEACH in network lifetime by an average of 30% approximately, In
addition, when the scale of network is expanded, the STCS algorithm can also perform
ee

25
26 better than LEACH.
27
28 Keywords: wireless sensor networks; clustering algorithm; cluster-head selection algorithm; soft
rR

29 threshold;
30
31
32 1. Introduction
33
ev

34
35
36 Wireless Sensor Network (WSN) comprises of micro sensor nodes, which are usually
iew

37
38 battery operated sensing devices with limited energy resources. In most cases,
39
40
41 replacing the batteries is not an option [1][2]. In order to extend the network lifetime,
42
43 many routing protocols have been devised. One of these is network clustering, in
On

44
45 which network is partitioned into small clusters and each cluster is monitored and
46
47
controlled by a node, called Cluster Head (CH). A CH is responsible for conveying
ly

48
49
50 any information gathered by the nodes in its cluster and may aggregate and compress
51
52
the data before transmitting it to the base station (BS). Other nodes send the data
53
54
55 sensed from the environment to these CHs. However, the added responsibility results
56
57 in a higher rate of energy drain at the CHs, and thus power-efficiency is important in
58
59
60
designing clustering protocols. LEACH (Lower Energy Adaptive Clustering

Hierarchy) [3], which is one of the most popular clustering mechanisms, addresses

URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo

Page 9 of 19 International Journal of Parallel, Emergent and Distributed Systems

1
2
3
this by probabilistically rotating the role of CH among all nodes. However, its cluster-
4
5
6 head selection mechanism is based on a kind of hard threshold. This kind of selection
7
8 mechanism causes that a node cannot continue to participate the cluster-head election
9
10
11
process, once it has acted as a CH in the current 1/p rounds. Therefore, as the
12
13 algorithm continues, the nodes which can be chosen as CHs will become fewer and
14
15 fewer. This paper focuses on how to resolve it by developing a novel approach of
16
Fo

17
18 cluster-head selection.
19
20 This paper builds on the work described in [4] by giving a detailed description
rP

21
22 and analysis of Soft Threshold based Cluster-head Selection (STCS) Algorithm, a
23
24
novel cluster-head selection algorithm for wireless sensor networks. In our previous
ee

25
26
27 work, we simulate a 100-node network to observe the performance of STCS. This
28
rR

29
paper is an extended version of the previous one. In this paper we expand the network
30
31
32 size and try different initial probabilities of becoming cluster-head of each node, then
33
ev

34 observe the influence of network size on performance of STCS and find the optimal
35
36
initial probability.
iew

37
38
39 The rest of this paper is organized as follows: Section 2 presents a brief
40
41 description of the related work. Section 3 describes the limitations of the current
42
43
On

44 LEACH algorithm and our algorithm on cluster-head selection in detail. Finally,

45
46 simulation results are presented in Section 4, while Section 5 concludes the paper.
47
ly

48
49
2. Related work
50
51 In recent years, many algorithms and protocols for cluster-head selection have been
52
53 proposed. These algorithms improve the performance of cluster-head selection from
54
55
56 different perspectives. In this section, we detail the related work on these
57
58 improvements. As what is mentioned in the above paragraph, LEACH is the most
59
60

URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo

 International Journal of Parallel, Emergent and Distributed Systems Page 10 of 19

1
2
3
popular clustering algorithm. Lots of cluster-head selection algorithms are based on
4
5
6 LEACH’s architecture.
7
8 LEACH-C (Centralized) [5] uses a centralized controller to select CHs. By
9
10
11
using a central control algorithm to form the clusters, it can produce better clusters by
12
13 dispersing the CH nodes throughout the network. The main drawbacks of this
14
15 algorithm are non-automatic cluster-head selection and the requirement that the
16
Fo

17
18 position of all sensors must be known. LEACH’s stochastic algorithm is extended in
19
20 [6] with a deterministic cluster-head selection, which utilizes the remaining energy
rP

21
22 level of each node to determine the threshold. However, to get the energy level of
23
24
sensors in a real network usually needs a routing protocol which will create new cost.
ee

25
26
27 HEED (Hybrid Energy-Efficient Distributed Clustering) [7] is a distributed clustering
28
rR

29
scheme in which CH nodes are picked from the deployed sensors. HEED considers a
30
31
32 hybrid of energy and communication cost when selecting CHs. In CEFL (Cluster-
33
ev

34 head Election Using Fuzzy Logic) algorithm [8], a kind of fuzzy logic method is
35
36
adopted to select the CH. In literature [9], the author propose a approach to optimally
iew

37
38
39 determine the location of cluster-heads for minimizing communication power, which
40
41 require that each sensor node connects to at least p cluster-heads for reliability, and
42
43
On

44 each cluster-head can accept at most q connections. In order to overcome the fact that
45
46 a Mixed Integer Nonlinear Programming (MINLP) problem, the author proposes an
47
ly

48 iterative decomposition algorithm and use a randomized multi-start technique for

49
50
51 global optimization. In literature [10], the author propose an Adaptive Clustering
52
53 Protocol for Medium-scale (ACPM) WSNs which is a LEACH-like clustering
54
55
56
protocol, it has a new cluster head selection strategy with an adaptive back-off scheme
57
58 to overcome the power limitation of broadcasting ADV messages in LEACH. In [11],
59
60 the author propose an ELCH(Extending Lifetime of Cluster Head) routing protocol

URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo

Page 11 of 19 International Journal of Parallel, Emergent and Distributed Systems

1
2
3
that has self-configuration and hierarchal routing properties, which organize the
4
5
6 clusters on the basis of radio radius and the number of cluster members. In addition,
7
8 the selection of cluster-head is according to the votes from their neighbors. In
9
10
11
literature [12], the author proposed A new algorithm for building and regroup clusters,
12
13 which is called Improved Distributed Cluster Organization Algorithm (IDCOA). By
14
15 the proposed algorithm, nodes are clustered via the way that some nodes propose
16
Fo

17
18 invitations, and other sensors respond.
19
20 Different from the algorithms mentioned above, our algorithm focuses on
rP

21
22 improving the cluster-head selection by adjusting the threshold of each node to
23
24
become CH gradually to extend the network lifetime.
ee

25
26
27
28 3. Algorithm description
rR

29
30 In this section, we review LEACH algorithm and discuss its limitations, and then put
31
32 forward our improvement on cluster-head selection in detail.
33
ev

34
35 3.1 LEACH
36
The operation of LEACH is broken up into rounds. Each round begins with a set-up
iew

37
38
39 phase, in which the clusters are organized. Then there is a steady-state phase, in which
40
41
42
data is transferred to the base station. At the beginning of each round, each sensor
43
On

44 node chooses a random number between 0 and 1, and compares it with a threshold
45
46 T(i). If the number is less than T(i), the node becomes a cluster-head in the current
47
ly

48
49 round. The threshold is set as:
50
51  p
 i∈G
52 1
53 T (i ) = 1 − p * (r mod ) (1)
p
54 
0 otherwise
55
k
56 p =
57 Where N ( N is the total number of network nodes, and k is the desired
58
59 cluster-head number of each round) is the desired (optimal) percentage of cluster
60

URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo

 International Journal of Parallel, Emergent and Distributed Systems Page 12 of 19

1
2
3
4 0≤ r < 1
p
heads, r represents the current round ( ) and G is the set of nodes that have not
5
6
7 been selected as CHs in the last r rounds. Thus, each node will be a CH at some point
8
9 within 1/p rounds. The cluster head nodes broadcast their status to other sensors in the
10
11
12
network. Each non-cluster-head node determines to which cluster it wants to belong
13
14 by choosing the CH that requires the minimum communication energy. Once all the
15
16 nodes are organized into clusters, each CH creates a TDMA schedule for the nodes in
Fo

17
18
19 its cluster. This allows the radio components of each non-cluster-head node to be
20
rP

21 turned off all time except its transmitting time, and thus the energy dissipated in the
22
23 individual sensors is minimized. The CH node selects a CDMA spreading code
24
ee

25
26 randomly, which is to be used for communication within its cluster so that the signals
27
28 of different clusters (using different CDMA codes) don't interfere. The CH node
rR

29
30
aggregates the data obtained from the nodes within its cluster and then transmits the
31
32
33 compressed data to the base station.
ev

34
35 LEACH has been a landmark in clustering protocols in wireless sensor
36
iew

37
38 network with its simplicity and efficiency. However, there are some limitations which
39
40 make LEACH not so effective. For example, during the probability based cluster-head
41
42 selection, once a node has acted as a CH, its threshold will be set to 0. Therefore, the
43
On

44
45 nodes available to be selected as CHs become fewer and fewer within 1/p rounds. In
46
47 the next section, we will describe the STCS (Soft Threshold Based Cluster-head
ly

48
49 Selection) algorithm, which uses the basic LEACH architecture but changes the CH
50
51
52 selection procedure to prolong the network lifetime.
53
54 Figure 1 shows the brief flowchart of LEACH algorithm.
55
56
57
58
Figure 1. A brief flowchart of LEACH algorithm.
59
60

URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo

Page 13 of 19 International Journal of Parallel, Emergent and Distributed Systems

1
2
3
3. STCS algorithm
4
5 To meet the unique requirements of wireless sensor networks, and more evenly
6
7 distribute energy load among the nodes in the networks, we proposed STCS (Soft
8
9
10 Threshold Based Cluster-head Selection) algorithm to make an improvement on the
11
12 CH selection algorithm.
13
14 In the STCS algorithm, CHs are also chosen according to the probability. The
15
16
Fo

17 traditional LEACH algorithm adopts a kind of hard-threshold CH selection method.

18
19 That is to say, after a node has been selected as a CH once, the threshold in its cluster-
20
rP

21
head selection will be changed to 0 directly and this node will lose its opportunity to
22
23
24 be selected as a CH again, even if it still has enough energy. This may not be the best
ee

25
26 method to evenly distribute energy consumption on each node and to prolong the
27
28
lifetime of the network. In our algorithm, the probability of a node to become a CH is
rR

29
30
31 also determined by a threshold T(i). However, different from the hard threshold in
32
33
ev

LEACH, in STCS is a soft threshold. That is, once a node has acted as a CH, T(i)
34
35
36 will be adjusted step by step instead of being changed to 0 directly.
iew

37
38 The detailed operations of STCS algorithm are shown in Figure 2.
39
40
41
42 Figure 2. The flowchart of soft threshold calculation.
43
On

44
From Figure 2, we can see that in the first round ( r = 0 ), all nodes are chosen to
45
k
46
47
be CHs with the probability p = N , which is the desired percentage of cluster heads.
ly

48
49 The threshold of each node in the following rounds is based on whether this node is a
50
51 CH or not and the member number of the cluster in the last round.
52
53
54 The soft threshold is adjusted by parameter , whose value may affect the
55
56 probability of nodes to become CHs in each round. How to set the adjusting
57
58 parameter will be discussed in the following paragraph. In Section 4.1, we will
59
60
introduce several different parameter values in the simulation, and try to find the

URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo

 International Journal of Parallel, Emergent and Distributed Systems Page 14 of 19

1
2
3
optimal value. The concrete operation of adjusting threshold is as follows, if a node
4
5
6 has been selected as a CH in the last round, its probability of becoming a CH in the
7
8 ε
9 NUM ( C ( i ) )
current round will be decreased by ε; else it will be increased by . Where
10
11
12 C (i ) NUM ( C ( i ) )
13 represents the cluster that node i belongs to, and represents the
14
15 C (i )
16 member number of .
Fo

17
18
19 3.3 Analysis of STCS
20
The STCS algorithm mainly focuses on improving the cluster-head selection
rP

21
22
23 procedure, while the cluster forming is similar to LEACH by using a distributed
24
ee

25 algorithm, where nodes make individual decisions without any centralized control. Its
26
27
28 goal is to design a cluster formation algorithm so that there are approximately k
rR

29
30 clusters in each round. Therefore, the STCS algorithm should ensure that the
31
32
expectations of the number of CHs to be k in every round. Set N as the total number
33
ev

34
35 of network nodes, and p is the desired percentage of the CHs, thus k = N × p .
36
iew

37
38 As shown in Figure 2, in the first round ( r = 0 ), each node i set its initial
39
40 threshold to p :
41
42
43
On

p
44 T ( i ) |r = 0 = =p (2)
45 1
1 − p * ( r mod )
46 p r =0
47 0 node i is a non-CH node in the r th round N
X i |r = 
ly

48 Y |r = ∑ X i
49 Set 1 node i is a CH node in the r th round , then i =1 r denotes the number
50
51 N N
52 E (Y |r =0 ) = E ( ∑ X i ) = ∑ 1* T (i ) |r =0 = N × p = k
i =1 i =1
53
of CHs in the r th round, and then r =0 .
54
55 1
1≤ r < p
56 As mentioned in Section 3.2, in the other ( ) rounds,
57
58 T (i ) |r −1 −ε i ∈ Gr −1
59 
T ( i ) |r =  ε (3)
60
T (i ) |r −1 + NUM(C(i)) otherwise


URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo

Page 15 of 19 International Journal of Parallel, Emergent and Distributed Systems

1
2
3
Where Gr-1 is the set of nodes which were selected to be CHs in the r − 1 th
4
5
6 round, and C(i) represents the cluster that node i belongs to. For the r th round, there
7
8 is:
9
10 N N
11 E (Y |r ) = E[ ∑ X i |r ] = ∑ 1* T (i ) |r (4)
12 i =1 i =1

13 For each cluster C, according to equation (3), we can get:

14
15 N N
E (Y |r ) = ∑ 1* T (i ) |r = ∑ 1* T (i ) |r −1 = E (Y |r −1 ) = ... = E (Y |0 ) = k
16
Fo
i =1 i =1
17
18 4. Simulation results and analysis
19
20 In order to evaluate the performance of the STCS algorithm, we used NS-2 simulator
rP

21
22 to simulate STCS and LEACH algorithm for comparison. The code for our
23
24
experiments was a modification based on the code of LEACH algorithm [13].
ee

25
26
27 In the simulation, similar to LEACH, we used a random 100-node network,
28
rR

29 the BS was located at (50, 175) in a 100m x 100m field. In these experiments, each
30
31
32 node began with only 2J of energy and calculated its probability as described in
33
ev

34 Figure 2 to determine its cluster head status at the beginning of each round. In
35
36 addition, in order to compare with LEACH, we also set the desired percentage of
iew

37
38
39 cluster heads p to 0.05. The parameter in STCS was set to p2.
40
41 We compared the time of communication when 1%, 50% and 100% of the
42
43
On

44
nodes die between LEACH and STCS with each node having the same initial energy
45
46 level. At the beginning of the simulation, since the nodes using the STCS are allowed
47
ly

48 to be CHs more than once, some nodes may be selected as CHs many times. It caused
49
50
51 their energy to drain rapidly, so the first node died earlier in STCS than in LEACH.
52
53 However, as the simulation continued, the advantage of STCS appeared gradually,
54
55 and the time when 50% and 100% of nodes died were both later in STCS than in
56
57
58 LEACH (see Figure 3 and Figure 4).
59
60

Figure 3. The lifetime of 100-node network with initial energy 2J/node.

URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo

 International Journal of Parallel, Emergent and Distributed Systems Page 16 of 19

1
2
3
4
5 Figure 4. Performance comparison when 1%, 50% and 100% of nodes died.
6 Table 1 summarizes the results with initial energy per node of 1J, 2J, 3J, 4J
7
8 and 5J in the 100m x 100m network. The result of table 1 shows that the conclusion
9
10
11
made in the above paragraph is still tenable with different initial energy.
12
13 Table 1. The time(s) when 1%, 50% and 100% nodes died for different initial energy.
14 Energy(J protocol 1% 50% 100%
15 /node)
16
Fo

17 1 LEACH 110 220 274

18 STCS 80 250 422
19 2 LEACH 380 490 550
20
rP

21
STCS 130 510 648
22 3 LEACH 480 690 758
23 STCS 120 760 1100
24 4 LEACH 550 930 1005
ee

25
26 STCS 190 990 1574
27 5 LEACH 860 1230 1350
28 STCS 150 1160 1871
rR

29 The experimental data listed above indicates that STCS does not perform well
30
31
32 enough at the initial period of algorithm. However, as the algorithm continues, STCS
33
ev

34 extends the network lifetime and performs much better than LEACH. In the next
35
36
section, we will use different parameters and observe its impact on the performance of
iew

37
38
39 STCS. In addition, we will also simulate 200 nodes to observe what influence will be
40
41 brought by the increase of the number of network nodes.
42
43
On

44
45 4. Simulation parameter setting
As shown in Figure 2, we adjust the threshold T ( i ) with a parameter. In this section,
46
47
ly

48
49 we will discuss how to choose the parameter.
50
51 In the worst case, if one node is always selected to be CH from the first round
52
53
54 to the last round, the total number of rounds is 1/p, while the initial threshold of each
55
56 1
p −( )×ε ≥ 0 2
57 p
node is . So we must make sure that p
, i.e., ε ≤ p . In the simulation
58
59
60

URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo

Page 17 of 19 International Journal of Parallel, Emergent and Distributed Systems

1
2
3
described above, we just set parameter ε to p2 simply. In Figure 5, we simulated the
4
5
6 proposed algorithm with parameter ε equalling to p2, p2/2 and p2/4 for comparison.
7
8
9
10 Figure 5. Comparison for STCS algorithm with parameter of p2, p2/2 and p2/4.
11 As can be seen from Figure 5, STCS with parameter p2/2 performs better than
12
13
14 STCS with parameter p2, but when parameter ε decreases from p2/2 to p2/4, the
15
16 difference of their performance is no longer obvious. The result of the simulation
Fo

17
18
reflects that the parameter ε may have an optimal value between 0 and p2.
19
20
rP

21 In addition, the desired percentage of cluster heads in LEACH is set to 0.05,

22
23 which is also the initial probability of each network node to become cluster-head.
24
ee

25
26
Here we simulate STCS algorithm with initial probability of 0.03, 0.035, 0.04, 0.045,
27
28 0.05 and 0.06, and to observe how the initial probability influences the performance
rR

29
30 of STCS. Figure 6 shows the simulation result.
31
32
33
ev

34
35 Figure 6. The Comparison of STCS with different initial probability and LEACH.
36 From Figure 6, we can see that the performance of STCS is not increased
iew

37
38 linearly with the increase of initial probability of network nodes. When we set the
39
40
41
probability to 0.035, the STCS performs best in compare with LEACH and STCS of
42
43 other probabilities.
On

44
45 In order to observe the influence of network size on the performance of STCS,
46
47
we double the network size to 200 nodes and locate the BS at (100, 350) in a 200m x
ly

48
49
50 200m field, while the other parameters is the same as before. Figure 7 shows the
51
52 simulation result. We can infer from Figure 7 that STCS algorithm can also
53
54
55 outperform LEACH with the expansion of the network size.
56
57
58
59 Figure 7. Comparison of STCS and LEACH for 200 nodes network.
60

URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo

 International Journal of Parallel, Emergent and Distributed Systems Page 18 of 19

1
2
3
5. Conclusion and future work
4
5 In wireless sensor networks, the energy consumption and the network lifetime are
6
7 important issues for the research of the route protocol. In this paper, we present a
8
9
10 novel cluster-head selection algorithm. Its main idea is to adjust the threshold of each
11
12 node step by step instead of changing it to 0 directly, and thus nodes have more
13
14 chance to become CHs. Simulation results show that the proposed algorithm performs
15
16
Fo

17 better than LEACH algorithm, and the lifetime of the network is extended by an
18
19 average of 30% approximately. In addition, when the scale of network is enlarged, the
20
rP

21
STCS algorithm can also outperform LEACH.
22
23
24 In this paper, we just adopt a way of adjusting the threshold to achieve our
ee

25
26 purpose of increasing the network lifetime. In order to further save energy and extend
27
28
the lifetime of the network, our future plans will involve how to optimize the selection
rR

29
30
31 of the parameter ε.
32
33
ev

34 Acknowledgments
35
36
Supported by the Research Fund for the Doctoral Program of Higher Education of
iew

37
38
39 China(RFDP), the fund of the State Key Laboratory of Software Development
40
41 Environment (Grant No. SKLSDE-2009ZX-04)and the National High-tech R&D
42
43
On

44 Program of China (863 Program) (Grant No. 2008AA12A216).

45
46
47 References
ly

48
49
50 [1] Sun Limin, Li Jianzhong, and Chen Yu, Wireless Sensor Networks, Tsinghua
51 publishing company, Beijing, 2005.
52 [2] I. F. Akyildiz, W. Su, and Y. Sankarasubramaniam, A survey on sensor networks,
53 IEEE Communications Magazine, 2002, 40(8), pp. 102-114.
54 [3] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, Energy-efficient
55
56
communication protocol for wireless sensor networks, Proceeding of the Hawaii
57 International Conference on System Sciences, Hawaii, January 2000, pp. 223-232
58 [4] Rong ding, Bing Yang, Lei Yang, Jiawei Wang, Soft Theshold based Cluster-
59 head Selection Algorithm for Wireless Sensor Networks, in proceedings of The Third
60 International Conference on Sensor Technologies and Applications, Athens, 2009

URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo

Page 19 of 19 International Journal of Parallel, Emergent and Distributed Systems

1
2
3
[5] W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, An application
4
5 specific protocol architecture for wireless microsensor network, IEEE Transactions
6 on Wireless Communications, 2002, 1(4), pp. 660-670.
7 [6] M. J. Handy, M. Haase, and D. Timmermann, Low energy adaptive clustering
8 hierarchy with deterministic cluster-head selection, Proceeding of the 4th
9 International Workshop on Mobile and Wireless Communications Network, 2002, pp.
10
11
9-11.
12 [7] O. Younis and S. Fahmy, HEED: A hybrid, energy-efficient, distributed clustering
13 approach for ad-hoc sensor networks, IEEE Transactions on Mobile Computing,
14 2004, 3(4), pp. 366–379.
15 [8] Gupta I. , Riordan D. , and Sampalli S. , Cluster-head election using fuzzy logic
16
Fo
for wireless sensor networks, Proceeding of the 3rd Annual Communication Networks
17
18 and Services Research Conference, Halifax, 2005, pp. 255−260.
19 [9] Xu ling, Christos G. Cassandras, Optimal Cluster-head Deployment in Wireless
20 Sensor Networks with Redundant Link Requirements, Proceedings of the 2nd
rP

21 international conference on Performance evaluation methodologies and tools, Nantes,

22 2007
23
24
[10] Xu Zhezhuang, Zhang Shiqing, Zhang Xiliang, Bao Binghao, Li Peng, “An
Adaptive Clustering Protocol for Medium-Scale Wireless Sensor Networks”, 2007
ee

25
26 International Conference on Wireless Communications, Networking and Mobile
27 Computing, Shanghai, 2007, pp. 2436-2439
28 [11] Lotf Jalil Jabari, Bonab Mehdi Nozad, Khorsandi Siavash, A Novel Cluster-based
rR

29
Routing Protocol with Extending Lifetime for Wireless Sensor Networks, 5th IEEE
30
31 and IFIP International Conference on Wireless and Optical Communications
32 Networks, Surabaya, 2008
33 [12]Zhao junfeng, Li JianPing, An improved distributed cluster organization
ev

34 algorithm of wireless sensor networks, 2008 International Conference on

35 Apperceiving Computing and Intelligence Analysis, 2008, pp. 329-333
36
[13] LEACH Algorithm Code, http://www-
iew

37
38 mtl.mit.edu/researchgroups/icsystems/uamps/research/leach/leach_code.shtml 07.13.
39 2009
40
41
42
43
On

44
45
46
47
ly

48
49
50
51
52
53
54
55
56
57
58
59
60

URL: http:/mc.manuscriptcentral.com/gpaa Email: user@test.demo