Conference
Version(Extended Abstract)
T. Calamoneri
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 L(h, k)-labelings of cellular graphs, seeking those with minimum span for each value of k and $ h \geq k$. We completely solve the frequency assignment problem with L(h,k) constraints on cellular networks finding exact values of the span for each value of h and k; only in a small interval we provide different upper and lower bounds. For theoretical completeness we study the same problem also on hexagonal and squared grids.
PS-PDF Files