3. Having the calculated queuing delay for each link from (23), as well as the
available time interval from (27), and the estimated MSDU deadline from
(27), the maximum retry limit is established from (17) and the average
number of retries, ( ) mean max
i i t ?¤ p p from (9).
4. For each node, the link that maximizes { }max
total ,
1
min { ( )} ( ) i
i
i
i j v
j
c l e L
??
?¤
?‰¤ <
??® ??? ?‹… ??? ??? ??° ??»
p
p 1 - E is
selected.
Figure 5.4: Algorithm for cross-layer optimization under an estimation-based framework.
Cross-layer Optimized Video Streaming over Wireless Multi-hop Mesh Networks
119
5.5 Complexity and Information Requirements of the Different Alternatives
Each proposed cross-layer optimization approach explores a different search space in order
to determine the optimal parameters and also requires a varying amount of feedback on the
conditions of the various links in the multi-hop mesh network. This results in varying
computational and communication requirements for the presented algorithms.
Consider the case of a mesh network consisting of N nodes. Each node hn, 1 ?‰¤ n < N,
is the origin of Mn paths. Each path pi stemming from node hn consists of total
n M ?? nodes, with
total 1 n M N ?? ?‰¤ ?‰¤ .
Pages:
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333