A wireless network simulation method

Field of the Invention

0001The invention relates to the Code Division Multiple Access (CDMA) cellular mobile communication system, in particular to a wireless network analog simulation method of the CDMA system (Evolution Data Optimized, EVDO), the principle of which also can be applied to the wireless network analog simulation of High-Speed Downlink Packet Access (HSDPA) of Wideband CDMA (WCDMA).

Background of the Invention

0002Wireless network simulation is an important procedure in the whole wireless network construction and runs through the entire network construction. In the programming stage, through the network simulation, the conditions of network coverage, capacity, and the like after the scheme implementation can be simulated in the design period before a network is realized, and the scheme can be adjusted after possible problems are timely found out according to the simulation results; in the optimization stage, the feasibility of the optimization measurements such as new station addition, station information modification, etc. can be verified through the network simulation so that the effects brought by the adjustment before the optimized scheme is implemented can be estimated in advance. Therefore, the network simulation greatly saves the time of wireless network construction and operation and the cost of manpower and material resources, being an important foundation for guaranteeing high-speed and high-quality network construction.

0003The core of the wireless network simulation is simulation algorithm which is used for simulating the dynamic conditions of a real network so as to calculate the performance indexes of coverage, etc. in the course of the actual network operation.

0004At present, the targets of wireless network simulation mainly are CDMA IS95 or 1X networks, and the air interfaces of the networks adopt power control technology in forward/reverse direction. As for the downlink, the target resources of the simulation mainly consider the distribution of downlink transmission power among different terminals and different channels; and as for the uplink, target resources mainly consider the soaring of the noise of power.

0005In view of the technical characteristics of air interface, the common wireless network simulation method mainly adopts the Monte Carlo iteration algorithm which takes downlink power and uplink background noise threshold as judging conditions of convergence, and the chief goal of the design of the system is to access more users as possible. Therefore, aiming to realize the goal, the wireless network simulation obtains a certain number of users and the network performances in the distribution through calculation so as to verify whether the design of the network meets the requirements or not.

0006A snapshot method is widely adopted in the industry at present. The method distributes terminals in each snapshot according to a certain traffic distribution algorithm, keeps the terminals in the same positions in each snapshot, and assumes that the accessible terminals continuously occupy the system resource, calculates the network performances of each snapshot through the iteration, then averages a plurality of snapshot results, and takes the averaged result as the result of the whole network. When the snap objects are sufficient, the averaged result has the statistical meanings approximates to the actual practice. And as for the CDMAIS95 or 1X network, the simulation method is relatively mature and has acceptable accuracy.

0007Along with the increase of the requirements of the effectiveness of spectrum and the requirement of the rate, the rate requirements of uplink and downlink are dissymmetrical, so the original air interface technology cannot meet the requirements of users. Moreover, various 3G networks currently try to adopt new technologies to meet the increasing requirements. Among the new technologies, a relatively important technology is the one which adopts rate control instead of power control in downlink. The essence of rate control is the Automatic Modulation Coding (AMC) technology and combines physical layer Hybrid Automatic Repeat Request (HARQ) technology with scheduling technology of MAC (Medium Access Control) layer, and the like, make the control for resources is more efficient, the multiuser gain is obvious, and the downlink rate gets greater improvements.

0008The protocol of EVDO and HSDPA is the integration and embodiment of these technologies, which is more and more adopted in real commercial networks, and provides an update road for the original CDMA system. The new network also need wireless network simulation, the original Monte Carlo simulation algorithm does not combine new technologies, particularly the new technology introduced to downlink, and does not support the processing for Quality of Service (QoS) requirements. Therefore, such simulation algorithm can not favorably reflect the performances and states of real practice.

0009As shown in <figref idref="f0001">Figure 1</figref>, the following is a brief explanation for the schematic diagram of CDMA2000-1X EVDO forward channel time division multiplexing and user scheduling: <ul id="ul0001" list-style="none" compact="compact"><li>As a "wide channel", a forward channel provides time-division sharing for all users. The minimum unit of time division is slot, one slot is possibly distributed to a certain user for transmitting data or distributed to overhead massage for transmission (called active slot), and possibly in an idle state without any data transmission (called idle slot).</li></ul>

0010Because of the forward traffic channel is time division multiplexing, that data are transmitted to which user at a certain time is determined by the scheduler program of the forward channel according to a certain scheduling strategy, and the throughputs of users in different wireless environments are strongly affected by different scheduler programs.

0011The scheduling objectives are to make all users in the same cell as fair as possible and to maximize the total throughputs of the cell in any possible way. But the two objectives exist contradiction. For example, in order to pursue maximum throughputs of the whole cell, the scheduling strategy is supposed to transmit data to the terminals in the best wireless environment, which inevitably conduce to the results that the users in the edge environment cannot get services.

0012Therefore, for solving the problem of unfairness, a final scheduling algorithm is a compromises of the two objectives. At present, a Proportional fair Scheduler adopted by the common system is such an algorithm which give consideration to both efficiency and fairness, and the main principle of the Proportional Fair Scheduler lies in tracing the following two variables: current application rate DRC (k) of a user and historical throughput T (k) of a user, and carrying out scheduling according to the ratio of DRC (k)/T (k). Therefore, the higher the current application rate of the user has, the more service possibility the user gets; and the higher the historical throughput of the user has, which shows the user got more service opportunities before, then the less service possibility the user gets later.

0013As stated above, the wireless network simulation plays a key role in wireless network programming and optimization. If Aiming at the technical characteristics of CDMA2000-1X EVDO, and introduce service QoS requirement, it is undoubtedly ideal that a wireless network simulation method which is suitable for a base station and adopts a forward scheduling technology is provided to meet the requirements of the new air interface technology better so as to further improve the simulation accuracy and play a greater role in the programming and optimization of a new network (EVDO, HSDPA). But it is a pity that related technologies have not yet been realized at present.

Summary of the Invention

0014In view of the above problems, the main purpose of the invention is to provide a wireless network analog simulation method.

0015According to the embodiments of the invention, a wireless network analog simulation method is provided.

0016The method comprises the following operations: step 402, initializing the snapshot loop; step 404, performing reverse link rate assigning process and forward processing process; step 406, calculating the average throughput and average rate of the cell on the basis of the QoS (Quality of service) requirements of the terminal supported service; and step 408, repeating step 402 to step 406 if the time of snapshot loop does not reach predetermined threshold.

0017Wherein, in the step 406, under the condition that all the terminal supported services have QoS requirements, the average throughput of a forward cell is calculated through the following formula: <maths id="math0001"><math display="inline"><msub><mi mathvariant="italic">Througput</mi><mi mathvariant="italic">FL</mi></msub><mo>=</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>p</mi></munderover></mstyle><msub><mi>R</mi><mrow><mi mathvariant="italic">FL</mi><mo>-</mo><mi mathvariant="normal">i</mi></mrow></msub><mo>,</mo></math><img file="EP2169968A1_D0001.tif" /></maths> wherein, p indicates the number of forward reverse access terminals, and 1 &lt;p ≤ m; under the condition that all the terminal supported services have no QoS requirements, the average throughput of the forward cell is calculated through the following formula: <maths id="math0002"><math display="inline"><msub><mi mathvariant="italic">Througput</mi><mi mathvariant="italic">FL</mi></msub><mo>=</mo><mfrac><mrow><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mi>m</mi><mo>+</mo><mn>1</mn></mrow><mi>n</mi></munderover></mstyle><msub><mi mathvariant="italic">DRC</mi><mi>i</mi></msub></mrow><mrow><mi>n</mi><mo>-</mo><mi>m</mi></mrow></mfrac><mo>,</mo></math><img file="EP2169968A1_D0002.tif" /></maths> wherein, n-m indicates the number of forward access terminals; in addition, under the condition of part of the terminal supported services have QoS requirements, the average throughput of the forward cell is calculated through the following formula: <maths id="math0003"><math display="inline"><msub><mi mathvariant="italic">Througput</mi><mi mathvariant="italic">FL</mi></msub><mo>=</mo><mfrac><mrow><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mi>m</mi><mo>+</mo><mn>1</mn></mrow><mi>n</mi></munderover></mstyle><msub><mi mathvariant="italic">DRC</mi><mi>i</mi></msub></mrow><mrow><mi>n</mi><mo>-</mo><mi>m</mi></mrow></mfrac><mo>*</mo><mi>β</mi><mo>+</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>p</mi></munderover></mstyle><msub><mi>R</mi><mrow><mi mathvariant="italic">FL</mi><mo>-</mo><mi mathvariant="normal">i</mi></mrow></msub><mo>,</mo></math><img file="EP2169968A1_D0003.tif" /></maths> wherein, <maths id="math0004"><math display="inline"><mi>β</mi><mo>=</mo><mn>1</mn><mo>-</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>p</mi></munderover></mstyle><mfrac><msub><mi>R</mi><mrow><mi mathvariant="italic">FL</mi><mo>-</mo><mi mathvariant="normal">i</mi></mrow></msub><msub><mi>DRC</mi><mi>i</mi></msub></mfrac><mo>,</mo></math><img file="EP2169968A1_D0004.tif" /></maths> wherein, p indicates the number of forward inverse access terminals with QoS requirement, and 1 &lt; p ≤ m, and n-m indicates the number of the forward access terminals without QoS requirement.

0018The forward average rate can be calculated through the following formula: DataRate<i>_FL</i> = Throughput_FL<i>l NumMobile,</i> wherein, <i>NumMobile</i> indicates the number of forward access users. And the reverse average rate can be calculated through the following formula: DataRate<i>_RL</i> = Throughput_RL / <i>NumMobile ,</i> wherein, <i>NumMobile</i> indicates the number of reverse access users, and <maths id="math0005"><math display="inline"><msub><mi mathvariant="italic">Througput</mi><mi mathvariant="italic">RL</mi></msub><mo>=</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>k</mi></munderover></mstyle><msub><mi>R</mi><mrow><mi mathvariant="italic">RL</mi><mo>-</mo><mi>i</mi></mrow></msub><mo>,</mo></math><img file="EP2169968A1_D0005.tif" /></maths><i>Througput _RL</i> indicates the average throughput of an reverse cell.

0019Concretely speaking, in step 404, the reverse link rate assigning process comprises: <ul id="ul0002" list-style="none"><li>Step 702, sorting all the terminals according to reverse QoS priority, putting the terminals with high QoS priority service at the front of the sequence, putting the terminals with low QoS priority service after the said terminals with high QoS priority service, placing the terminals without QoS requirement randomly at the end of the sequence.</li><li>Step 704, initializing the data rate of each terminal according to the terminal access order;</li><li>Step 706, calculating the terminal service channel transmission power corresponding to the data rate and total transmission power of the terminal.</li><li>Step 708, judging whether the total transmission power of the terminal exceeds the maximum transmission power threshold;</li><li>If the judge result is yes, performing the step 712, otherwise, performing the step 710; step 710, judging whether the relative cell received noise increase exceed the threshold due to the acess of the i^th terminal , if the judge result is yes, performing the step 712, otherwise, recording successful terminal access;</li></ul>

0020And the step 712, judging whether the date rate of the i^th terminal can be reduced, and reducing the data rate by one grade according to the regulations of the rate grade if the result is yes, otherwise, recoding failed terminal access. Wherein, in the step 712, judging whether the data rate grade-reduced is lower than the minimum rate threshold after the data rate is redeced by one grade, returning the processing to the step 706 if the judge result is not, otherwise, recording the failed terminal access.

0021In addition, in the step 404, the forward processing process comprises: <ul id="ul0003" list-style="none"><li>Step 802, determining the total number of cells within the simulation range and initial cell;</li><li>Step 804, determining the terminals subject to the initial cell;</li><li>Step 806, sorting terminals according to forward service priority;</li><li>Step 808, sorting the terminals which can not meet the forward QoS requirements;</li><li>Step 810, judging whether there is the terminals which can not meet the forward QoS requirement according to the selected result of the step 808, if the judge result is yes, performing the step 812, otherwise, performing the step 814;</li><li>Step 812, processing the inaccessible forward terminals to the initial cell; and</li><li>Step 814, inputting accessible forward terminal sequences to the initial cell and possible to-be-deleted terminal.</li></ul>

0022Wherein, the sequence in the step 806 can be concretely processed as follows: <ul id="ul0004" list-style="none"><li>Step 902, reading the attributes of the terminals contained in the snapshot one by one and checking whether the terminal supported services have priority requirements;</li><li>Step 904, attributing the terminals without priority requirement to the set of forward terminals without forward priority;</li><li>Step 906, attributing the QoS services terminals with priority requirement to the set of terminals with forward priority; and</li><li>Step 908, sorting the terminals in the set of terminals with forward priority according to the priority after the ergodicity of all terminals, and putting the terminals in the set of terminals with forward priority at the front of the terminal sequence; and randomly sorting the terminals in the set of terminals without forward priority, and putting the terminals in the set of terminals without forward priority at the rear of the terminal sequence.</li></ul>

0023Herein, the step 908 can concretely comprise the following process: <ul id="ul0005" list-style="none"><li>Step 1002, sorting the terminals of the cell according to the forward service priority;</li><li>Step 1004, setting P=1, and determining the number of terminals with QoS requirement is M, wherein, M is an integer which is greater than or equal to zero;</li><li>Step 1006, judging whether P is greater than M or not, outputting the accessible terminal sequences and inaccessible terminal sequences if P is larger than M, and performing the processing to step 1008 if P is smaller than or equal to M,;</li><li>Step 1008, the previous P terminals with QoS requirements are judged according to the following formulas and the subsequent processing is performed according to the judge result: <maths id="math0006" num="Formula 1:"><math display="block"><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">1</mn></mrow></msub><msub><mi>DRC</mi><mn mathvariant="normal">1</mn></msub></mfrac><mo mathvariant="normal">+</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">2</mn></mrow></msub><msub><mi>DRC</mi><mn mathvariant="normal">2</mn></msub></mfrac><mo mathvariant="normal">+</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">+</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mi mathvariant="normal">p</mi></mrow></msub><msub><mi>DRC</mi><mi mathvariant="normal">p</mi></msub></mfrac><mo mathvariant="normal"><</mo><mn mathvariant="normal">1</mn></math><img file="EP2169968A1_D0006.tif" /></maths><maths id="math0007" num="Formula 2:"><math display="block"><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">1</mn></mrow></msub><msub><mi>DRC</mi><mn mathvariant="normal">1</mn></msub></mfrac><mo mathvariant="normal">+</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">2</mn></mrow></msub><msub><mi>DRC</mi><mn mathvariant="normal">2</mn></msub></mfrac><mo mathvariant="normal">+</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">+</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mi mathvariant="normal">p</mi></mrow></msub><msub><mi>DRC</mi><mi mathvariant="normal">p</mi></msub></mfrac><mo>=</mo><mn mathvariant="normal">1</mn></math><img file="EP2169968A1_D0007.tif" /></maths><maths id="math0008" num="Formula 3:"><math display="block"><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">1</mn></mrow></msub><msub><mi>DRC</mi><mn mathvariant="normal">1</mn></msub></mfrac><mo mathvariant="normal">+</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">2</mn></mrow></msub><msub><mi>DRC</mi><mn mathvariant="normal">2</mn></msub></mfrac><mo mathvariant="normal">+</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">+</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mi mathvariant="normal">p</mi></mrow></msub><msub><mi>DRC</mi><mi mathvariant="normal">p</mi></msub></mfrac><mo>></mo><mn mathvariant="normal">1</mn><mo>;</mo></math><img file="EP2169968A1_D0008.tif" /></maths></li></ul>

0024Wherein, if the formula 1 is tenable, set P=P+1, and the processing performing to the step 1006; if the formula 2 is tenable, all terminals after the P^th terminal are put into the set of inaccessible terminals, and the accessible terminal sequences and inaccessible terminal sequences are outputted; and if the formula 3 is tenable, the P^th terminal is put into the set of inaccessible terminals, and set P=P+1, and the processing is performing to the step 1006;

0025Moreover, between the step 404 and the step 406, the forward adjustment algorithm is performed, if forward adjustment is required, or the reverse adjustment algorithm is performed if reverse adjustment is required.

0026In addition, before the step 402, the following processings are included: calculating the corresponding forward DRC(Date Rate Control) rate of the candidate set on each grid on the basis of the comparison of the real forward demodulation signal to noise ratio Îor/loc and system demodulation threshold; wherein, the current grid supported forward DRC rate group corresponding to different cells are determined by checking the table according to the value of real signal to noise ratio Îor/loc on each grid, and when the real Îor/loc value is between the corresponding demodulation thresholds of two data rates, the lower rate is taken as the supportable forward DRC rate.

0027Aiming at the technical characteristics of CDMA2000-1 EVDO and introducing QoS requirement, the above technical scheme of the invention enables the wireless network simulation method to meet the requirements of the new air interface technology better and further improve the simulation accuracy and enables the wireless network simulation to highly approximate to the real network conditions of new network systems (EFDO, HSDPA), so the wireless network simulation can play a greater role in the programming and optimization so as to direct the network programming and optimization in higher efficiency.

Description of the Drawings

0028The figures described herein are used for providing further understanding for the invention, which form part of the application. The schematic embodiment and the description thereof of the invention are used for describing the invention and does not have improper limit for the invention. Among the figures: <ul id="ul0006" list-style="none" compact="compact"><li><figref idref="f0001">Figure 1</figref> is the schematic diagram according to the channel time-division multiplexing of a relevant technology;</li><li><figref idref="f0002">Figure 2</figref> is the overall flow chart of real operations of the wireless network analog simulation method according to the embodiment of the invention;</li><li><figref idref="f0003">Figure 3</figref> is the flow chart of the determination of candidate sets in the processing of <figref idref="f0002">Figure 2</figref>;</li><li><figref idref="f0004">Figure 4</figref> is the flow chart of the wireless network analog simulation method according to the embodiment of the invention;</li><li><figref idref="f0005">Figure 5</figref> is the processing flow chart of the first plan of the wireless network analog simulation method according to the embodiment of the invention;</li><li><figref idref="f0006">Figure 6</figref> is the processing flow chart of the second plan of the wireless network analog simulation method according to the embodiment of the invention;</li><li><figref idref="f0007">Figure 7</figref> is the reverse link data rate assigning process of the wireless network analog simulation method according to the embodiment of the invention;</li><li><figref idref="f0008">Figure 8</figref> is the forward processing flow chart of the wireless network analog simulation method according to the embodiment of the invention;</li><li><figref idref="f0009">Figure 9</figref> is the processing flow chart about sorting the priority of forward services in the forward processing; and</li><li><figref idref="f0010">Figure 10</figref> is the processing flow chart about selecting the set of forward inaccessible terminals in the forward processing process.</li></ul>

Detailed Description of the Invention

0029Fully considering the technical characteristics of AMC technology, combination of a physical layer and the HARQ technology, rate control, particularly the scheduling mechanism of a base station, and the like, and also considering the simulation processing of the hybrid service combining services with QoS requirement and services without QoS requirement, the present invention provides a new network analog simulation method which is simple and clear and can accurately reflect the varieties of the air interface technology.

0030In a word, in the present invention: firstly, aiming at the characteristics of full power transmission of forward channel in CDMA2000-1X EVDO, the forward basic coverage static analysis is finished at the first stage of the simulation processing; secondly, the reverse basic coverage iterative analysis is finished during the iteration process of simulation processing; thirdly, aiming at the QoS requirement of the service in the current real system, the judgment and processing of the QoS requirement are introduced to the simulation method, and the reverse rate adjustment is performed according to the processing result; finally, through the processing of the scheduling algorithm, a new algorithm is introduced to finish the calculation of the forward average rate and the throughput of the cell.

0031The embodiment of the invention is described hereinafter in detail by referring to the drawings.

0032As shown in <figref idref="f0002">figure 2</figref>, based on the principle of time-division multiplexing of forward channel in GDMA2000-1X EVDO and user scheduling, and combining the network simulation algorithm, the processing used for implementing the wireless network analog simulation method of the present invention comprises: <ul id="ul0007" list-style="none"><li>Step 201, inputting geographic information and initializing network configuration parameters; <ul id="ul0008" list-style="none" compact="compact"><li>In the step, the initialization operation of the wireless network simulation is performed, wherein mainly comprising inputting a three-dimensional electronic map and giving initial values to a network including base stations, terminals, carrier waves, carriers, and the like. The three-dimensional electronic map at least includes elevation, and additionally has ground scene information and vector information of roads, rivers, etc.</li></ul></li><li>Step 202, calculating the path loss of each cell; <ul id="ul0009" list-style="none" compact="compact"><li>In the step, firstly, determining the simulation range; then calculating the path loss of each cell on each grid in a specified range, and grid is a square which takes the smallest precision of the three-dimensional electronic map as the side length and is the divisibly smallest unit of the three-dimensional electronic map; the specified range is determined by setting a certain path loss threshold, and when the path loss of the cell on a certain grid exceeds the threshold, the distance between the grid and the cell can be considered so far that the influence of the cell can be neglected. The value of the path loss threshold is variable and affected by environment and network scale.</li></ul></li><li>Step 203, determining the candidate set and the cell with highest intensity on each grid: <ul id="ul0010" list-style="none" compact="compact"><li>The determination of the candidate set is based on the pilot frequency signal to noise ratio from the relevant cell to each grid, wherein the pilot frequency signal to noise ratio is closely related to the path loss of each grid relative to the relevant cell. The forward channel of CDMA2000-1X EVDO adopts a full power transmission, namely, the power of the forward pilot frequency channel is the total power of forward transmission, the pilot frequency signal to noise ratio from the relevant cell to each grid can be calculated through the pilot frequency transmission power and the path loss, and coverage cell candidate set on each grid can be determined through sorting from maximum to minimum and comparing with the setting threshold of candidate set; and then the cell with the strongest pilot frequency signal to noise ratio is recorded, and in each cell, the strongest cell is recorded as the grid information of the cell. The step is shown in <figref idref="f0003">Figure 3</figref>.</li></ul></li><li>Step 204, calculating the forward DRC rate corresponding to the candidate set on each grid: <ul id="ul0011" list-style="none" compact="compact"><li>Based on the coverage cell candidate set, the forward Date Rate Control (DRC) of CDMA2000-1X EVDO supported by each cell in the candidate set on each grid is calculated. The calculation of the DRC rate is based on the comparison between the forward real demodulation signal to noise ratio Îor/loc and the system demodulation threshold. Different system demodulation thresholds correspond to different DRC rates, and the forward DRC rate groups supported by different cells corresponding to the current grid can be determined by referring a relevant table according to the value of real signal to noise ratio on each grid. When the value of real Îor/loc lies between the demodulation thresholds corresponding to two data rates, the lower rate is taken as the supportable forward DRC rate.</li></ul></li><li>Step 205, setting terminal type and proportion: <ul id="ul0012" list-style="none" compact="compact"><li>In order to facilitate the setting of traffic, the terminal type is set according to the principle of terminal type corresponding to loaded service one by one in the step, and terminal ratio is set according to the service load in a simulation target.</li></ul></li><li>Step 206, network simulation process;</li><li>Step 207, outputting simulation diagrams and statistical results and finishing the network simulation; and</li></ul> Finally, the processing is end.

0033<figref idref="f0003">Figure 3</figref> is the flow chart of the determination of candidate set in the step 203, including the following concrete steps: <ul id="ul0013" list-style="none"><li>Step 301, calculating the pilot frequency Ppiloti from each cell on the current grid through the following formula: <maths id="math0009"><math display="block"><mi>Ppiloti</mi><mo mathvariant="italic">=</mo><msub><mi mathvariant="italic">P</mi><mrow><mi mathvariant="italic">tx</mi><mo mathvariant="italic">,</mo><mi mathvariant="italic">i</mi></mrow></msub><mo mathvariant="italic">*</mo><msub><mi mathvariant="italic">Pathloss</mi><mi mathvariant="italic">i</mi></msub><mo mathvariant="italic">,</mo></math><img file="EP2169968A1_D0009.tif" /></maths> Wherein, i=1 to M, <i>P_tx,i</i> indicates the total transmission power of the i^th cell; <i>Pathloss_i</i> indicates the path loss from the i^th cell to the current grid; and M indicates the number of the cells relevant to the current grid. As for a real network, partial cells far from a certain grid can be excluded because of very small relativity. The processing method is setting a certain path loss threshold value, when the path loss of a certain cell to the grid exceeds the threshold value, the cell can be considered irrelevant to the grid, so the value of M can be determined. Wherein, the path loss threshold value is consistent with the threshold value in the step 202.</li><li>Step 302, calculating the total receiving power loj on the grid through the following formula: <ul id="ul0014" list-style="none" compact="compact"><li><maths id="math0010"><math display="inline"><msub><mi mathvariant="italic">Io</mi><mi>j</mi></msub><mo>=</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>M</mi></munderover></mstyle><msub><mi>P</mi><mrow><mi mathvariant="italic">tx</mi><mo>,</mo><mi>i</mi></mrow></msub><mo>*</mo><msub><mi mathvariant="italic">Pathloss</mi><mi>i</mi></msub><mo>,</mo></math><img file="EP2169968A1_D0010.tif" /></maths> wherein, j indicates a grid marker.</li></ul></li><li>Step 303, calculating the pilot frequency signal to noise ratio Eci/loj of each cell on the grid j through the hollowing formula: <maths id="math0011"><math display="block"><msub><mi>Ec</mi><mi mathvariant="normal">i</mi></msub><mo>/</mo><msub><mi>lo</mi><mi mathvariant="normal">j</mi></msub><mo>=</mo><msub><mi>Ppilot</mi><mi mathvariant="normal">i</mi></msub><mo>/</mo><msub><mi>lo</mi><mi mathvariant="normal">j</mi></msub><mn>.</mn></math><img file="EP2169968A1_D0011.tif" /></maths></li><li>Step 304, sorting Ec_i/lo_j (for instance, according to the sequence from maximum to minimum).</li><li>Step 305, the several cells corresponding to the maxmum Ec/lo are set to coverage cell candidate set positioned on the grid terminal: <ul id="ul0015" list-style="none" compact="compact"><li>In the step, the value of the candidate set adopts the algorithm combining the threshold value and the most limit; firstly set the threshold value of Ec/lo , the number K of the cells whose Ec_i/lo_j is greater than the threshold value is calculated, if K>N (N indicates the number of the designed maximum candidate sets), former N cells are taken as candidates sets, and otherwise, former K cells are taken as the candidate sets.</li></ul></li><li>Step 306, in each cell, recording the strongest cell as grid information of the cell. The strongest cell is defined as the cell receiving the greatest Ec/lo value is the strongest service cell of the grid.</li></ul>

0034Then the processing is finished.

0035A wireless network simulation method according to the embodiments is elaborated below by referring to the figures (namely, the network simulation process in the step 206).

0036In a word, the network simulation processing comprises two big sections of loops, including the snapshot loop processing in which one snapshot can be understood as a processing of a system reaching the stable state under the condition of one distribution of the given terminal and the results of the simulation processing are the average combination of a large number of snapshot results; and the iterative loop processing in which one snapshot includes a plurality of iterative loop processings, and the purpose of the iterative loop is to enable the system to reach a stable state. Previously, the forward or reverse iterative loop algorithm used in the relevant technologies adopts Monte Carto iterative algorithm; however, in the DO system, the forward resources are time division multiplexing, so the Monte Carto iterative algorithm is inapplicable. The forward algorithm of the embodiment adopts a novel algorithm in consideration of the forward scheduling and QoS instead of the Monte Carto iterative algorithm, and meanwhile, the universal reverse algorithm is improved on the basis of the Monte Carto iterative algorithm according to the match between QoS and forward. The implementation of the method is concretely described as follows: <ul id="ul0016" list-style="none" compact="compact"><li>As shown in <figref idref="f0004">Figure 4</figref>, a wireless network simulation method comprises the following processing according to the embodiment: step 402, initializing the snapshot loop; step 404, performing reverse link rate assigning process and forward processing process; step 406, calculating the average throughput and average rate of the cell on the basis of the QoS requirement of the terminal supported service; and step 408, repeating the step 402 to the step 406 if the time of the snapshot loop does not reach to the predetermined threshold.</li></ul>

0037The method can be implemented through two schemes, the two schemes are described respectively as follows: <ul id="ul0017" list-style="none" compact="compact"><li>The first scheme</li></ul>

0038As shown in <figref idref="f0005">Figure 5</figref>, in the scheme, a wireless network simulation method concretely comprises the following processing: <ul id="ul0018" list-style="none" compact="compact"><li>Step 501, initializing the snapshot loop;</li></ul>

0039The initialization includes the following contents: (1) determining the random distributed position of the terminal in a predetermined mode, and randomly distributing the terminal in the designated geographic range of a network (for example, the mode of distributing the traffic of the cell according to the cell's covering areas, and the like); once the distribution mode is determined, the concrete positions of the terminals in each snapshot will be randomly determined; and the number of the terminals of each snapshot is coincidence with the Poisson distribution principle. <ul id="ul0019" list-style="none"><li>(2) Determining the correlated cell according to the grid of the terminal (covering the candidate set of the cell)</li><li>(3) Determining the random lognormal fading and stochastic power control error information of each terminal;</li><li>Step 502, reverse link rate assigning (as shown in <figref idref="f0007">Figure 7</figref>);</li><li>Step 503, performing forward processing with the reversely accessible terminal sequence obtained from the reverse iterative result as the input condition (as shown in <figref idref="f0008">Figure 8</figref>), thereby obtaining the terminal sequence simultaneously meeting the forward access conditions;</li><li>Step 504, judging whether an reverse adjustment is required or not, and performing step 505 if it is required and performing step 506 if it is not required.</li></ul>

0040It is here noticeable that in the process of judging, there are terminals deleted in the cell forward processing in step 508, then the terminals are deleted from the reverse iterative terminal set; and as long as at least one terminal is deleted, the reverse adjustment needs to be performed. <ul id="ul0020" list-style="none"><li>Step 505, performing the reverse rate adjustment algorithm which is basically the same as the reverse link rate assigning (as shown in <figref idref="f0007">Figure 7</figref>) and is different from the reverse link rate assigning in which the terminals are not selected randomly, and the terminal set is definite, namely being selected from the reverse iteration, but excludes the deleted terminals in the forward processing;</li><li>Step 506, calculating the forward, reverse throughout and average rate; In this step, the calculation of the cell forward average throughout can have the following situations: <ul id="ul0021" list-style="none"><li>Situation 1: Under the condition that all the terminal supported services have QoS requirements, the average throughout of the forward cell is calculated through the following formula: <maths id="math0012"><math display="inline"><msub><mi mathvariant="italic">Througput</mi><mi mathvariant="italic">FL</mi></msub><mo>=</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>p</mi></munderover></mstyle><msub><mi>R</mi><mrow><mi mathvariant="italic">FL</mi><mo>-</mo><mi mathvariant="normal">i</mi></mrow></msub><mo>,</mo></math><img file="EP2169968A1_D0012.tif" /></maths> wherein, p indicates the number of forward and reverse access terminals, and 1&lt;p≤m;</li><li>Situation 2: Under the condition that the terminal supported services have no QoS requirements, the average throughout of the forward cell is calculated through the following formula: <maths id="math0013"><math display="inline"><msub><mi mathvariant="italic">Througput</mi><mi mathvariant="italic">FL</mi></msub><mo>=</mo><mfrac><mrow><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mi>m</mi><mo>+</mo><mn>1</mn></mrow><mi>n</mi></munderover></mstyle><msub><mi mathvariant="italic">DRC</mi><mi>i</mi></msub></mrow><mrow><mi>n</mi><mo>-</mo><mi>m</mi></mrow></mfrac><mo>;</mo></math><img file="EP2169968A1_D0013.tif" /></maths> wherein, n-m indicates the number of forward access terminals; and</li><li>Situation 3: under the condition that part of the terminal supported services has QoS requirements, the average throughout of the forward cell is calculated through the following formula: <maths id="math0014"><math display="inline"><msub><mi mathvariant="italic">Througput</mi><mi mathvariant="italic">FL</mi></msub><mo>=</mo><mfrac><mrow><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mi>m</mi><mo>+</mo><mn>1</mn></mrow><mi>n</mi></munderover></mstyle><msub><mi mathvariant="italic">DRC</mi><mi>i</mi></msub></mrow><mrow><mi>n</mi><mo>-</mo><mi>m</mi></mrow></mfrac><mo>*</mo><mi>β</mi><mo>+</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>p</mi></munderover></mstyle><msub><mi>R</mi><mrow><mi mathvariant="italic">FL</mi><mo>-</mo><mi mathvariant="normal">i</mi></mrow></msub><mo>,</mo></math><img file="EP2169968A1_D0014.tif" /></maths>wherein,, <maths id="math0015"><math display="inline"><mi>β</mi><mo>=</mo><mn>1</mn><mo>-</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>p</mi></munderover></mstyle><mfrac><msub><mi>R</mi><mrow><mi mathvariant="italic">FL</mi><mo>-</mo><mi mathvariant="normal">i</mi></mrow></msub><msub><mi>DRC</mi><mi>i</mi></msub></mfrac><mo>,</mo></math><img file="EP2169968A1_D0015.tif" /></maths> wherein, p indicates the number of forward and reverse access terminals with the QoS requirements, and 1&lt;p≤m; n-m indicates the number of the forward access terminals without QoS requirements;</li></ul> Wherein, the forward average rates of the three situations are equal to the average throughout of the forward cells divided by the number of the forward access users. So the forward average rate can be calculated through the following formula: DataRate<i>_FL</i> = Throughput_FL / <i>NumMobile</i> ; wherein, <i>NumMobile</i> indicates the number of forward access users. Moreover, the reverse average rate is calculated through the following formula: DataRate_R<i>L</i> = Throughput_RL<i>l NumMobile</i> , wherein, <i>NumMobile</i> indicates the number of reverse access users, and <maths id="math0016"><math display="inline"><msub><mi mathvariant="italic">Througput</mi><mi mathvariant="italic">RL</mi></msub><mo>=</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>k</mi></munderover></mstyle><msub><mi>R</mi><mrow><mi mathvariant="italic">RL</mi><mo>-</mo><mi>i</mi></mrow></msub><mo>,</mo></math><img file="EP2169968A1_D0016.tif" /></maths><i>Througput _RL</i> indicates the average throughout of the reverse cells;</li><li>Step 507, judging whether the time of the snapshot loop reaches the predetermined threshold or not, continuing the next snapshot if the times are insufficient; otherwise, finishing the total snapshot loop. Wherein, the initial values of the variables of different snapshot loops are different, these variables include the number of terminals, positions of the terminals, the access order of the terminals and the like.</li><li>Step 508, finishing the processing.</li></ul>

0041The above is the description of the first scheme of the embodiment; and besides this, the second scheme can be practically implemented, and is elaborated as follows together with the drawings.

0042The second scheme:

0043As shown in <figref idref="f0006">Figure 6</figref>, in the scheme, a wireless network analog simulation method comprises the following processing: <ul id="ul0022" list-style="none"><li>Step 601, processing the initialization of the snapshot loop;</li><li>Step 602, forward processing process(as shown in <figref idref="f0008">Figure 8</figref>);</li><li>Step 603, performing reverse link rate assigning with the forward accessible terminal sequence obtained from the forward processing as the input condition(as shown in <figref idref="f0007">Figure 7</figref>), thereby obtaining the terminal sequence simultaneously meeting the reverse access conditions.</li><li>Step 604, judging whether forward adjustment is required or not, and performing step 605 if it is required, and shifting to step 606 if it is not required;</li></ul>

0044For the judgment conditions, they are similar to those of the first scheme, if there are reverse inaccessible terminals during cell reverse link rate assigning of the step 603, the terminals are deleted from the set of forward terminals; and as long as one terminal is deleted at least, the forward adjustment algorithm needs to be performed. <ul id="ul0023" list-style="none"><li>Step 605, performing forward adjustment algorithm, which is basically the same as the forward processing process(as shown in <figref idref="f0008">Figure 8</figref>), and is different from the forward processing in which the terminal is not randomly selected, the terminal set is definite, namely, being selected from the forward processing process, but excludes the deleted terminals in the reverse link rate assigning process.</li><li>Step 606, calculating the forward, reverse throughout and average rate;</li><li>Step 607, judging whether the time of the snapshot loop reaches the predetermined threshold or not;</li></ul>

0045And finally, finishing the processing.

0046<figref idref="f0007">Figure 7</figref> shows the reverse link rate assigning process in the step 404 (namely, the step 502 or 603), which mainly includes the following processing as shown in <figref idref="f0007">Figure 7</figref>: <ul id="ul0024" list-style="none"><li>Step 1, sorting all the terminals according to the reverse service QoS priority, putting the terminals with high priority service at the front of the sequence, putting the terminals with low priority service after the terminals with high priority service, placing the terminals without the QoS requirements randomly at the end of the sequence, moreover, keeping the terminal reverse access order valid in each reverse iterative calculation of the snapshot when the terminal reverse access order is determined (corresponding to the step 702);</li><li>Step 2, initializing the data rates of each terminal according to the terminal access order, and generally setting the initial rate of the terminal be the maximum rate of a system, and setting the data rate of the i^th terminal is R_i (corresponding to the step 704);</li><li>Step 3, calculating the terminal service channel transmission power corresponding to the rate R_i;</li><li>Step 4, calculating the total transmission power Tx_i of the terminal according to the proportion of the service channel in the total terminal transmission power (step 3 and step 4 corresponding to the above step 706);</li><li>Step 5, judging whether Tx_i exceeds the maximum transmission power threshold of the i^th terminal or not, and performing step 7 if the judgment is yes, otherwise, performing step 6 (corresponding to the above step 708);</li><li>Step 6, judging whether the relevant cell received noise increase exceeds the threshold due to the access of the i^th terminal; performing step 7 if the judgment is yes, otherwise performing step 10,and recording successful terminal access; (corresponding to the step 710);</li><li>Step 7, judging whether the data rate of the i^th terminal can be reduced with the main judgment basis that if the i^th terminal supported service requires the data rate to be a fixed value, the rate can not be reduced, and the step 10 is performed; and failed terminal access is recorded, and otherwise the step 8 is performed;</li><li>Step 8, reducing R_i by one grade according to the regulations of the rate grade (the step 7 and step 8 correspond to the step 712);</li><li>Step 9, judging whether the R_i being reduced by one grade is lower than the minimum rate threshold; performing step 10 if the judgment is yes, which shows the terminal is inaccessible and recording the failed terminal access, otherwise performing step 3 to carry out the next iteration;</li><li>Step 10, recording the calculation result of the terminal;</li><li>Step 11, performing the loop of next terminal till the reverse rate assigning judgment of all the terminals is finished;</li><li>Step 12, judging whether the reverse link meets the finishing decision condition of the snapshot or not , performing step 13 if the judgment is yes, otherwise performing step 3;</li><li>Step 13, outputting the final results, namely, the reverse access terminal sequence and reverse access rate;</li><li>Step 14, finishing the snapshot loop.</li></ul>

0047Wherein, for the judge condition in the step 12, it has two stages to decide whether one snapshot finishes or not, When the convergence conditions are met, if the variation of the reverse background noise increase of two adjacent iterations is smaller than a certain threshold, namely when the fluctuation of the reverse background noise increase of the two adjacent iterations is quite small, it is regarded as the iterative convergence, and the iterative loop exits, when the iteration is not convergent, but there are much more iteration times, the threshold of iteration times is set to prevent the condition that the loop can not be stopped, which is resulted from the iteration failing to get convergence, and when the iteration times are equal to the threshold, the iteration is forced to stop, and shift to the loop of next snapshot;

0048<figref idref="f0008">Figure 8</figref> shows the forward processing process in the said step 404 (namely, the step 503 or step 602). As shown in <figref idref="f0008">Figure 8</figref>, concretely includes the following processing : <ul id="ul0025" list-style="none"><li>Step 80, setting the total number of the cells in the simulation range be Ncell (corresponding to the step 802);</li><li>Step 81, determining the initial cell is the cell x, x=1;</li><li>Step 82, determining the terminals are subject to the initial cell x (the step 81 and step 82 correspond to the above step 804);</li><li>Step 83, sorting the terminals subject to the cell x according to the forward service priority (the concrete sort processing is shown in <figref idref="f0009">Figure 9</figref>); (corresponding to the step 806);</li><li>Step 84, selecting the terminals which can not meet the forward QoS requirements (the concrete select processing is shown in <figref idref="f0010">Figure 10</figref>); (corresponding to the above step 808)</li><li>Step 85, judging whether there are terminals which can not meet the forward QoS requirements or not, judging whether the terminals which can not meet the forward QoS requirements are necessarily processed or not according to the selected results of the step 84, performing step 86 if the judgment is yes, and performing step 87 if the judgment is no; (corresponding to the step 810)</li><li>Step 86, processing the forward inaccessible terminals to the cell x; there are a plurality of choices for the processing method, for example, (1) directly deleting this kind of terminals from the terminal sequence; (2) picking out the cell of the next high intensity from the candidate set of these terminals, attributing the terminals to the cell, and deleting the terminals from the reverse iteration results if there is no cell of the next high pilot intensity candidate set; wherein, preferably, adopting the method of directly deleting this kind of terminals from the terminal sequence (corresponding to the step 812);</li><li>Step 87, outputting the accessible terminal sequence and possibly to-be-deleted terminals (corresponding to the above step 814);</li><li>Step 88, x = x+1;</li><li>Step 89, judging whether x is smaller or equal to the number Ncell of the cells; and shifting to the step 82 if the judgment is yes, which shows having cell which is not processed, otherwise finishing the processing process;</li></ul>

0049<figref idref="f0009">Figure 9</figref> shows the processing of sorting the priority of the terminal of the reverse snapshot loop result according to the forward service in the step 806 (namely, the step 83);

0050As shown in <figref idref="f0009">Figure 9</figref>, the step 806 includes the following steps: <ul id="ul0026" list-style="none"><li>Step 902, reading the attributes of the terminal contained in the snapshot one by one and checking whether the terminal supported services have the priority requirements or not;</li><li>Step 904, attributing the common terminals without the priority requirements into the set of forward non-priority terminals;</li><li>Step 906, attributing the QoS services terminals with the priority requirements into the set of forward priority terminals;</li><li>Step 908, sorting the terminals in the set of priority terminals according to the priority after the ergodicity of all the terminals and putting the terminals of the set of priority terminals at the front of the terminal sequence; and randomly sorting the terminals in the set of the forward non-priority terminals, and putting the terminals in the set of the forward non-priority terminals at the rear of the terminal sequence, thereby determining the access order of all the terminals in the snapshot;</li></ul>

0051And finally, finishing the processing process.

0052<figref idref="f0010">Figure 10</figref> shows the flow of selecting the set of the forward inaccessible terminals in the step 808 (namely, the step 84) which includes the following processing as shown in <figref idref="f0010">Figure 10</figref>: <ul id="ul0027" list-style="none" compact="compact"><li>Step 1002, sorting the terminals of the cell according to the forward service priority, and regarding the set of inaccessible terminals as zero.</li></ul>

0053Here, suppose there are n terminals subject to the cell i, the terminals are sorted from high to low according to the priority as AT₁, AT₂, ....., AT_n, the DRC rates of the n terminals are respectively denoted as DRC1,DRC2,....., DRCn. wherein, the terminals from AT₁ to AT_m are attributed to the set of forward priority terminals; and the rates of the QoS requirements of the n terminals are denoted as from R_FL-₁ to R_FL-_m and the terminals from AT_m+1 to AT_n are attributed to the set of forward non-priority terminals. <ul id="ul0028" list-style="none"><li>Step 1004, setting P=1; and the number of the terminals with QoS requirements is M, this step is mainly for the initialization of the following calculations;</li><li>Step 1006, judging whether p is greater than M or not; performing the processing to step 1010, if P is greater than M; performing the processing to step 1008, if P is smaller than or equal to M; here, p is greater than M shows all the terminals with QoS requirements are scanned over and the terminals without QoS requirements are unnecessarily judged whether they meet the requirements or not;</li><li>Step 1008, for the former P terminals with the QoS requirements, judging whether the following formulas are tenable or not; <maths id="math0017" num="Formula 1:"><math display="block"><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">1</mn></mrow></msub><msub><mi>DRC</mi><mn mathvariant="normal">1</mn></msub></mfrac><mo mathvariant="normal">+</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">2</mn></mrow></msub><msub><mi>DRC</mi><mn mathvariant="normal">2</mn></msub></mfrac><mo mathvariant="normal">+</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">+</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mi mathvariant="normal">p</mi></mrow></msub><msub><mi>DRC</mi><mi mathvariant="normal">p</mi></msub></mfrac><mo><</mo><mn mathvariant="normal">1</mn></math><img file="EP2169968A1_D0017.tif" /></maths><maths id="math0018" num="Formula 2:"><math display="block"><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">1</mn></mrow></msub><msub><mi>DRC</mi><mn mathvariant="normal">1</mn></msub></mfrac><mo mathvariant="normal">+</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">2</mn></mrow></msub><msub><mi>DRC</mi><mn mathvariant="normal">2</mn></msub></mfrac><mo mathvariant="normal">+</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">+</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mi mathvariant="normal">p</mi></mrow></msub><msub><mi>DRC</mi><mi mathvariant="normal">p</mi></msub></mfrac><mo>=</mo><mn mathvariant="normal">1</mn></math><img file="EP2169968A1_D0018.tif" /></maths><maths id="math0019" num="Formula 3:"><math display="block"><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">1</mn></mrow></msub><msub><mi>DRC</mi><mn mathvariant="normal">1</mn></msub></mfrac><mo mathvariant="normal">+</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">2</mn></mrow></msub><msub><mi>DRC</mi><mn mathvariant="normal">2</mn></msub></mfrac><mo mathvariant="normal">+</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">+</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mi mathvariant="normal">p</mi></mrow></msub><msub><mi>DRC</mi><mi mathvariant="normal">p</mi></msub></mfrac><mo>></mo><mn mathvariant="normal">1</mn><mo>;</mo></math><img file="EP2169968A1_D0019.tif" /></maths></li></ul>

0054It is here noticeable that in the formula 1, formula 2 and formula 3, the accumulation of the left parts of the formula need to delete the terminals in the set of forward inaccessible terminals.

0055When the formula 1 is met, namely, the accumulation sum is less than 1, which shows that the forward can bear the P terminal and the former terminals of the P terminal and there is more capacity to bear the non-QoS terminals; and at this time, P=P+1 is performed, and the processing is performed to step 1006.

0056If the formula 2 is tenable, namely, the accumulation is equal to 1, which shows the P terminal and the previous QoS terminals of the P terminal can just bear forward, and simultaneously can not bear any other terminal no matter whether there are QoS requirements; and at the time, all the terminals after the terminal P are put into the set of the inaccessible terminals, including the terminals with QoS requirements and the terminals without QoS requirements, and the processing is performed to the step 1010 (outputting the accessible terminal sequence and inaccessible terminal sequence).

0057When the formula 3 is met, namely, the accumulation sum is greater than 1, which shows that the terminal P is inaccessible, and the terminal P is required to be put in the set of forward inaccessible terminals. At the time, the terminals after the terminal P are possibly accessed, so the loop does not exit,and P=P+1 is performed, and the processing is performed to step 1006.

0058Step 1010, outputting the accessible terminal sequence and inaccessible terminal sequence, the sum of the two sequences is the total number of the terminals in the cell in the beginning of processing.

0059And finally, finishing the processing process.

0060Together with <figref idref="f0002">Figure 2</figref>, the simulation process of the CDMA2000-1X EVDO network as the example, the concrete implementation steps of the invention are elaborated as follows.

0061The concrete implementation steps are as follows: <ol id="ol0001"><li>(1) Introducing the three-dimensional electronic map, which including elevation, ground objects and vector information. and inputting the information of the network such as the base station, terminals, carriers, powers and the like in batch or one by one;</li><li>(2) Taking the general urban environment as an example, generally, when the path loss of a certain point reaches 200dB, the distance of the point to the cell transmitting signals is considered far enough, so, 200dB is set as the threshold, the path loss of all the surrounding grids less than and equal to the threshold of each cell is calculated, and form the path loss matrix of each cell;</li><li>(3) Calculating the pilot signal to noise ratio Ec_i/lo_j, corresponding to each cell on each grid, wherein, Ec_i is the pilot energy of each chip from the i^th cell, lo_j is the total received power on the grid;</li></ol>

0062Wherein, i=1, ..., M, <maths id="math0020"><math display="inline"><msub><mi>Io</mi><mi mathvariant="normal">j</mi></msub><mo mathvariant="normal">=</mo><mstyle displaystyle="true"><munderover><mo mathvariant="normal">∑</mo><mrow><mi mathvariant="normal">i</mi><mo mathvariant="normal">=</mo><mn mathvariant="normal">1</mn></mrow><mi mathvariant="normal">M</mi></munderover></mstyle><msub><mi>Io</mi><mi mathvariant="normal">i</mi></msub><mo mathvariant="normal">,</mo></math><img file="EP2169968A1_D0020.tif" /></maths> and M=20 ( in the general urban environment). In the step, the calculated values of pilot signal to noise ratio on each grid are sorted, N maximums are selected to be the covered cell candidate set positioned at the terminal of the grid, and generally, N=6. The utmost maximum of the pilot signal to noise ratio in the covered cell candidate set is marked at the corresponding grid of the path file matrix of the corresponding cell, namely the highest intensity service cell. (4) Calculating the forward demodulation signal to noise ratio Îor/loc of each grid, and obtaining the supportable maximum rate DRC of each grid through checking the below Table 1. The following is the corresponding relationship between the forward demodulation signal to noise ratio threshold and DRC rate under the condition of Additive white Gaussian noise (Additive White Gaussian Noise, AWGN): <tables id="tabl0001" num="0001"><table frame="all"><title>Table 1</title><tgroup cols="4"><colspec colnum="1" colname="col1" colwidth="28mm" /><colspec colnum="2" colname="col2" colwidth="20mm" /><colspec colnum="3" colname="col3" colwidth="11mm" /><colspec colnum="4" colname="col4" colwidth="40mm" /><thead><row><entry align="center" valign="middle">Data rate ( kbps )</entry><entry align="center" valign="middle">DRC value</entry><entry align="center" valign="middle">Slot</entry><entry align="center" valign="middle">lor/loc (PER=1%) AWGN</entry></row></thead><tbody><row><entry align="center">38.4</entry><entry align="center">1</entry><entry align="center">16</entry><entry align="center">-11.4</entry></row><row><entry align="center">76.8</entry><entry align="center">2</entry><entry align="center">8</entry><entry align="center">-8.6</entry></row><row><entry align="center">153.6</entry><entry align="center">3</entry><entry align="center">4</entry><entry align="center">-5.6</entry></row><row><entry align="center">307.2</entry><entry align="center">5</entry><entry align="center">4</entry><entry align="center">-2.5</entry></row><row><entry align="center">307.2</entry><entry align="center">4</entry><entry align="center">2</entry><entry align="center">-2.5</entry></row><row><entry align="center">614.4</entry><entry align="center">7</entry><entry align="center">2</entry><entry align="center">0.5</entry></row><row><entry align="center">614.4</entry><entry align="center">6</entry><entry align="center">1</entry><entry align="center">0.7</entry></row><row><entry align="center">921.6</entry><entry align="center">8</entry><entry align="center">2</entry><entry align="center">3.2</entry></row><row><entry align="center">1228.8</entry><entry align="center">10</entry><entry align="center">2</entry><entry align="center">5.9</entry></row><row><entry align="center">1228.8</entry><entry align="center">9</entry><entry align="center">1</entry><entry align="center">5.5</entry></row><row><entry align="center">1536</entry><entry align="center">13</entry><entry align="center">2</entry><entry align="center">8.11</entry></row><row><entry align="center">1843.2</entry><entry align="center">11</entry><entry align="center">1</entry><entry align="center">10.8</entry></row><row><entry align="center">2457.6</entry><entry align="center">12</entry><entry align="center">1</entry><entry align="center">15.4</entry></row><row><entry align="center">3072</entry><entry align="center">14</entry><entry align="center">1</entry><entry align="center">20.45</entry></row></tbody></tgroup></table></tables>

0063Table 1 comes from the minimum test standard «Recommended Minimum Performance Standards for cdma2000 High Rate Packet Data Access Terminal» . <ul id="ul0029" list-style="none"><li>(5) Supposed that the data rate QoS requirements of the network supported service are 1.2Mbps, 300kbps and 112kbps, and the ratio of the services is 1:2:1, then set the three terminal types correspond to the three services respectively, and the number ratio of the three types of terminals is 1:2:1, even though the terminals of a certain type can support a plurality of services in practice, the terminals are set separately in the simulation, facilitating the distribution setting of the traffic.</li><li>(6) Initializing the snapshot parameters, including the number of terminals , distribution position and the like.</li><li>(7) Performing reverse rate assigning (as shown in <figref idref="f0006">Figure 6</figref>), determining the reverse access order of the terminals according to the QoS priority of the terminal supported service , iteratively determining the reverse access rate and failure information of each terminal in the terminal access sequence, and obtaining the terminal sequence of successful reverse access.</li><li>(8) Judging whether the forwards of the reverse successfully accessible terminals need to support services with the QoS requirements, directly jumping to (11) , if the judgment is no, and calculating the average throughout of the reverse cell; performing (9) if the judgment is yes;</li><li>(9) Here, the algorithm for forward QoS requirement processing during one snapshot is shown here with a supposition.</li></ul>

0064Suppose that there are six reverse successfully accessible terminals, the terminals are sorted according to the forward service QoS and the QoS priority from high to low to obtain the terminal sequence AT1, AT2, ....., AT6. Setting AT1 to AT4 is the terminal with farward Qos requirement, AT5 and AT5 are the common services terminal without Qos requirement, as shown in the below Table 2: <tables id="tabl0002" num="0002"><table frame="all"><title>Table 2</title><tgroup cols="7"><colspec colnum="1" colname="col1" colwidth="61mm" /><colspec colnum="2" colname="col2" colwidth="18mm" /><colspec colnum="3" colname="col3" colwidth="18mm" /><colspec colnum="4" colname="col4" colwidth="15mm" /><colspec colnum="5" colname="col5" colwidth="15mm" /><colspec colnum="6" colname="col6" colwidth="15mm" /><colspec colnum="7" colname="col7" colwidth="15mm" /><thead><row><entry valign="middle">Terminal sequence number</entry><entry valign="middle">AT₁</entry><entry valign="middle">AT₂</entry><entry valign="middle">AT₃</entry><entry valign="middle">AT₄</entry><entry valign="middle">AT₅</entry><entry valign="middle">AT₆</entry></row></thead><tbody><row><entry valign="middle">Forward service QoS requirement</entry><entry namest="col2" nameend="col4" align="center" valign="middle">yes</entry><entry namest="col5" nameend="col7" align="center" valign="middle">no</entry></row><row><entry valign="middle">Forward service priority</entry><entry valign="middle">1</entry><entry valign="middle">1</entry><entry valign="middle">2</entry><entry valign="middle">3</entry><entry valign="middle">/</entry><entry valign="middle">/</entry></row><row><entry valign="middle">Forward QoS supported data rate ( bps )</entry><entry valign="middle">200k</entry><entry valign="middle">500k</entry><entry valign="middle">100k</entry><entry valign="middle">300k</entry><entry valign="middle">/</entry><entry valign="middle">/</entry></row><row><entry valign="middle">DRC data rate (bps)</entry><entry valign="middle">1.2288M</entry><entry valign="middle">2.4576M</entry><entry valign="middle">307.2k</entry><entry valign="middle">921.6k</entry><entry valign="middle">307.2k</entry><entry valign="middle">153.6k</entry></row></tbody></tgroup></table></tables>

0065Substituting the above assumed conditions into the formula 1 to the formula 3, then obtaining: <maths id="math0021"><math display="block"><mtable columnalign="left"><mtr><mtd><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">1</mn></mrow></msub><msub><mi>DRC</mi><mn mathvariant="normal">1</mn></msub></mfrac><mo mathvariant="normal">+</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">2</mn></mrow></msub><msub><mi>DRC</mi><mn mathvariant="normal">2</mn></msub></mfrac><mo mathvariant="normal">+</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">•</mo><mo mathvariant="normal">+</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mi mathvariant="normal">p</mi></mrow></msub><msub><mi>DRC</mi><mi mathvariant="normal">p</mi></msub></mfrac></mtd><mtd><mo>=</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">1</mn></mrow></msub><msub><mi>DRC</mi><mn mathvariant="normal">1</mn></msub></mfrac><mo mathvariant="normal">+</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">2</mn></mrow></msub><msub><mi>DRC</mi><mn mathvariant="normal">2</mn></msub></mfrac><mo mathvariant="normal">+</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn>3</mn></mrow></msub><msub><mi>DRC</mi><mn>3</mn></msub></mfrac><mo mathvariant="normal">+</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn>4</mn></mrow></msub><msub><mi>DRC</mi><mn>4</mn></msub></mfrac></mtd></mtr><mtr><mtd><mspace width="1em" /></mtd><mtd><mo>=</mo><mfrac><mn>200</mn><mn>1228.8</mn></mfrac><mo>+</mo><mfrac><mn>500</mn><mn>2457.6</mn></mfrac><mo>+</mo><mfrac><mn>100</mn><mn>307.2</mn></mfrac><mo>+</mo><mfrac><mn>300</mn><mn>921.6</mn></mfrac></mtd></mtr><mtr><mtd><mspace width="1em" /></mtd><mtd><mo>≈</mo><mn>1.0173</mn></mtd></mtr><mtr><mtd><mspace width="1em" /></mtd><mtd><mo>></mo><mn>1</mn></mtd></mtr></mtable></math><img file="EP2169968A1_D0021.tif" /></maths>

0066Wherein, when p=3, having <maths id="math0022"><math display="block"><mtable columnalign="left"><mtr><mtd><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">1</mn></mrow></msub><msub><mi>DRC</mi><mn mathvariant="normal">1</mn></msub></mfrac><mo mathvariant="normal">+</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn mathvariant="normal">2</mn></mrow></msub><msub><mi>DRC</mi><mn mathvariant="normal">2</mn></msub></mfrac><mo mathvariant="normal">+</mo><mfrac><msub><mi mathvariant="normal">R</mi><mrow><mi>FL</mi><mo mathvariant="normal">-</mo><mn>3</mn></mrow></msub><msub><mi>DRC</mi><mn>3</mn></msub></mfrac></mtd><mtd><mo>=</mo><mfrac><mn>200</mn><mn>1228.8</mn></mfrac><mo>+</mo><mfrac><mn>500</mn><mn>2457.6</mn></mfrac><mo>+</mo><mfrac><mn>100</mn><mn>307.2</mn></mfrac></mtd></mtr><mtr><mtd><mspace width="1em" /></mtd><mtd><mo>≈</mo><mn>0.692</mn></mtd></mtr><mtr><mtd><mspace width="1em" /></mtd><mtd><mo>&lt;</mo><mn>1</mn></mtd></mtr></mtable></math><img file="EP2169968A1_D0022.tif" /></maths>

0067So, the forward access of AT₄ is not allowed to perform, so as to meet the QoS requirements of the three terminals AT₁ to AT₃ with high forward service priority. Meanwhile, the common terminals AT₅ and AT₆ still can be accessed because the forward capacity does not reach saturation after the terminals from AT₁ to AT₃ are accessed, namely, the final forward access terminal sequence comprises AT₁, AT₂, AT₃, AT₅ and AT₆. <ul id="ul0030" list-style="none" compact="compact"><li>(10) Take the above terminal sequence as the reverse access terminal sequence, re-performing the iteration of the reverse rate assigning.</li></ul>

0068Suppose that the reverse terminal rate after iterated is shown in <figref idref="f0003">Figure 3</figref> as follows: <tables id="tabl0003" num="0003"><table frame="all"><title>Table 3</title><tgroup cols="6"><colspec colnum="1" colname="col1" colwidth="62mm" /><colspec colnum="2" colname="col2" colwidth="13mm" /><colspec colnum="3" colname="col3" colwidth="15mm" /><colspec colnum="4" colname="col4" colwidth="13mm" /><colspec colnum="5" colname="col5" colwidth="15mm" /><colspec colnum="6" colname="col6" colwidth="13mm" /><thead><row><entry valign="top">Terminal sequence number</entry><entry valign="top">AT₁</entry><entry valign="top">AT₂</entry><entry valign="top">AT₃</entry><entry valign="top">AT₅</entry><entry valign="top">AT₆</entry></row></thead><tbody><row><entry>Data rate after reverse adjustment ( bps )</entry><entry>76.8k</entry><entry>307.2k</entry><entry>76.8k</entry><entry>153.6k</entry><entry>38.4k</entry></row></tbody></tgroup></table></tables><ul id="ul0031" list-style="none" compact="compact"><li>(11) Calculating the average throughout of the forward and reverse cell;</li></ul>

0069Compounding the third situation, according to the assumed conditions in Table 2 and Table 3, namely the access terminal sequence is the union of the QoS service forward terminals and the terminals without QoS.

0070Substituting the values of Table 2 into the formula <maths id="math0023"><math display="inline"><msub><mi mathvariant="italic">Througput</mi><mi mathvariant="italic">FL</mi></msub><mo>=</mo><mfrac><mrow><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mi>m</mi><mo>+</mo><mn>1</mn></mrow><mi>n</mi></munderover></mstyle><msub><mi mathvariant="italic">DRC</mi><mi>i</mi></msub></mrow><mrow><mi>n</mi><mo>-</mo><mi>m</mi></mrow></mfrac><mo>*</mo><mi>β</mi><mo>+</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>p</mi></munderover></mstyle><msub><mi>R</mi><mrow><mi mathvariant="italic">FL</mi><mo>-</mo><mi mathvariant="normal">i</mi></mrow></msub><mo>,</mo></math><img file="EP2169968A1_D0023.tif" /></maths> thus obtaining the forward average cell throughout: <maths id="math0024"><math display="block"><mtable columnalign="left"><mtr><mtd><msub><mi mathvariant="italic">Througput</mi><mi mathvariant="italic">FL</mi></msub></mtd><mtd><mo>=</mo><mfrac><mrow><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mi>m</mi><mo>+</mo><mn>1</mn></mrow><mi>n</mi></munderover></mstyle><msub><mi mathvariant="italic">DRC</mi><mi>i</mi></msub></mrow><mrow><mi>n</mi><mo>-</mo><mi>m</mi></mrow></mfrac><mo>*</mo><mi>β</mi><mo>+</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>p</mi></munderover></mstyle><msub><mi>R</mi><mrow><mi mathvariant="italic">FL</mi><mo>-</mo><mi mathvariant="normal">i</mi></mrow></msub></mtd></mtr><mtr><mtd><mspace width="1em" /></mtd><mtd><mo>=</mo><mfrac><mrow><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>5</mn></mrow><mn>6</mn></munderover></mstyle><msub><mi mathvariant="italic">DRC</mi><mi>i</mi></msub></mrow><mn>2</mn></mfrac><mo>*</mo><mfenced><mn>1</mn><mo>-</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mn>3</mn></munderover></mstyle><mfrac><msub><mi>R</mi><mrow><mi mathvariant="italic">FL</mi><mo>-</mo><mi mathvariant="normal">i</mi></mrow></msub><msub><mi>DRC</mi><mi>i</mi></msub></mfrac></mfenced><mo>+</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mn>3</mn></munderover></mstyle><msub><mi>R</mi><mrow><mi mathvariant="italic">FL</mi><mo>-</mo><mi mathvariant="normal">i</mi></mrow></msub></mtd></mtr><mtr><mtd><mspace width="1em" /></mtd><mtd><mo>=</mo><mfrac><mrow><mn>307.2</mn><mo>⁢</mo><mi>k</mi><mo>+</mo><mn>153.6</mn><mo>⁢</mo><mi>k</mi></mrow><mn>2</mn></mfrac><mo>*</mo><mfenced><mn>1</mn><mo>-</mo><mn>0.692</mn></mfenced><mo>+</mo><mfenced><mn>200</mn><mo>⁢</mo><mi>k</mi><mo>+</mo><mn>500</mn><mo>⁢</mo><mi>k</mi><mo>+</mo><mn>100</mn><mo>⁢</mo><mi>k</mi></mfenced></mtd></mtr><mtr><mtd><mspace width="1em" /></mtd><mtd><mo>=</mo><mn>870.96</mn><mo>⁢</mo><mi mathvariant="italic">kbps</mi></mtd></mtr></mtable></math><img file="EP2169968A1_D0024.tif" /></maths>

0071Substituting the values of Table 3 into the formula <maths id="math0025"><math display="inline"><msub><mi mathvariant="italic">Througput</mi><mi mathvariant="italic">RL</mi></msub><mo>=</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>k</mi></munderover></mstyle><msub><mi>R</mi><mrow><mi mathvariant="italic">RL</mi><mo>-</mo><mi>i</mi></mrow></msub><mo>,</mo></math><img file="EP2169968A1_D0025.tif" /></maths> thus obtaining the reverse average cell throughout: <maths id="math0026"><math display="block"><mtable columnalign="left"><mtr><mtd><msub><mi mathvariant="italic">Througput</mi><mi mathvariant="italic">RL</mi></msub></mtd><mtd><mo>=</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>p</mi></munderover></mstyle><msub><mi>R</mi><mrow><mi mathvariant="italic">RL</mi><mo>-</mo><mi>i</mi></mrow></msub><mo>+</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mi>m</mi><mo>+</mo><mn>1</mn></mrow><mi>n</mi></munderover></mstyle><msub><mi>R</mi><mrow><mi mathvariant="italic">RL</mi><mo>-</mo><mi>i</mi></mrow></msub></mtd></mtr><mtr><mtd><mspace width="1em" /></mtd><mtd><mo>=</mo><mn>76.8</mn><mo>⁢</mo><mi>k</mi><mo>+</mo><mn>307.2</mn><mo>⁢</mo><mi>k</mi><mo>+</mo><mn>76.8</mn><mo>⁢</mo><mi>k</mi><mo>+</mo><mn>153.6</mn><mo>⁢</mo><mi>k</mi><mo>+</mo><mn>38.4</mn><mo>⁢</mo><mi>k</mi></mtd></mtr><mtr><mtd><mspace width="1em" /></mtd><mtd><mo>=</mo><mn>652.8</mn><mo>⁢</mo><mi mathvariant="italic">kbps</mi></mtd></mtr></mtable></math><img file="EP2169968A1_D0026.tif" /></maths><ul id="ul0032" list-style="none"><li>(12) Calculating the forward and reverse average rates: <maths id="math0027"><math display="block"><mtable columnalign="left"><mtr><mtd><mi>Forward average rate</mi></mtd><mtd><mo mathvariant="normal">=</mo><mi>forward cell average throughout</mi><mo mathvariant="normal">/</mo><mi>the number of forward access users</mi></mtd></mtr><mtr><mtd><mspace width="1em" /></mtd><mtd><mo mathvariant="normal">=</mo><mn mathvariant="normal">870.96</mn><mo>⁢</mo><mi mathvariant="normal">k</mi><mo mathvariant="normal">/</mo><mn mathvariant="normal">5</mn></mtd></mtr><mtr><mtd><mspace width="1em" /></mtd><mtd><mo mathvariant="normal">=</mo><mn mathvariant="normal">174.192</mn><mo>⁢</mo><mi>kbps</mi></mtd></mtr></mtable></math><img file="EP2169968A1_D0027.tif" /></maths><maths id="math0028"><math display="block"><mtable columnalign="left"><mtr><mtd><mi>Reverse average rate</mi></mtd><mtd><mo mathvariant="normal">=</mo><mi>reverse cell average throughout</mi><mo mathvariant="normal">/</mo><mi>the number of reverse access users</mi></mtd></mtr><mtr><mtd><mspace width="1em" /></mtd><mtd><mo mathvariant="normal">=</mo><mn mathvariant="normal">652.8</mn><mo>⁢</mo><mi mathvariant="normal">k</mi><mo mathvariant="normal">/</mo><mn mathvariant="normal">5</mn></mtd></mtr><mtr><mtd><mspace width="1em" /></mtd><mtd><mo mathvariant="normal">=</mo><mn>130.56</mn><mo>⁢</mo><mi>kbps</mi></mtd></mtr></mtable></math><img file="EP2169968A1_D0028.tif" /></maths></li><li>(13) Judging whether the time of the snapshot loop reaches the predetermined threshold or not, changing the initial variables of the snapshot loop if the times are insufficient, namely changing the information of terminals such as the number, positions, access order and the like to continue the next snapshot, and otherwise finishing the total snapshot loops.</li><li>(14) Statistically averaging all the results of the snapshot loop, outputting the simulation drawings, and finishing the simulation.</li></ul>

0072In a word, aiming at the characteristics of the CDMA2000-1XEVDO air interfacing technology such as forward full power transmission, forward partial services with QoS requirements, forward services require scheduling, rate control and the like, improves the iteration flows of traditional forward and reverse, and introduces the processing method for the services with QoS requirements, simultaneously simulates the dynamic scheduling strategy in an approximate static method, solves the defect that the traditional simulation method can not obtain the forward average rate and cell average throughout. With the technical schemes of the invention, the simulation model can be highly approximated to the network condition of the real EVDO system conditions, and the EVDO network planning and optimization can be more efficiently directed.

0073The preferred embodiment of the present invention is described for the purpose of illustration, not for limiting the present invention. For those skilled in the field, it is obvious that various alterations and modifications can be made to the present invention. Any alterations, substitutions and modifications falling into the spirit and principle of the present invention shall be protected by the claims of the present invention.