Sciweavers

72 search results - page 2 / 15
» Approximation Algorithms for Computing Capacity of Wireless ...
Sort
View
TON
2010
151views more  TON 2010»
12 years 12 months ago
Throughput Optimal Distributed Power Control of Stochastic Wireless Networks
The Maximum Differential Backlog (MDB) control policy of Tassiulas and Ephremides has been shown to adaptively maximize the stable throughput of multihop wireless networks with ran...
Yufang Xi, Edmund M. Yeh
IPPS
2009
IEEE
13 years 12 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
INFOCOM
2009
IEEE
13 years 12 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
DIALM
2008
ACM
139views Algorithms» more  DIALM 2008»
13 years 7 months ago
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
Zeev Nutov
TON
2010
279views more  TON 2010»
13 years 3 months ago
Distributed algorithms for minimum cost multicast with network coding
— We adopt the network coding approach to achieve minimum-cost multicast in interference-limited wireless networks where link capacities are functions of the signal-to-noise-plus...
Yufang Xi, Edmund M. Yeh