#### DMCA

## Cross-layer congestion control, routing and scheduling design in ad hoc wireless networks (2006)

### Cached

### Download Links

- [spot.colorado.edu]
- [www.cds.caltech.edu]
- [spot.colorado.edu]
- [macs.cs.cityu.edu.hk]
- [netlab.caltech.edu]
- [netlab.caltech.edu]
- [www.eecis.udel.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Proc. IEEE Infocom |

Citations: | 147 - 10 self |

### Citations

3130 | Ad-hoc on-demand distance vector routing, in
- Perkins, Royer
- 2001
(Show Context)
Citation Context ... resource allocation (see e.g. [3]), i.e., they determine the feasible rate region at link layer. Second, most routing schemes for ad hoc networks select paths that minimize hop count (see e.g. [12], =-=[25]-=-). This implicitly predefines a route for any source-destination pair of a static network, independent of the pattern of traffic demand and interference/contention among links. This may result in cong... |

3018 | Dynamic source routing in ad hoc wireless networks, in
- Johnson, Maltz
- 1996
(Show Context)
Citation Context ...nt for resource allocation (see e.g. [3]), i.e., they determine the feasible rate region at link layer. Second, most routing schemes for ad hoc networks select paths that minimize hop count (see e.g. =-=[12]-=-, [25]). This implicitly predefines a route for any source-destination pair of a static network, independent of the pattern of traffic demand and interference/contention among links. This may result i... |

1918 |
Rate control in communication networks: shadow prices, proportional fairness and stability
- Kelly, Maulloo, et al.
- 1998
(Show Context)
Citation Context ... from the rate and scheduling constraints. Lastly, TCP congestion control algorithms can be interpreted as distributed primal-dual algorithms over the Internet to maximize aggregate utility, see e.g. =-=[13]-=-, [20], [15]. This series of work implicitly assumes a network where link capacities are fixed and routes are pre-specified. Here, we extend the basic utility maximization formulation with rate constr... |

1663 |
Combinatorial Optimization: Algorithms and Complexity
- Papadimitriou, Steiglitz
- 1982
(Show Context)
Citation Context ...t an (maximal) independent set in the conflict graph will correspond to a (maximal) matching in this undirected graph. Maximum weighted matching problem can be computed in polynomial time (see, e.g., =-=[23]-=-), but this requires centralized implementation. If implemented over an ad hoc network, each node needs to notify the central node of its weight and local connectivity information such that the centra... |

926 | Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
- Tassiulas, Ephremides
- 1992
(Show Context)
Citation Context ...explore the achievable rate region while optimizing some global objective for the end users. The stochastic Lyapunov function method is a powerful tool to prove the stability of Markovian system [1], =-=[29]-=-. Especially, Theorem 3.1 in [29] provides sufficient conditions for the stability of general Markov chain. We combine convex analysis with stochastic Lyapunov method to establish the stability and op... |

876 |
Applied Probability and Queues
- Asmussen
- 2003
(Show Context)
Citation Context ...ally explore the achievable rate region while optimizing some global objective for the end users. The stochastic Lyapunov function method is a powerful tool to prove the stability of Markovian system =-=[1]-=-, [29]. Especially, Theorem 3.1 in [29] provides sufficient conditions for the stability of general Markov chain. We combine convex analysis with stochastic Lyapunov method to establish the stability ... |

682 | Optimization flow control: basic algorithm and convergence
- Low, Lapsley
- 1999
(Show Context)
Citation Context ...the rate and scheduling constraints. Lastly, TCP congestion control algorithms can be interpreted as distributed primal-dual algorithms over the Internet to maximize aggregate utility, see e.g. [13], =-=[20]-=-, [15]. This series of work implicitly assumes a network where link capacities are fixed and routes are pre-specified. Here, we extend the basic utility maximization formulation with rate constraints ... |

549 | Impact of interference on multi-hop wireless network performance
- Jain, Padhye, et al.
- 2003
(Show Context)
Citation Context ... maximization formulation with rate constraints at nodes and additional constraints on scheduling at link layer. We model the contention relations between wireless links as a conflict graph (see e.g. =-=[11]-=-). This construction indicates which groups of links mutually interfere and cannot be active simultaneously. The feasible rate region at link layer is the convex hull of the corresponding rate vectors... |

385 |
Minimization Methods for Non-Differentiable Functions
- Shor
- 1985
(Show Context)
Citation Context ...ting and scheduling algorithm. It is easy to verify that g k i (p) = ∑ f k i,j(p) − ∑ f k j,i(p) − x k i (p) (17) j is a subgradient5 of dual function D(p) at point p. Thus, by the subgradient method =-=[26]-=-, [2], we obtain the following algorithm for price adjustment for node destination pair (i, k) p k i (t + 1) = [pki (t) + γt( xki (p(t)) X X −( (p(t)) − j:(i,j)∈L f k i,j j j:(j,i)∈L f k j,i (p(t)) ) ... |

350 | Dynamic power allocation and routing for time varying wireless networks
- Neely, Modiano, et al.
- 2003
(Show Context)
Citation Context ...ith the constraints that arise from contention for channel access. This paper substantially extends [3] to include routing and to study the network with time-varying channel and multirate devices. In =-=[22]-=-, the authors use multi-commodity flow variables to characterize the network capacity region for a wireless network with time-varying channel, and propose a joint routing and power allocation policy t... |

338 | The impact of imperfect scheduling on crosslayer rate control in multihop wireless networks
- Lin, Shroff
(Show Context)
Citation Context ...how it typically achieves a performance within about 4/5 of the maximum weight. As for the overall performance of our cross-layer design with this approximate scheduling, we can extend the results in =-=[19]-=- to show that the performance is no worse than that achieved by an exact design with a feasible rate region 1 2Π (and in practice, 4 5Π) at the link layer. Moreover, in Section VII we will see that th... |

238 |
Link scheduling in polynomial time
- Hajek, Sasaki
- 1988
(Show Context)
Citation Context ...that there is an opportunity for achieving throughput gains by employing an interferenceaware routing protocol. We use the same construction to model the contention relations among wireless links. In =-=[7]-=-, [14], the authors use a similar model to study the problem of jointly routing the flows and scheduling the transmissions to determine the achievable rates in multi-hop wireless networks. All these w... |

209 | End-to-end congestion control schemes: Utility functions, Random losses and ECN marks
- Kunniyur, Srikant
- 2000
(Show Context)
Citation Context ...te and scheduling constraints. Lastly, TCP congestion control algorithms can be interpreted as distributed primal-dual algorithms over the Internet to maximize aggregate utility, see e.g. [13], [20], =-=[15]-=-. This series of work implicitly assumes a network where link capacities are fixed and routes are pre-specified. Here, we extend the basic utility maximization formulation with rate constraints at nod... |

200 | Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm,” Queue
- Stolyar
- 2005
(Show Context)
Citation Context ...ng channels. Our result is applicable to a variety of time-varying systems that can be solved or modelled by dual algorithms. Similar result is obtained in other contexts through different techniques =-=[28]-=-, [6]. Our goal is to present a systematic approach to cross-layer design, not only to improve the performance, but more importantly, to make the interactions between different layers more transparent... |

194 | Fair resource allocation in wireless networks using queue-length based scheduling and congestion control
- Eryilmaz, Srikant
(Show Context)
Citation Context ...nnels. Our result is applicable to a variety of time-varying systems that can be solved or modelled by dual algorithms. Similar result is obtained in other contexts through different techniques [28], =-=[6]-=-. Our goal is to present a systematic approach to cross-layer design, not only to improve the performance, but more importantly, to make the interactions between different layers more transparent. Mot... |

168 | Simultaneous routing and resource allocation via dual decomposition
- Xiao, Johansson, et al.
- 2004
(Show Context)
Citation Context ...rate designs of different layers that interact through congestion price. Recent publications along this line of “layering as optimization decomposition” [5] includes [31], [8] for TCP/IP interaction, =-=[34]-=- for routing and resource allocation, [4], [16] for TCP and physical layer, and [3], [17], [18], [32] for joint TCP and media access control or scheduling. III. MODEL Consider an ad hoc wireless netwo... |

163 | Maxweight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
- Stolyar
- 2004
(Show Context)
Citation Context ... we further elaborate this point in the context of a generalized model of queueing network and general convex optimization. Consider a model of queueing network that is served by a generalized switch =-=[27]-=-. The generalized switch consists of a set L of interdependent parallel servers with time-varying service capabilities. The servers are interdependent in that they may not provide service simultaneous... |

156 | Joint rate control and scheduling in multihop wireless networks
- Lin, Shroff
(Show Context)
Citation Context ...ility-based optimization framework for Internet congestion control. The same framework has been applied to study the congestion control over ad hoc wireless networks (see, e.g., [4], [36], [35], [3], =-=[18]-=-). In [3], the authors study joint congestion control and media access control for ad hoc wireless network, and formulate rate allocation as a utility maximization problem with the constraints that ar... |

135 | Hop-by-hop Congestion Control over a Wireless Multi-hop Network
- Yi, Shakkottai
- 2004
(Show Context)
Citation Context ...21] provides a utility-based optimization framework for Internet congestion control. The same framework has been applied to study the congestion control over ad hoc wireless networks (see, e.g., [4], =-=[36]-=-, [35], [3], [18]). In [3], the authors study joint congestion control and media access control for ad hoc wireless network, and formulate rate allocation as a utility maximization problem with the co... |

118 | Joint congestion control and media access control design for ad hoc wireless networks
- Chen, Low, et al.
- 2005
(Show Context)
Citation Context ...sjoint resources with fixed capacities, in ad hoc wireless networks the link capacities are “elastic” and the contention among links provide a fundamental constraint for resource allocation (see e.g. =-=[3]-=-), i.e., they determine the feasible rate region at link layer. Second, most routing schemes for ad hoc networks select paths that minimize hop count (see e.g. [12], [25]). This implicitly predefines ... |

72 | Doyle Cross-Layer Optimization in TCP/IP networks
- Wang, Li, et al.
(Show Context)
Citation Context ...“vertical” decomposition into separate designs of different layers that interact through congestion price. Recent publications along this line of “layering as optimization decomposition” [5] includes =-=[31]-=-, [8] for TCP/IP interaction, [34] for routing and resource allocation, [4], [16] for TCP and physical layer, and [3], [17], [18], [32] for joint TCP and media access control or scheduling. III. MODEL... |

63 | Layering as optimization decomposition
- Chiang, Low, et al.
- 2007
(Show Context)
Citation Context ...to a natural “vertical” decomposition into separate designs of different layers that interact through congestion price. Recent publications along this line of “layering as optimization decomposition” =-=[5]-=- includes [31], [8] for TCP/IP interaction, [34] for routing and resource allocation, [4], [16] for TCP and physical layer, and [3], [17], [18], [32] for joint TCP and media access control or scheduli... |

62 | Cross-layer rate control for end-to-end proportional fairness in wireless networks with random access
- Wang, Kar
- 2005
(Show Context)
Citation Context ...is line of “layering as optimization decomposition” [5] includes [31], [8] for TCP/IP interaction, [34] for routing and resource allocation, [4], [16] for TCP and physical layer, and [3], [17], [18], =-=[32]-=- for joint TCP and media access control or scheduling. III. MODEL Consider an ad hoc wireless network with a set N of nodes and a set L of logical links. These links are directed, though we assume con... |

51 | time 1/2-approximation algorithm for maximum weighted matching in general graphs
- Preis
- 1999
(Show Context)
Citation Context ...ication overhead which is expensive in time and resources. There also exist simpler greedy sequential algorithms to compute a weighted matching at most a factor of 2 away from the maximum (see. e.g., =-=[24]-=-). But they also require centralized implementation. We seek a distributed algorithm where each node participates in the computation itself using only local information. A few distributed approximatio... |

42 | Distributed weighted matching
- WATTENHOFER, WATTENHOFER
- 2004
(Show Context)
Citation Context ...d algorithm where each node participates in the computation itself using only local information. A few distributed approximation algorithms exist for maximum weighted matching problem, see e.g. [30], =-=[33]-=-, [9]. In [9], the author presents a simple distributed algorithm to compute a weighted matching at most a factor of 2 away from the maximum in linear running time O(|L ′|). This algorithm is a distri... |

40 | Price-based Resource Allocation in Wireless Ad Hoc Networks - Xue, Li, et al. - 2003 |

38 | Jointly optimal congestion and contention control based on network utility maximization
- Lee, Chiang, et al.
(Show Context)
Citation Context ...ons along this line of “layering as optimization decomposition” [5] includes [31], [8] for TCP/IP interaction, [34] for routing and resource allocation, [4], [16] for TCP and physical layer, and [3], =-=[17]-=-, [18], [32] for joint TCP and media access control or scheduling. III. MODEL Consider an ad hoc wireless network with a set N of nodes and a set L of logical links. These links are directed, though w... |

17 |
Price-based distributed algorithm for optimal rate-reliability tradeoff in network utility maximization
- Lee, Chiang, et al.
- 2006
(Show Context)
Citation Context ...through congestion price. Recent publications along this line of “layering as optimization decomposition” [5] includes [31], [8] for TCP/IP interaction, [34] for routing and resource allocation, [4], =-=[16]-=- for TCP and physical layer, and [3], [17], [18], [32] for joint TCP and media access control or scheduling. III. MODEL Consider an ad hoc wireless network with a set N of nodes and a set L of logical... |

16 | Parallel approximation algorithms for maximum weighted matching in general graphs
- Uehara, Chen
- 2000
(Show Context)
Citation Context ...ributed algorithm where each node participates in the computation itself using only local information. A few distributed approximation algorithms exist for maximum weighted matching problem, see e.g. =-=[30]-=-, [33], [9]. In [9], the author presents a simple distributed algorithm to compute a weighted matching at most a factor of 2 away from the maximum in linear running time O(|L ′|). This algorithm is a ... |

11 | TCP/IP interaction based on congestion price: Stability and optimality
- He, Chiang, et al.
- 2006
(Show Context)
Citation Context ...cal” decomposition into separate designs of different layers that interact through congestion price. Recent publications along this line of “layering as optimization decomposition” [5] includes [31], =-=[8]-=- for TCP/IP interaction, [34] for routing and resource allocation, [4], [16] for TCP and physical layer, and [3], [17], [18], [32] for joint TCP and media access control or scheduling. III. MODEL Cons... |

10 |
Charaterizing achievable rates in multi-hop wireless newtorks: The joint routing and scheduling problem
- Kodialam, Nandagopal
- 2003
(Show Context)
Citation Context ...there is an opportunity for achieving throughput gains by employing an interferenceaware routing protocol. We use the same construction to model the contention relations among wireless links. In [7], =-=[14]-=-, the authors use a similar model to study the problem of jointly routing the flows and scheduling the transmissions to determine the achievable rates in multi-hop wireless networks. All these works f... |

5 |
A duality model of TCP and active queue management algorithms
- Low
- 2003
(Show Context)
Citation Context ...t in a convex set, the dual-based algorithm remains stable and optimal when the constraint set is modulated by an irreducible finite-state Markov chain. II. RELATED WORK The work in [13], [15], [20], =-=[21]-=- provides a utility-based optimization framework for Internet congestion control. The same framework has been applied to study the congestion control over ad hoc wireless networks (see, e.g., [4], [36... |

1 |
Balancing transport and physical layers in wirless multihop networks: Jointly optimal congestion control and power control
- Chiang
- 2005
(Show Context)
Citation Context ...rying capacity as in lasthop wireless networks where each (wired or wireless) link can be seen as a server and the routing is again specified by a routing matrix. It can include power control as well =-=[4]-=- as power does not change convexity of the feasible rate region. Convex optimization has provided a powerful tool in recent years to formulate and solve network resource allocation problems with deter... |

1 |
Simple distribute weighted matchings, preprint
- Hoepman
- 2004
(Show Context)
Citation Context ...rithm where each node participates in the computation itself using only local information. A few distributed approximation algorithms exist for maximum weighted matching problem, see e.g. [30], [33], =-=[9]-=-. In [9], the author presents a simple distributed algorithm to compute a weighted matching at most a factor of 2 away from the maximum in linear running time O(|L ′|). This algorithm is a distributed... |