Oblivious interference scheduling

@inproceedings{Fanghnel2009ObliviousIS,
  title={Oblivious interference scheduling},
  author={Alexander Fangh{\"a}nel and Thomas Kesselheim and Harald R{\"a}cke and Berthold V{\"o}cking},
  booktitle={PODC},
  year={2009}
}
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wireless network. In the directed version of the problem, each pair of points consists of a dedicated sending and a dedicated receiving device. In the bidirectional version the devices within a pair shall be able to exchange signals in both directions. In both versions, each pair must be assigned a power level and a color… CONTINUE READING
Highly Cited
This paper has 111 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 64 extracted citations

Algorithms for Sensor Systems

Lecture Notes in Computer Science • 2015
View 8 Excerpts
Highly Influenced

Wireless scheduling with power control

ACM Trans. Algorithms • 2012
View 5 Excerpts
Highly Influenced

111 Citations

0102030'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 111 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

The Complexity of Connectivity in Wireless Networks

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications • 2006
View 7 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…