05.01.2015 Views

Wireless Sensor Networks : Technology, Protocols, and Applications

Wireless Sensor Networks : Technology, Protocols, and Applications

Wireless Sensor Networks : Technology, Protocols, and Applications

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

294 PERFORMANCE AND TRAFFIC MANAGEMENT<br />

Figure 11.5 Closed-loop model for the system [11.17].<br />

system performance metrics such as average energy consumption <strong>and</strong> average delay<br />

have also been calculated in the following manner:<br />

1. Construct a DTMC sensor node model, represented by the leftmost box for<br />

each sensor node i to get the stationary distribution p i <strong>and</strong> the probability that<br />

data are received in a time slot ða i Þ in node i.<br />

2. Solve the network model using queuing network analysis to calculate the<br />

average data transmission rate between any pair of sensor nodes n <strong>and</strong> m in<br />

the network ðl n;m Þ as well as the average throughput for each sensor node.<br />

3. Given l n;m as input to the interference model, compute the value of the<br />

probability that data are transmitted successfully in a time slot in node iðb i Þ.<br />

4. b i is used as input to the sensor node model, iterating through steps 1 to 3.<br />

The worst relative error for two successive estimates of the sensor throughput<br />

is used as the stopping criterion. It is stated in [11.17] that 10 iterations result<br />

in an error below 0.0001.<br />

11.5 CASE STUDY: SIMPLE COMPUTATION<br />

OF THE SYSTEM LIFE SPAN<br />

In this section we present a simple model to compute the system life span. The<br />

following assumptions are made:<br />

1. All sensor nodes ðNÞ in the network organize a two-tiered topology. The<br />

sensor nodes in the lower layer are called leaf nodes. The sensor nodes in the<br />

high layer are called leader nodes. At the high layer, there are N 1 leader nodes<br />

forming a k-tree topology with h þ 1 levels (or h hops) from the sink, where<br />

each leader node in level i connects k child nodes in level i þ 1 to its parent<br />

node at layer i 1 (see Figure 11.6). Each leader node in the higher layer that

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!