Sciweavers

71 search results - page 8 / 15
» Approximation Algorithms for Wireless Link Scheduling With S...
Sort
View
MOBIHOC
2007
ACM
14 years 7 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
INFOCOM
2007
IEEE
14 years 1 months ago
Low-Complexity Distributed Scheduling Algorithms for Wireless Networks
— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...
Abhinav Gupta, Xiaojun Lin, R. Srikant
ICC
2007
IEEE
122views Communications» more  ICC 2007»
14 years 1 months ago
Dynamic Programming for Scheduling a Single Route in Wireless Networks
— Multi-slot resource scheduling in a general two dimensional wireless ad hoc network, is a hard problem with no known polynomial-time solution. Recent optimization theoretic ana...
Gyouhwan Kim, Rohit Negi
INFOCOM
2009
IEEE
14 years 2 months ago
Power Controlled Scheduling with Consecutive Transmission Constraints: Complexity Analysis and Algorithm Design
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
Liqun Fu, Soung Chang Liew, Jianwei Huang
CISS
2008
IEEE
14 years 2 months ago
Distributed power control in wireless ad hoc networks using message passing: Throughput optimality and network utility maximizat
— This paper presents an algorithm for distributed power control and scheduling over wireless ad hoc-networks, where the data rate on each link depends on the transmission power ...
Aneesh Reddy, Sanjay Shakkottai, Lei Ying