Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Reports

Upper bounds for the span in triangular lattice graphs: application to frequency planning for cellular network

Abstract : We study a problem coming from the design of wireless cellular radiocommunication network. Frequency planning constraints are modelled in terms of graph theory. For each planning function $f$ let us call $sp(f)$ - or the {\em span} of the frequency planning $f$ - the difference between the largest and the smallest frequency used. Let the {\em Order} of the graph be $Or(G)=sp(G)+1$ and the {\em maximal local order} of the graph the maximum order of a clique of $G$, i.e. $Mlo(G) = \max_{X \ \mbox{clique of}\ G} sp(X)$. We show: $Mlo(G) \leq sp(G) \leq 8\lceil\frac{Mlo(G)}{6}\rceil$.
Document type :
Reports
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02102069
Contributor : Colette ORANGE Connect in order to contact the contributor
Submitted on : Wednesday, April 17, 2019 - 9:13:29 AM
Last modification on : Saturday, September 11, 2021 - 3:19:15 AM

File

RR1997-28.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02102069, version 1

Collections

Citation

Stephane Ubeda, Janez Zerovnik. Upper bounds for the span in triangular lattice graphs: application to frequency planning for cellular network. [Research Report] LIP RR-1997-28, Laboratoire de l'informatique du parallélisme. 1997, 2+15p. ⟨hal-02102069⟩

Share

Metrics

Record views

6

Files downloads

16