Information Technology Reference
In-Depth Information
4
Performance Evaluation
In this section, the authors simulated two basic approaches to form the wireless
sensor networks to make the MST: Random Nearest Neighbor Tree (Random
NNT) and Euclidian MST (also known as Geometric weighted MST) and
compared both of them with the proposed Simple Weighted Spanning Tree
(SWST) algorithm. In the simulations, the following was assumed:
1)
Nodes are placed randomly in two dimensional Euclidian space.
2)
Nodes exhibit perfect disk coverage.
3)
Nodes exhibit same maximum transmission range and same sensing
range.
4)
All nodes are within the sink node's maximum transmission range.
5)
Nodes do not possess information concerning their position, orientation
and neighbors.
6)
For simplicity, packets are assumed to not be lost in the Data Link layer.
7)
Distance between two nodes is determined using Received Signal
Strength Indicator (RSSI).
8)
Network duty cycle = 100%.
9)
Two or more simultaneous events in the network cannot occur, and rate
of event occurrence is one event per second.
For each experiment, nodes were randomly deployed along with event
coordinates and sequences. This information was then utilized with the other two
algorithms tested to ensure a more accurate comparison and evaluation of the three
algorithms. The simulation parameters are found in Table 1.
Table 1
Simulation Parameters
Parameters
Value
Deployment area
Event number
Time of simulation
Number of events per unit time
Initial energy of the sink node
Maximum transmission range of the sink
Topology Maintenance after the amount of time
Energy consumed to transmit message for
maximum range
Energy consumed for listening in 1 second
Threshold Energy Level
1000m x 1000m
1000
1000
seconds
1 event/second
Infinity
Infinity
200 seconds
0.1 Joule
0.01 Joule
1.5 Joule
Search WWH ::
Custom Search