## Joint congestion control and media access control design for ad hoc wireless networks (2005)

### Cached

### Download Links

- [spot.colorado.edu]
- [netlab.caltech.edu]
- [netlab.caltech.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | in Proceedings of IEEE Infocom |

Citations: | 89 - 4 self |

### BibTeX

@INPROCEEDINGS{Chen05jointcongestion,

author = {Lijun Chen and Steven H. Low and John C. Doyle},

title = {Joint congestion control and media access control design for ad hoc wireless networks},

booktitle = {in Proceedings of IEEE Infocom},

year = {2005},

pages = {2212--2222}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract — We present a model for the joint design of congestion control and media access control (MAC) for ad hoc wireless networks. Using contention graph and contention matrix, we formulate resource allocation in the network as a utility maximization problem with constraints that arise from contention for channel access. We present two algorithms that are not only distributed spatially, but more interestingly, they decompose vertically into two protocol layers where TCP and MAC jointly solve the system problem. The first is a primal algorithm where the MAC layer at the links generates congestion (contention) prices based on local aggregate source rates, and TCP sources adjust their rates based on the aggregate prices in their paths. The second is a dual subgradient algorithm where the MAC sub-algorithm is implemented through scheduling linklayer flows according to the congestion prices of the links. Global convergence properties of these algorithms are proved. This is a preliminary step towards a systematic approach to jointly design TCP congestion control algorithms and MAC algorithms, not only to improve performance, but more importantly, to make their interaction more transparent.

### Citations

4010 | Convex Optimization - Boyd, Vandenberghe - 2004 |

1482 |
Rate control in communication networks: shadow prices, proportional fairness and stability
- Kelly, Maulloo, et al.
- 1998
(Show Context)
Citation Context ...hms can be interpreted as distributed primaldual algorithms over the Internet to maximize aggregate utility, and a user’s utility function is (often implicitly) defined by its TCP algorithm, see e.g. =-=[18]-=-, [22], [21]. This series of work implicitly assumes a wireline network where link capacities are fixed and shared by flows that traverse common links. A natural formulation for the joint design of co... |

754 |
Graph Theory
- Diestel
- 2000
(Show Context)
Citation Context ...lso a sufficient condition for the feasibility of the flow vector if and only if the contention graph is a perfect graph 3 (see [1], also cited in [11]). According to the strong perfect graph theorem =-=[8]-=-, [7], a graph is perfect if and only if it has no induced subgraph that is isomorphic to an odd hole 4 , or its complement. Therefore if there exist odd holes in a contention graph, the sum of the no... |

560 | Optimization flow control, i: Basic algorithm and convergence
- Low, Lapsley
- 1999
(Show Context)
Citation Context ...n be interpreted as distributed primaldual algorithms over the Internet to maximize aggregate utility, and a user’s utility function is (often implicitly) defined by its TCP algorithm, see e.g. [18], =-=[22]-=-, [21]. This series of work implicitly assumes a wireline network where link capacities are fixed and shared by flows that traverse common links. A natural formulation for the joint design of congesti... |

449 | Analysis of TCP performance over mobile ad hoc networks
- Holland, Vaidya
- 1999
(Show Context)
Citation Context ... hoc wireless network. I. INTRODUCTION We consider the problem of congestion control over a multihop wireless ad hoc network. This has been an active research area over the past few years (see, e.g., =-=[15]-=-, [5], [9], [30], [12], [37], [38], [6]) with many fascinating and complex issues, involving, e.g., mobility, channel estimation, power control, MAC, routing, etc. Unlike most of previous work however... |

292 |
Minimization methods for non-differentiable functions
- Shor
- 1985
(Show Context)
Citation Context ...han 90 degrees with all descent directions at p. The new iteration may not improve the dual cost for all values of the stepsize. There exists many results on the convergence of the subgradient method =-=[27]-=-, [3]. For constant stepsize, the algorithm is guaranteed to converge to within a range of the optimal value 6 . For diminishing stepsize, the algorithm is guaranteed to converge to the optimal value.... |

207 | Joint scheduling and power control for wireless ad hoc networks
- ElBatt, Ephremides
(Show Context)
Citation Context ...hms. For example, in our joint design we can carry out scheduling by heuristically identifying the set of concurrently active links that can achieve the maximization in (14) approximately (see, e.g., =-=[10]-=-). C. A Numerical Example To illustrate the characteristics of the joint congestion control and scheduling algorithm (15), (16) and (18), and their implications for the algorithm’s implementation in a... |

202 |
Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks
- Xu, Saadawi
- 2001
(Show Context)
Citation Context ...ther penalize these flows with more contention. This A 1 B 2 C 3 D 4 E Fig. 1. Example of ad hoc wireless network G 6 will result in significant TCP unfairness in ad hoc wireless networks [13], [28], =-=[35]-=-, [36], [37]. To illustrate this, consider the example in Fig.1, and assume there are four network-layer flows A → B, C → D, E → F and G → H. The flow C → D experiences more contention and will build ... |

191 |
Link scheduling in polynomial time
- Hajek, Sasaki
- 1988
(Show Context)
Citation Context ...flow in all cliques to which it belongs. We now consider the problem of determining if a set of link flows are feasible, i.e., whether a schedule can be found to achieve this set of flows (see, e.g., =-=[14]-=-, [20]). This will be the constraint imposed by the MAC layer. Assume that we are given a L-dimensional vector y where yl is the desired flow on link l, in packets per second. We refer to y as the lin... |

188 | End-to-end congestion control schemes: Utility functions, random losses and ECN marks
- Kunniyur, Srikant
- 2003
(Show Context)
Citation Context ...nterpreted as distributed primaldual algorithms over the Internet to maximize aggregate utility, and a user’s utility function is (often implicitly) defined by its TCP algorithm, see e.g. [18], [22], =-=[21]-=-. This series of work implicitly assumes a wireline network where link capacities are fixed and shared by flows that traverse common links. A natural formulation for the joint design of congestion and... |

188 | Achieving MAC Layer Fairness in Wireless Packet Networks
- Nandagopal, Kim, et al.
- 2000
(Show Context)
Citation Context ... between link-layer flows provide fundamental constraints for resource allocation. In this paper we will model the contention relations between link-layer flows as a flow contention graph (see, e.g., =-=[25]-=-, [11]). This construction captures the location-dependent contention among link-layer flows. Based on the contention graph, we will use a contention matrix to mathematically formulate the contention ... |

148 | The impact of multihop wireless channel on tcp throughput and loss
- Fu, Zerfos, et al.
- 2003
(Show Context)
Citation Context ... I. INTRODUCTION We consider the problem of congestion control over a multihop wireless ad hoc network. This has been an active research area over the past few years (see, e.g., [15], [5], [9], [30], =-=[12]-=-, [37], [38], [6]) with many fascinating and complex issues, involving, e.g., mobility, channel estimation, power control, MAC, routing, etc. Unlike most of previous work however we focus on the inter... |

132 |
Data Networks, 2nd edition
- Bertsekas, Gallager
- 1992
(Show Context)
Citation Context ...tely the right price function λn =1− e −zn − zne −zn This price is just the probability when there are two or more packets, and can be readily derived following similar analysis carried out for Aloha =-=[2]-=-. For the general case with backoff, we have not yet obtained an explicit price function. We can also implement active queue management through designing other kinds of traffic-dependent multiple acce... |

107 | Hop-by-hop congestion control over a wireless multi-hop network
- Yi, Shakkottai
- 2003
(Show Context)
Citation Context ...TION We consider the problem of congestion control over a multihop wireless ad hoc network. This has been an active research area over the past few years (see, e.g., [15], [5], [9], [30], [12], [37], =-=[38]-=-, [6]) with many fascinating and complex issues, involving, e.g., mobility, channel estimation, power control, MAC, routing, etc. Unlike most of previous work however we focus on the interaction of co... |

96 | Boppana, “A comparison of TCP performance over three routing protocols for mobile Ad Hoc networks
- Dyer, V
- 2009
(Show Context)
Citation Context ...ss network. I. INTRODUCTION We consider the problem of congestion control over a multihop wireless ad hoc network. This has been an active research area over the past few years (see, e.g., [15], [5], =-=[9]-=-, [30], [12], [37], [38], [6]) with many fascinating and complex issues, involving, e.g., mobility, channel estimation, power control, MAC, routing, etc. Unlike most of previous work however we focus ... |

88 | Maxmin fair scheduling in wireless networks
- Tassiulas, Sarkar
- 2002
(Show Context)
Citation Context ...th both primary and secondary interference, and jointly design congestion control and MAC. Many schemes have been proposed for fair bandwidth sharing at link layer (see, e.g., [25], [33], [24], [16], =-=[29]-=-, [11]). Some of these schemes try to achieve weighted fairness, but they usually assume the weights are given and do not address the issue of how to choose those weights. In our work, these weights o... |

87 | Improving TCP performance over mobile ad-hoc networks with out-of-order detection and response
- Wang, Zhang
(Show Context)
Citation Context ...twork. I. INTRODUCTION We consider the problem of congestion control over a multihop wireless ad hoc network. This has been an active research area over the past few years (see, e.g., [15], [5], [9], =-=[30]-=-, [12], [37], [38], [6]) with many fascinating and complex issues, involving, e.g., mobility, channel estimation, power control, MAC, routing, etc. Unlike most of previous work however we focus on the... |

84 | Enhancing tcp fairness in ad hoc wireless networks using neighborhood red
- Xu, Gerla, et al.
- 2003
(Show Context)
Citation Context ...TRODUCTION We consider the problem of congestion control over a multihop wireless ad hoc network. This has been an active research area over the past few years (see, e.g., [15], [5], [9], [30], [12], =-=[37]-=-, [38], [6]) with many fascinating and complex issues, involving, e.g., mobility, channel estimation, power control, MAC, routing, etc. Unlike most of previous work however we focus on the interaction... |

80 | A Feedback-Based Scheme for Improving TCP Performance
- Chandran, Raghunathan, et al.
- 2001
(Show Context)
Citation Context ...ireless network. I. INTRODUCTION We consider the problem of congestion control over a multihop wireless ad hoc network. This has been an active research area over the past few years (see, e.g., [15], =-=[5]-=-, [9], [30], [12], [37], [38], [6]) with many fascinating and complex issues, involving, e.g., mobility, channel estimation, power control, MAC, routing, etc. Unlike most of previous work however we f... |

74 |
On max-min fairness and scheduling in wireless ad-hoc networks: Analytical framework and implementation
- Huang, Bensaou
- 2001
(Show Context)
Citation Context ...rks with both primary and secondary interference, and jointly design congestion control and MAC. Many schemes have been proposed for fair bandwidth sharing at link layer (see, e.g., [25], [33], [24], =-=[16]-=-, [29], [11]). Some of these schemes try to achieve weighted fairness, but they usually assume the weights are given and do not address the issue of how to choose those weights. In our work, these wei... |

66 |
Nonlinear Programming, 2nd edition, Athena Scientific
- Bertsekas
- 1999
(Show Context)
Citation Context ... −1 s l plRls and D1(p) is differentiable, but problem (14) may have multiple maxima and D2(p) is a piecewise linear function and not differentiable. Thus, D(p) is not differentiable at every point p =-=[3]-=-, and we cannot use the usual gradient methods, which are developed for differentiable problems, to solve the dual problem. Here we will solve the dual problem using subgradient method. Suppose c(p) i... |

58 | A unifying passivity framework for network flow control
- Wen, Arcak
- 2003
(Show Context)
Citation Context ...blem (3)-(4) only approximately. By choosing appropriate price functions λn(·), the optimal solution can be guaranteed to satisfy the constraint (4), and even solve the system problem (3)-(4) exactly =-=[32]-=-. In practice, the price functions λn(·) determine the efficiency of the congestion control scheme, as we will further discuss in the next subsection. B. Generating Congestion Price from the MAC Layer... |

55 | To layer or not to layer: balancing transport and physical layers in wireless multihop networks
- Chiang
(Show Context)
Citation Context ...e consider the problem of congestion control over a multihop wireless ad hoc network. This has been an active research area over the past few years (see, e.g., [15], [5], [9], [30], [12], [37], [38], =-=[6]-=-) with many fascinating and complex issues, involving, e.g., mobility, channel estimation, power control, MAC, routing, etc. Unlike most of previous work however we focus on the interaction of congest... |

48 | TCP over wireless multihop protocols: Simulation and experiments
- Gerla, Bagrodia, et al.
- 1999
(Show Context)
Citation Context ...TCP will further penalize these flows with more contention. This A 1 B 2 C 3 D 4 E Fig. 1. Example of ad hoc wireless network G 6 will result in significant TCP unfairness in ad hoc wireless networks =-=[13]-=-, [28], [35], [36], [37]. To illustrate this, consider the example in Fig.1, and assume there are four network-layer flows A → B, C → D, E → F and G → H. The flow C → D experiences more contention and... |

46 |
Distributed Fair Scheduling
- Vaidya, Bahl, et al.
- 2000
(Show Context)
Citation Context ...er the networks with both primary and secondary interference, and jointly design congestion control and MAC. Many schemes have been proposed for fair bandwidth sharing at link layer (see, e.g., [25], =-=[33]-=-, [24], [16], [29], [11]). Some of these schemes try to achieve weighted fairness, but they usually assume the weights are given and do not address the issue of how to choose those weights. In our wor... |

45 |
bandwidth sharing algorithms based on game theory frameworks for wireless ad-hoc networks
- Fang, Bensaou, et al.
(Show Context)
Citation Context ...en link-layer flows provide fundamental constraints for resource allocation. In this paper we will model the contention relations between link-layer flows as a flow contention graph (see, e.g., [25], =-=[11]-=-). This construction captures the location-dependent contention among link-layer flows. Based on the contention graph, we will use a contention matrix to mathematically formulate the contention constr... |

43 |
Nonlinear Systems,” 2nd edition
- Khalil
- 1996
(Show Context)
Citation Context ...x ∗ and is equal zero for x = x ∗ . Thus, V (x(t)) is strictly increasing with t, unless x(t) =x ∗ . More precisely, choose V (x ∗ )−V (x) as a Lyapunov function for system (7). By Lyapunov’s theorem =-=[19]-=-, the trajectories of (7) converge to x ∗ , starting from any initial condition x(0). Note that algorithm (7) solves the system problem (3)-(4) only approximately. By choosing appropriate price functi... |

40 | TCP behavior across multihop wireless networks and the wired internet
- Xu, Bae, et al.
- 2002
(Show Context)
Citation Context ...enalize these flows with more contention. This A 1 B 2 C 3 D 4 E Fig. 1. Example of ad hoc wireless network G 6 will result in significant TCP unfairness in ad hoc wireless networks [13], [28], [35], =-=[36]-=-, [37]. To illustrate this, consider the example in Fig.1, and assume there are four network-layer flows A → B, C → D, E → F and G → H. The flow C → D experiences more contention and will build up que... |

28 |
Simultaneous routing and resource allocation for wireless networks
- Xiao, Johansson, et al.
- 2001
(Show Context)
Citation Context ...ory of cross-layer design via dual decomposition in optimization framework. Other work that can be put into thisscategory includes TCP/IP interaction in [31], joint routing and resource allocation in =-=[34]-=- and joint TCP and power control in [6]. The work on joint congestion control and MAC design is the first step in our attempt to provide a unified framework for systematically carrying out cross-layer... |

26 | Fair sharing of MAC under TCP in wireless ad hoc networks
- Tang, Gerla
- 1999
(Show Context)
Citation Context ...ll further penalize these flows with more contention. This A 1 B 2 C 3 D 4 E Fig. 1. Example of ad hoc wireless network G 6 will result in significant TCP unfairness in ad hoc wireless networks [13], =-=[28]-=-, [35], [36], [37]. To illustrate this, consider the example in Fig.1, and assume there are four network-layer flows A → B, C → D, E → F and G → H. The flow C → D experiences more contention and will ... |

25 | Guaranteeing Fair Service to Persistent Dependent Tasks
- Bar-Noy, Mayer, et al.
- 1998
(Show Context)
Citation Context ...ust be a convex combination of the characteristic vectors of all independent sets of the flow contention graph 2 , and that the set of achievable flow vectors is a closed, convex and compact set (see =-=[1]-=-, also cited in [11]). In addition, constraint (1) is also a sufficient condition for the feasibility of the flow vector if and only if the contention graph is a perfect graph 3 (see [1], also cited i... |

13 | layer design for wireless networks - Shakkottai, Rappaport, et al. - 2003 |

13 |
Can TCP and shortest-path routing maximize utility
- Wang, Li, et al.
- 2003
(Show Context)
Citation Context ...for an overview). Our work belongs to the category of cross-layer design via dual decomposition in optimization framework. Other work that can be put into thisscategory includes TCP/IP interaction in =-=[31]-=-, joint routing and resource allocation in [34] and joint TCP and power control in [6]. The work on joint congestion control and MAC design is the first step in our attempt to provide a unified framew... |

13 | Fair Bandwidth Sharing Algorithms based on Game Theory Frameworks for Wireless Ad-hoc Networks
- Fang, Bensaou
- 2004
(Show Context)
Citation Context ...een linklayer flows provide fundamental constraints for resource allocation. In this paper we will model the contention relations between link-layer flows as a flow contention graph (see, e.g., [25], =-=[11]-=-). This construction captures the location-dependent contention among link-layer flows. Based on the contention graph, we will use a contention matrix to mathematically formulate the contention constr... |

9 |
Charaterizing achievable rates in multi-hop wireless networks: The joint routing and scheduling problem
- Kodialam, Nandagopal
- 2003
(Show Context)
Citation Context ...n all cliques to which it belongs. We now consider the problem of determining if a set of link flows are feasible, i.e., whether a schedule can be found to achieve this set of flows (see, e.g., [14], =-=[20]-=-). This will be the constraint imposed by the MAC layer. Assume that we are given a L-dimensional vector y where yl is the desired flow on link l, in packets per second. We refer to y as the link-laye... |

5 |
A duality model of TCP and active queue management algorithms
- Low
- 2003
(Show Context)
Citation Context ...rol schemes. VI. JOINT DESIGN II: SCHEDULING LINK-LAYER FLOWS ACCORDING TO CONGESTION PRICE In this section, a dual algorithm is derived by solving the dual problem of the system problem (3)-(4)[22], =-=[23]-=-. The solution to the dual problem motivates a scheme for media access control in which link-layer flows are scheduled according to congestion prices. A. Dual Algorithm and Its Convergence The system ... |

5 |
A topology independent fair queueing model in ad hoc wireless networks
- Luo, Lu
- 2000
(Show Context)
Citation Context ... networks with both primary and secondary interference, and jointly design congestion control and MAC. Many schemes have been proposed for fair bandwidth sharing at link layer (see, e.g., [25], [33], =-=[24]-=-, [16], [29], [11]). Some of these schemes try to achieve weighted fairness, but they usually assume the weights are given and do not address the issue of how to choose those weights. In our work, the... |

1 |
The strong perect graph theorem, preprint
- Cornuejols
- 2003
(Show Context)
Citation Context ... sufficient condition for the feasibility of the flow vector if and only if the contention graph is a perfect graph 3 (see [1], also cited in [11]). According to the strong perfect graph theorem [8], =-=[7]-=-, a graph is perfect if and only if it has no induced subgraph that is isomorphic to an odd hole 4 , or its complement. Therefore if there exist odd holes in a contention graph, the sum of the normali... |