Sciweavers

177 search results - page 21 / 36
» Fast Algorithms and Performance Bounds for Sum Rate Maximiza...
Sort
View
TAMC
2009
Springer
14 years 2 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
WIOPT
2006
IEEE
14 years 1 months ago
Combined QoS scheduling and call admission control algorithm in cellular networks
— In this paper, a scheduling problem in wireless networks is considered when there simultaneously exist CBR (constant bit rate) users requiring exact minimum average throughput ...
Hyang-Won Lee, Song Chong
WCNC
2008
IEEE
14 years 2 months ago
Joint Power and Bandwidth Allocation in Multihop Wireless Networks
Abstract—This paper considers power and bandwidth allocation to maximize the end-to-end rate in a multihop wireless network. Assuming an orthogonal frequency division multiplexin...
Deqiang Chen, J. Nicholas Laneman
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
13 years 5 months ago
Stochastic optimization for Markov modulated networks with application to delay constrained wireless scheduling
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...
Michael J. Neely
IPSN
2007
Springer
14 years 1 months ago
The worst-case capacity of wireless sensor networks
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...
Thomas Moscibroda