scispace - formally typeset
Journal ArticleDOI

Cross-layer optimization of wireless networks using nonlinear column generation

Reads0
Chats0
TLDR
A specialized solution method is developed, based on a nonlinear column generation technique, and it is proved that it converges to the globally optimal solution.
Abstract
We consider the problem of finding the jointly optimal end-to-end communication rates, routing, power allocation and transmission scheduling for wireless networks. In particular, we focus on finding the resource allocation that achieves fair end-to-end communication rates. Using realistic models of several rate and power adaption schemes, we show how this cross-layer optimization problem can be formulated as a nonlinear mathematical program. We develop a specialized solution method, based on a nonlinear column generation technique, and prove that it converges to the globally optimal solution. We present computational results from a large set of networks and discuss the insight that can be gained about the influence of power control, spatial reuse, routing strategies and variable transmission rates on network performance.

read more

Citations
More filters
Journal ArticleDOI

Simultaneous routing and resource allocation via dual decomposition

TL;DR: This paper forms the simultaneous routing and resource allocation (SRRA) problem as a convex optimization problem over the network flow variables and the communications variables, and exploits problem structure to derive efficient solution methods.
Journal ArticleDOI

Engineering wireless mesh networks: joint scheduling, routing, power control, and rate adaptation

TL;DR: This work develops efficient and exact computational tools using column generation with greedy pricing that allow for exact solutions for networks significantly larger than what has been possible so far and develops very fast approximations that compute nearly optimal solutions for even larger cases.
Proceedings ArticleDOI

Cross-layer rate control for end-to-end proportional fairness in wireless networks with random access

TL;DR: Two cross-layer algorithms, a dual based algorithm and a primal based algorithm, are proposed in this paper to solve the rate control problem in a multi-hop random access network and it is proved rigorously that the two proposed algorithms converge to the globally optimal solutions.
Journal ArticleDOI

Spatial Deep Learning for Wireless Scheduling

TL;DR: By using a deep learning approach, it is possible to bypass the channel estimation and to schedule links efficiently based solely on the geographic locations of the transmitters and the receivers due to the fact that in many propagation environments, the wireless channel strength is largely a function of the distance-dependent path-loss.
Journal ArticleDOI

Routing, scheduling and channel assignment in Wireless Mesh Networks: Optimization models and algorithms

TL;DR: This paper studies the radio resource assignment optimization problem in Wireless Mesh Networks assuming a time division multiple access (TDMA) scheme, a dynamic power control able to vary emitted power slot-by-slot, and a rate adaptation mechanism that sets transmission rates according to the signal-to-interference-and-noise ratio (SINR).
References
More filters
Book

Convex Optimization

TL;DR: In this article, the focus is on recognizing convex optimization problems and then finding the most appropriate technique for solving them, and a comprehensive introduction to the subject is given. But the focus of this book is not on the optimization problem itself, but on the problem of finding the appropriate technique to solve it.
Journal ArticleDOI

The capacity of wireless networks

TL;DR: When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for a randomly chosen destination is /spl Theta/(W//spl radic/(nlogn)) bits persecond under a noninterference protocol.
Book

Data networks

TL;DR: Undergraduate and graduate classes in computer networks and wireless communications; undergraduate classes in discrete mathematics, data structures, operating systems and programming languages.
Journal ArticleDOI

Rate control for communication networks: shadow prices, proportional fairness and stability

TL;DR: This paper analyses the stability and fairness of two classes of rate control algorithm for communication networks, which provide natural generalisations to large-scale networks of simple additive increase/multiplicative decrease schemes, and are shown to be stable about a system optimum characterised by a proportional fairness criterion.
Journal ArticleDOI

Mobility increases the capacity of ad hoc wireless networks

TL;DR: The per-session throughput for applications with loose delay constraints, such that the topology changes over the time-scale of packet delivery, can be increased dramatically under this assumption, and a form of multiuser diversity via packet relaying is exploited.
Related Papers (5)