Scheduling Activities in Wireless Sensor Networks

Chen, Yu; Fleury, Éric

doi:10.1007/978-1-84882-218-4_15

Search citation statements

Order By: Relevance

Paper Sections

Select...

Previous Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2012

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 54 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Instead of trying to describe all different variants for which the MLS problem has been proved to be NPhard, we will only highlight the result closest to ours, by Katz, Volker, and Wagner [9]. For a more complete summary of work in this area, we refer readers to the survey papers [12,8,13] and book chapter [2].…”

Section: Previous Workmentioning

confidence: 99%

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

Lin,

Schalekamp

2012

Preprint

View full text Add to dashboard Cite

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 Interferenceplus-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 α ≥ 3.

show abstract

Section: Previous Workmentioning

confidence: 99%