On the Complexity of the Minimum Latency Scheduling Problem on the Euclidean Plane

Details On the Complexity of the Minimum Latency Scheduling Problem on the Euclidean Plane On the Complexity of the Minimum Latency Scheduling Problem on the Euclidean Plane

2012-03-13

arxiv.org/abs/1203.2725v1

Computer Science

Networking and Internet Architecture

Scientific paper

We show NP-hardness of the minimum latency scheduling (MLS) problem under the physical model of wireless networking. In this model a transmission is received successfully if the Signal to Interference-plus-Noise Ratio (SINR), is above a given threshold. In the minimum latency scheduling problem, the goal is to assign a time slot and power level to each transmission, so that all the messages are received successfully, and the number of distinct times slots is minimized. Despite its seeming simplicity and several previous hardness results for various settings of the minimum latency scheduling problem, it has remained an open question whether or not the minimum latency scheduling problem is NP-hard, when the nodes are placed in the Euclidean plane and arbitrary power levels can be chosen for the transmissions. We resolve this open question for all path loss exponent values $\alpha \geq 3$.

Affiliated with

Also associated with

No associations

Rating

On the Complexity of the Minimum Latency Scheduling Problem on the Euclidean Plane 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 Complexity of the Minimum Latency Scheduling Problem on the Euclidean Plane, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Complexity of the Minimum Latency Scheduling Problem on the Euclidean Plane will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-143661