美国数学建模竞赛特等奖论文——2000 B O A Channel Assignment Model The Span Without a Face【数学建模】.pdfVIP

The Span Without a Face 311 A Channel Assignment Model: The Span Without a Face Jeffrey Mintz Aaron Newcomer James C. Price California Polytechnic State University San Luis Obispo, CA Advisor: Thomas O’Neil Introduction We were asked to design efficient assignment of radio channels to a sym- metric network of transmitter locations over a large planar area, so as to avoid interference. Efficiency is based on the span, the minimum of the largest chan- nel assigned. We derive properties implied by the first set of constraints and by the geom- etry of the given figure, which we use to construct what we call “span theory.” We prove upper and lower bounds for the span of the given figure. With the aid of a computer program, we narrow the bounds and prove that the span is 9. This is also the span of a network generated by extending the figure arbitrarily far in all directions. We then consider slightly altered constraints, that the channels of neigh- boring transmitters cannot differ by less than k. We determine two distinct strategies for channel assignments and two associated formulas for the span; the span is min{3k + 3, 2k + 7} for both the figure and the generated plane. Allowing a transmitter to be positioned irregularly in the hexagons changes the span by at most 1. Allowing all transmitters to be positioned irregularly—a worst-case scenario—gives a span of 18. Assumptions and Justifications • Every hexagon in the field has a single transmitter at its center. This can be assumed for Requirements A, B, and C from statements in the problem. c The UMAP Journal 21 (3) (2000) 311–326. 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 distr