Abstract:
A location-based service is handled for a limited geographic area for a plurality of subscribers in this geographic area. The area is served by more than one device for determining the geographic position of mobile radio users. The location-based service sends an inquiry about the identity of subscribers in the geographic area to a central network element, whereupon the central network element, instead of the location-based service, requests the current information about the subscribers active in the limited geographic area from the at least two devices for determining the geographic position of mobile radio users. The central network element then delivers the result back to the location-based service.

Description:
BACKGROUND OF THE INVENTION  
       Field of the Invention  
         [0001]    The invention relates to a method for location-based services. The invention also relates to a device for carrying out the method according to the invention. The invention finds its most advantageous application in wireless radio systems.  
           [0002]    Current services are closely tied to particular networks; subscribers use codes which specify these networks. Most of these networks allow roaming in other access networks and subscribers have the option of using more than one network, for example by means of a multimode terminal or also via different terminals. On the other hand, various application servers offer interesting services. These should be independent of the basic network and the changing network provider. The trend is toward international service providers who do not want to be impaired by local circumstances. It would be advantageous, therefore, to be able to provide a server which can hide these differences.  
           [0003]    Location-based services currently being offered allow a subscriber to be located. Services which want to deal with more than one subscriber, for example, different “identities” of a person, or unknown identities in a particular area independently of the network used need a current database with a multiplicity of information items about the networks and the regions covered by the networks.  
           [0004]    Current 3GPP (3rd Generation Partnership Project, www.3gpp.org) protocols are oriented towards location-based services that handle few subscribers. Services which should cover all registered subscribers, for example, statistical analyses with a detailed local accuracy or services limited to particular, relatively small regions, produce a large amount of signaling messages and thus trigger many locating processes. Furthermore, the implementation is not set up for a higher density of interrogation with respect to privacy concerns and the protection of the privacy sphere.  
           [0005]    Examples of services affected by this are:  
           [0006]    emergency information for a district: for example closing a park, fire alarm, warning against hazards  
           [0007]    advertisements for a region: opening of a new business, beginning of an event in a few minutes . . .  
           [0008]    triggering of a service when the user enters a particular area: e.g. offering special information, changing to a better (or more advantageous) connection such as WLAN, Bluetooth, etc.  
           [0009]    triggering of a service when the user remains at the same place for a particular period: e.g. queuing at a check-out or in front of an entrance, looking at an advertisement (poster), waiting at a stop . . .  
           [0010]    the user can be informed when he approaches a particular place, for example a restaurant or a hotel  
           [0011]    the user is informed when he approaches a particular other user or a device: friend, colleague, team-mate, parking ticket dispenser . . .  
           [0012]    the user is informed when a person or device is leaving a region: theft protection, child leaving party, etc.  
           [0013]    location-dependent charging: in particular, the subscriber must be informed that the charging changes when he leaves or enters a region  
           [0014]    statistical analyses such as determination of the number of devices in a region, for example, for detecting a traffic jam, responding to the increased demand for public transport after the end of a mass event such as a concert, a sports event, etc.  
           [0015]    To date, location-dependent services are still in the introductory phase and are therefore not used particularly frequently. Many of the services specified above have not yet been implemented or can only be implemented with poor resolution on the basis of information currently available in a network such as the cellID (identification of a cell of a cellular network) or LAC (location area code—a larger location area formed of cells). In the near future, only network-specific services will be offered and an open interface is currently not provided. OMA/LIF (Open Mobile Alliance, Location Interoperability Forum, www.openmobilealliance.org) and 3GPP are only beginning to define the extensions for location-dependent triggering.  
           [0016]    Furthermore, the demand for internetwork services does not yet exist to a great extent since there are currently only a few subscribers who use different access networks side-by-side. However, it is already apparent that, for example, an alternative utilization of GPRS (General Packet Radio Services) and WLAN (Wireless Local Area Network) is becoming more and more popular.  
           [0017]    Hitherto conceivable solutions would be:  
           [0018]    cyclic polling of the terminals. However, since this can involve a large number of devices, a high data flow is generated  
           [0019]    involving all subscribers such as broadcast SMS. No special selection of subscribers for one service possible (e.g. only foreign subscribers).  
         SUMMARY OF THE INVENTION  
         [0020]    It is accordingly an object of the invention to provide a method and a device for supporting location-based services which overcome the above-mentioned disadvantages of the heretofore-known devices and methods of this general type and which specify a solution for an improved offering of location-dependent services.  
           [0021]    With the foregoing and other objects in view there is provided, in accordance with the invention, a method for handling a location-based service in a limited geographic area for a plurality of subscribers, wherein the limited geographic area is served by at least two devices for determining a geographic position of mobile radio users, the method which comprises:  
           [0022]    receiving, in a central network element, an inquiry from the location-based service concerning an identity of the subscribers in the limited geographic area;  
           [0023]    requesting, with the central network element, a current information item about the subscribers active in the limited geographic area from the at least two devices for determining the geographic position of mobile radio users; and  
           [0024]    delivering, with the central network element, the information to the location-based service.  
           [0025]    In other words, the invention relates to a method for handling a location-based service for a limited geographic area (also referred to as “area” in the text which follows) which is served by at least two devices for determining the geographic position of mobile radio users (GMLC) for a plurality of subscribers in this geographic area.  
           [0026]    The location-based service (LCS) sends an inquiry about the identity of subscribers in a geographic area (area) to a central network element (LAS 1 ). The central network element then obtains the current information about the subscribers active in the limited geographic area from the at least two devices for determining the geographic position of mobile radio users (GMLC). The central network element then delivers the result back to the location-based service (LCS).  
           [0027]    In the solution according to the invention, the freely selectable region is not restricted to one network operator. The external location services (LCS) client no longer needs to distribute the inquiry to all network operators offering their services in this area, this is done for it by the central network element. As long as 3GPP networks are involved, this is a relatively small problem since there is only a small number of these and they are generally known. In the case of the WLAN networks, however, the situation is different since this is a rapidly changing business.  
           [0028]    An additional network node is then introduced which contains all network operators and their local radius of operation. The central network element which deals with the interaction of the network operators provides third-party service providers with the opportunity to offer their own small applications inexpensively and rapidly. End users, network operators and application developers will profit from such an approach.  
           [0029]    The distribution, carried out by the central network element, of functionalities to many connected network nodes which are controlled by different operators supports third-party service providers in offering their services also in areas which are made difficult by technological, administrative or legal boundaries.  
           [0030]    These central network elements also solve dynamic problems by reducing the network load and using caches.  
           [0031]    In accordance with an added feature of the invention, a first device for determining the geographic position of mobile radio users is located within an infrastructure of a first mobile radio network and a second device for determining the geographic position of mobile radio users is located within an infrastructure of a second mobile radio network.  
           [0032]    In accordance with an additional feature of the invention, upon receiving an inquiry in the central network element, a check is carried out whether a desired result is already stored as a result of a previous inquiry and the result can be delivered to the location-based service, or the central network element must request the desired result from the at least one device for determining the geographic position of mobile radio users. The process may further provide a result requested by the central network element from a device for determining the geographic position of mobile radio users with an additional identification (e.g., a timestamp and/or information on an accuracy of the inquiry), and reuse the stored result for one or more further inquiries in dependence on the additional identification.  
           [0033]    In accordance with another feature of the invention, the method comprises, upon receiving an inquiry in the central network element, first checking whether a desired inquiry has already been processed or a result of a previous inquiry is still outstanding, and, after receiving the result of the previous inquiry, a current inquiry can also be answered.  
           [0034]    In accordance with a further feature of the invention, the central network element collects the results of the inquiries from the at least two devices for determining the geographic position of mobile radio users and, as soon as all interrogated devices for determining the geographic position of mobile radio users have answered, combines the answers and to deliver the result to the location-based service.  
           [0035]    In accordance with again an added feature of the invention, the region of the inquiry comprises a first geographic region (location area  1 ) for which a first central network element is responsible, and comprises a second geographic region (location area  2 ) for which a second central network element is responsible. Furthermore, the first central network element receives an inquiry and forwards this inquiry for the second geographic region to the second central network element.  
           [0036]    In accordance with again an additional feature of the invention, the central network element stores the results of the inquiries as a list and only delivers the identification of the list back to the location-based service. Preferably, the central network element is additionally supplied with or determines by other means characteristics of the subscribers determined from the devices for determining the geographic position of mobile radio users, collects these and stores them for later use, and delivers them back to the location-based service together with the identification of the list.  
           [0037]    In accordance with again a further feature of the invention, the central network element contains a correlation between the identity of at least one subscriber for whom a location information is requested and the network node responsible for this subscriber and, if the central network element receives an inquiry message from the location-based service, it distributes this inquiry to each identity which is stored for this network node.  
           [0038]    With the above and other objects in view there is also provided, in accordance with the invention, a device for handling inquiries of a location-based service, for a limited geographic area (area) which is served by at least two devices for determining the geographic position of mobile radio users, for a plurality of subscribers in this geographic area. The novel device includes:  
           [0039]    means for receiving inquiries, sent by the location-based service, about the identity of subscribers in this geographic area; and  
           [0040]    means for sending a request for current information about the subscribers active in the limited geographic area to a device for determining the geographic position of mobile radio users; and  
           [0041]    means for receiving the answers from the interrogated device for determining the geographic position of mobile radio users; and  
           [0042]    means for processing the answers; and  
           [0043]    means for sending the result to the location-based service.  
           [0044]    In accordance with yet an added feature of the invention, the device has a database for storing the answers from the interrogated device for determining the geographic position of mobile radio users and an additional identification of the answers, and means for comparing a new inquiry with the answers already stored.  
           [0045]    In accordance with a concomitant feature of the invention, the database stores the answers from the interrogated device for determining the geographic position of mobile radio users and sends an unambiguous identification (unique identifier) of the answers, and the unambiguous identification of the answers is used in subsequent messages from the location-based service.  
           [0046]    Other features which are considered as characteristic for the invention are set forth in the appended claims.  
           [0047]    Although the invention is illustrated and described herein as embodied in a method and a device for handling location-based services, it is nevertheless not intended to be limited to the details shown, since various modifications and structural changes may be made therein without departing from the spirit of the invention and within the scope and range of equivalents of the claims.  
           [0048]    The construction and method of operation of the invention, however, together with additional objects and advantages thereof will be best understood from the following description of specific embodiments when read in connection with the accompanying drawings. 
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0049]    [0049]FIG. 1 is a block diagram of an existing 3GPP network architecture supplemented in accordance with the invention;  
         [0050]    [0050]FIG. 2 is an architecture diagram with the local area server LAS;  
         [0051]    [0051]FIG. 3 is an area diagram showing various geographic areas which are supplied by an LAS;  
         [0052]    [0052]FIG. 4 is a tree structure showing a geographic area covered by a local area server LAS;  
         [0053]    [0053]FIG. 5 is an area diagram showing an example of various independent requirements; and  
         [0054]    [0054]FIG. 6 is a data exchange flowchart. 
     
    
     DESCRIPTION OF THE PREFERRED EMBODIMENTS  
       [0055]    Referring now to the figures of the drawing in detail and first, particularly, to FIG. 1 thereof, there is illustrated a block diagram showing a basic structure of the architecture of the system.  
         [0056]    A. Architecture and Overview  
         [0057]    [0057]FIG. 1 shows the current 3GPP network architecture as depicted in chapter 5.2.2 of the specification 3GPP TS 23.002 (V5.9.0, 2002-12): Network Architecture. A more detailed description of the network elements and interfaces (Lh, Le, Lc, Lg, Iu, Iur, Iub, Uu, etc.) can also be found there; for that purpose, the specification is herewith incorporated by reference.  
         [0058]    In the home location register HLR, entries with respect to subscriber information are assigned to the mobile radio subscriber.  
         [0059]    The visitor location register VLR is the local register for switching-based services. It is used by the mobile switching center MSC for obtaining information about roaming subscribers, that is to say those from local and other mobile radio operators, staying in the region and for processing their calls.  
         [0060]    In contrast, the serving GPRS support node SGSN, is needed for storing subscriber information for packet-oriented services in a mobile radio network.  
         [0061]    The mobile-services switching center MSC also represents the interface between the mobile radio network and the landline network. The switching center performs all necessary functions for processing circuit-switched services to and from the mobile station.  
         [0062]    The gateway mobile location center GMLC is the first network node accessed via a location-based service in a mobile radio network. It performs the authorization and interrogates the home location register HLR for the routing information.  
         [0063]    In the text which follows, GMLC also stands for other network nodes such as WLAN access points (also called hotspots), landline network, etc., which form the access for location-based services.  
         [0064]    A node B is a logical network component which serves one or more cells. A radio network controller RNC is a network component in the mobile radio network which controls one or more nodes B.  
         [0065]    The location measurement unit LMU performs radio measurements in support of locating methods. Two types of LMU are defined, namely:  
         [0066]    type A: access via the normal GSM interface (U m ), there is no wire connection to another network element.  
         [0067]    type B: access via the base station—controller interface (I UB ). The LMU can be a stand-alone network element with a pseudo-cell ID or can be integrated in a node B.  
         [0068]    The serving radio network controller SRNC coordinates the location inquiries as a function of priority and selects a suitable locating method. It can have an interface to the controlling radio network controller CRNC which mainly has aids for locating the terminal and interrogates a corresponding measurement from the network nodes B and LMU.  
         [0069]    A description of locating methods may be found, by way of example, in the article “Convex Position Estimation in Wireless Sensor Networks” by Lance Doherty, Kristofer S. J. Pister, Laufent El Ghaoui, Infocom 2001, Anchorage, Ak., April 2001 (http://wwwbsac.eecs.berkeley.edu/-ldoherty/infocom.pdf).  
         [0070]    The GSM service control function, gsmSCF, is a functional unit which contains the CAMEL service logic for implementing operator-specific services.  
         [0071]    The cell broadcast center CBC is responsible for managing CBS (cell broadcast service) messages and conveying CBS messages to the RNS (Radio Network System).  
         [0072]    Only the right-hand part of FIG. 1 is relevant for the present case. An external LCS client interrogates the network for location information via an L e  interface (3GPP uses the mobile location protocol MLP (LIF/OMA, TS 101 specification: MLP Mobile Location Protocol). The position can be interrogated with defined accuracy for one or more IDs. However, the protocol can only handle a network which was selected by the external LCS client with the aid of the subscriber ID. In future, this protocol should also be applicable to international cases.  
         [0073]    A new network element, the location area server LAS, and a new protocol, the location area protocol LAP for handling areas, are being introduced. The location area server is located between or next to the external LCS client and the various networks.  
         [0074]    [0074]FIG. 2 shows the new network element location area server LAS and its position in the network. The various mobile radio or WLAN operators can cooperate and use the network element LAS for relieving their own network elements and to integrate various technologies. On the other hand, the LAS can join competing networks and allow external applications to gain access to these networks. The LAS has a database which stores the actual network coverage. Each LAS is responsible for a certain region. The region served by an LAS can be a country, a continent or also a relatively small unit. Furthermore, there is an interLAS protocol between two LASs and a mechanism for selecting the correct LAS. The inquiries received by an external LCS client are not limited to the region covered by a single LAS. Communication with the external LCS client takes place via the location area protocol LAP. This can also be used for communicating with the network nodes GLMC or WLAN hotspot. Existing standard protocols are also possible but the losses in functionality must be accepted.  
         [0075]    Step 0  
         [0076]    The prerequisite is the configuration of the LAS. Each LAS contains a table containing addresses of network nodes and of location areas served by the LAS. These entries can be entered statically, for example by an operator, or generated dynamically by a protocol similar to that described in step 1.  
         [0077]    Step 1  
         [0078]    The location area data in the LAS must be dynamically updated. As soon as a new network node offers its services or the topology changes, this network node informs the next LAS about the new area served. For this purpose, it sends a message  
         [0079]    LAP:UPDATE_LOCATION_AREA  
         [0080]    to the LAS with added or removed regions, specified, e.g. by a list of coordinates as described, for example, in the MLP protocol. The network node identifier, the address of the network node and the area served are stored there. If the entire area or a part of it is also served by one or more additional LASs, the message is also forwarded to these LASs. The addresses of these additional LASs, together with the network node identifier, are stored for further actions.  
         [0081]    As soon as the LAS receives a timeout during the transmission of messages to network units, it marks the network as “unavailable” in order to keep its database updated. The LAS forwards this information to all additional LASs affected by the failure of this network unit.  
         [0082]    To avoid unnecessary messages, each network node should inform the LAS about whether it is available. For this purpose, a message  
         [0083]    LAP:OPERATIONAL_AGAIN  
         [0084]    is sent to the LAS after a failure.  
         [0085]    This mechanism also solves the problem of redundant network elements. If network  1  uses two GMLCs for serving the same area, the two can inform the LAS about the area. The LAS will continue the operation by duplicating all inquiries until one of the GMLCs no longer answers. As soon as the GMLC is operational again, it reports to the LAS and receives copies of the messages again.  
         [0086]    Step 2  
         [0087]    When the LAS receives the message  
         [0088]    LAP:AREA_REQUEST  
         [0089]    from an external LCS client, which contains a definition of an area, the LAS checks the area and its responsibility. For the parts of the area administered by other LASs it forwards the inquiries to these LASs. For the part of the area administered by itself, it begins to determine all involved network nodes and their relevant areas.  
         [0090]    [0090]FIG. 3 shows an example of the area served by an LAS. Three network nodes, namely network node [ 1 ,  2 ,  3 ], have announced the areas served by them (represented, for simplicity, as rectangles). The desired area (an ellipse) is then scanned and split into three areas, namely area [ 1 ,  2 ,  3 ]. New subareas are formed: subarea  1  consisting of area 1  and area 2  is used for the network node  1  and subarea  2  consisting of area 2  and area 3  is used for the network node  2 . The network node  3  is not affected by this inquiry.  
         [0091]    Step 3  
         [0092]    The inquiry received is now forwarded to all selected network nodes, containing only the required subareas. The answers received are routed to the triggering external LCS client, either collected by all network nodes or individually as soon as they arrive depending on the specification in the original inquiry. If a network node does not answer, it is placed in the list of unavailable network nodes (see step 1).  
         [0093]    B. Identification  
         [0094]    All known protocols inquiring location information such as the MLP (LIF/OMA) need the identity of the subscriber for whom the location information is interrogated. The identity information is available in a variety of formats depending on the technologies used. For example, an Internet address (IP V.4 or IP V.6) looks different from an E.164 number. External LCS clients should not be confronted by these different formats and the LAS advantageously handles the resolution.  
         [0095]    For interrogated areas, the external LCS client normally does not know the identities of the subscribers. Naturally, it would be best if the network were to solve this problem and provide a protocol which also allows a location interrogation in the case of unknown identity. However, this would also raise a number of concerns with regard to protection of the private sphere if all external LCS clients were allowed to trace the subscribers of a network. In addition, it would lead to large messages with long lists of subscribers. Even if no return of identities were demanded in the inquiry, the answer would have to contain a list of all subscribers with some identification and location and also a list of the subscribers for whom the inquiry was not successful, either because the wanted subscriber is absent or his data protection rules did not allow an inquiry by this external LCS client.  
         [0096]    This problem could be solved by a network node operated in a confidential environment, either due to legal authorization or by the network operator himself.  
         [0097]    The LAS contains a database which contains the correlation between identities and the responsible network nodes.  
         [0098]    Step 1  
         [0099]    The network nodes update the database in the LAS at intervals with all identities currently served by them, with the aid of  
         [0100]    LAP: UPDATE_IDENTITIES.  
         [0101]    Step 2  
         [0102]    When the LAS receives an inquiry message from the external LCS client  
         [0103]    LAP: AREA_REQUESTS  
         [0104]    it distributes this inquiry to each identity stored in its database for these network nodes.  
         [0105]    Step 3  
         [0106]    All successful answers  
         [0107]    LAP: AREA_REQUEST_RESP  
         [0108]    from subscribers located in this area are forwarded to the external LCS client, either collectively or individually, depending on the requested mode. This relieves the external location service client, it does not receive any nonrelevant information, for example about subscribers who are not located within the requested area but who do exist in the network.  
         [0109]    If the protocol used between LAS and GMLC (e.g. MLP) does not allow an area to be specified with sufficient accuracy, the position of each subscriber must be interrogated individually and only those who are located within the desired area are reported back.  
         [0110]    This procedure is of advantage since the number of inquiries to the area is reduced if only active identities are used. The LCS client does not need to know anything about the internal structure of the identities and the size and number of messages is reduced. The data protection of subscribers who are not interrogated is also guaranteed in this way since no data are sent from the LAS to the LCS client.  
         [0111]    However, the network must report all subscribers to the LAS. During this process, internal data are forwarded, and the frequency of use. To solve this data protection problem, LASs can be cascaded. One is located in the network of the operator and receives the message  
         [0112]    LAP:UPDATE_IDENTITIES  
         [0113]    and a further LAS links various networks but does not receive any information about identities.  
         [0114]    Advantageous embodiments are possible:  
         [0115]    Variant A  
         [0116]    For network nodes serving a large area, it may be advantageous to insert into the message LAP:UPDATE_IDENTITIES specific location information, for example the 3GPP location area. The number of LAP:UPDATE_IDENTITIES messages will increase but the LAS can then only use identities in the requested areas and thus reduce the number of messages to the respective network.  
         [0117]    Modified Step 1  
         [0118]    The LAS has received internal rules for constructing identities in dependence on each network used, either predefined or with the message  
         [0119]    LAP: UPDATE_LOCATION_AREA  
         [0120]    from the GMLC. It then generates each possible identifier or uses wild card mechanisms which are allowed by this network for communicating a message (for example “MLP: Triggered Location Reporting Request”) which triggers a return message if the object is registering in the network. If it receives such a report and this report indicates that the subscriber is available, it can set a periodic trigger for receiving the location-based information with somewhat better accuracy, for example in location areas. Using this standard protocol mechanism, the LAS can fill its database consisting of identities, network nodes and known location information without requiring any change in the network.  
         [0121]    Variant B  
         [0122]    There is a number of applications in which the external LCS client does not need to know the identity of the object located. It can be sufficient to send an information item to all objects located. In this case, a relatively small modification of the protocol is also sufficient for solving this problem:  
         [0123]    Modified step 3  
         [0124]    On receipt of the answers  
         [0125]    LAP: AREA_REQUEST_RESP  
         [0126]    in the requested areas, the LAS collects all identities together with capabilities and characteristics of terminals used and possibly identifiers for these (for example SMS, WAP, SIP, E-mail addresses, voice mail, speech . . .). These possibilities and presettings can also be retrieved by the LAS directly from a server keeping these data. A temporary identifier for this list of identities is then sent back to the external LCS client together with statistical information, for example how many subscribers were found, how many of these can use SMS etc.  
         [0127]    Step 4  
         [0128]    The external LCS client can then address particular parts of the information, for example a web address, a telephone number, a short message or the like to this temporary list by using the message  
         [0129]    LAP: SUBMIT_INFO.  
         [0130]    The LAS can forward this information to all subscribers of this temporary list in accordance with the user profiles stored by it.  
         [0131]    Many of the algorithms described can also be performed by the external LCS client itself. However, since there is a number of independent external LCS clients in the network, it would greatly increase the network loading by means of a multiplicity of messages. It is advantageous, therefore, to introduce a central network node which is conducted by a reliable confidential operator. Thus, the networks of various network operators and various technologies can also be combined in a simple manner.  
         [0132]    C. Dynamic Optimization with AREA_IDENTITY  
         [0133]    The areas used by applications are normally symbolically defined, for example a country, a city, a building or a shopping mall. Naturally, these areas can be represented by a polygon which consists of a number of points and edges, see, for example, specification LIF TS  101 . It is no problem to calculate whether the position of a sought object is located within a sought polygon. However, this requires an increased computational overhead, especially if it is intended to determine whether the object is crossing a boundary. This requires these calculations to be carried out frequently for a high number of possible objects and for all areas checked which exceeds the limits of performance of current network elements. It is therefore desirable not to calculate such an area in polygons but to define it in other network-specific areas. This can be a subnetwork in the case of WLAN or location areas (LAC) and cells (CI) for 3GPP.  
         [0134]    [0134]FIG. 4 shows the geographic structure served by an LAS. Its area of responsibility consists of one WLAN and two GMLCs. The GMLC areas, in turn, are covered by one or more MSC-SGSNs. These, in turn, are divided into location areas and the location areas consist of radio cells. Cellular networks are usually built up in such a hierarchical structure. For example, 3GPP is defined in such a manner that an HLR knows the MSC area of a subscriber in which it is currently located. The MSC always knows the last location area of a subscriber. It is only in some cases, for example when a subscriber is currently calling, that the actual cell is known. Otherwise, the precise position of location can only be found by an explicit inquiry from the radio network or from the subscriber station.  
         [0135]    An algorithm for avoiding repeated pollings of the position could look as follows: in the first approximation, a set of location areas LA enclosing the desired area is triggered. If the target object is located in one of these location areas, a locating method with more detailed accuracy can be used, for example on the basis of the radio cells. A more detailed determination may be unnecessary if the required accuracy is not very high or the radio cells are small.  
         [0136]    To use the mechanism according to the invention, the desired area given by polygons or a composition of ellipses and rectangles must be converted into location areas. The processing necessary for this can be quite elaborate depending on the size of the area and should be avoided. Changes in network topology should also remain unnoticeable for the external LCS client and be transparent.  
         [0137]    In the text which follows, a process is thus specified which shows how a desired area is converted once by the LAS and an identifier for this area is delivered back to the external LCS for further use. However, this requires the disclosure of the position of the location areas in the network. This may present problems since network operators may not wish to disclose the internal structure of their network.  
         [0138]    The further action by the LAS depends on the user structure, whether the LAS belongs to a network operator or acts across network operators. If the LAS belongs to a number of network operators, a cascaded structure as described above can be advantageously chosen. The external client then sends its inquiry to an LAS belonging to a number of network operators and behaving in accordance with algorithm A. After that, this LAS sends the inquiry to the LASs within the network operator according to algorithm B.  
         [0139]    Algorithm A—The LAS does not know the internal structure of the network:  
         [0140]    Step 1  
         [0141]    The external client sends a message  
         [0142]    LAP: REQUEST_AREA_IDENTIFIER  
         [0143]    to the LAS. This message contains the complete definition of an area.  
         [0144]    Step 2  
         [0145]    The LAS processes this area as already described in part A, step 2. During this process, the message  
         [0146]    LAP: REQUEST_AREA_IDENTIFIER is forwarded to other LASs if necessary. The result is stored in the database. It consists of a list of units affected and the subareas for these units together with the received identifiers of other LASs. In the case of changes in the network as described in part A, step 1, the data are updated. Since this updating is necessary only sporadically, a gain in performance can be expected, in any case.  
         [0147]    Step 3  
         [0148]    The LAS stores the definition of the area together with the result obtained, generates an unambiguous name AREA_IDENTITY and sends it back with the message  
         [0149]    LAP: REQUEST_AREA_IDENTIFIER_RESPONSE.  
         [0150]    In the further course of the action, this identifier can be used for external clients and also by other applications having knowledge of it. Further mechanisms for maintaining these identifiers, for example discarding the entry if it is not used within a number of days or forming the checksum are necessary and known to a person skilled in the art. It can also obtain additional information, for example a readable designator which describes the nature of this area such as “shopping center XY” or “city AZ”. If the requested area is already contained in the database of the LAS, the stored identifier AREA_IDENTITY is delivered back. Advantageously, identifiers already determined by the LAS operator are predefined, for example cities or countries.  
         [0151]    Step 4  
         [0152]    The AREA_IDENTITY determined or defined can then be used for messages such as LAP: AREA_REQUEST as described above. The use of these identifiers can be promoted, for example by charging lower fees or by increased priority in answering the messages.  
         [0153]    Algorithm B—LAS knows the internal structure of the network:  
         [0154]    Step 0  
         [0155]    The message  
         [0156]    LAP: UPDATE_LOCATION_AREA  
         [0157]    as described above, also contains the internal structure of an area dealt with, a list of location areas and optionally also a list of radio cells.  
         [0158]    Step 1  
         [0159]    See algorithm A, step 1 above.  
         [0160]    Step 2  
         [0161]    See step 2 above In addition, a list of location areas and optionally also of radio cells is stored for each AREA_IDENTITY in the database.  
         [0162]    Steps 3 and 4  
         [0163]    See step 3 and step 4 above Naturally, these functionalities can also be physically integrated in the MSC-SGSN.  
         [0164]    D. Dynamic Optimization in the Case of a Large Number of Clients  
         [0165]    The network receives different independent inquiries for different areas from different independent applications located on many external clients. If the network deals with these inquiries independently of one another, it generates a large amount of superfluous traffic. The algorithm described is intended to lead to the expensive locating methods being executed only under certain conditions. It is then determined firstly whether the object is located in location areas, then in cells and it is only when the objected is located within a special cell that the actual locating is carried out.  
         [0166]    Step 1  
         [0167]    If it is found that a number of inquiries are made for the same area (this can be determined simply by finding the same AREA_IDENTITY in the inquiries during a comparison), the inquiry can be dealt with by the LAS itself. This is done either by using a result already reported back and temporarily stored in the cache or by waiting for a result already requested but not obtained. The probability of two identical inquiries from independent applications is very high when a large number of competitors offer the same services or the area is relatively large, for example a city.  
         [0168]    Step 2  
         [0169]    Even if two inquiries do not deal with absolutely identical areas, the algorithm used can still lead to the same location areas or cells. This concept can be clarified by the following example from FIG. 5. An area is shown which consists of two location areas, location area  1  and location area  2 . These location areas, in turn, are divided into radio cells (cell  1 . 1 , cell  1 . 2 , cell  1 . 3 , cell  2 . 1  etc.). There are various applications which make inquiries in three target areas which partially overlap both the location areas and the radio cells. In this case, there is only a small overlapping area between target area  1  and target area  2 . Target area  1  covers location area  1  and location area  2 , target area  2  only covers a part of location area  2  and target area  3 , in turn, only covers location area  1 . If an inquiry for target area  1  is received, this result can also be used later without any further inquiry for target area  2  and target area  3 , respectively, without again requesting information from this MSC. For target area  1 , the cells cell  2 . 1 , cell  2 . 2  and cell  2 . 4  must be requested. These results can be used again later for target area  2 .  
         [0170]    An algorithm could look as follows:  
         [0171]    Step 1  
         [0172]    After receiving an instruction  
         [0173]    LAP: AREA_REQUEST  
         [0174]    the requested area is compared with those which were ended shortly before or the inquiry of which has not been completely processed yet. If agreements are found during the comparison, the request just received is answered from the answers already stored or delayed until the result is available. It must be taken into consideration that there can be different parameters in the inquiry such as “quality of service” parameters and accuracy of the inquiry.  
         [0175]    Step 2  
         [0176]    After receiving a list of selected network nodes as already described in part A, step 3, or the list of location areas or cells as described in part C, algorithm B, the LAS can break down the inquiry into a set of individual operations for subareas. For each subarea, the inquiry is dealt with as previously described in step 1. Subareas for which there is no result are collected and the inquiries are then forwarded to the GMLCs as already described above.  
         [0177]    Step 3  
         [0178]    The incoming results of the new inquiries are stored in the cache, together with a timestamp. As soon as all required information necessary for answering the original inquiry has been collected, an answer is generated together with the results from the cache. Optionally, partial results can also be sent immediately to the external client. This improves the response times, at least for a part, and distributes the load over time.  
         [0179]    The second step can be improved further by means of the described architecture and databases in the LAS: If the inquiry AREA_REQUEST allows even answers with greater inaccuracy to be sent back or else with location information, the timestamp of which is further in the past, LAS can use the results of earlier inquiries for responding. This lowers the number of inquiries which must be forwarded to the GMLC.  
         [0180]    The knowledge of the internal structure of various network operators can also lower the network load.  
       EXAMPLE 1  
       [0181]    A roaming subscriber outside his home network can alternatively register in two visited networks VPLMN 1  and VPLMN 2 . If the LAS accurately knows the position of the subscriber in VPLMN 1  and shortly thereafter there is an inquiry for VPLMN 2 , the subscriber has changed to VPLMN 2  in the meantime and only this fact is known to the LAS, the current position can also be calculated with the required quality from the exact position from VPLMN 1 , the time difference and the average speed of the subscriber without having to carry out a new and more precise location inquiry from the second visited network VPLMN 2 .  
       EXAMPLE 2  
       [0182]    For this purpose, FIG. 3 must be considered again. If it is known that the location had been in network node  1  some time ago and an average speed does not allow the subscriber to be located already in the network node  3  area, an inquiry for this can be avoided. Using algorithms which take into consideration some past positions of the subscriber, the accuracy can also be enhanced without interrogating the networks. Some algorithms are described in the document by Lance Doherty et al. already cited above.  
         [0183]    [0183]FIG. 6 contains a summary of the algorithms. The call-up diagram is only exemplary of some aspects of the invention and it is not complete, either, since some necessary response messages have been left out. It shows a location information server LAS, two application programs external client  1  and  2  with which the LAS communicates via the LAP protocol, two networks with the network elements GMLC 1  and GMLC 2  with which the location information server communicates via the LAP-MLP protocol and a second location information server LAS 2  with which the first LAS communicates via an inter-LAS protocol. Both of the two independent application protocols want to send an SMS to all subscribers in the same region. This region is served by the two independent networks represented by GMLC 1  and GMLC 2 .  
         [0184]    Messages  1  and  2 :  
         [0185]    GMLC 1  and GMLC 2  send their location information coordinates of the areas for which they are responsible and optionally the structure and location of the location areas and radio cells to the LAS. In addition, the message can contain a structure of the identities and/or a list of currently active identities in this area.  
         [0186]    Message  3 :  
         [0187]    The LAS is not responsible for a part of the location of GMLC 2  which is why the corresponding part of the information is forwarded to LAS 2  in a message. This does not appear to be optimal in this small network configuration but it does indicate the flexibility of the protocol.  
         [0188]    Message  4 :  
         [0189]    The external client  1  sends an AREA_REQUEST to the LAS, containing a description of the requested area.  
         [0190]    Message  5 :  
         [0191]    A part of this requested area (subarea  0 ) is not handled by the LAS but by the second location server LAS 2 . This request is, therefore, forwarded to LAS 2 .  
         [0192]    Message  6 :  
         [0193]    A standard MLP protocol message as described in OMA is sent to GMLC 2 . It contains the subarea  1  served by GMLC 2 , and the identities used by GMLC 2 .  
         [0194]    Message  7 :  
         [0195]    The same applies to GMLC 1 .  
         [0196]    Message  8 :  
         [0197]    The location server LAS 2 , too, now sends standard MLP protocol messages for the area served by it and GMLC 2  to GMLC 2 .  
         [0198]    Message  9 :  
         [0199]    The second external client  2 , too, now sends a location request AREA_REQUEST for the same area as in message  4 . The location server LAS takes note of this fact and delays the processing of this message since it is waiting for the answers to the first inquiry (message  4 ).  
         [0200]    Message  10 :  
         [0201]    The location server receives the answers from GMLC 1 . They may contain a long list of identities and their location information or error messages. This answer is stored until all requested information has arrived or until a timeout occurs.  
         [0202]    Message  11 :  
         [0203]    The same applies to GLMC 2 .  
         [0204]    Message  12 :  
         [0205]    The second location server LAS 2 , too, is collecting information.  
         [0206]    Message  13 :  
         [0207]    The second location server LAS 2  generates a temporary identity RESP_ID_ 1  for the collected subscriber identities and an identifier AREA_ID_ 1  for this area for later use. These are sent to the location server LAS.  
         [0208]    Message  14 :  
         [0209]    The location server LAS now has all the necessary information, it also generates a temporary identity RESP_ID_ 2  and an identifier AREA_ID_ 2  for this area for later use. These are sent to the first external client  1 .  
         [0210]    Message  15 :  
         [0211]    The location inquiry AREA_REQUEST can now also be answered by the external client  2 . Only information collected by the first inquiry from the external client  1  is used.  
         [0212]    Message  16 :  
         [0213]    The external client  1  now wants to send a short SMS message to all subscribers located within the area specified before. It therefore sends a SUBMIT_INFO message with the text of the SMS to the location server LAS to the list stored there with the identity RESP_ID_ 2 .  
         [0214]    Message  17 :  
         [0215]    The location server LAS will send the text of this short SMS message to all subscriber identities which it has previously stored from GLMC 1 . In this case, the target is normally not the GLMC but a network node which is responsible for short messages.  
         [0216]    Message  18 :  
         [0217]    The same applies to GMLC 2 .  
         [0218]    Message  19 :  
         [0219]    The information is now also sent to location server  2  LAS 2  by means of SUBMIT_INFO, using RESPOND_ID_ 1 .  
         [0220]    Message  20 :  
         [0221]    Location server  2  LAS 2  will also proceed as described in message  17  above.  
         [0222]    This application claims the priority under 35 U.S.C. § 119 of German patent application No. 103 15 064.1, filed Apr. 2, 2003. The disclosure of the priority application is herewith incorporated by reference in its entirety. MPEP 2163.07 (E8, 2003).