Wireless Capacity With Arbitrary Gain Matrix

Details Wireless Capacity With Arbitrary Gain Matrix Wireless Capacity With Arbitrary Gain Matrix

2011-08-04

arxiv.org/abs/1108.1055v1

Computer Science

Data Structures and Algorithms

8 pages, to appear in ALGOSENSORS 2011

Scientific paper

Given a set of wireless links, a fundamental problem is to find the largest subset that can transmit simultaneously, within the SINR model of interference. Significant progress on this problem has been made in recent years. In this note, we study the problem in the setting where we are given a fixed set of arbitrary powers each sender must use, and an arbitrary gain matrix defining how signals fade. This variation of the problem appears immune to most algorithmic approaches studied in the literature. Indeed it is very hard to approximate since it generalizes the max independent set problem. Here, we propose a simple semi-definite programming approach to the problem that yields constant factor approximation, if the optimal solution is strictly larger than half of the input size.

Affiliated with

Also associated with

No associations

Rating

Wireless Capacity With Arbitrary Gain Matrix 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 With Arbitrary Gain Matrix, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Wireless Capacity With Arbitrary Gain Matrix will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-14216