Computer Science – Data Structures and Algorithms
Scientific paper
2011-11-22
Computer Science
Data Structures and Algorithms
to appear in INFOCOM 2012, 16 pages, 4 fgures
Scientific paper
We give algorithms with constant-factor performance guarantees for several capacity and throughput problems in the SINR model. The algorithms are all based on a novel LP formulation for capacity problems. First, we give a new constant-factor approximation algorithm for selecting the maximum subset of links that can be scheduled simultaneously, under any non-decreasing and sublinear power assignment. For the case of uniform power, we extend this to the case of variable QoS requirements and link-dependent noise terms. Second, we approximate a problem related to cognitive radio: find a maximum set of links that can be simultaneously scheduled without affecting a given set of previously assigned links. Finally, we obtain constant-factor approximation of weighted capacity under linear power assignment.
Halldorsson Magnus M.
Mitra Pradipta
No associations
LandOfFree
Wireless Capacity and Admission Control in Cognitive Radio does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Wireless Capacity and Admission Control in Cognitive Radio, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Wireless Capacity and Admission Control in Cognitive Radio will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-553417