Information Technology Reference
In-Depth Information
Calculate min(D(u))
Select the corresponding parent node from D(u) as
FP(u):FP(u)=P(u){index(min(D(u)))};
Update tr(u) using RSSI: tr(u)=min(D(u));
Else
Select the corresponding parent node from PE(u) as
FP(u):FP(u)=P(u){index(max(PE(u)))};
Update tr(u) using RSSI:
tr(u)=D(u){index(max(PE(u)))};
End if.
Sends unicast parent recognition message to parent node.
Parent Selection timeout expires.
4) Set status:
If status(u)=active
If receives any parent recognition message
status(u) = active;
Else
If does not receive parent recognition message
status(u) = sleeping;
End if.
End if.
Else status(u) = comatose;
End if.
The proposed algorithm has the following advantages:
1) The SWST algorithm is scalable since it is a distributed algorithm; it does
not require information on the overall network status and control.
2) Localization mechanisms such as GPS are not necessary.
3) The algorithm aims to balance the network load and energy. This is
accomplished by saving energy by both parent and children nodes.
4) The algorithm is simple; during MST creation, only small amounts of
running times are utilized and messages are exchanged which reduces
energy consumption.
5) Message collisions are decreased significantly since the number of active
nodes in the topology is fewer.
Dynamic Global Topology Recreation (DGTRec) was implemented as the
topology maintenance protocol that will recreate the reduced topology at
predefined time intervals. The simulation results show improvements in network
load balancing after utilization of the proposed SWST algorithm.
Search WWH ::




Custom Search