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

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

Fig. 8 Effect of changing n
line represents Random N
respectively.

ed
hm

5 Conclusion

In this paper, the author
protocol based on weigh
proposed SWST algorithm
algorithm from the aspec
energy of the system, it
event sensing messages to
the foremost important ta
testing of the algorithm a
model will be extended to
investigate applications i
structures inhibiting wirel

rs proposed an energy balanced topology constructio
hted Minimum Spanning Tree algorithm. Although th
m does not outperform Random NNT and Euclidian MS
ct of total dead node number and amount of remainin
surely performs best among the three in delivering th
o the sink and consequently to the base station, which
ask of a sensor network. Future work will entail furthe
gainst more energy balancing algorithms for WSNs. Th
o have the WSN deployed in a three dimensional space t
in a more realistic environment that can include larg
less sensor node transmissions.

on
he
ST
ng
he
is
er
he
to
ge