Generation of multi-hop communication links depending on limiting values

The invention relates to a method, device and computer program for establishing communication connections in a radio communication system with at least one base station and subscriber terminals, which are at least partly made as multi-hop Ad-hoc nodes. Radio communication systems with multi-hop subscriber terminals are rather known in the current state of the art.

In the publication of M. Lott et al. "Hierarchical Cellular Multihop Networks", EPMCC 2003, March 2003 presents a combination of cellular mobile communication systems based on infrastructure with permanently installed base stations with the self-organizing Ad-Hoc WLAN mobile communication system. Base stations offer access to the primary network, which is based on the TCP / IP protocol. The WLAN communication system includes permanently installed Internet Access Points. Coverage or spatial coverage (Coverage) for establishing communication connections between an access point and one of the mobile nodes of the WLAN (Mobile Node) can be increased by permanently installed or mobile, multi-hop network nodes (Multihop capable Nodes). It follows that a multi-hop communication connection, as compared to a direct communication connection, requires a larger network capacity, because for each partial connection, in order to make a full multi-hop connection, adequate transmission resources are needed.

In the publication of G. Cristeche et al. "Aspects for integration of ad-hoc and cellular networks", 3rd Scandinavian Workshop on Wireles Ad-hoc Networks, Stockholm, May 6-7 2003, in particular the functions of the Ad-hoc network were presented,

- 3 directly used to extend the coverage area and to increase the capacity of the cell, a UMTS type mobile cellular communication system, without using access points. The mobile subscriber terminals of UMTS networks were made in such a way that the communication connection from the base station to the further mobile terminal was set up by the mobile terminals.

By extending the Coverage Extension, the network radius or the radius of the cell is also increased, so that also subscriber terminals located further away from the communication network or base station can be served by this network or its base station. However, this has a negative impact on the bandwidth of the entire network.

Document EP-A-1 133 113 describes a decentralized method of limiting the distribution of messages in multi-hop communication. At the source point, the hop limit is defined, which decreases each time the message is sent. For a hop count value of 0, the message is no longer sent.

The object of the present invention is to provide better possibilities for setting up communication connections between the base station and subscriber terminals that are at least partly carried out as multi-hop Ad-hoc nodes. This object has been achieved by the features of the independent patent claim.

The first subject of the invention relates to a method for establishing communication connections in a radio communication system with at least one base station and subscriber terminals, which are at least partly made as Ad-hoc multi-hop nodes. According to the invention, it is provided that at least one part of the communication connections on the part of the radio communication system is set a limit value for multi-hop connections

-4 communication, the current value is obtained for multi-hop communication connections, and multi-hop communication connections to subscriber terminals are only established if the current value does not exceed the limit value. It can easily be guaranteed that the required assumptions, in particular regarding the required bandwidth within the radio communication system, will be maintained. The limit value can be set once or at regular intervals. It can also be dynamically determined and optimized by events, for example, by changing the current number of active subscriber terminals in a given radio communication system.

Advantageously, it can be provided that each base station may define an individual limit value. For this purpose, optimization of limit values ​​should be carried out at each base station depending on the local conditions within the range of a given base station.

The limit value can in principle be determined for each relevant type and any relevant instance of the radio system. Preferably, an analysis of the cell parameters is performed by the base station of the radio communication system and based on the results of this analysis, the limit value for the communication connections of the given base station is determined.

defining limit values ​​can

In this way, it can be performed autonomously and individually by each base station. In addition, it can be envisaged that between the base stations of the radio communication system there is an exchange of information about limit values ​​that are defined for the given base stations. In this way, you can optimize the base station limits in mutual agreement between the base stations to

-5 obtain optimal network operation also for the group of base stations. This development also offers the possibility of adjusting the limit value of one base station based on the limit values ​​of adjacent base stations.

In particular, it can be provided that the exchange of information is at least partly based on an IPv6 compliant protocol. The protocol compliant with IPv6 (IP protocol version 6) has the advantage that under this protocol the functionality of communication connections to and / or to mobile subscriber terminals is already provided. It is preferably provided that the information exchange is at least partly based on a HMIPv6 (Hierarchical Mobility IPv6) protocol. This protocol is an extension of IPv6 that enables the creation of a scalable IP network structure consisting of single Mobility Anchor Points (MAP). In this way, special benefits are obtained, which also affect the radio communication side in communications connections to subscriber terminals: it is possible to use IP to combine the IP infrastructure with virtually any hierarchy level, i.e. IP infrastructure is practically arbitrarily scalable depending on the requirements for the network coverage area and the number of nodes to access the IP infrastructure. In this way, the particularly necessary call transfer can be implemented more quickly from the radio network side, since the transfer of the technical signaling connection must only be done by local MAPs, and not, for example, by single, common central devices that extend the time it takes .

The limit value may in principle be determined on the basis of any relevant assumptions and / or measurement data. Preferably, however, it is provided that the limit value is determined on the basis of Ad-6hoc data. To determine the limit, the data available in the context of setting up or signaling Ad-hoc communication connections are used anyway. Therefore, the implementation of the invention is possible with minimal expenditure on the radio communication system.

Another object of the present invention includes a device for establishing communication connections in a radio communication system with at least one base station and subscriber terminals, which are at least partly constructed as Ad-hoc multi-hop nodes. According to the invention, the device comprises:

a device for determining limit values ​​for multi-hop communication connections for at least a portion of communication links, a device for comparing specific limit values ​​with current values ​​for multi-hop communication connections, and a device for establishing further multi-hop communication connections depending on the result of the comparison.

The benefits that can be achieved by these technical means will be explained in the same way as for the method described above.

An extension of this subject of the invention is a device for exchanging information about limit values ​​between base stations of a radio communication system. Here too, in order to present the significance and advantages of these measures, reference should be made to the respective implementations of the method outlined above.

In particular, it can be provided that the information exchange device is at least partly used for

- IPv6 compliant protocol processing. In this way, it can be advantageously provided that the information exchange device is at least partly used for processing the HMIPv6 compliant protocol. The benefits that are obtained for a radio communication system with mobile, multi-hop subscriber terminals have already been explained based on the method of the invention.

A third object of the present invention is a computer program that has preferably been developed to implement the method described above. In particular, the computer program may be developed to cooperate with the device according to the invention described above.

According to the invention, it is envisaged that the computer program includes:

the first program procedure that calculates and determines the limit value for multi-hop communication connections for at least some of the communication links in the radio communication system, the second program procedure for obtaining the current value for multi-hop communication connections and the third program procedure that controls the device for setting up multi-hop connections communication to subscriber terminals, only if the current value does not exceed the specified limit.

Also the other method steps mentioned above, as well as further method steps, data processing and transmission steps, in particular protocols, which

The following description of the figures will be explained, they can be implemented, essentially in the form of program procedures for this or other suitable computer program.

A special embodiment of the present invention will be explained below based on Figures 1 to

11.

They present:

Fig. 1:

Fig. 2: Fig. 3: Fig. 4:

Fig. 5:

Fig. 6:

Fig. 7:

Fig. 8:

Fig. 9: Fig. 10 a schematic representation of the hierarchical communication infrastructure; a schematic representation of the extension of the Ad-hoc coverage area without a specified pitch radius; a schematic representation of the extension of the Ad-hoc coverage area with a specified stroke radius; a schematic representation of the extension of the jumping coverage area;

course of the result

Ad-hoc optimal ray sequences for comparing operations with a positive jump radius without communication between base stations;

sequence of operations with negative result of the jump radius comparison without communication between base stations;

sequence of actions with a positive result comparing the jump radius with communication between base stations;

sequence of operations with a negative result of the comparison of the jump radius with communication between base stations;

protocol stack when connecting Mobile IP and Ad-hoc (AODV);

schematic representation of the significant innovative components of the base station;

-9Fig. 11: schematic representation of a hierarchical communication structure analogous to Fig. 1, but according to HMIPv6.

The embodiment described below relates to the possibility of determining limit values ​​for multi-hop communication connections, with the determination of the hop radius (maximum allowable number of hops for the communication connection) and / or determination of the total number of subscriber terminals currently associated with the given base station in the Ad-hoc network. The subscriber terminals of the wireless communication network are able, based on the multi-hop capacity of at least part of the subscriber terminals in the Ad-hoc network, to establish a connection to the base station, although the given subscriber terminals are out of range of the given base station. The Ad-hoc network therefore extends the base station's range using multi-hop Ad-hoc routing protocols. This coverage extension is also called coverage coverage extension. The extension of the coverage area is based on the use of subscriber terminals in the form of Ad-hoc nodes that serve as IP connection routers that can be used as a communication route in a given communication connection. The wireless communication network can be made as a suitable mobile UMTS network or also as a WLAN network, which enables an appropriate extension of the Ad-hoc coverage area, as is known from the state of the art cited at the beginning.

The essential components and functions of the objects of the invention will be briefly explained below based on the embodiment shown:

-10 terminal both to

Base station:

The base station is a gateway between Ad-hoc subscriber terminals and an IP infrastructure (e.g. Internet, see Figures 1 and 11). It offers Adhoc subscriber terminals Internet access and enables connection between the Ad-hoc subscriber terminal and a remote communication partner, which is also associated with an IP-based communication structure. The base station is adapted to make an Ad-hoc subscriber connection to the Internet, and hence the processing of the Ad-hoc protocol as well as a mobile protocol based on IP.

Stroke radius:

The hop radius corresponds to the maximum allowable hop length from the base station to Ad-hoc subscribers in the Ad-hoc network. The hop radius is also the maximum number of jumps allowed (intermediate nodes) between the base station and the Ad-hoc subscriber terminal. The number of hops is sent to the base station using the Ad-hoc protocol, or can be obtained by the base station based on routing information. If the connection consists of, for example, three hops, then the connection includes a base station, an Ad-hoc subscriber terminal and two additional Ad-hoc nodes. If the maximum allowable number of hops is increased, or the jump radius is increased, then the network load increases, as in this way more Ad-hoc subscribers can also be included in the Ad-hoc network around the base station. The hop radius can be determined by the base station itself. Based on this determination, Ad-hoc subscriber terminals whose pitch length exceeds the hop radius are not included in the Ad-hoc network around the base station. The network, as well as the network load, remain stable in this way.

-11 Number of Ad-hoc subscribers:

Alternatively or in addition to the method described, the absolute number of Ad-hoc subscriber terminals within the Ad-hoc network can be taken into account when calculating the network load and determining the hop radius. As an alternative to specifying the hop radius as a limit, you can also specify the maximum number of Ad-hoc subscriber terminals as a limit within the Ad-hoc network. You can e.g. specify that the hop radius for a specific base station is not reduced as long as the specified number of Ad-hoc subscriber terminals is not exceeded.

A combination (Trade-off) between the jump radius and the maximum number of Ad-hoc subscribers allowed (hybrid method) can also be implemented:

The above described method of determining the hop radius and the maximum number of Adhoc subscriber terminals can be used to calculate the optimal network load. A compromise is possible here, which, through the combination of the algorithm for calculating the pitch radius and the algorithm for calculating the number of Ad-hoc subscribers, allows better network planning. The corresponding estimated parameters are preferably calculated based on the said algorithms. These calculations can be performed autonomously by the base station and used to determine both the jump radius and the maximum number of Ad-hoc subscribers allowed. In addition, the virtual radius of the coverage area can be advantageously determined as an additional limit for this method. This virtual coverage area radius represents a value that is defined as a function of the specified and / or the pitch radius value obtained and the maximum number of Ad-hoc subscribers allowed. The larger the jump radius and the number of Ad-hoc subscribers,

- the larger the radius of the coverage area is. In the simplest case, the coverage area radius is determined in direct proportion to the jump radius and the number of Ad-hoc subscribers.

Communication between base stations:

A special communication protocol is used to exchange data between different base stations FA-BS1 to FA-BS4 (see Fig. 1). Said communication protocol provides for the exchange of information about the limit value, e.g. the hop radius or the maximum number of Ad-hoc subscribers allowed, between (preferably adjacent) base stations from FA-BS1 to FA-BS4. The exchange can be carried out, for example, in schematically illustrated in Fig. 1 IP infrastructure to which base stations FA-BS1 to FA-BS4 are attached. It is also possible to provide for a hierarchical mobile IP infrastructure, which enables the superior instances (mobile agents) to coordinate the exchange of information between base stations from FA-BS1 to FA-BS4. For example, they are shown in Fig. 1 as a Regional Foreign Agent RFA and / or Gateway Foreign Agent GFA. Fig. 11 shows an alternative embodiment based on IPv6.

The IP structure according to HMIPv6 is presented, but instead of strictly defined RFA and GFA, only functionally equivalent Mobility Anchor Point MAP are provided. Base stations from BS1 to BS4 serve as an Access Router AR. In this way, the IP infrastructure can be scaled virtually anywhere. This will be explained later in more detail.

The FRA, GFA mobile agents according to Fig. 1 are technically linked to base stations FA-BS1 to FA-BS4.

It is therefore possible to easily exchange between different base stations from FA-BS1 to FA-BS4. This protocol allows this exchange of data as part of the autonomous

-13 matching and optimization of network planning, based on the pitch radius and / or the maximum number of subscribers allowed.

The present invention enables the determination of limit values ​​for an Ad-hoc network around a base station. In this way, you can also specify the coverage extension around a given base station. In principle, a small jump radius or a small number of Ad-hoc subscribers also lead to a small extension of the coverage area that can be obtained in the Ad-hoc network around the base station. This fact can be explained as part of the definition of the virtual radius of the coverage area.

It is required to specify a limit value so that long IP routes are not juxtaposed with multiple jumps through remote Ad-hoc, MN0, MN1 subscriber terminals that can reduce the bandwidth of total Ad-hoc networks around base stations FA-BS1 to FA-BS4. This will be explained even more clearly on the basis of Figs. 2 to 4. The base station from FA-BS1 to FA-BS4, therefore, by defining the limit value, it can ultimately affect whether the remote MN0, MN1 subscriber terminals are accepted in their own Ad-hoc network. An algorithm is required for this, which on the basis of the already existing number of Ad-hoc subscribers and the length of the jumps will define a criterion that allows maintaining the bandwidth.

Each base station FA-BS1 to FA-BS4 can then, based on a specific limit value and exchange information with other base stations FA-BS1 to FA-BS4 and / or with a specific Ad-hoc MN0 subscriber terminal decide that the terminal Ad-hoc MN0 subscriber will be accepted into their own Ad-hoc network, in particular when a given Ad-hoc MN0 subscriber terminal has no other possibility to connect to other base stations

-14 from FA-BS1 to FA-BS4. In this case, the subscriber terminal MN0 can send a corresponding request to the only reachable base station from FA-BS1 to FA-BS4. This is particularly the case when there is only one base station FA-BS1, or the base stations adjacent to the first base station FA-BS1 from FA-BS2 to FA-BS4 are defined in such a way that they cannot match the pitch radius specified for them, that said Ad-hoc MN0 subscriber terminal could be accepted into their Ad-hoc network.

As already mentioned, it is preferably provided that base stations FA-BS1 to FA-BS4 exchange information about temporarily determined hop radii. This exchange of information can take place as Broadcast / Multicast and can use the existing IP-based infrastructure shown in Fig. 1 for this purpose. Based on the information received from neighboring base stations FABS1 to FA-BS4, each base station FA-BS1 to FA-BS4 can in one or more optimization stages modify such defined jump radii temporarily that it is possible to handle the largest possible the number of Ad-hoc subscriber terminals MN0, MN1, in a given case, taking into account the minimum bandwidth value of each Ad-hoc network. This optimization can also be performed dynamically, for example, when the load on the network of a given base station FA-BS1 increases, the pitch radius of a given base station FA-BS1 must be reduced. During the optimization procedure, it can be determined in this way whether and to what extent other base stations FA-BS2 to FA-BS4 can increase their jump radii to enable data exchange with Adn hoc MN0, MN1 subscriber terminals in the coverage area so that each Ad-hoc subscriber terminal MN0, MN1 could establish a communication connection with the base station from FA-BS1 to FA-BS4.

-15 This will be explained later with reference to Figs. 3 and 4.

In addition, within the Ad-hoc protocols, signaling can be provided between base stations FA-BS1 to FA-BS4 and Ad-hoc MN0, MN1 subscriber terminals, as well as additional signaling under IP protocols between different, preferably adjacent stations bases from FA-BS1 to FA-BS4, so that a specific base station FA-BS1 can reject an additional Ad-hoc MN1 subscriber terminal or attach another base station from FA-BS2 to FA-BS4.

As already mentioned, for each Ad-hoc subscriber terminal MN0, MN1 who wants to communicate with the Internet, a base station from FA-BS1 to FABS4 is needed as the default gateway to send routing requests to the Internet. For this purpose, an IP-based mobile protocol is used that can send requests and responses to a given base station from FA-BS1 to FA-BS4. In addition, by using such a mobile protocol (e.g. Mobile IP / HMIP / FMIP), global mobility of each Ad-hoc subscriber terminal MN0, MN1 is supported. In this way, it is possible to roam between disconnected Ad-hoc networks of different base stations from FA-BS1 to FABS4, as well as between different IP infrastructures, without interfering with existing IP connections.

According to the present invention, with reference to the examples presented, there are many separate base stations, whereby the use of multi-hop subscriber terminals of Ad-hoc routing protocols can increase the coverage (Coverage) of base stations. In this way, with the increase in the number of attached Ad-hoc nodes, the base station's coverage (Coverage Extension Radius) is broadened. According to the messages, such expansion negatively affects

-16 data throughput. By limiting the hop length, i.e. by specifying the hop radius and / or by limiting the permissible number of Ad-hoc nodes, the network load can be optimized. With the present invention, it is possible, from the base station side, to regulate the data transmission rate and network load so that the actual network load does not exceed a certain maximum load. The required data transmission speed for each Ad-hoc subscriber terminal for data transmission via a given base station can be maintained.

According to the current state of the art, the Ad-hoc multi-hop protocol is interpreted in such a way that the maximum allowable stroke length or specified jump radius is not anticipated when connecting Ad-hoc subscriber terminals to an existing Ad-hoc network. According to the current state of the art, the rather widespread admission of all subscribers to the existing Ad-hoc network is preferred, regardless of the number of jumps. In addition, autonomous communication of base stations regarding limit values, as well as their optimization, are not provided for in current protocols.

In the further part of the description, the methods and stages of their implementation described above will be explained in detail.

1. How to determine the stroke length of the stroke radius:

determination

a) defining the optimal network load by the base station

b) determination by the base station of the actual network load

-17c) comparison by the base station of the optimal network load with the maximum permissible network load

d) determination of the jump radius based on the results of stage c)

e) sending information about the jump to neighboring stations of said protocol

f) autonomous matching of the hop radius by the base station, based on the received hop radius information from neighboring base stations.

specified base radius with

2. Method of determining the maximum number of Ad-hoc subscribers (number of nodes):

a) the base station defines the optimal number of nodes

b) determination by the base station of the actual number of nodes

c) the base station comparing the optimal number of nodes with the maximum number of nodes allowed

d) determining the maximum allowable number of nodes

e) sending information about a certain number of nodes to neighboring base stations in accordance with said protocol

f) the base station autonomously matching the number of nodes based on information about the number of nodes received from neighboring base stations.

3. Method of combined determination of the stroke length and number of Ad-hoc subscribers (hybrid method):

-18a) determination by the base station of the optimal network load, consisting of the optimal number of Ad-hoc nodes and the pitch radius

b) determination by the base station of the actual network load, consisting of the actual number of Ad-hoc nodes and the actual pitch radius

c) the base station comparing the actual network load with the optimal network load

d) determination of the pitch radius and the maximum number of knots allowed

e) sending information about the specified hop radius and the specified number of nodes to the neighboring base stations by means of said protocol

f) the base station's autonomous matching of the jump radius and the number of nodes based on the information about the jump radius and the number of nodes received from neighboring base stations.

Possible implementation of the method of determining the stroke radius will be exemplified below:

An algorithm will be used that estimates the load and location of the base station in conjunction with the associated basis for determining Ad-hoc subscriber density calculation, Ad-hoc network. This estimation is the density of the jumps and the length of the jump. is obtained from the number of terminals divided by the stroke radius. You can also average individual Ad-hoc density results obtained for different time moments and use for comparison. When the number of jumps increases, one should also take into account the increasing network density. An increase in network density increases network load. This minimizes the data transmission speed of all Ad-hoc subscriber terminals. So that the base stations can keep the data rate for

-19 of all subscriber terminals, the network must be limited. This can be achieved by active measurements or by using comparative values, as a result of which the optimal network density can be determined. The values ​​required for this are known to the base station.

When setting up an Ad-hoc network, the base station can compare the current network density, which it can obtain based on the current number of Ad-hoc subscriber terminals, with stored and / or averaged setpoints and determine the jump radius autonomously. By the base station itself comparing the setpoint and actual value for the network density of existing Ad-hoc nodes, the base station can obtain a jump radius and use it to decide whether it should accept a new Ad-hoc subscriber terminal. Ad-hoc subscriber terminals with a stroke length that is less than or equal to the hop radius can be accepted by the base station into the Ad-hoc network. As a result, however, the network load increases.

The set values ​​or maximum values ​​for the network load cannot be exceeded by comparing the actual number of Ad-hoc subscribers with the specified maximum allowable number of Ad-hoc subscriber terminals as described above, or by recalculating the current network load and possibly reducing the jump radius.

The criterion for an Ad-hoc node to compile a route to a specific destination node is, according to the current state of the art, a stroke metric, which is based on choosing the shortest route and using it as a communication route. As a result, the base station generally chooses Ad-hoc nodes that offer the shortest route. However, according to the invention, it is unacceptable that the selected route length exceeds the hop radius of the Ad-hoc network of the given base station.

Figure 1 shows schematically the construction of a hierarchical communication infrastructure for implementing the invention. For example, four base stations FA-BS1 to FA-BS4 are shown in Fig. 1 . The four base stations FA-BS1 to FA-BS4 are made according to the IP protocol illustrated in Fig. 1 as Foreign Agents, which are at least regionally associated with each other by Regional Foreign Agents RFA. For IPv6, as shown in Fig. 11, this structure corresponds to the structure composed of Mobility Anchor Point MAP points, which perform local registration of Ad-hoc subscriber terminals. In addition, Fig. 1 shows two MN0, MN1 mobile Ad-hoc nodes that freely move between four base stations FA-BS1 to FA-BS4.

Fig. 2 shows the structure of the Ad-hoc network, consisting of four Ad-hoc networks, each consisting of Ad-hoc A subscriber terminals and base station B. For the length of the jump between base stations B and Ad-hoc A subscriber terminals a limit value is specified. This therefore leads to unrestricted network compilation around each base station B and asymmetrical load distribution of the network or around one base station B, with the maximum data transmission possibilities of base station B not taken into account at all.

Fig. 3 shows the situation of Fig. 2, where a specific jump radius, i.e. the maximum allowable number of strokes (jump = 1, 1, 2, 3) is determined for the implementation of the Ad-hoc coverage area for each base station B. By determining the network load and taking into account the load capacity or data transmission capability of a specific base station (i.e. the theoretical maximum possible network load, where the ability to connect to the primary IP network is decisive), you can specify

-21 individual pitch radius for each base station. Fig. 3 shows, however, that when determining only the individual hop station radii, it may be the case that individual Ad-hoc subscriber terminals will not be served by any base station B.

Fig. 4 shows the situation of Fig. 3 in which the individually defined hopping radii of base stations B, as a result of the distribution between base stations B locally and / or globally in one or more iterative optimization stages, are further optimized so that all terminals Ad-hoc subscriber can be supported. Jump radii (pitch = 1, 2, 2, 3) are obtained. It is possible at the same time to dynamically distribute the network load, thanks to which it is possible that although each base station B can only manage the number of Ad-hoc A subscriber terminals that results from its load capacity, all subscriber terminals A are supported. Thanks to this, it is possible to avoid increasing the network load beyond the capabilities of each base station B, and yet support for a given coverage area is provided.

Fig. 5 shows the sequence sequence of the proposed protocol when attempting to establish a connection between subscriber terminals MN (n) with the base station BS (n) to access the Internet through this base station as the default gateway. To this end, MN (n) sends through the multi-hop MN (n + 1) device, which is already part of the BS (n) Ad-hoc network, the Base Station Request BS Req request. BS (n), compares the stroke length with the specified stroke radius. Because this condition is met, BS (n) accepts the subscriber terminal MN (n). The device then starts the registration process from the Home Agent (HA) or from the responding node

-22 Correspondent Node (CN) and sends updates to the Binding Update BU. This is approved by the Home Agent (BU ACK). At this point, the connection is fully established. The MN (n) subscriber terminal is now associated with an IP-based infrastructure (e.g. the Internet).

Fig. 6 shows, similarly to Fig. 5, the sequence sequence of the proposed protocol when attempting to set up a connection via the MN (n) subscriber terminal with the BS (n) base station to access the Internet through this base station as the default gateway. For this purpose, MN (n) sends through the multi-hop MN (n + 1) device, which is already part of the BS (n) Ad-hoc network, Base Station Request BS Req request. BS (n) compares the stroke length with the specified stroke radius. As a result, the base station BS (n) states, however, that in this case this condition is not met. Therefore BS (n) sends BS NACK negative confirmation.

The MN (n) subscriber terminal is now starting a new Base Station Request BS Req request. Then a further BS (n + 1) base station reports. She could also make her first request. However, the MN (n) subscriber terminal does not know which BS can take it over. Hence, on the second request, the first BS does not respond (it can be advantageously predicted to remember the request). BS (n + 1) is, after comparing the stroke length with the stroke radius, ready to take over the new MN (n) nodes and send a positive BS ACK confirmation.

The MN (n) subscriber terminal therefore starts sending the Binding Update (BU) update to the Home Agent (HA). The connection is fully established.

-23Fig. 7 shows the sequence sequence when attempting to register the subscriber terminal MN (n) to the base station BS (n). To this end, MN (n) re-sends the request via a multi-hop MN (n + 1) device that is already part of the BS (n) base station Ad-hoc network. The BS (n) base station compares the stroke length with the specified stroke radius. The result of the comparison is the decision that the subscriber MN (n) must be rejected. Before the BS (n) base station rejects the new MN (n) subscriber, the BS (n) base station starts polling the neighboring BS (n + 1) base station to determine its hop radius. To this end, BS (n) sends a HOP Request (HOP Req.). The response of the neighboring base station BS (n + 1) means that BS (n) must accept a new subscriber MN (n). The connection will then be fully established. The reason for this may be that the second BS (n + 1) has reached its capacity limit, which is indicated by the smaller stroke radius. BS (n) has the largest jump radius and can increase it to receive a new MN (n) subscriber terminal. If BS (n) cannot increase the pitch radius because the capacity limit is reached, then a new MN (n) subscriber terminal is not accepted. It can now or must, by means of a vertical handoff (Handoff), for example, go to a parent network, e.g. a mobile cellular network.

Fig. 8 shows the sequence sequence when attempting to register a subscriber terminal MN (n) through a multi-hop terminal MN (n + 1) to a BS (n) base station. The BS (n) base station compares the stroke length with the specified stroke radius. The result of the comparison is the decision that the subscriber MN (n) must be rejected. Before the BS (n) base station rejects the new MN (n) subscriber, the BS (n) base station starts polling the neighbor BS (n + 1) to determine its hop radius. To this end, BS (n) sends a HOP jump request

-24Restest HOP Req. BS (n + 1) leads

A response from a neighboring base station to state that BS (n) does not need to accept a new MN (n) subscriber. BS (n) sends BS NACK. MN (n) then sends BS Req to discover another base station. Reports to BS (n + 1), which has a larger jump radius. The BS (n + 1) base station compares the request with its hop radius and receives a new MN (n) subscriber. It then sends Binding Update (BU) updates to the Home Agent (HA). The connection is fully established.

Fig. 9 shows a set of protocols integrating Mobile IP and AODV (Ad hoc On-demand Distance Vector Routing Protocol), which, for example, is used in the protocol described herein. The following mobile agents are presented: Correspondent Node (CN), Home Agent (HA), Gateway Foreign Agent (GFA), Regional Foreign Agent (FRA) and Foreign Agent (FA). In addition, a combination of an Ad-hoc network consisting of MN (n) and MN (n + 1) is presented.

The Ad-hoc routing protocol (here AODV) is used to attach and send the IP routing packet. The HMIP protocol stack is used to connect a mobile subscriber terminal to the Internet when the terminal passes between IP networks. To this end, the Ad-hoc subscriber terminal must send Binding Update (BU) updates via the base station. The base station here is FA, which is the gateway between the Ad-hoc network and the IP infrastructure.

If the protocol for HMIPv6 is implemented, then instead of Gateway Foreign Agent (GFA) and Regional Foreign Agent (RFA) only Mobility Anchor Points (MAP) are provided, according to Fig. 11.

Fig. 10 schematically shows the relevant, innovative components of the BS1 base station for establishing communication connections in a radio communication system with

-25 regarding transmission

Information Exchange with at least many BS1, BS2 base stations and MN0, MN1 subscriber terminals. MN0, MN1 subscriber terminals are made as multi-hop Ad-hoc nodes. The MN0 subscriber terminal attempts to establish an Ad-hoc communication connection with the BS1 base station via the MN1 subscriber terminal.

The BS1 base station includes a Limit Value Definition Unit LVDU device for determining the jump radius for multi-hop communication connections. In terms of data transmission, the LVDU device is associated with the Limit Value Comparison Unit LVCU device, which is used to compare a specific jump radius with the current jump length values ​​of the currently tested communication connection. The LVCU device is connected with the Multihop device in terms of data transmission

Communication Unit MHCU, used to set up further multi-hop communication connections depending on the result of the comparison. Finally, the LVDU device is under the data associated with the device

Unit IXU, used to exchange information about the hop radius between the BS1 base station and one or more neighbor BS2 base stations of the radio communication system.

Fig. 11 shows a structure analogous to Fig. 1 for implementing HMIPv6 according to the present invention. Instead of the Gateway Foreign Agent GFA and Regional Foreign Agents RFA, there are only Mobility Anchor Points MAP, which can be assigned to virtually any hierarchy level. Base stations BS1 to BS4 serve as an Access Router AR in this case. This IP infrastructure can be freely scaled, i.e. basically any number of MAPs can be predicted in any hierarchical system to achieve the desired network coverage area or desired number of network accesses.

The network hierarchy can be compiled in various branches of the IP infrastructure in different ways, as shown schematically in Fig. 11 for the left and right branches of the IP infrastructure. It is therefore obvious that for the MN1 subscriber terminal, the transfer of the connection, for example, from the BS3 base station to the BS4 base station, in principle, can be done faster, because only local MAPs need to be involved in the transfer of the connection with respect to signal exchange rather than central devices such as RFA or GFA.