数学建模竞赛2011F奖（nice表格）修订版.docVIP

Repeater Coordination Team #8878 February 14,2011 Abstract Our goals are to determine the minimum number of repeaters necessary to accommodate 1000 users (Task 1) or 10000 users (Task 2), and to discuss the case in mountainous areas (Task 3). Assuming repeaters can pick up and retransmit all 145 to 148 MHz VHF signals (240 different channels) at the same time and users can use these 240 channels equally, we propose effective methods with two pivotal variables: the transmission range of repeaters (r) and interference range (d). To avoid co-channel interference, we focus on a far enough distance between repeaters and the application of PLs to approach the minimum number of repeaters under 3 mentioned situations. Dividing the whole area by “sufficiently separated frequencies” will reduce the utilization of repeaters. Thus we mainly focus on other two methods: let repeaters be far enough apart, or use CTCSS System. In Task 1, we consider a repeater network in which any two sites can communicate. To get the area a seamless cover, a cellular communication network model is adopted. the minimum number of repeaters is 39, calculated in MATLAB. In Task 2, the network should be thickened. But we must leave enough distance to prevent the co-channel interference. By AJS algorithm, we make an effective and fast simulation to users’ random communications. We estimate that one cellular communication network with 5 miles side length can service 3840 users at the same time. Thus, 3 cellular communication networks with 5 miles side length can service all the 10000 users. To avoid co-channel interference between these 3 networks, 3 PLs are associated to each network. In Task 3, we discuss two situations. In the relatively simple situation 1——there is one mountain in the area, the critical variables are the radius of the mountain base R. According to geometry characteristics of the mountain and the law of cosines, it is the mountainside where repeaters are needed. Using the sectional