<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ep-patent-document PUBLIC "-//EPO//EP PATENT DOCUMENT 1.4//EN" "ep-patent-document-v1-4.dtd">
<ep-patent-document id="EP04749093B1" file="EP04749093NWB1.xml" lang="en" country="EP" doc-number="1647157" kind="B1" date-publ="20140604" status="n" dtd-version="ep-patent-document-v1-4">
<SDOBI lang="en"><B000><eptags><B001EP>ATBECHDEDKESFRGBGRITLILUNLSEMCPTIESILTLVFIRO..CY..TRBGCZEEHUPLSK....................................</B001EP><B003EP>*</B003EP><B005EP>J</B005EP><B007EP>DIM360 Ver 2.41 (21 Oct 2013) -  2100000/0</B007EP></eptags></B000><B100><B110>1647157</B110><B120><B121>EUROPEAN PATENT SPECIFICATION</B121></B120><B130>B1</B130><B140><date>20140604</date></B140><B190>EP</B190></B100><B200><B210>04749093.3</B210><B220><date>20040629</date></B220><B240><B241><date>20060208</date></B241><B242><date>20100930</date></B242></B240><B250>en</B250><B251EP>en</B251EP><B260>en</B260></B200><B300><B310>0302026</B310><B320><date>20030708</date></B320><B330><ctry>SE</ctry></B330></B300><B400><B405><date>20140604</date><bnum>201423</bnum></B405><B430><date>20060419</date><bnum>200616</bnum></B430><B450><date>20140604</date><bnum>201423</bnum></B450><B452EP><date>20140114</date></B452EP></B400><B500><B510EP><classification-ipcr sequence="1"><text>H04W  16/18        20090101AFI20130624BHEP        </text></classification-ipcr></B510EP><B540><B541>de</B541><B542>VERFAHREN ZUR BESTIMMUNG DER GEOGRAPHISCHEN VERKEHRSLAST IN EINEM MOBILTELEKOMMUNIKAITONSNETZ</B542><B541>en</B541><B542>METHOD FOR DETERMINING THE GEOGRAPHICAL TRAFFIC LOAD IN A MOBILE TELECOMMUNICATION NETWORK.</B542><B541>fr</B541><B542>PROCEDE PERMETTANT DE DETERMINER UNE CHARGE DE TRAFIC GEOGRAPHIQUE DANS UN RESEAU DE TELECOMMUNICATIONS MOBILES</B542></B540><B560><B561><text>US-A- 5 359 649</text></B561><B561><text>US-B1- 6 185 409</text></B561><B561><text>US-B1- 6 385 301</text></B561><B561><text>US-B1- 6 449 350</text></B561><B562><text>STEUER J. AND JOBMANN K.: 'The use of mobile positioning supported traffic density measurements to assist load balancing methods based on adaptive cell sizing' THE 13TH IEEE INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATION vol. 1, no. II-IV, 15 September 2002 - 18 September 2002, pages 339 - 343, XP010614243</text></B562></B560></B500><B700><B720><B721><snm>SOMMER, Magnus</snm><adr><str>Sävsångarvägen 12</str><city>138 37 Älta</city><ctry>SE</ctry></adr></B721></B720><B730><B731><snm>TELIASONERA AB</snm><iid>100997470</iid><irf>P 05-104 C.887</irf><adr><city>106 63 Stockholm</city><ctry>SE</ctry></adr></B731></B730><B740><B741><snm>Hopfgarten, Nils</snm><sfx>et al</sfx><iid>100019327</iid><adr><str>Groth &amp; Co. KB 
P.O. Box 6107</str><city>102 32 Stockholm</city><ctry>SE</ctry></adr></B741></B740></B700><B800><B840><ctry>AT</ctry><ctry>BE</ctry><ctry>BG</ctry><ctry>CH</ctry><ctry>CY</ctry><ctry>CZ</ctry><ctry>DE</ctry><ctry>DK</ctry><ctry>EE</ctry><ctry>ES</ctry><ctry>FI</ctry><ctry>FR</ctry><ctry>GB</ctry><ctry>GR</ctry><ctry>HU</ctry><ctry>IE</ctry><ctry>IT</ctry><ctry>LI</ctry><ctry>LU</ctry><ctry>MC</ctry><ctry>NL</ctry><ctry>PL</ctry><ctry>PT</ctry><ctry>RO</ctry><ctry>SE</ctry><ctry>SI</ctry><ctry>SK</ctry><ctry>TR</ctry></B840><B844EP><B845EP><ctry>LT</ctry><date>20060208</date></B845EP><B845EP><ctry>LV</ctry><date>20060208</date></B845EP></B844EP><B860><B861><dnum><anum>SE2004001055</anum></dnum><date>20040629</date></B861><B862>en</B862></B860><B870><B871><dnum><pnum>WO2005004514</pnum></dnum><date>20050113</date><bnum>200502</bnum></B871></B870><B880><date>20060419</date><bnum>200616</bnum></B880></B800></SDOBI>
<description id="desc" lang="en"><!-- EPO <DP n="1"> -->
<heading id="h0001">TECHNICAL FIELD</heading>
<p id="p0001" num="0001">The present invention relates to mobile telephone networks, and is aimed at determining traffic information regarding where in the telecommunication network the traffic is handled.</p>
<heading id="h0002">TECHNICAL PROBLEM</heading>
<p id="p0002" num="0002">There is an interest in acquiring knowledge about where the geographical load in telecommunication networks, especially in mobile telecommunication networks, is, in order to make it possible to optimize the system. When knowledge about this has been acquired, available resources can be adjusted in a more optimal way than what is the case at present. In order to distribute the resources more efficiently than in the systems of today, it is desirable to get information regarding the traffic distribution within the geographical coverage areas of the different cells. By the development in the field of mobile telecommunication the problem is accelerating. At change from GSM to UMTS it is in the latter case of even more importance to get information about where the traffic is handled. The reason for this is that the UMTS radio interface, W-CDMA, has a strongly load-depending coverage. The development in the field of mobile telecommunication will accentuate this problem in the future. Consequently it is of greatest importance to find methods which automatically measure the traffic load with regard to geographical sub-areas covered by a cell, that is the coverage area of a base station.</p>
<heading id="h0003">PRIOR ART</heading>
<p id="p0003" num="0003">In the systems of today the traffic handling is determined by means of statistical counters, which measure the traffic, expressed in Erlang, per cell. It consequently is at cell level that the present system provides information.<!-- EPO <DP n="2"> --> Information consequently is provided regarding the total traffic-handling per cell, that is, which traffic that is handled within the coverage area of a base station.</p>
<p id="p0004" num="0004">The document "<nplcit id="ncit0001" npl-type="s"><text>The use of mobile positioning supported traffic density measurements to assist load balancing methods based on adaptive cell sizing", by Steuer J. et al, The 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communication, 15-18 Sept. 2002, Volume: 1</text></nplcit>, relates to methods for balancing the spatial traffic load. After having defined the target function, the next step is the examination of the influence of one load balancing step on the introduced traffic parameters. As the initial values of λ<sub>New Cell</sub>, λ<sub>HO</sub>, tm<sub>cell</sub> and the average call duration tm<sub>call</sub> are measured, and therefore known, their change has to be estimated. For this purpose, the geographic effect of one load balancing step has to be described either analytically or determined with the coverage map of the TE-LCS module.</p>
<heading id="h0004">THE SOLUTION</heading>
<p id="p0005" num="0005">The present invention relates to a method and device at mobile telephone network. The mobile telephone network includes terminals and base stations allocated functions for collecting and processing traffic information. The terminals transmit information to the base stations. Said information is stored in a database. The information is arranged according to sub-areas within a defined larger area. By means of a filter method, the incoming information is limited to comprise only a limited selection of the received information. By means of available information, the traffic load within the sub-areas after that is calculated, which sub-areas are admitted to be parts of the coverage area of said base stations. After that, the traffic load within the sub-areas is calculated, which information is utilized to optimize in the system available<!-- EPO <DP n="3"> --> resources. The information which has been acquired regarding the traffic information is stored in a database.</p>
<p id="p0006" num="0006">At the filtering, at GSM, a filtering method is used including the steps:
<ol id="ol0001" compact="compact" ol-style="">
<li>1. Identify reported cells by means of ARFCN and BSIC.</li>
<li>2. Get/derive data about antenna gain, output power and cable loss from the position database.</li>
<li>3. Calculate the loss, L, according to <maths id="math0001" num=""><math display="block"><mi mathvariant="normal">L</mi><mo>=</mo><msub><mi>P</mi><mi mathvariant="italic">out</mi></msub><mo>+</mo><msub><mi>G</mi><mi mathvariant="italic">ant</mi></msub><mo>-</mo><mfenced separators=""><mi>RX</mi><mo>-</mo><mi>LEV</mi><mo>-</mo><mi>FULL</mi><mo>-</mo><mn>10</mn></mfenced><mo>,</mo></math><img id="ib0001" file="imgb0001.tif" wi="74" he="10" img-content="math" img-format="tif"/></maths> and</li>
</ol>
at UMTS a filtering method including the steps:
<ol id="ol0002" compact="compact" ol-style="">
<li>1. Identify reported cells by means of a scrambling code.</li>
<li>2. Get/derive data regarding antenna gain, CPICH, output power and cable loss from the position database.</li>
<li>3. Calculate the loss according to <maths id="math0002" num=""><math display="block"><mi mathvariant="normal">L</mi><mo>=</mo><msub><mfenced><msub><mi>P</mi><mi>r</mi></msub></mfenced><mi mathvariant="italic">CPICH</mi></msub><mo>-</mo><msub><mi>L</mi><mi mathvariant="italic">cable</mi></msub><mo>+</mo><msub><mi>G</mi><mi mathvariant="italic">ant</mi></msub><mo>-</mo><mi>RSCP</mi></math><img id="ib0002" file="imgb0002.tif" wi="75" he="11" img-content="math" img-format="tif"/></maths></li>
</ol></p>
<p id="p0007" num="0007">Further, the following algorithm is used:
<ul id="ul0001" list-style="none" compact="compact">
<li>to calculate the position by means of the loss values, the positions <o ostyle="rightarrow"><i>R<sub>t</sub></i></o> according to <maths id="math0003" num=""><math display="block"><mover><mi>r</mi><mo>‾</mo></mover><mo>=</mo><mfrac><mstyle displaystyle="false"><mstyle displaystyle="true"><munder><mo>∑</mo><mi mathvariant="italic">every i</mi></munder></mstyle><msub><mover><mi>R</mi><mo>‾</mo></mover><mi>i</mi></msub><msup><mn>10</mn><mrow><mo>-</mo><mfrac><msub><mi>L</mi><mrow><mi>i</mi><mo>-</mo><mi>A</mi></mrow></msub><mi>B</mi></mfrac></mrow></msup></mstyle><mstyle displaystyle="false"><mstyle displaystyle="true"><munder><mo>∑</mo><mi mathvariant="italic">every i</mi></munder></mstyle><msup><mn>10</mn><mrow><mo>-</mo><mfrac><msub><mi>L</mi><mrow><mi>i</mi><mo>-</mo><mi>A</mi></mrow></msub><mi>B</mi></mfrac></mrow></msup></mstyle></mfrac></math><img id="ib0003" file="imgb0003.tif" wi="41" he="31" img-content="math" img-format="tif"/></maths><br/>
where
<ul id="ul0002" list-style="none" compact="compact">
<li><o ostyle="rightarrow"><i>R<sub>t</sub></i></o> = (X<sub>i</sub>, Y<sub>i</sub>) that is, the vector of the base station position</li>
<li>A = a first algorithm parameter</li>
<li>B =a second algorithm parameter</li>
<li>A and B can be obtained from Hata, Cost 231-Hata, or Cost 231 Walfisch-Ikegami-models.</li>
<li>L<sub>i</sub> = path loss for base station i</li>
</ul><!-- EPO <DP n="4"> --></li>
<li>at determining the position of the mobile.</li>
</ul></p>
<p id="p0008" num="0008">The produced information is arranged in a histogram.</p>
<heading id="h0005">ADVANTAGES</heading>
<p id="p0009" num="0009">The invention provides a possibility to determine which areas within a cell that are more or less loaded. By this information, available resources can be distributed in one for the system more optimal way than with the resources of to-day. By this distribution the system consequently can be utilized in a, from a technical point of view, more optimal way which results in one from an economical point of view less costly network.</p>
<heading id="h0006">DESCRIPTION OF FIGURES</heading>
<p id="p0010" num="0010">
<ul id="ul0003" list-style="none" compact="compact">
<li><figref idref="f0001">Fig. 1</figref> shows the hierarchical structure of the invention.</li>
<li><figref idref="f0001">Fig. 2</figref> shows collecting of data for GSM which is done by means of an interface towards BC.</li>
</ul></p>
<heading id="h0007">TERMS</heading>
<p id="p0011" num="0011">
<dl id="dl0001" compact="compact">
<dt>RNC</dt><dd>Radio Network Controller UMTS</dd>
<dt>BSC</dt><dd>Base Station Controller GSM</dd>
<dt>BTS</dt><dd>Base Transmission Station</dd>
<dt>MS</dt><dd>Mobile Station (Mobile unit)</dd>
<dt>UE</dt><dd>User Equipment (Mobile Radio unit)</dd>
<dt>GSM</dt><dd>Global System for Mobile communication</dd>
<dt>UMTS</dt><dd>Universal Mobile Telecommunication System</dd>
<dt>W-CDMA</dt><dd>Wideband Code Division Multiple Access (Radio interface UMTS)</dd>
<dt>BSIC</dt><dd>Base Station Identity Code (GSM)</dd>
<dt>ARFCN</dt><dd>Absolute Radio Frequency Channel Number</dd>
</dl></p>
<heading id="h0008">PREFERRED EMBODIMENT</heading>
<p id="p0012" num="0012">In the following, the invention is described on basis of the figures and the terms in them.<!-- EPO <DP n="5"> --></p>
<p id="p0013" num="0013">The present invention relates to a method for determining the geographical load in a mobile telecommunication network. In the known mobile telecommunication networks GSM and UMTS the fact that the terminals, when a connection is established, transmit measurement reports to the base station, RNC in UMTS, respective BSC in GSM, or by positioning/position finding for each terminal with methods which are earlier known, is utilized. The obtained information is transmitted to a database where the data information is processed. The collected information after that is processed and arranged in a measurement report where the measurement values are stored with regard to existing cells in the radio system.</p>
<p id="p0014" num="0014">A mobile radio system, 1, is divided into a number of cells, 2. Each cell, 2, is served by a base station, B, at which mobile stations, M, are moving within or between the cells, 2. The mobile stations, M, determine, according to some well known method, their positions. Examples of such methods are triangulation where a number of fixed base stations are utilized. In this case the geographical positions of the base stations are known. The distance between the mobile station, M, and respective base station, B, is determined by, for instance, measuring the time the signal need to travel between base station and mobile station. The calculation of the geographical position after that is executed by a calculation unit which is centrally located, for instance in the base radio network system, alternatively in the mobile unit. Other alternatives are to use positioning systems which are utilizing satellite navigation, for instance GPS. Also other systems can be utilized; the important thing is that the information can be identified and stored in an unequivocal/distinct way.<!-- EPO <DP n="6"> --></p>
<p id="p0015" num="0015">In a mobile telecommunication system according to <figref idref="f0001">Figure 2</figref>, the mobile stations, M, transmit their positions to the base station, B. The current information after that is transmitted to the base radio center, BC. The information is arranged in matrix form where for instance each line relates to a measurement report, and the columns correspond to the individual cells. In a database, SC, information regarding power, cable losses, antenna gain, frequency and BSIC or scrambling code for respective cell are stored. In a filter function, F, after that, there is a random selection of measurement values which shall be utilized at the calculation, at which the result is stored in a database D. At the filtering, different filter functions can be utilized, which are adjusted to the current mobile radio system. Thus can, as an example, be mentioned that at GSM, the filtering function will be as follows.
<ol id="ol0003" compact="compact" ol-style="">
<li>1. Identify reported cells by means of ARFCN and BSIC.</li>
<li>2. Get/derive data about antenna gain, output power and cable loss from the position database.</li>
<li>3. Calculate the loss, L, according to <maths id="math0004" num=""><math display="block"><mi mathvariant="normal">L</mi><mo>=</mo><msub><mi>P</mi><mi mathvariant="italic">out</mi></msub><mo>+</mo><msub><mi>G</mi><mi mathvariant="italic">ant</mi></msub><mo>-</mo><mfenced separators=""><mi>RX</mi><mo>-</mo><mi>LEV</mi><mo>-</mo><mi>FULL</mi><mo>-</mo><mn>10</mn></mfenced><mo>,</mo></math><img id="ib0004" file="imgb0004.tif" wi="72" he="9" img-content="math" img-format="tif"/></maths></li>
</ol>
and for UMTS:
<ol id="ol0004" compact="compact" ol-style="">
<li>1. Identify reported cells be means of scrambling code.</li>
<li>2. Get/derive data regarding antenna gain, CPICH, output power and cable loss from the position database.</li>
<li>3. Calculate the loss according to <maths id="math0005" num=""><math display="block"><mi mathvariant="normal">L</mi><mo>=</mo><msub><mfenced><msub><mi>P</mi><mi>r</mi></msub></mfenced><mi mathvariant="italic">CPICH</mi></msub><mo>-</mo><msub><mi>L</mi><mi mathvariant="italic">cable</mi></msub><mo>+</mo><msub><mi>G</mi><mi mathvariant="italic">ant</mi></msub><mo>-</mo><mi>RSCP</mi></math><img id="ib0005" file="imgb0005.tif" wi="76" he="12" img-content="math" img-format="tif"/></maths></li>
</ol></p>
<p id="p0016" num="0016">For other systems corresponding adjustments are made at calculation of the losses. The calculated values after that are entered into the matrix of the database.</p>
<p id="p0017" num="0017">In order to find the position, the current area is divided into sub-areas. The size of the sub-areas are adjusted to the accuracy by which one wants to determine the traffic<!-- EPO <DP n="7"> --> distribution. This can, for instance, be dependent on urban environment, countryside, topography etc. Each sub-area is characterized by a position r=(x,y), in the center of the sub-area, and a number, n, which is given the start value 0. The area which is divided can be of any size, for instance a country, a town, the coverage area of a base station etc.</p>
<p id="p0018" num="0018">The traffic distribution after that is calculated according to the following method.
<ol id="ol0005" compact="compact" ol-style="">
<li>1. Take one measurement report at a time from the data base.</li>
<li>2. Calculate the position by means of the loss values, the positions <o ostyle="rightarrow"><i>R<sub>t</sub></i></o> according to <maths id="math0006" num=""><math display="block"><mover><mi>r</mi><mo>‾</mo></mover><mo>=</mo><mfrac><mstyle displaystyle="false"><mstyle displaystyle="true"><munder><mo>∑</mo><mi mathvariant="italic">every i</mi></munder></mstyle><msub><mover><mi>R</mi><mo>‾</mo></mover><mi>i</mi></msub><msup><mn>10</mn><mrow><mo>-</mo><mfrac><msub><mi>L</mi><mrow><mi>i</mi><mo>-</mo><mi>A</mi></mrow></msub><mi>B</mi></mfrac></mrow></msup></mstyle><mstyle displaystyle="false"><mstyle displaystyle="true"><munder><mo>∑</mo><mi mathvariant="italic">every i</mi></munder></mstyle><msup><mn>10</mn><mrow><mo>-</mo><mfrac><msub><mi>L</mi><mrow><mi>i</mi><mo>-</mo><mi>A</mi></mrow></msub><mi>B</mi></mfrac></mrow></msup></mstyle></mfrac></math><img id="ib0006" file="imgb0006.tif" wi="41" he="30" img-content="math" img-format="tif"/></maths><br/>
where
<ul id="ul0004" list-style="none" compact="compact">
<li><o ostyle="rightarrow"><i>R<sub>t</sub></i></o> =(X<sub>i</sub>, <sub>i</sub>) that is, the vector of the base station position</li>
<li>A = a first algorithm parameter</li>
<li>B =a second algorithm parameter</li>
<li>A and B can be obtained from Hata, Cost 231-Hata, or Cost 231 Walfisch-Ikegami-models.</li>
<li>L<sub>i</sub> = path loss for base station i.</li>
</ul></li>
<li>3. Calculate the Euclidean distance to all screen dots, r, and select the screen dot which has the smallest distance, j.</li>
<li>4. Adjust the counter, n, of this screen dot upwards by 1.</li>
<li>5. When all lines in the table have been accomplished, divide the counters of all screen dots by the number of<!-- EPO <DP n="8"> --> lines in the table.</li>
</ol></p>
<p id="p0019" num="0019">A histogram in two dimensions in this way is obtained over the traffic.</p>
<p id="p0020" num="0020">The invention is not limited to the above described example of embodiment, or to the following patent claims, but may be subject to modifications within the frame of the idea of invention.</p>
</description>
<claims id="claims01" lang="en"><!-- EPO <DP n="9"> -->
<claim id="c-en-01-0001" num="0001">
<claim-text>Method for determining the geographical load in a mobile telecommunication network, including to terminals and base stations allocated functions, that the terminals transmit information to the base stations which information is stored in a database, that the information is arranged in sub-areas within a defined larger area, that the information is limited by means of a filtering method, and that the position is determined by the traffic distribution within the part areas being calculated, at which the available resources of the system are optimized, that the information regarding the traffic information is stored in a database, <b>characterized in that</b> the filtering method includes steps to calculate path losses (L), which are stored in the database, and that the position is determined by the traffic distribution, which traffic distribution is done according to the steps:
<claim-text>- take a measurement report at a time from the database.</claim-text>
<claim-text>- calculate the position by means of the loss values, <maths id="math0007" num=""><math display="block"><mover><mi>r</mi><mo>‾</mo></mover><mo>=</mo><mfrac><mstyle displaystyle="false"><mstyle displaystyle="true"><munder><mo>∑</mo><mi mathvariant="italic">every i</mi></munder></mstyle><msub><mover><mi>R</mi><mo>‾</mo></mover><mi>i</mi></msub><msup><mn>10</mn><mrow><mo>-</mo><mfrac><msub><mi>L</mi><mrow><mi>i</mi><mo>-</mo><mi>A</mi></mrow></msub><mi>B</mi></mfrac></mrow></msup></mstyle><mstyle displaystyle="false"><mstyle displaystyle="true"><munder><mo>∑</mo><mi mathvariant="italic">every i</mi></munder></mstyle><msup><mn>10</mn><mrow><mo>-</mo><mfrac><msub><mi>L</mi><mrow><mi>i</mi><mo>-</mo><mi>A</mi></mrow></msub><mi>B</mi></mfrac></mrow></msup></mstyle></mfrac></math><img id="ib0007" file="imgb0007.tif" wi="118" he="28" img-content="math" img-format="tif"/></maths>
<claim-text>where A is a first algorithm parameter, B is a second algorithm parameter, wherein A and B can be obtained from Hata, Cost 231-Hata, or Cost 231 Walfish-Ikegami-models, L<sub>i</sub> is path loss for base station I,</claim-text></claim-text>
<claim-text>- calculate the Euclidian distance to all screen dots, r, and select the screen dot which has the smallest distance, j,</claim-text>
<claim-text>- adjust the counter, n, of this screen dot upwards by 1.</claim-text>
<claim-text>- when all lines in the table have been accomplished;<br/>
<!-- EPO <DP n="10"> -->divide the counters of all screen dots by the number of lines in the table.</claim-text></claim-text></claim>
<claim id="c-en-01-0002" num="0002">
<claim-text>Method as claimed in patent claim 1,<br/>
<b>characterized in that</b> the filtering method for GSM includes the steps:
<claim-text>- identify reported cells by means of ARFCN and BSIC,</claim-text>
<claim-text>- get/derive data about antenna gain, output power and cable loss from the position database,</claim-text>
<claim-text>- calculate the path loss according to <maths id="math0008" num=""><math display="block"><mi mathvariant="normal">L</mi><mo>=</mo><msub><mi>P</mi><mi mathvariant="italic">out</mi></msub><mo>+</mo><msub><mi>G</mi><mi mathvariant="italic">ant</mi></msub><mo>-</mo><mfenced separators=""><mi>RX</mi><mo>-</mo><mi>LEV</mi><mo>-</mo><mi>FULL</mi><mo>-</mo><mn>10</mn></mfenced><mn>.</mn></math><img id="ib0008" file="imgb0008.tif" wi="90" he="14" img-content="math" img-format="tif"/></maths></claim-text></claim-text></claim>
<claim id="c-en-01-0003" num="0003">
<claim-text>Method as claimed in patent claim 1,<br/>
<b>characterized in that</b> the filtering method for UMTS includes the steps:
<claim-text>- identify reported cells by means of scrambling code,</claim-text>
<claim-text>- get/derive data regarding antenna gain, CPICH, output power and cable loss from the position database,</claim-text>
<claim-text>- calculate the path loss according to <maths id="math0009" num=""><math display="block"><mi mathvariant="normal">L</mi><mo>=</mo><msub><mfenced><msub><mi>P</mi><mi>r</mi></msub></mfenced><mi mathvariant="italic">CPICH</mi></msub><mo>-</mo><msub><mi>L</mi><mi mathvariant="italic">cable</mi></msub><mo>+</mo><msub><mi>G</mi><mi mathvariant="italic">ant</mi></msub><mo>-</mo><mi>RSCP</mi><mn>.</mn></math><img id="ib0009" file="imgb0009.tif" wi="89" he="15" img-content="math" img-format="tif"/></maths></claim-text></claim-text></claim>
<claim id="c-en-01-0004" num="0004">
<claim-text>Method as claimed in any of the previous patent claims, <b>characterized in that</b> a histogram over the traffic is created.</claim-text></claim>
<claim id="c-en-01-0005" num="0005">
<claim-text>Device for determining the geographical load in a mobile telecommunications network comprising means for performing the method steps defined in any one of Claims 1-4.</claim-text></claim>
</claims>
<claims id="claims02" lang="de"><!-- EPO <DP n="11"> -->
<claim id="c-de-01-0001" num="0001">
<claim-text>Verfahren zum Bestimmen der geographischen Last in einem Mobiltelekommunikationsnetz, das Funktionen enthält, die Endgeräten und Basisstationen zugewiesen sind, so dass die Endgeräte Informationen zu den Basisstationen senden, wobei die Informationen in einer Datenbank gespeichert sind, dass die Informationen innerhalb eines definierten größeren Bereichs in Teilbereichen angeordnet sind, dass die Informationen mit Hilfe eines Filterverfahrens einschränkt werden und dass die Position durch die Verkehrsverteilung innerhalb der Teilbereiche, die berechnet werden, an denen die verfügbaren Betriebsmittel des Systems optimiert sind, bestimmt wird, dass die Informationen, die die Verkehrsinformationen betreffen, in einer Datenbank gespeichert sind, <b>dadurch gekennzeichnet, dass</b> das Filterverfahren Schritte umfasst, Pfadverluste (L) zu berechnen, die in der Datenbank gespeichert sind, und dass die Position durch die Verkehrsverteilung bestimmt wird, welche Verkehrsverteilung gemäß den folgenden Schritten ausgeführt wird:
<claim-text>- Verwenden eines Messberichts zu einer Zeit aus der Datenbank,</claim-text>
<claim-text>- Berechnen der Position mit Hilfe der Verlustwerte der Positionen R gemäß <maths id="math0010" num=""><math display="block"><mover><mi>r</mi><mo>‾</mo></mover><mo>=</mo><mfrac><mstyle displaystyle="false"><mstyle displaystyle="true"><munder><mo>∑</mo><mi mathvariant="italic">jeder i</mi></munder></mstyle><msub><mover><mi>R</mi><mo>‾</mo></mover><mi>i</mi></msub><msup><mn>10</mn><mrow><mo>-</mo><mfrac><mrow><msub><mi>L</mi><mi>i</mi></msub><mo>-</mo><mi>A</mi></mrow><mi>B</mi></mfrac></mrow></msup></mstyle><mstyle displaystyle="false"><mstyle displaystyle="true"><munder><mo>∑</mo><mi mathvariant="italic">jeder i</mi></munder></mstyle><msup><mn>10</mn><mrow><mo>-</mo><mfrac><mrow><msub><mi>L</mi><mi>i</mi></msub><mo>-</mo><mi>A</mi></mrow><mi>B</mi></mfrac></mrow></msup></mstyle></mfrac></math><img id="ib0010" file="imgb0010.tif" wi="43" he="31" img-content="math" img-format="tif"/></maths>
<claim-text>wobei A ein erster Parameter des Algorithmus ist, B ein zweiter Parameter des Algorithmus ist, wobei A und B aus Hata-, Cost-231-Hata-, oder Cost-231-Walfish-Ikegami-Modellen erhalten werden können, und L<sub>i</sub> ein Pfadverlust für die Basisstation I ist,</claim-text></claim-text>
<claim-text>- Berechnen des Euklidischen Abstands zu allen Rasterpunkten, r, und Auswählen des Rasterpunkts, der den kleinsten Abstand, j, aufweist.</claim-text>
<claim-text>- Anpassen des Zählers, n, des Rasterpunkts um 1 nach oben,</claim-text>
<claim-text>- wenn alle Zeilen in der Tabelle fertiggestellt worden sind;<br/>
Teilen der Zähler aller Rasterpunkte durch die Anzahl der Zeilen in der Tabelle.</claim-text></claim-text></claim>
<claim id="c-de-01-0002" num="0002">
<claim-text>Verfahren nach Anspruch 1,<br/>
<!-- EPO <DP n="12"> --><b>dadurch gekennzeichnet, dass</b> das Filterverfahren für GSM die folgenden Schritte enthält:
<claim-text>- Identifizieren berichteter Zellen mit Hilfe von ARFCN und BSIC,</claim-text>
<claim-text>- Erhalten/Ableiten von Daten über Antennengewinn, Ausgangsleistung und Kabelverlust aus der Positionsdatenbank,</claim-text>
<claim-text>- Berechnen des Pfadverlusts gemäß <maths id="math0011" num=""><math display="block"><mi mathvariant="normal">L</mi><mo>=</mo><msub><mi>P</mi><mi mathvariant="italic">aus</mi></msub><mo>+</mo><msub><mi>G</mi><mi mathvariant="italic">ant</mi></msub><mo>-</mo><mfenced separators=""><mi>RX</mi><mo>-</mo><mi>LEV</mi><mo>-</mo><mi>FULL</mi><mo>-</mo><mn>10</mn></mfenced><mn>.</mn></math><img id="ib0011" file="imgb0011.tif" wi="74" he="13" img-content="math" img-format="tif"/></maths></claim-text></claim-text></claim>
<claim id="c-de-01-0003" num="0003">
<claim-text>Verfahren nach Anspruch 1,<br/>
<b>dadurch gekennzeichnet, dass</b> das Filterverfahren für UMTS die folgenden Schritte enthält:
<claim-text>- Identifizieren berichteter Zellen mit Hilfe von Verwürfelungscode,</claim-text>
<claim-text>- Erhalten/Ableiten von Daten, die Antennengewinn, CPICH, Ausgangsleistung und Kabelverlust betreffen, aus der Positionsdatenbank,</claim-text>
<claim-text>- Berechnen des Pfadverlusts gemäß <maths id="math0012" num=""><math display="block"><mi mathvariant="normal">L</mi><mo>=</mo><msub><mfenced><msub><mi>P</mi><mi>r</mi></msub></mfenced><mi mathvariant="italic">CPICH</mi></msub><mo>-</mo><msub><mi>L</mi><mi mathvariant="italic">kable</mi></msub><mo>+</mo><msub><mi>G</mi><mi mathvariant="italic">ant</mi></msub><mo>-</mo><mi>RSCP</mi></math><img id="ib0012" file="imgb0012.tif" wi="72" he="11" img-content="math" img-format="tif"/></maths></claim-text></claim-text></claim>
<claim id="c-de-01-0004" num="0004">
<claim-text>Verfahren nach einem der vorhergehenden Ansprüche, <b>dadurch gekennzeichnet, dass</b> ein Histogramm über den Verkehr erzeugt wird.</claim-text></claim>
<claim id="c-de-01-0005" num="0005">
<claim-text>Vorrichtung zum Bestimmen der geographischen Last in einem Mobiltelekommunikationsnetz, die Mittel zum Ausführen der Verfahrensschritte, die in einem der Ansprüche 1-4 definiert sind, umfasst.</claim-text></claim>
</claims>
<claims id="claims03" lang="fr"><!-- EPO <DP n="13"> -->
<claim id="c-fr-01-0001" num="0001">
<claim-text>Procédé de détermination de la charge géographique dans un réseau de télécommunications mobiles, comprenant des fonctions attribuées à des terminaux et stations de base, les terminaux transmettant des informations aux stations de base, lesquelles informations étant stockées dans une base de données, les informations étant agencées dans des sous-zones d'une zone définie plus étendue, les informations étant limitées par un procédé de filtrage, et la position étant déterminée par la distribution de trafic dans les zones partielles calculées, auxquelles les ressources disponibles du système sont optimisées, les informations concernant les informations de trafic étant stockées dans une base de données, <b>caractérisé en ce que</b> le procédé de filtrage comporte des étapes pour calculer des pertes de chemin (L), lesquelles sont stockées dans la base de données, et la position étant déterminée par la distribution de trafic, laquelle distribution de trafic étant effectuée en fonction des étapes consistant à :
<claim-text>- effectuer un rapport de mesure à un certain temps à partir de la base de données ;</claim-text>
<claim-text>- calculer la position au moyen des valeurs de perte, les positions R en fonction<br/>
de <maths id="math0013" num=""><math display="block"><mover><mi>r</mi><mo>‾</mo></mover><mo>=</mo><mfrac><mstyle displaystyle="false"><mstyle displaystyle="true"><munder><mo>∑</mo><mi mathvariant="italic">chaque i</mi></munder></mstyle><msub><mover><mi>R</mi><mo>‾</mo></mover><mi>i</mi></msub><msup><mn>10</mn><mrow><mo>-</mo><mfrac><mrow><msub><mi>L</mi><mi>i</mi></msub><mo>-</mo><mi>A</mi></mrow><mi>B</mi></mfrac></mrow></msup></mstyle><mstyle displaystyle="false"><mstyle displaystyle="true"><munder><mo>∑</mo><mi mathvariant="italic">chaque i</mi></munder></mstyle><msup><mn>10</mn><mrow><mo>-</mo><mfrac><mrow><msub><mi>L</mi><mi>i</mi></msub><mo>-</mo><mi>A</mi></mrow><mi>B</mi></mfrac></mrow></msup></mstyle></mfrac></math><img id="ib0013" file="imgb0013.tif" wi="45" he="29" img-content="math" img-format="tif"/></maths>
<claim-text>où A est un premier paramètre d'algorithme, B est un second paramètre d'algorithme, où A et B peuvent être obtenus à partir de modèles Hata, Cost 231-Hata ou Cost 231 Walfish-Ikegami, <i>L<sub>i</sub></i> est la perte de trajet de la station de base I,</claim-text></claim-text>
<claim-text>- calculer la distance euclidienne jusqu'à tous les points d'écran, r, et sélectionner le point d'écran qui a la plus petite distance, j,</claim-text>
<claim-text>- augmenter le compteur, n, de ce point d'écran de 1,</claim-text>
<claim-text>- quand toutes les lignes dans la table ont été traitées ;<br/>
diviser les compteurs de tous les points d'écran par le nombre de lignes dans la table.</claim-text></claim-text></claim>
<claim id="c-fr-01-0002" num="0002">
<claim-text>Procédé selon la revendication 1, <b>caractérisé en ce que</b> le procédé de filtrage pour GSM comporte les étapes consistant à :<!-- EPO <DP n="14"> -->
<claim-text>- identifier les cellules signalées au moyen de ARFCN et BSIC ;</claim-text>
<claim-text>- obtenir/dériver des données de gain d'antenne, puissance de sortie et perte de câble depuis la base de données de positions ;</claim-text>
<claim-text>- calculer la perte de chemin en fonction de <maths id="math0014" num=""><math display="block"><mi mathvariant="normal">L</mi><mo>=</mo><msub><mi>P</mi><mi mathvariant="italic">sortie</mi></msub><mo>+</mo><msub><mi>G</mi><mi mathvariant="italic">ant</mi></msub><mo>-</mo><mfenced separators=""><mi>RX</mi><mo>-</mo><mi>LEV</mi><mo>-</mo><mi>FULL</mi><mo>-</mo><mn>10</mn></mfenced><mn>.</mn></math><img id="ib0014" file="imgb0014.tif" wi="83" he="10" img-content="math" img-format="tif"/></maths></claim-text></claim-text></claim>
<claim id="c-fr-01-0003" num="0003">
<claim-text>Procédé selon la revendication 1, <b>caractérisé en ce que</b> le procédé de filtrage pour UMTS comporte les étapes consistant à :
<claim-text>- identifier les cellules signalées au moyen d'un code de brouillage,</claim-text>
<claim-text>- obtenir/dériver des données de gain d'antenne, CPICH, puissance de sortie et perte de câble depuis la base de données de positions ;</claim-text>
<claim-text>- calculer la perte de chemin en fonction de <maths id="math0015" num=""><math display="block"><mi mathvariant="normal">L</mi><mo>=</mo><msub><mfenced><msub><mi>P</mi><mi>r</mi></msub></mfenced><mi mathvariant="italic">CPICH</mi></msub><mo>-</mo><msub><mi>L</mi><mi mathvariant="italic">câble</mi></msub><mo>+</mo><msub><mi>G</mi><mi mathvariant="italic">ant</mi></msub><mo>-</mo><mi>RSCP</mi><mn>.</mn></math><img id="ib0015" file="imgb0015.tif" wi="76" he="10" img-content="math" img-format="tif"/></maths></claim-text></claim-text></claim>
<claim id="c-fr-01-0004" num="0004">
<claim-text>Procédé selon l'une quelconque des revendications précédentes, <b>caractérisé en ce qu'</b>un histogramme de trafic est créé.</claim-text></claim>
<claim id="c-fr-01-0005" num="0005">
<claim-text>Dispositif de détermination de la charge géographique dans un réseau de télécommunications mobiles comprenant des moyens pour exécuter les étapes de procédé définies dans l'une quelconque des revendications 1 à 4.</claim-text></claim>
</claims>
<drawings id="draw" lang="en"><!-- EPO <DP n="15"> -->
<figure id="f0001" num="1,2"><img id="if0001" file="imgf0001.tif" wi="163" he="229" img-content="drawing" img-format="tif"/></figure>
</drawings>
<ep-reference-list id="ref-list">
<heading id="ref-h0001"><b>REFERENCES CITED IN THE DESCRIPTION</b></heading>
<p id="ref-p0001" num=""><i>This list of references cited by the applicant is for the reader's convenience only. It does not form part of the European patent document. Even though great care has been taken in compiling the references, errors or omissions cannot be excluded and the EPO disclaims all liability in this regard.</i></p>
<heading id="ref-h0002"><b>Non-patent literature cited in the description</b></heading>
<p id="ref-p0002" num="">
<ul id="ref-ul0001" list-style="bullet">
<li><nplcit id="ref-ncit0001" npl-type="s"><article><author><name>STEUER J. et al.</name></author><atl>The use of mobile positioning supported traffic density measurements to assist load balancing methods based on adaptive cell sizing</atl><serial><sertitle>13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communication</sertitle><pubdate><sdate>20020915</sdate><edate/></pubdate><vid>1</vid></serial></article></nplcit><crossref idref="ncit0001">[0004]</crossref></li>
</ul></p>
</ep-reference-list>
</ep-patent-document>
