#### DMCA

## Routing for multiple concurrent video sessions in wireless ad hoc networks (2005)

Venue: | in Proc. IEEE ICC, Seoul, Korea |

Citations: | 13 - 8 self |

### Citations

10602 | Introduction to Algorithms
- Cormen, Leiserson, et al.
- 1990
(Show Context)
Citation Context ...ent a Dijkstra’s Algorithm-based shortest path routing algorithm (SP) using hop-count as the routing metric, and a disjoint shortest path routing algorithm (DSP) using loss rate as the routing metric =-=[12]-=-. In order to guarantee the stability condition in SP, each time when a path is found, we subtract the minimum rate of the corresponding video session from the capacity of each link along this path, w... |

1213 |
Non-linear programming theory and algorithms
- Bazaraa, Sherali, et al.
- 1993
(Show Context)
Citation Context ...mes. (19) OPT-Rate is a nonlinear optimization problem with nonlinear constraints. It can be efficiently solved using an iterative procedure based on the Sequential Quadratic Programming (SQP) method =-=[11]-=-. IV. NUMERICAL RESULTS In this section, we present the simulation results obtained by using the GA-based approach for the concurrent video routing problem. In each experiment, a wireless ad hoc netwo... |

397 | Cedar: a coreextraction distributed ad hoc routing algorithm
- Sivakumar, Sinha, et al.
- 1999
(Show Context)
Citation Context ...s [13]–[17]. In these efforts, the focus has been on addressing network-layer routing problems from various perspectives (e.g., associativity [13] of wireless links, differentiated link state updates =-=[14]-=-, end-to-end resource guarantees [15], [16], and selecting node or edge disjoint paths [17]). In contrast to the present paper, most of these prior efforts do not explicitly formulate the objective fu... |

385 |
Quality-of-service routing for supporting multimedia applications,
- Wang, Crowcroft
- 1996
(Show Context)
Citation Context ...lves identifying the joint and disjoint links of the paths (in order to compute the traffic load on each link), which is only possible when all the paths are completely determined. Wang and Crowcroft =-=[8]-=- proved that QoS routing problems having multiple additive and/or multiplicative metrics are NPcomplete. Our problem has an additive delay metric and a multiplicative loss metric. In addition, our pro... |

289 |
Ad Hoc Mobile Wireless Networks: Protocols and Systems”,
- Toh
- 2002
(Show Context)
Citation Context ...quality than the two frames in Figs. 8(b) and 8(c). V. RELATED WORK It should be clear that the problem addressed in this paper differs from the network-layer QoS-routing problems for ad hoc networks =-=[13]-=-–[17]. In these efforts, the focus has been on addressing network-layer routing problems from various perspectives (e.g., associativity [13] of wireless links, differentiated link state updates [14], ... |

278 | On the use of fractional Brownian motion in the theory of connectionless networks.
- Norros
- 1995
(Show Context)
Citation Context ...te (VBR) video that exhibits long-range dependent (LRD) characteristics, we can model the link as a fractional Brownian motion (fBm) queueing system, where tij has a heavy-tailed Weibull distribution =-=[4]-=-. It is important to point out that the problem formulation and, more importantly, the proposed GAbased solution approach do not depend on a specific traffic behavior, queueing model, and video distor... |

234 |
Genetic Algorithms and Engineering Optimization
- Gen, Cheng
- 2000
(Show Context)
Citation Context ...total number of iterations (generations), the maximum computing time, or a threshold of desired video distortion. Note that similar coding, crossover, and mutation operations have been used in, e.g., =-=[9]-=-, [10] for shortest path routing. In the present paper, we extend these schemes to handle multiple concurrent sessions and for the more complex cross-layer problem. In what follows, we use the example... |

232 | Analysis of video transmission over lossy channels,”
- Stuhlmuller, Farber, et al.
- 2000
(Show Context)
Citation Context ... an empirical rate-distortion model that links the overdue and loss probabilities derived in the last subsection to video distortion, which is an important application layer video quality measure. In =-=[7]-=-, Stuhlmuller et al. developed an empirical ratedistortion model for a hybrid motion compensated video encoder. For a video sequence encoded at a target coding rate Rσ , the average end-to-end distort... |

231 |
QoS routing in ad hoc wireless networks,
- Lin, Liu
- 1999
(Show Context)
Citation Context ...s been on addressing network-layer routing problems from various perspectives (e.g., associativity [13] of wireless links, differentiated link state updates [14], end-to-end resource guarantees [15], =-=[16]-=-, and selecting node or edge disjoint paths [17]). In contrast to the present paper, most of these prior efforts do not explicitly formulate the objective function with an application layer metric via... |

130 | Fundamental bounds and approximations for ATM multiplexers with applications to video teleconferencing,”
- Elwalid, Heyman, et al.
- 1995
(Show Context)
Citation Context ...proximation to obtain an accurate estimate of the overdue probabilities. In the following, we illustrate such an approximation when link delays are exponentially distributed, using the Chernoff Bound =-=[5]-=-. First, the moment generating function of tij can be derived as: Mij(s) = E[estij ] = αijαij−s , for s < αij . Assuming that the link delays are independent, the moment generating function of Tσ is: ... |

91 | A genetic algorithm for shortest path routing problem and the sizing of populations,”
- Ahn, Ramakrishna
- 2002
(Show Context)
Citation Context ... number of iterations (generations), the maximum computing time, or a threshold of desired video distortion. Note that similar coding, crossover, and mutation operations have been used in, e.g., [9], =-=[10]-=- for shortest path routing. In the present paper, we extend these schemes to handle multiple concurrent sessions and for the more complex cross-layer problem. In what follows, we use the example wirel... |

70 | Path Set Selection in Mobile Ad Hoc Networks,”
- Papadimitratos, Haas, et al.
- 2002
(Show Context)
Citation Context ...ty than the two frames in Figs. 8(b) and 8(c). V. RELATED WORK It should be clear that the problem addressed in this paper differs from the network-layer QoS-routing problems for ad hoc networks [13]–=-=[17]-=-. In these efforts, the focus has been on addressing network-layer routing problems from various perspectives (e.g., associativity [13] of wireless links, differentiated link state updates [14], end-t... |

66 |
Quality of Service for Ad hoc On-demand Distance Vector Routing”, Mobile Ad Hoc Networking Working Group, Internet Draft,
- Perkins, Belding-Royer
- 2000
(Show Context)
Citation Context ...cus has been on addressing network-layer routing problems from various perspectives (e.g., associativity [13] of wireless links, differentiated link state updates [14], end-to-end resource guarantees =-=[15]-=-, [16], and selecting node or edge disjoint paths [17]). In contrast to the present paper, most of these prior efforts do not explicitly formulate the objective function with an application layer metr... |

42 | On routing for multiple description video over wireless ad hoc networks,”
- Mao, Hou, et al.
- 2006
(Show Context)
Citation Context ...r naturally by GAs since they are intrinsically parallel, and concurrent multi-session routing and interactions increase computational effort only linearly as compared with the single session routing =-=[2]-=-. We demonstrate the superior performance of the GA-based approach over traditional approaches using extensive numerical results. The remainder of this paper is organized as follows. In Section II, we... |

38 | Subexponential Distributions,
- Klüppelberg
- 2004
(Show Context)
Citation Context ...able received video quality. 1230 example, for an i.i.d. sequence of heavy-tailed Weibull random variables {X1, · · · ,Xn}, we have that Pr [ ∑n k=1 Xk > x] ≈ Pr [ max{1≤k≤n}{Xk} > x ] ≈ nPr [X1 > x] =-=[6]-=-. 4) End-to-End Loss Rate: Assuming that the packet loss processes on the links are independent, the end-to-end loss probability of session σ can be easily computed as: pσ = 1− ∏ {i,j}∈L (1− xσijpij),... |

8 |
Fast determination of qos-based multicast routes in wireless networks using genetic algorithm
- Banerjee, Das
- 2001
(Show Context)
Citation Context ...ustrate this point with numerical examples. There exist some prior efforts on applying GA to address network layer problems. For example, GA has been explored in network-centric routing in [9], [10], =-=[18]-=-. These efforts have taken the important step in exploring the potential of GA for optimized QoS routing. The research problem addressed in this paper builds upon these earlier efforts and aims to mak... |

2 |
Queueing Systems: Volumn I: Theory
- Kleinrock
- 1975
(Show Context)
Citation Context ... on a Link : Since real-time video traffic typically has stringent delay requirements, it is necessary to consider link delays due to congestion. We model each link {i, j} as a general queuing system =-=[3]-=- with an average input rate λij (defined in (2)) and a service capacity cij . Let the probability density function of queueing delay tij on link {i, j} be fij(y). We assume that all of the moments of ... |