On the Problem of Wireless Scheduling with Linear Power Levels

Details On the Problem of Wireless Scheduling with Linear Power Levels On the Problem of Wireless Scheduling with Linear Power Levels

2011-07-25

arxiv.org/abs/1107.4981v1

Computer Science

Networking and Internet Architecture

Scientific paper

In this paper we consider the problem of communication scheduling in wireless networks with respect to the SINR(Signal to Interference plus Noise Ratio) constraint in metric spaces. The nodes are assigned linear powers, i.e. for each sender node the power is constant times the path loss between the sender and corresponding receiver. This is the minimal power for a successful transmission. We present a constant factor deterministic approximation algorithm, which works for at least Euclidean fading metrics. Simultaneously we obtain the approximate value of the optimal schedule length with error at most a constant factor. To give an insight into the complexity of the problem, we show that in some metric spaces the problem is NP-hard and cannot be approximated within a factor less than 1.5.

Affiliated with

Also associated with

No associations

Rating

On the Problem of Wireless Scheduling with Linear Power Levels 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 On the Problem of Wireless Scheduling with Linear Power Levels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Problem of Wireless Scheduling with Linear Power Levels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-573171