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

bone construction after the random deployment of 240 nodes
mall red, blue and yellow dots represent active, sleeping an
y. The large solid red circle is the sink node. The green circl
maximum communication area of the respective nodes.

Fig. 2 Communication backb
a 1000m x 1000m field: sm
comatose nodes respectively
around each node represent m

in
nd
es

ode when child node has more energy than the threshold value Fig. 3 Selection of parent no

The proposed algorith
node has more energy tha
options- parent 1, parent
has the highest level of
distance between parent 3
the child node. In this ca
consumption to use the pa
and thus balance the load

m is illustrated in Figs. 3, 4 and 5. In Fig. 3, the chil
an the threshold energy level (1.5 Joules) and it has thre
2 and parent 3 to choose as its final parent. As parent
energy, the child node will choose it even though th
3 and the child node is greater than that of parent 2 an
ase, the child node will increase its transmission powe
arent node with the highest energy as the default gatewa
among the parent nodes.

ld
ee
3
he
nd
er
ay