The L(h, k)-labeling is an assignment of frequencies to the transmitters/receivers of a multihop radio network such that 'close' transmitters must have frequencies which differ by at least k, and 'very close' transmitters must have frequencies which differ by at least h. The span of an L(h, k)-labeling is the difference between the largest and the smallest assigned frequency. In this paper we study the L(h, k)-labeling problem of cellular graphs, seeking those with minimum span for each value of k and h ≥ k. © Springer-Verlag Berlin Heidelberg 2003.
Exact solution of a class of frequency assignment problems in cellular networks: (Extended abstract) / Calamoneri, Tiziana. - 2841:(2003), pp. 163-173. [10.1007/978-3-540-45208-9_14]
Exact solution of a class of frequency assignment problems in cellular networks: (Extended abstract)
CALAMONERI, Tiziana
2003
Abstract
The L(h, k)-labeling is an assignment of frequencies to the transmitters/receivers of a multihop radio network such that 'close' transmitters must have frequencies which differ by at least k, and 'very close' transmitters must have frequencies which differ by at least h. The span of an L(h, k)-labeling is the difference between the largest and the smallest assigned frequency. In this paper we study the L(h, k)-labeling problem of cellular graphs, seeking those with minimum span for each value of k and h ≥ k. © Springer-Verlag Berlin Heidelberg 2003.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
