An Approach to Construct Weighted Minimum Spanning Tree in Wireless Sensor Networks - Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing - page 76

A. Experiment 1: Changin
In this experiment, maxim
degree. From Fig. 6 one
the other two tested proto
node. When the node deg
parent enabling the system
increases with the node d
increase. Therefore, the S
nodes and a low total amo
any node degree, SWST
sink, but in so doing w
compared to the other tw
the transmission range i
protocols when comparing

ng the node degree
mum transmission ranges were changed to evaluate nod
can see that the proposed SWST algorithm outperform
ocols in delivering the event sensing message to the sin
gree increases, children nodes are able to choose a stron
m to perform better. As the number of successful even
egree, the energy required for message delivery will als
SWST algorithm will possess a high total number of dea
ount of remaining energy for a higher node degree. As fo
T algorithm more successfully delivers messages to th
will utilize more energy resulting in more dead node
wo tested algorithms. As can be observed from Fig. 6, a
increases, the SWST algorithm outperforms the othe
g the number of successful events.

de
ms
nk
ng
nts
so
ad
or
he
es
as
er

nsmission ranges over different algorithms. Green, blue and re
NNT, Euclidian MST and the proposed SWST algorith

Fig. 6 Effect of various tran
line represents Random N
respectively.

ed
hm