Revisiting the optimal scheduling problem

  title={Revisiting the optimal scheduling problem},
  author={Sastry Kompella and Jeffrey E. Wieselthier and Anthony Ephremides},
  journal={2008 42nd Annual Conference on Information Sciences and Systems},
In this paper, we revisit the problem of determining the minimum-length schedule that satisfies certain traffic demands in a wireless network. Traditional approaches for the determination of minimum-length schedules are based on a collision channel model, in which neighboring transmissions cause destructive interference if and only if they are within the "interference region" of the receiving nodes. By contrast, here we adopt a more realistic model for the physical layer by requiring that a… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS
20 Citations
11 References
Similar Papers


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


Publications referenced by this paper.
Showing 1-10 of 11 references

Linear Programming and Network Flows

  • M. S. Bazaraa, J. J. Jarvis, H. D. Sherali
  • 2005
1 Excerpt

Resource optimiza tion of spatial TDMA in ad hoc radio networks: A column generation approach

  • P. Bjorklund, P. Varbrand, Di Yuan
  • 2003
1 Excerpt

Toft.Graph Coloring Problems

  • B.T.R. Jensen
  • 1995

Similar Papers

Loading similar papers…