Vous êtes sur la page 1sur 30

Chapter5: Results and Analysis

5.1 Introduction

This chapter will explain and discuss the simulation results to evaluate the performance
of the LEACH and LEACH-C protocols following the methodology which is
introduced previously. Both protocols are applied on the same network, then by
comparing the results of both simulation cases, the LEACH-C will be approved as an
evolutional technique of the LEACH protocol, the comparison is based on the node
lifetime by counting the number of alive and dead nodes and average energy dissipated,
the calculations are implemented for allover rounds and in each round.

5-2 The Network Setup


According to the design parameters of the wireless sensor network, where 100 nodes
are distributed in random locations within 100100 m2 and base station location
coordinates are (x=150 m, y=50 m). These nodes are classified to have two types
normal and advanced this classification also made randomly, due the node type there
are two energy values that are initially assigned to the each type. Fig. 5.1 shows the
node distribution, type and energy statues in the network as displayed from the
simulation.

Fig.5.1: The node distribution and type


5.3 Performance Evaluation
The initial network layout and energy values will be used in both protocols, these
parameters should be stored to be defined again for the other program, then the results
well be combined for comparison and to estimate the improvement of using the
centralized clustering instead of the random operation.

5.3.1 Performance Evaluation of LEACH Protocol


In the LEACH simulation, then the program start the iteration by dividing the nodes
into groups which are called clusters and in each cluster a certain node will be assigned
as a head cluster according to Eq.4-6 and step 6 Fig. 5.2 shows the cluster head selection
and the associated cluster nodes at the beginning of iteration.

Sink

+ Normal Node Normal Node Cluster Head

Fig. 5.2: the network layout at the CH creation for first time

Also as shown in Fig. 5.3 the program will display more details about the
clusters by estimation of their breeders and the nodes associated in each
cluster.
Fig. 5.3: the clusters and the associated nodes

The number of cluster heads will be counted for first iteration, in this
time the cluster head start communication with the base station.
Assuming that Initially there are no dead nodes, dead advanced nodes,
and dead normal nodes, therefore their counters are reset to zero.

To accomplish the sensing and communication operations between nodes


and through the associated cluster head base station each node consumes
an amount of energy depends on its distance from base station. The
distance and average dissipated energy calculations are described in step 6
of simulation methodology. The value of the consumed energy will be
compared with the energy threshold to determine if the nodes energy is
below the threshold this node is considered as dead node and no longer
used in the next round.
At the round end there are counters to estimate the number of cluster heads
and if occurred alive and dead nodes. The next iteration round will update
the energy values and statutes as result of the last round, therefore the
number of cluster heads and dissipated energy are varied for each round.
After a number of iterations as the nodes energy is decreased to become
less threshold the nodes will die and the round where the first node dies is
determined. Fig.s 5.4- 5-7 shows the network statues for selected number
of rounds, noticing that the program can display the results for each round
indicating the round number.

Dead Node

Fig. 5.4: the network statues at round 40


Fig. 5.5: the network statues at round 60
Fig. 5.6: the network statues at round 85
o
Fig. 5.7: the network statues at round 100 (final round)

The statistical analysis will explain the average energy consumption


through the rounds and the number of alive and dead nodes, the analysis
will be illustrated in the following figures and summarized in in tables.

The average energy in each round is obtained cumulative sum of dissipated


energy of the rounds from the first one to the related round this sum is
divided by the round number, Fig.s 5.8 5.11 show the relationships
between the average energy of each node and round number at different
intervals of 25, 50, 75, 100 first rounds.

0.15

0.145

0.14
Average Energy of Each Node

0.135

0.13

0.125

0.12

0.115

0.11
0 5 10 15 20 25
Round Number

Fig. 5.8: Average Energy of Each Node for the first 25 rounds
0.16

0.15

0.14
Average Energy of Each Node

0.13

0.12

0.11

0.1

0.09

0.08
0 5 10 15 20 25 30 35 40 45 50
Round Number

Fig. 5.9: Average Energy of Each Node for the first 50 rounds

0.16

0.14
Average Energy of Each Node

0.12

0.1

0.08

0.06

0.04
0 10 20 30 40 50 60 70 80
Round Number

Fig. 5.10: Average Energy of Each Node for the first 75 rounds
0.16

0.14
Average Energy of Each Node

0.12

0.1

0.08

0.06

0.04

0.02
0 10 20 30 40 50 60 70 80 90 100
Round Number

Fig. 5.11: Average Energy of Each Node for all 100 rounds

The dead node counters will be recalled and plotted with the correspondent
round, Fig.s 5.12 5.15 show the relationships between the number of
dead nodes and round number at different intervals of 25, 50, 75, 100 first
rounds.
1

0.8

0.6

0.4
Number of Dead Nodes

0.2

-0.2

-0.4

-0.6

-0.8

-1
0 5 10 15 20 25
Round Number

Fig. 5.12: Number of Dead Nodes for the first 25 rounds

14

12

10
Number of Dead Nodes

0
0 5 10 15 20 25 30 35 40 45 50
Round Number

Fig. 5.13: Number of Dead Nodes for the first 50 rounds


45

40

35
Number of Dead Nodes

30

25

20

15

10

0
0 10 20 30 40 50 60 70 80
Round Number

Fig. 5.14: Number of Dead Nodes for the first 75 rounds

80

70

60
Number of Dead Nodes

50

40

30

20

10

0
0 10 20 30 40 50 60 70 80 90 100
Round Number

Fig. 5.15: Number of Dead Nodes for all 100 rounds


The number of alive nodes in each round is obtained by subtract the
number of dead nodes from the total number of nodes, Fig. 5.16 shows
the relationships between the number of alive nodes and round number.

100

90

80
Number of Alive Nodes

70

60

50

40

30

20

10
0 10 20 30 40 50 60 70 80 90 100
Round Number

Fig. 5.15: Number of Alive Nodes at each Round

Tables 5.1, 5.2 shows the number dead nodes, normal dead nodes,
advanced dead nodes, number of cluster heads, number of packets
sent to cluster heads, and average energy

Tables 5.1: The number of dead nodes, normal dead nodes, and
advanced dead nodes at selected rounds

Number of Number of normal Number of advanced


dead nodes dead nodes dead nodes
At round 1 0 0 0
At round 10 0 0 0
At round 20 0 0 0
At round 30 5 4 0
At round 40 12 11 1
At round 50 26 24 1
At round 60 33 29 3
At round 70 45 40 5
At round 80 54 45 9
At round 90 73 56 15
At round 100 83 63 20

Tables 5.2: The number of cluster heads, number of packets sent to


cluster heads, and average energy at selected rounds

Number of Number of packets sent Average


cluster heads to cluster heads Energy
At round 1 36 164 0.1486
At round 10 40 160 0.1344
At round 20 38 162 0.1201
At round 30 46 150 0.1062
At round 40 48 140 0.0932
At round 50 30 145 0.0816
At round 60 34 134 0.0711
At round 70 36 119 0.0616
At round 80 26 120 0.0531
At round 90 24 105 0.0458
At round 100 24 93 0.0395

Tables 5.3 shows the total number alive nodes, dead nodes, the round
where first node dies, and the total average energy

Tables 5.3: The total number alive nodes, dead nodes, the round
where first node dies, and the total average energy

Total alive nodes 17


Total dead node 83
Round of first dead node 22
Total average energy : 0.0395
As described in the methodology the network dimensions, node distribution
and initial energies will be saved to be used in the LEACH-C program

5.3.2 Performance Evaluation of LEACH-C Protocol


The simulation program uses the similar design parameters which are defined in the
LEACH program, to restore the network layout and energy values for each node, to
estimate the advantages of LEACH-C over LEACH in the same network and similar
conditions then the program start the iteration with an evolutional approach in
clustering and cluster head as explained in the methodology, Fig. 5.16 shows the
LEACH-C clustering and cluster head creation.

100

90

80

70

60

50

40

30

20

10

0
0 10 20 30 40 50 60 70 80 90 100

Fig. 5.16: LEACH-C clustering and cluster head creation.

Similarly in LEACH case LEACH-C program uses the same energy model
where the distance and average dissipated energy calculations are
described in step 6 of simulation methodology. The value of the consumed
energy will be compared with the energy threshold to determine if the
nodes energy is below the threshold this node is considered as dead node
and no longer used in the next round.
At the round end there are counters to estimate the number of cluster heads
and if occurred alive and dead nodes. The next iteration round will update
the energy values and statutes as result of the last round, therefore the
number of cluster heads and dissipated energy are varied for each round.
After a number of iterations as the nodes energy is decreased to become
less threshold the nodes will die and the round where the first node dies is
determined. Fig.s 5.17- 5-22 shows the network statues for selected
number of rounds, noticing that the program can display the results for each
round indicating the round number.

Iteration #15/100
100

90

80

70

60

50

40

30

20

10

0
10 20 30 40 50 60 70 80 90 100

+ Normal Node Normal Node Cluster Head

Fig. 5.17: the network statues at round 15


Iteration #31/100
100

90

80

70

60

50

40

30

20

10

0
10 20 30 40 50 60 70 80 90 100

Dead Node

Fig. 5.18: the network statues at round 31


Iteration #45/100
100

90

80

70

60

50

40

30

20

10

0
10 20 30 40 50 60 70 80 90 100

Fig. 5.19: the network statues at round 45


Iteration #60/100
100

90

80

70

60

50

40

30

20

10

0
10 20 30 40 50 60 70 80 90 100

Fig. 5.20: the network statues at round 60

Iteration #80/100
100

90

80

70

60

50

40

30

20

10

0
10 20 30 40 50 60 70 80 90 100

Fig. 5.21: the network statues at round 80


Iteration #100/100
100

90

80

70

60

50

40

30

20

10

0
10 20 30 40 50 60 70 80 90 100

Fig. 5.22: the network statues at round 100 (final round)

The statistical analysis will explain the average energy consumption


through the rounds and the number of alive and dead nodes, the analysis
will be illustrated in the following figures and summarized in in tables.

The average energy in each round is obtained cumulative sum of dissipated


energy of the rounds from the first one to the related round this sum is
divided by the round number, Fig.s 5.23 5.26 show the relationships
between the average energy of each node and round number at different
intervals of 25, 50, 75, 100 first rounds.
0.152

0.15

0.148
Average Energy of Each Node

0.146

0.144

0.142

0.14

0.138

0.136

0.134

0.132
0 5 10 15 20 25
Round Number (First 25 Rounds)

Fig. 5.23: Average Energy of Each Node for the first 25 rounds

0.15

0.145
Average Energy of Each Node

0.14

0.135

0.13

0.125

0.12
0 5 10 15 20 25 30 35 40 45 50
Round Number (First 50 Rounds)

Fig. 5.24: Average Energy of Each Node for the first 50 rounds
0.155

0.15

0.145
Average Energy of Each Node

0.14

0.135

0.13

0.125

0.12

0.115
0 10 20 30 40 50 60 70 80
Round Number (First 75 Rounds)

Fig. 5.25: Average Energy of Each Node for the first 75 rounds

0.15

0.145

0.14
Average Energy of Each Node

0.135

0.13

0.125

0.12

0.115

0.11

0.105
0 10 20 30 40 50 60 70 80 90 100
Round Number (All 100 Rounds)

Fig. 5.26: Average Energy of Each Node for all 100 rounds
The dead node counters will be recalled and plotted with the correspondent
round, Fig.s 5.27 5.30 show the relationships between the number of
dead nodes and round number at different intervals of 25, 50, 75, 100 first
rounds.

3.5

3
Number of Dead Nodes

2.5

1.5

0.5

0
0 5 10 15 20 25
Round Number (First 25 Rounds)

Fig. 5.27: Number of Dead Nodes for the first 25 rounds


10

7
Number of Dead Nodes

0
0 5 10 15 20 25 30 35 40 45 50
Round Number (First 50 Rounds)

Fig. 5.28: Number of Dead Nodes for the first 50 rounds

18

16

14
Number of Dead Nodes

12

10

0
0 10 20 30 40 50 60 70 80
Round Number (First 75 Rounds)

Fig. 5.29: Number of Dead Nodes for the first 75 rounds


25

20
Number of Dead Nodes

15

10

0
0 10 20 30 40 50 60 70 80 90 100
Round Number (All 100 Rounds)

Fig. 5.30: Number of Dead Nodes for all 100 rounds

The number of alive nodes in each round is obtained by subtract the


number of dead nodes from the total number of nodes, Fig. 5.31 shows
the relationships between the number of alive nodes and round number.
100

95
Number of Alive Nodes

90

85

80

75
0 10 20 30 40 50 60 70 80 90 100
Round Number (All 100 Rounds)

Fig. 5.31: Number of Alive Nodes at each Round

Tables 5.4, 5.5 shows the number dead nodes, normal dead nodes,
advanced dead nodes, number of cluster heads, number of packets
sent to cluster heads, and average energy

Tables 5.4: The number of dead nodes, normal dead nodes, and
advanced dead nodes at selected rounds

Number of Number of normal Number of advanced


dead nodes dead nodes dead nodes
At round 1 0 0 0
At round 10 2 0 0
At round 20 3 0 0
At round 30 5 3 0
At round 40 6 5 1
At round 50 10 8 2
At round 60 13 9 4
At round 70 16 9 7
At round 80 18 9 9
At round 90 22 10 12
At round 100 22 10 12
Tables 5.5: The number of cluster heads, number of packets sent to
cluster heads, and average energy at selected rounds

Number of Number of packets sent Average


cluster heads to cluster heads Energy
At round 1 36 164 0.1486
At round 10 40 158 0.1411
At round 20 38 159 0.1346
At round 30 41 154 0.1311
At round 40 42 152 0.1277
At round 50 26 164 0.1242
At round 60 28 159 0.1196
At round 70 26 158 0.1166
At round 80 18 164 0.1147
At round 90 15 163 0.1109
At round 100 15 163 0.1066

Tables 5.6 shows the total number alive nodes, dead nodes, the round
where first node dies, and the total average energy

Tables 5.6: The total number alive nodes, dead nodes, the round
where first node dies, and the total average energy

Total alive nodes 78


Total dead node 22
Round of first dead node 10
Total average energy : 0.1066
5.3.3 Comparison Analysis
The results of a compression performance of the protocols are introduced
in this work to estimate the proposed developed clustering approach
efficiency where these methods have been investigated in this simulation
work for the same network the results of both protocols are combined with
a certain number of rounds and displayed as in the following figures and
summarized in a table. Fig. 5.32 shows both protocols relationships
between the average energy of each node and round number for all of
rounds.

0.16
LEACH
LEACH-C
0.14
Average Energy of Each Node

0.12

0.1

0.08

0.06

0.04

0.02
0 10 20 30 40 50 60 70 80 90 100
Round Number (All 100 Rounds)

Fig. 5.32: Average Energy of Each Node for all 100 rounds

From Fig. 5.32 it is clearly noticed the decreasing of average node


energy through the rounds with different rates of varying, the LEACH-
C decrement rate is less than LEACH, so the energy consumption is in
LEACH-C less than that in LEACH.
Fig. 5.33 show both protocols relationships between the number of dead
nodes at the all 100 rounds.

90
LEACH
80 LEACH-C

70
Number of Dead Nodes

60

50

40

30

20

10

0
0 10 20 30 40 50 60 70 80 90 100
Round Number (All 100 Rounds)

Fig. 5.33: Number of Dead Nodes for all 100 rounds


Fig. 5.34 shows the relationships between the number of alive nodes and
round number.

100
LEACH
90 LEACH-C

80
Number of Alive Nodes

70

60

50

40

30

20

10
0 10 20 30 40 50 60 70 80 90 100
Round Number (All 100 Rounds)

Fig. 5.34: Number of Alive Nodes for all 100 rounds

From Fig.'s 5.33-5.34 it is clearly noticed the increasing of dead nodes


in the rounds with different rates but, for the LEACH-C the number of
dead nodes are significantly less than those of LEACH, also the for alive
nodes the LEACH-C have a greater number comparing with LEACH,
therefore the lifetime of network in LEACH-C is longer than that in
LEACH

Tables 5.7 shows the total number alive nodes, dead nodes, and the
total average energy for both LEACH and LEACH-C.
Tables 5.7: The total number alive nodes, dead nodes, the round
where first node dies, and the total average energy
Parameter LEACH LEACH-C
alive nodes 17 78
Dead nodes 83 22
Average Energy 0.03954 0.1066

Tables 5.8 shows the in general the performance of both LEACH and
LEACH-C.

Tables 5.8: General attributes comparison between LEACH and


LEACH-C.

Attributes LEACH LEACH-C

Network Overhead less more

Architecture Distributed Centralized

Election of CHs CHs are elected rotation CHs are elected by BS w.r.t
wise by the nodes based on nodes energy and
a probabilistic approach distance to BS
No. of CHs(desired) Not-guaranteed Guaranteed

Life time Less More

Startup energy dissipation Less More

Total energy dissipation More Less

Finally, Fig.s 5.34 5.34 the rate of change in LEACH-C is much less
than LEACH and getting to balanced and steady state and from Table
5.8 the system environment is more suitable if the LEACH protocol is
updated by the LEACH-C.

Vous aimerez peut-être aussi