【資料名稱】：頻率規(guī)劃算法特獎論文

【資料作者】：國外

【資料日期】：2001

【資料語言】：英文

【資料格式】：PDF

【資料目錄和簡介】：

We use mainly combinatorial methods to estimate and prove bounds for
various cases, concentrating on two levels of interference. We use the concept
of a span, the minimum largest channel among assignments that satisfy the
constraints.
For Requirements A and B, the span is 9. For Requirement C, the span is 7
when k = 1, 9 when k = 2, 12 when k = 3, and 2k + 7 for k ≥ 4.
For Requirement D, we present the results in a table (Table 2). Some of our
results improve on upper bounds in Shepherd [1998].
Only regular transmitter placement needs to be considered; irregular placement
can be accommodated by making the hexagons so small that the transmitters
are in regular placement, with the bounds adapted correspondingly.
For Requirement E, we discuss both the limitations of our model and its
ability to produce an upper bound for any situation.