Title of Invention

"METHOD FOR ESTABLISHING A CONNECTION BETWEEN A SERVICE REQUESTER (CLIENT) AND A SERVICE PROVIDER (SERVER) IN A DECENTRALIZED MOBILE WIRELESS NETWORK"

Abstract

The invention relates to a method for establishing a connection between a service requester (client) (1) and a service provider (server) (3) in a decentralized mobile wireless network (8) with service discovery service, wherein the service requester (client), in order to locate an as yet unknown service provider (server) (3) offering a required service, sends a service discovery request (SD-REQ) (4) in the form of a multicast message to locally adjacent stations (2) of the decentralized mobile wireless network (8) which are IP routers, and these stations (2) in turn forward the multicast message to their neighboring stations (2) and finally to the service provider (server) (3) which responds with a service discovery reply (SD-REP) (7). The method is characterized in that for tracing the route back to the service requester (client) (1), the route information of the service discovery request and its reply are added to the routing tables of the stations (2). FIG. 5

Full Text

Description Method for establishing a connection between a service requester (client) and a service provider (server) in a decentralized mobile wireless network The invention relates to a method for establishing a connection between a service requester (client) and a service provider (server) in a decentralized mobile wireless network with service discovery service, wherein the service requester (client), in order to locate an as yet unknown service provider (server) offering a required service, sends a service discovery request (SD-REQ) in the form of a multicast message to locally adjacent stations of the decentralized mobile wireless network which are IP routers, and these stations in turn forward the multicast message to their neighboring stations and finally to the service provider (server) which responds with a service discovery reply (SD-REP). Such a method is disclosed in document DE 101 43 228 Al. In future public broadband wireless networks, the routing mechanisms of ad hoc networks (decentralized networks with preferably mobile stations) will be employed. The ad hoc routing protocol is based on IP (Internet Protocol) packet switching and has the task of finding a route from the source to the destination node of a data stream within the wireless network. If no direct connection exists, the task is to select a set of routers enabling the IP packets to be transmitted. The routers forward received IP packets to the next router or to the destination station. There are various routing protocols for ad hoc networks. The routing function is performed in different ways e.g. using AODV (Ad hoc On Demand Distance Vector Routing Protocol), DSR (Dynamic Source Routing Protocol for Mobile Ad hoc Networks), DSDV (Destination Sequence Distance Vector for Mobile Computers) protocols. The AODV protocol will now be considered by way of example. The common feature of all the routing protocols mentioned above is that, when routing is initiated, the IP address of the receiver station is used as the input parameter. On the basis of this information, the routing protocol looks for a favorable route through the network. With increasing station mobility, the signaling of the routing protocol messages is largely responsible for the so-called signaling overhead of telecommunications. In the case of the reactive routing protocols such as AODV, route request (R-REQ) messages are multicast over the entire radio network if a route is as yet unknown or obsolete. » There are many different situations in which the address of a destination station is initially unknown, i.e. there is no input information for routing. This is the case, for example, when the mobile end customer wishes to make contact with a station providing a particular service without the computer name or IP address being known to him. Examples of this include requesting locality-related information, requesting local weather information or locating an ATM in the vicinity. Searching for a service provider (service discovery) can be performed centrally using a "directory service" or on a decentralized basis. In the decentralized case, the service requester (client) sends a "service discovery request (SD-REQ)" message to all the stations within a selected range. The stations offering the relevant service (servers) respond accordingly. The response is then known as the "service discovery reply (SD-REP)" message. The SD-REQ message is a multicast message which reaches all the stations in a geographical area. Each station of the ad hoc network forwards the multicast message to its neighboring stations. Server stations reply with a detailed description of the requested service in the SD-REP message. Advantageously the reply from a server now follows the route taken shortly before by the "service discovery" message. Whereas in the case of the AODV routing protocol a corresponding behavior exists in principle, it is not provided, however, for the SD-REQ and SD-REP messages. As routing tables in the routers are only adapted for using the AODV protocol, but not for forwarding service discovery protocol messages, at present a route between the relevant stations still has to be found after service discovery. The following sequence would have to be followed under the current definition of the ad hoc routing protocol: - The client multicasts an SD-REQ message. - At each server offering the service, routing to the service requester is initiated, i.e. each server multicasts R-REQ messages in order to create a route to the client. - The client responds with R-REP. - The path between server and client now exists and the server can reply with SD-REP. - The client can now, if required, select a server and establish a connection to said server in order to make use of the required service or to obtain further information. Another solution for avoiding multicast messages for service discovery is for servers to register their services with a central server. Clients would then first contact this central server in order to determine the IP addresses of the servers providing the required service. If a client has now selected a server, it also knows its IP address, and can then send the normal R-REQ to determine a route to the server. The disadvantage of the second solution is that one or more server databases must be set up. The addresses of the stations must be somehow made known. In addition, the client station still has to send multicast messages in order to determine the route to the server database and, if required, the route to the server. The object of the invention is therefore to find a method for establishing the connection between a service requester (client) and a service provider (server) in a decentralized mobile wireless network with service discovery service, which minimizes the signaling overhead problem. These objects of the invention are achieved by the method having the features set forth in claim 1. Advantageous further developments of the invention are the subject matter of subordinate claims. The inventors have identified that it is possible to minimize the signaling overhead if the multicast message sent by the service requester (client), the routing tables used in the routers for locating the service provider (server), is also provided with routing information to the service requester (client). According to this inventive concept, the inventors propose to improve the method known per se for establishing a connection between a service requester (client) and a service provider (server) in a decentralized mobile wireless network with service discovery service, wherein the service requester (client), in order to locate an as yet unknown service provider (server) offering a required service, sends a service discovery request (SD-REQ) in the form of a multicast message to locally adjacent stations of the decentralized mobile wireless network which are IP routers, and these stations in turn forward the multicast message to their neighboring stations and finally to the service provider (server) which responds with a service discovery reply (SD-REP), such that the routing information of the service discovery request and its service discovery reply is added to the routing tables of the stations for tracing the route back to the service requester (client). This enables the route request (R-REQ) hitherto required from the service provider to be eliminated, thereby considerably reducing the signaling overhead in the mobile wireless network. In a particular embodiment of the method, the service discovery request (SD-REQ) of the at least one service requester (client) can be expanded to include elements of a route request (R-REQ) of the at least one service provider (server). In the case of the R-REQ of the AODV protocol these would be all the elements apart from those relating to the destination address, i.e. "D", "G", "Destination IP Address" and "Destination Sequence Number". In a particular embodiment, the service discovery reply (SD-REP) of the at least one service provider (server) is expanded to include all the elements of a route reply (R-REP) of the at least one service requester (client). In the case of the AODV protocol, each station receiving these SD-REQ and SD-REP messages can update their internal routing tables on the basis of the additional information elements, so that a second explicit routing can be dispensed with. It is advantageous if preferably an AODV or a DSR protocol is used as the routing protocol which is incorporated in the service discovery request and in the service discovery reply (SD-REP). These routing protocols belong to the category of reactive routing protocols, by means of which a changing or obsolete route can be easily updated. Alternatively it is advantageous if the routing protocol, preferably AODV or DSR, is expanded such that, on receipt of the expanded SD-REQ and SD-REP messages, it updates the local routing tables accordingly with the route information. The invention will now be described with reference to preferred embodiments with the aid of Figures 1 to 6 in which the following reference numerals are used: 1: service requester (client)/station of the service requester (client); 2: other stations; 3: service provider (server)/station of the service provider (server); 4: service discovery request; 4a: service discovery request with incorporated routing information elements; 5: route request; 6: route reply; 7: service discovery reply; 7a: service discovery reply with incorporated routing information elements; 8: ad hoc network. In detail: Figure 1: shows an ad hoc network in which a client sends out a service discovery request in the form of a multicast message; Figure 2: shows an ad hoc network from Figure 1 in which two servers send out a route request to the client likewise in the form of a multicast message in each case; Figure 3: shows an ad hoc network from Figures 1 and 2 in which the client sends a reply to the route request back to the servers; Figure 4: shows an ad hoc network from Figures 1 to 3 in which the servers provide the required service to the client; Figure 5: shows an ad hoc network in which a client sends out a service discovery request in the form of a special multicast message; Figure 6: shows an ad hoc network from Figure 5 in which two servers provide the required service to the client. Figures 1 to 4 show the known method for establishing a connection between a service requester (client) 1 and a service provider (server) 3 in an ad hoc network 8. For the sake of clarity, the various steps are shown separately in Figures 1 to 4. In the version illustrated, the ad hoc network 8 consists of a service requester (client) 1 who wishes to call up a particular service from the network 8. This ad hoc network 8 additionally comprises a plurality of stations 2 which may also be mobile and provide various services. All the stations of the ad hoc network 8 are routers and can create connections to other stations of the ad hoc network 8 via the routing protocol used. The two special stations providing the service required by the service requester (client) 1 have been denoted by the reference numeral 3. These are then designated as service providers (servers) 3. The Figures show the following: Figure 1 shows how the service requester (client) 1 requiring a service such as weather data for a particular region proceeds in order to obtain the service. As the server address/IP address of the service provider (server) 3 able to provide the weather data is generally not known to the service requester (client) 1, the service requester (client) 1 will send a service discovery request 4 into the ad hoc network 8. The service discovery request 4 (dotted arrows) is transmitted by the service requester (client) 1 generally as a multicast or broadcast message to geographically adjacent stations 2. This multicast or broadcast message is forwarded by the stations 2 to their neighboring stations 2 until the right service provider(s) (server(s)) 3 is/are also reached. The distribution of all the messages mentioned here and in particular the "flooding" of the ad hoc network 8 with these messages is termed the signaling overhead. The two service providers (servers) 3 only receive the service discovery request 4 of the service requester (client) 1. The route or path on which this service discovery request 4 has come from the service requester (client) 1 to the service provider (server) 3 cannot be retraced under the service discovery service. Figure 2 now shows how the two service providers (servers) 3 locate the service requester (client) 1. The two service providers (servers) 3 send a route request 5 in the form of a multicast message to their locally adjacent stations 2. The route request 5 is forwarded, similarly to the service discovery request 4 from the service requester (client) 1 from Figure 1, from station 2 to station 2 and finally to the service requester (client) 1. However, in contrast to the service discovery request 4, in the case of the route request 5, the route or path of the sender, i.e. of the two service providers (servers) 3, is made known. Thus, on receiving AODV protocol route request messages 5, the stations 2 adapt their routing tables. This "route marking" is indicated by the dotted circles of the stations 2. This step in which the service provider (server) 3 looks for the route to the service requester (client) 1 also involves flooding the network on the assumption that a route to station 1 of the service requester (client) is still unknown. Figure 3 shows how the service requester (client) 1 replies to the route request 5 of the two service providers (servers) 3. The service requester (client) 1 can now retrace the routes/paths over which the route request 5 of the two service providers (servers) 3 has reached him. The service requester (client) 1 sends a route reply 6 in response to each route request of the two service providers (servers) 3, e.g. on the route/path taken by the associated route request. This route reply 6 is symbolized by a solid arrow to denote that the route/path is known. Figure 4 shows how the two service providers (servers) 3 transmit their service description to the service requester (client) 1 on the determined route/path in the form of a service discovery reply 7. The service requester (client) 1 can now, for example, select -which service provider (server) 3 to use. The method explained with reference to Figures 1 to 4 highlights the complexity of localization in the ad hoc network 8. For example, Figures 1 and 2 specifically show the effect of the signaling overhead. However, it is particularly the "flooding" of the ad hoc network 8 with too many messages that is to be avoided. To this end, Figures 5 and 6 describe a new method for establishing the connection between a service requester (client) and a service provider (server) which at least reduces the signaling overhead. Figure 5 shows the same ad hoc network 8 as in Figures 1 to 4. Analogously to Figure 1, the service requester (client) 1 seeking an as yet unknown service provider (server) 3 offering a required service sends a multicast message to locally adjacent stations 2. In contrast to Figure 1 this multicast message consists of a service discovery request 4a incorporating information elements of the route request. By means of the incorporated routing message, the routing tables are adapted by the extended routing protocol when this multicast message is forwarded from station 2 to adjacent station 2. Through the adapting of the routing tables, the route/path to the service requester (client) 1 can be traced back. This "route/path marking" is indicated by the dotted circles of the stations 2. It should be mentioned at this point that the stations 1 and 3, i.e. the service requester (client) and the two service providers (servers), are also routers. This means that they too generate, send and receive, and process routing protocol messages and behave according to the rules of the routing protocol. In particular, they also have routing tables. For this reason the stations 1 and 3 are also shown by dotted circles in Figures 5 and 6. Figure 6 shows how the two service providers (servers) 3 transmit their service description to the service requester (client) 1 on the now known route/path in the form of a service discovery reply 7a. In contrast to Figure 4, this message consists of a service discovery reply 7a into which all the information elements of the route reply are incorporated. By means of the incorporated routing message the routing tables are adapted by the extended routing protocol when this message is forwarded from the station 2 to adjacent station 2. Through the adapting of the routing tables, the route/path can be traced back to the service provider (server) 3. This "route/path marking" is indicated by the dotted circles of the stations 2. The service requester (client) 1 can now, for example, select which service provider (server) 3 to use and, for example, set up a data connection to one of them without further routing. The advantage of this new method is that the signaling overhead incurred by the transmission of route requests from the service provider (server) 3 to the service requester (client) 1 in the form of multicast messages, as shown in Figure 2, can be eliminated. All in all, there is provided a new method for establishing a connection between a service requester (client) and a service provider (server) in a decentralized mobile wireless network with service discovery service, preferably in an ad hoc mobile wireless network or a mobile wireless network using reactive ad hoc network protocols, said method requiring fewer multicast messages and therefore minimizing the signaling overhead problem. Obviously the abovementioned features of the invention can be used not only in the combination specified but also in other combinations or on their own, without departing from the scope of the invention. We claim:- 1. A method for establishing a connection between a service requester (client) (1) and a service provider (server) (3) in a decentralized mobile wireless network (8) with service discovery service, wherein the service requester (client), in order to locate an as yet unknown service provider (server) (3) offering a required service, sends a service discovery request (SD-REQ) (4) in the form of a multicast message to locally adjacent stations (2) of the decentralized mobile wireless network (8) which are IP routers, and these stations (2) in turn forward the multicast message to their neighboring stations (2) and finally to the service provider (server) (3) which responds with a service discovery reply (SD-REP) (7),characterized in that a) the multicast message consists of a service discovery request (SD-REQ) (4a) incorporating information elements of the route request, b) by means of the incorporated information elements of the route request, routing tables are adapted by a routing protocol when the multicast message is forwarded from a station (2) to another station (2), c) the multicast message consists of a service discovery reply (7a) into which the information elements of the route request are incorporated, d) by means of the incorporated information elements of the service discovery reply (SD-REP) (7), the routing tables are adapted by the routing protocol when this service discovery reply (SD-REP) (7)is forwarded from a station (2) to another station (2) and e) for tracing the route back to the service requester (client) (1), the route information of the service 2. A method as claimed in claim 1, wherein the service discovery request (SD-REQ) (4) of the at least one service requester (client) (1) is expanded to include elements of a route request (R-REQ) (5) of the at least one service provider (server) (3). 3. A method as claimed in claim 1, wherein the service discovery reply (SD-REP) (7) of the at least one service provider (server) is expanded to include all the elements of a route reply (R-REP) (6) of the at least one service requester (client) (1). 4. A Method as claimed in claim 1,wherein an AODV or a DSR protocol is preferably used as routing protocol which is incorporated in the service discovery request (SD-REQ) (4) and in the service discovery reply (SD-REP) (7). 5. A Method as claimed in claim 1,wherein the routing protocol, preferably AODV or DSR, is extended such that, on receipt of the expanded SD-REQ messages (4a) and SD-REP messages (7a), it updates the local routing tables accordingly with the route information. 6. A method for establishing a connection between a service requester (client) and a service provider (server) in a decentralized mobile wireless network, substantially as hereinbefore described with reference to the accompanying drawings 5 and 6.

Documents:

2583-DELNP-2006-Abstract-(30-11-2009).pdf

2583-delnp-2006-abstract.pdf

2583-DELNP-2006-Claims-(30-11-2009).pdf

2583-delnp-2006-claims.pdf

2583-DELNP-2006-Correspondence-Others-(30-11-2009).pdf

2583-DELNP-2006-Correspondence-Others.pdf

2583-DELNP-2006-Description (Complete)-(30-11-2009).pdf

2583-delnp-2006-description (complete).pdf

2583-delnp-2006-drawings.pdf

2583-DELNP-2006-Form-1-(30-11-2009).pdf

2583-DELNP-2006-Form-1.pdf

2583-delnp-2006-form-13.pdf

2583-DELNP-2006-Form-18.pdf

2583-DELNP-2006-Form-2-(30-11-2009).pdf

2583-delnp-2006-form-2.pdf

2583-delnp-2006-form-26.pdf

2583-DELNP-2006-Form-3-(30-11-2009).pdf

2583-delnp-2006-form-3.pdf

2583-delnp-2006-form-5.pdf

2583-delnp-2006-pct-210.pdf

2583-delnp-2006-pct-304.pdf

2583-DELNP-2006-Petition-137-(30-11-2009).pdf

2583-DELNP-2006-Petiton-137-(30-11-2009).pdf