Frequency Channel Assignment on Planar Networks

  title={Frequency Channel Assignment on Planar Networks},
  author={Michael Molloy and Mohammad R. Salavatipour},
For integers p q, a L(p;q)-labeling of a network G is an integer labeling of the nodes of G such that adjacent nodes receive integers which diier by at least p, and nodes at distance two receive labels which diier by at least q. The minimum number of labels required in such labeling is p q (G). This arises in the context of frequency channel assignment in mobile and wireless networks and often G is planar. We show that if G is planar then p q (G) 5 3 (2q ? 1) + 12p + 144q ? 78. We also provide… CONTINUE READING

From This Paper

Topics from this paper.


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

Some results on  ijnumbers of the products ofcomplete graphs

  • J. P. Georges, D. W. Mauro
  • Congr . Numer .
  • 1999

Scheduling algorithms for multihop radionetworks , IEEE / ACM Trans

  • E. L. Lloyd
  • 1993

On the complexity of distance2 coloring , InProc

  • E. L. Lloyd
  • Conf . Comput . and Inform . pages
  • 1992

On the number of Qn andrelated graphs

  • J. P. Georges A. Whittlesey, D. W. Mauro
  • SIAM J . Disc . Math .

Similar Papers

Loading similar papers…