美国数学建模竞赛特等奖论文——2000 B O Radio Channel Assignments【数学建模】.pdfVIP

Radio Channel Assignments 369 Radio Channel Assignments Justin Goodwin Dan Johnston Adam Marcus Washington University St. Louis, MO Advisor: Hiro Mukai Summary 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 place- ment can be accommodated by making the hexagons so small that the trans- mitters 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. Definitions • Let s denote the length of a side of a hexagon. Then the distance from the center of one hexagon to the center of an adjacent hexagon is s√3. • A region is a collection of hexagons, finite or otherwise. • For u and v hexagons in a region X , let D(u, v) be the minimum number of hexagons (including the first but not including the last) that one must pass through to move from u to v in region X . Set D(u, u) = 0. So, for example, the stipulation in the problem that any two different transmitters c The UMAP Journal 21 (3) (2000) 369–378. Copyright 2000 by COMAP, Inc. All rights reserved. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial