## QoS and Fairness Constrained Convex Optimization of Resource Allocation for Wireless Cellular and Ad Hoc Networks (2002)

### Cached

### Download Links

- [www.ieee-infocom.org]
- [stanford.edu]
- [www.stanford.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | in Proc. IEEE Infocom |

Citations: | 77 - 10 self |

### BibTeX

@INPROCEEDINGS{Julian02qosand,

author = {David Julian and Mung Chiang and Daniel O'Neill and Stephen Boyd},

title = {QoS and Fairness Constrained Convex Optimization of Resource Allocation for Wireless Cellular and Ad Hoc Networks},

booktitle = {in Proc. IEEE Infocom},

year = {2002},

pages = {477--486}

}

### Years of Citing Articles

### OpenURL

### Abstract

For wireless cellular and ad hoc networks with QoS constraints, we propose a suite of problem formulations that allocate network resources to optimize SIR, maximize throughput and minimize delay. The distinguishing characteristics of these resource allocation formulations is that, by using convex optimization, they accommodate a variety of realistic QoS and fairness constraints. Their globally optimal solutions can be computed efficiently through polynomial time interior point methods, even though they use nonlinear objectives and constraints.

### Citations

582 | Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment - Ramanathan, Rosales-Hain - 2000 |

441 | Framework for uplink power control in cellular radio systems
- Yates
- 1995
(Show Context)
Citation Context ...Various iterative methods have been proposed to optimally maximize the minimum SIR, to minimize total or individual power, or to maximize throughput in [1], [3], [4], [6], [8], [9], [13], [15], [18], =-=[19]-=-, but these methods are not general enough to allow a diverse set of QoS constraints and other objective functions. We present a new framework of resource allocation based on the computational efficie... |

160 |
Toward Power Sensitive Network Architectures
- Bambos
- 1998
(Show Context)
Citation Context ...sed general convex optimization framework. Various iterative methods have been proposed to optimally maximize the minimum SIR, to minimize total or individual power, or to maximize throughput in [1], =-=[3]-=-, [4], [6], [8], [9], [13], [15], [18], [19], but these methods are not general enough to allow a diverse set of QoS constraints and other objective functions. We present a new framework of resource a... |

139 |
On the performance of adaptive modulation in cellular systems
- Qiu, Chawla
- 1999
(Show Context)
Citation Context ...l convex optimization framework. Various iterative methods have been proposed to optimally maximize the minimum SIR, to minimize total or individual power, or to maximize throughput in [1], [3], [4], =-=[6]-=-, [8], [9], [13], [15], [18], [19], but these methods are not general enough to allow a diverse set of QoS constraints and other objective functions. We present a new framework of resource allocation ... |

91 |
An asynchronous distributed algorithm for power control in cellular radio systems
- Mitra
- 1993
(Show Context)
Citation Context ...zation framework. Various iterative methods have been proposed to optimally maximize the minimum SIR, to minimize total or individual power, or to maximize throughput in [1], [3], [4], [6], [8], [9], =-=[13]-=-, [15], [18], [19], but these methods are not general enough to allow a diverse set of QoS constraints and other objective functions. We present a new framework of resource allocation based on the com... |

80 | Radio link admission algorithms for wireless networks with power control and active link quality protection
- Bambos, Chen, et al.
- 1995
(Show Context)
Citation Context ...eneral convex optimization framework. Various iterative methods have been proposed to optimally maximize the minimum SIR, to minimize total or individual power, or to maximize throughput in [1], [3], =-=[4]-=-, [6], [8], [9], [13], [15], [18], [19], but these methods are not general enough to allow a diverse set of QoS constraints and other objective functions. We present a new framework of resource alloca... |

38 | Adaptive power control and MMSE interference suppression
- Ulukus, Yates
- 1998
(Show Context)
Citation Context ...work. Various iterative methods have been proposed to optimally maximize the minimum SIR, to minimize total or individual power, or to maximize throughput in [1], [3], [4], [6], [8], [9], [13], [15], =-=[18]-=-, [19], but these methods are not general enough to allow a diverse set of QoS constraints and other objective functions. We present a new framework of resource allocation based on the computational e... |

29 | Gradual removals in cellular PCS with constrained power control and noise
- Andersin, Rosberg, et al.
- 1996
(Show Context)
Citation Context ...proposed general convex optimization framework. Various iterative methods have been proposed to optimally maximize the minimum SIR, to minimize total or individual power, or to maximize throughput in =-=[1]-=-, [3], [4], [6], [8], [9], [13], [15], [18], [19], but these methods are not general enough to allow a diverse set of QoS constraints and other objective functions. We present a new framework of resou... |

24 |
Distributed Autonomous Wireless Channel Assignment Algorithm with Power Control
- Foschini, Miljanic
- 1995
(Show Context)
Citation Context ...ptimization framework. Various iterative methods have been proposed to optimally maximize the minimum SIR, to minimize total or individual power, or to maximize throughput in [1], [3], [4], [6], [8], =-=[9]-=-, [13], [15], [18], [19], but these methods are not general enough to allow a diverse set of QoS constraints and other objective functions. We present a new framework of resource allocation based on t... |

24 | Distributed Resource Allocation for DS-CDMA-Based Multimedia ad hoc Wireless LAN’s - Lal, Sousa - 1999 |

16 | Optimal Power Control in Interference Limited Fading Wireless Channels with Outage Probability Specifications
- Kandukuri, Boyd
- 2002
(Show Context)
Citation Context ...nd flexibly allowing different constraints, objectives and variables. A similar idea has been used to minimize outage probability in cellular networks under Rayleigh fading without QoS constraints in =-=[11]-=-. We show that the convex optimization framework can be used to incorporate a variety of QoS constraints and objectives, not just for cellular networks, but for ad hoc networks as well. III. CONVEX OP... |

6 | Resource allocation for QoS provisioning in wireless ad hoc networks
- Chiang, O'Neill, et al.
- 2001
(Show Context)
Citation Context ...user QoS requirements are transformed into a set of QoS link requirements for the hops taken from source to destination. Extending the results for cellular networks to ad hoc networks and our work in =-=[7]-=-, the following problems P 4 to P 7 are solved for multi-hop networks in sections VI and VII: P 4 Finding the optimum power control to maximize overall system throughput consistent with QoS guarantees... |

6 |
Robust and QoS constrained optimization of power control in wireless cellular networks
- Julian, Chiang, et al.
- 2001
(Show Context)
Citation Context ...apture the effect of both co-channel and adjacent channel interference, and is routinely used in this paper to characterize the QoS parameter of throughput of a particular link. Extending our work in =-=[10]-=-, sections IV and V formulate the following problems P 1 to P 3 for wireless cellular networks and show that they can be solved using convex optimization techniques. P 1 Determining feasibility of a s... |

5 |
A simple distributed autonomour power control algorithm and its convergence
- Foschini, Miljanic
- 1993
(Show Context)
Citation Context ...vex optimization framework. Various iterative methods have been proposed to optimally maximize the minimum SIR, to minimize total or individual power, or to maximize throughput in [1], [3], [4], [6], =-=[8]-=-, [9], [13], [15], [18], [19], but these methods are not general enough to allow a diverse set of QoS constraints and other objective functions. We present a new framework of resource allocation based... |

3 |
Convex Optimization and Its Engineering Applications
- Boyd, Vandenberghe
- 1999
(Show Context)
Citation Context ... point method. Convex optimization refers to minimizing a convex objective function over convex constraint sets. The particular type of convex optimization we use is in the form of geometric program. =-=[5]. -=-Geometric programming focuses on monomial and posynomial functions. Definition 1: A monomial is a function f : Rn →R, where the domain contains all real vectors with non-negative components: h(x) =c... |

1 | Gradual removals in celllular PCS with constrained power control and noise - Andersin, Rosberg, et al. - 1997 |

1 | Power-based leader selection in ad-hoc wireless networks - Shah, Flikkema - 1999 |