METHOD FOR THE NETWORK INITIALIZATION OF A NETWORK FOR THE RADIO LOCATION OF OBJECTS WITHIN A LIMITED SPACE

Abstract

In a method for initializing at least one network segment of a network for the wireless location of movable locating objects arranged in a limited space using pulsed radio signals, wherein the at least one network segment in the limited space has at least two spaced apart reference nodes which form a chain-shaped communication network and which are autarkic in terms of communication, wherein a locating object arranged in the limited space is able to be located using one of the distance-based trilateration carried out by at least three reference nodes, and wherein general information is communicated by broadcast channels, the reference nodes listen to the broadcast channels in a standby position until initial information about their active participation in the communication network is received.

Claims

1. Method for initializing at least one network segment of a network for the wireless locating of moving locating objects arranged in a limited space (115) by means of pulsed radio signals, wherein the at least one network segment in the limited space (115) has at least two spaced apart reference nodes (135-180) which form a chain-shaped communication network and which are autarkic in terms of communication, wherein a locating object (288) arranged in the limited space (115) is able to be located by means of a distance-based trilateration carried out by the at least three reference nodes (135- 180), and wherein general information is communicated by means of broadcast channels, wherein the reference nodes (135-180) listen to the broadcast channels in a standby position until initial information about their active participation in the communication network is received.

2. Method according to claim 1, wherein the reference nodes (135-180) generate a neighbor database by means of communication with all reachable reference nodes.

3. Method according to claim 2, wherein the reference nodes (135-180) communicate the neighbor database to other reference nodes during the initialization.

4. Method according to claim 2, wherein the neighbor database contains information about received signal amplitudes and/or background noises, and this information is communicated to other reference nodes during the initialization.

5. Method according to claim 2, wherein the neighbor database contains information on the distance to neighboring reference nodes, and this information is communicated to other reference nodes during the initialization.

6. Method according to claim 2, wherein the neighbor database contains statistical information on the frequency of the occurrence of distance measurements to other reference nodes, and that this information is communicated to other reference nodes during the initialization.

7. Method according to claim 1, wherein at least one administration node communicates set-up information to the reference nodes, which is successively further communicated in a chain to other reference nodes.

8. Method according to claim 7, wherein the at least one administration node is implemented in at least one reference node.

9. Method according to claim 7, wherein the set-up information comprises the chain length as well as corresponding UlDs and LIDs for the reference nodes participating on the chain.

10. Method according to claim 1, wherein a propagating confirmation response starting from a last reference node in a chain takes place to the other reference nodes of the chain and the administration node successively via the reference nodes of the chain.

11. Method according to claim 10, wherein the information propagated in the confirmation response comprises the feedback of a respective LID.

12. Method according to claim 1, wherein an administration node transmits initialization packages to reference nodes which contain at least one localization measurement request.

13. Method according to claim 12, wherein the initialization packages include a command which signalizes the segment initialization and further information that describes the network topology and/or the configuration status of the administration node.

14. Method according to claim 4, wherein the administration node forms a network segment structure from reference nodes, based on the statistical information about the frequency of occurrence of the distance measurements to neighboring reference nodes, in the shape of at least one chain.

15. Method according to claim 14, wherein at least two, substantially equally long chains are formed from reference nodes.

16. Method according to claim 7, wherein, at the end of the initialization, the administration node communicates further information to the reference nodes regarding the properties of the communication network and about desired locating methods, and it does this in the form of an almanac and/or in the form of logical spaces and/or in the form of transformation information for a global coordinate system.

17. Computer program which is configured to carry out each step of the method according to claim 1.

18. Machine-readable data storage medium on which a computer program in accordance with claim 17 is saved.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0029] Other objects and features of the invention will become apparent from the following detailed description considered in connection with the accompanying drawings. It is to be understood, however, that the drawings are designed as an illustration only and not as a definition of the limits of the invention.

[0030] In the drawings,

[0031] FIG. 1 shows a network formed from two daisy chains and comprising a segment, an initialization according to the invention being able to be carried out in said network;

[0032] FIGS. 2a-2g show exemplary states in an initialization according to the invention of a network related here at different points in time;

[0033] FIG. 3a shows a table of an exemplary time sequence of a communication protocol for measuring distance in a localization segment in accordance with the invention, as becomes valid after the initialization of a segment shown in FIG. 1 is complete. This table corresponds to a basic TDMA slot map, which forms a basic sequence of time slots;

[0034] FIG. 3b shows an exemplary channel distribution in a network formed from more than one segment, wherein each of the individual segments is constructed in a similar way to the segment shown in FIG. 1; and

[0035] FIG. 4 shows an exemplary embodiment of the method according to the invention for network initialization based on a flow diagram.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

[0036] FIG. 1 shows an exemplary logical structure of a locating segment, formed from two daisy chains, of a localization network. In the communication chain in the example based on said UWB technology, communication messages between “neighboring” participants are sequentially propagated within the two “daisy chains”.

[0037] The arrangement shown in FIG. 1 includes an administration node 100 that, in the exemplary embodiment, has an inherently known data connection to an external IT server 110 via an ethernet connection 105. This server functionality, however, can also be implemented in the administration node 100 itself. A limited space is defined by the line 115, the participants being arranged in said space or being able to move (dynamically). Power supply units 120, 120′ are arranged on this outer limit line 115 in order to supply the participants with the electrical energy required for their operation.

[0038] In the lower half of the drawing, a first daisy chain (C1) 125, and in the upper half of the drawing a second daisy chain (C2) 130, branch off from the administration node 100. In this exemplary embodiment, there are five reference nodes 135-155 along the first daisy chain 125, and in the second daisy chain 130 also five reference nodes 160-180 are arranged. It must also be noted that no (actual) locating objects are shown in this drawing yet.

[0039] A localization measurement of participants carried out in the network shown in FIG. 1 takes place using the known method of “trilateration”. This method is based on the fact that, in case of knowing only the distance of an object to a known point, its own location (in planar view) is on a sphere or, in a 3D space, on a spherical shell around this point. In the case of two known points, its own location is on the points of intersection of the two spherical shells, i.e. on a circular line.

[0040] In FIGS. 2a-2g, exemplary method steps of a first exemplary embodiment of the method according to the invention for initializing a network segment exemplarily shown in FIG. 1 using a sequence of network statuses are illustrated. A single locating object 200 is shown in these drawings (FIGS. 2a-2g), which is not yet registered and, accordingly, is not yet a “participant” in the current sense. For this reason, in FIG. 2a the object 200 is provided with a human ear 205 in order to signify that the object 200, as described in detail in the following, listens to a broadcast channel.

[0041] It must be noted that the entire communication or corresponding signal transfer for network initialization described here can be either synchronous or asynchronous. In the following exemplary embodiment, only an asynchronous signal transmission is supposed, wherein the following described basic processes can be used accordingly in the case of a synchronous signal transmission.

[0042] It must be furthermore noted that the described method is used in general for segment initialization and locating objects therefore can or are permitted to have active participation in communication only after this initialization phase is completed. Active participation is commenced by registering in the corresponding network segment after the segment initialization.

[0043] In this exemplary embodiment, it is furthermore assumed that there is a basic functional localization network shown in FIG. 1 in accordance with the following definition, i.e. the reference nodes and the administration node are able to transmit UWB radio signals and have a valid UID.

[0044] The number specified for the daisy chains formed in the following of five reference nodes per chain is only exemplary, and can be any number greater or less than 5, wherein the total number of reference nodes in the two-dimensional or virtual three-dimensional localization of a locating object by means of trilateration in any case should preferably be >=3. In a one-dimensional localization or locating of a locating object along a line, a total number of reference nodes of >=2 suffices. However, it must be highlighted that, in the case of pure presence detection of a locating object (“zero dimensional location”), or if the position in the case of a one-dimensional location can be reduced to a half axis whose start represents the reference node, the use of a total of only one reference node is possible. The two daisy chains can also contain different numbers of reference nodes. However, a symmetrical construction from the point of view of resource efficiency and maximum measuring speed in the subsequent measurement operation is preferable. The reference nodes from the daisy chain C1 are labelled in the following with the numbers 11′ to 15′ contained in FIG. 1, the reference nodes from the daisy chain C2 are labelled with the numbers 21′ to 25′.

[0045] As can be seen in FIG. 2a, all participants 200, 215-235 and 240-260, with the exception of the administration node 210, are in a so-called “ALOHA” mode at the start of the initialization. Communication in ALOHA mode takes place based on a “listen before talk” procedure with additional stochastic telegram communication. In the special case specified here, the participants, with the exception of the administration node, are in a standby position in which they initially only listen to the different broadcast channels and do not send any of their own messages. During this process, every administration node, i.e. in the current network segment the administration node 210, transmits initialization commands together with information on network topology and the configuration status of the administration node, which is primarily determined for the reference nodes in its own segment and is also especially necessary for later distance measurements. The information on the network topology includes the number and SIDS of the segments configured in the network, the UlDs of all reference nodes available in the localization network and its assignment to the respective segment. In addition to the UID, the reference nodes are assigned with a provisional LID in their own segment. The information on the configuration status of the administration node consists primarily of information on its firmware status.

[0046] During this process, the reference nodes 215-260 switch between the different possible broadcasting channels until they receive initial information from a broadcast of a random segment as to whether and in which segment they are a reference node or not. If necessary, they switch to the broadcast channel of the segment in which they are specified as a reference in order to participate in the correct segment in the network initialization. After they have received their provisional LID in their target segment, the reference nodes take part in the communication 261, 261′, 261″ and 261′″ in their segment by repeating the initialization command and information of the administration node during the simultaneous distance measurement to any reference nodes in their segment, as can be seen in FIG. 2b. During this process, the reference nodes also create a neighbor database by evaluating the communication taking place, by means of which both daisy chains of the reference nodes can be subsequently autarkically operated. Along with the measured distance to the other reference nodes, in the neighbor database there is also information on the received signal amplitudes (V.sub.Peak), the background noise and the occurrence or failure of UWB connections, by means of which the following most stable (in terms of communication) possible daisy chains can be formed.

[0047] During this process, the above described communication expands in an avalanche-like way in the network. A sufficiently long waiting period is necessary to ensure that all reference nodes are able to participate in this chaotic communication flow for long enough in order to generate a reliable database in the statistics and neighbor database. The end of this first initialization phase is triggered by the administration node transmitting a new command instead of the initialization command which instructs the reference nodes to communicate the respectively logged statistics database to this segment. In the following communication that follows, simultaneously resulting distance measurements are not necessary. This command, in turn, expands in an avalanche-like way within the segment. Reference nodes repeat this command randomly in turn together with the content of their neighbor database. Neighbor databases that have been listened to of other reference nodes are completely integrated into their own database and the updated data set is transmitted if the communication process is participated in once more. The result of this is that, after a certain period of time has elapsed, all reference nodes and the administration node have the same information, which is complete from the point of view of communication, about the neighboring relationships in the network segment. If the administration node does not detect any more change in the neighbor database for a certain amount of time, or if a certain maximum waiting time has expired, the administration node ends the described spreading of the neighbor(hood) database in the network.

[0048] With the help of the neighbor database, the administration node calculates a stable daisy chain structure from the information collected. Different weightings can thus be used for the statistical information recorded in the neighbor database, which, when added together, ensure that information can be reliably and completely propagated along the daisy chain. In order to achieve a higher tolerance to errors, it can e.g. be taken into account that next-but-one or next-but-two neighbors within the formed daisy chain are also able to communicate directly with each other as reliably as possible. Furthermore, the administration node can also assign the reference nodes with a new LID, which e.g. indicates their daisy chain and position within this. It is shown in FIG. 2c how the administration node 210 in this example generates the lower daisy chain 215-235 and communicates this generation to the reference nodes within the daisy chain. Thus, the administration node 210 transmits 262 (as respectively implied by the circular wave propagation) the chain setup information together with a counter to diagnose the propagation of this message to the nearest reference node 215. This reference node communicates this information 263, in turn, to the next reference node 220. In this way the two reference nodes 225, 230 following this also communicate 264-266 the chain setup information until the last reference node 235 of the lower daisy chain. Said chain setup information comprises amoung others the chain length and corresponding UIDS, and if available the new LIDS for reference nodes participating in the chain. If a reference node notices that the information it has sent is not being spread further, it resends the data package that it has already sent. This is advantageous because, in this way, the lower daisy chain can also receive information about the planned second daisy chain.

[0049] In FIG. 2d a response to confirm the successful DC set-up starting from the last reference node 235 in the lower chain, by means of the reference nodes, or a corresponding propagation to all other reference nodes of this daisy chain, in which a chain setup “acknowledge” (i.e. corresponding acceptance or confirmation of the resultant chain generation) takes place, including the feedback of diagnostic information, e.g. in the form of the respective LID. The response starts by transmitting 268 a corresponding communication 269 to the next reference node which, in turn, transmits a corresponding communication 271 to the next reference node 270. If forming the daisy chain has not been possible because the broadcast shown in FIG. 2c could not be spread widely enough or could not be spread further, the described response takes place from the reference node, which was the last to have further spread the broadcast information. The diagnostic information in the chain setup “acknowledge” can then be used by the administration node if needed to generate a better daisy chain (abbreviated in the following as “DC”).

[0050] The administration node 210 repeats the procedure described in the previous two paragraphs to form the upper DC. This is signified by communication along the arrows 273-277 which represents the formation of the DC from the reference nodes 240-260. Along this new second DC, a chain set up “acknowledge” is finally also transmitted back to the administration node, analogously to the procedure described above. Thus, in the whole segment, the formation of both chains has occurred and is complete.

[0051] The reference nodes then receive a complete dataset for describing the network. This is shown in FIG. 2e. For this purpose, the administration node in turn transmits information by means of forward broadcast 278 along the lower daisy chain, as is signified by the arrows 279, 281 and 282. During this process, the reference nodes repeat the respective complete received information. The data set for describing the network typically contains a complete almanac with the known positions of all reference nodes in the entire localization network. Further information can also be communicated to the selected coordinates system (coordinates transformation, rotation) and to logical spaces. Due to the data quantity, the information must be spread out on several data pages. As in the case in the formation of the daisy chains, a confirmation of the successful information transfer occurs from the end of the daisy chain or from the last reached participant via a feedback data and diagnostic diagram.

[0052] Directly after the diagnostic information has been sent, the reference nodes generate the TDMA slot map shown in FIG. 3 and wait for the start of the synchronous communication phase via the administration node. However, the same process of the above described information spreading occurs first, as is also shown in FIG. 2f for the second (upper) DC. The broadcast 284 in turn starts at the administration node and the information is then, as signified with the arrows 285 and 287, spread along the DC until the last reference node. From there, a return broadcast 286 occurs along the DC back to the administration node. In the upper DC the reference nodes also switch to synchronous communication mode, based on the TDMA slot map shown in FIG. 3.

[0053] The initializing phase of this network segment is ended with the cycle of network information described here. After the last broadcast package, which is still responding, has been received from the upper DC, the administration node also switches to synchronous communication mode and, after a short waiting period, starts the TDMA communication by spreading a broadcast, as is depicted in first slot shown in FIG. 3a. This broadcast informs all participants of the successful segment initialization. From this time onwards, the locating object 288 can register in this network segment with a random reference node via the communication 289 shown as an example in FIG. 2g.

[0054] The exemplary embodiment described above of the initialization of a localization network related here formed from at least two segments (see FIG. 1 for an individual segment) is described in the following using a flow diagram shown in FIG. 4 and is realized by the initialization of the individual network segments taking place in parallel or sequentially. Only the initialization of an individual network segment is described in the following, however this is undertaken in a uniform way for all segments of which the localization network consists. At the same time, initially only the initialization of the components belonging to the communication infrastructure i.e. in this case of the administration nodes and the reference nodes, is explicitly described. The initialization for locating objects, however, takes place in an identical manner to that of the reference nodes, unless a different mode of action is specifically referred to. Network segments can cycle through such an initialization up to any point in time. The representation in FIG. 4 and the process described in the following text when combined form the same behavior as described above based on FIGS. 2a-2g. Previously, the communication paths between the communication participants were in the middle of the description. In the following description, the sequential process will now be shown and linked with the communication flow between the communication partners by referring to the previously described Figures.

[0055] From the view of the reference nodes, as already described, the initial state or starting state is characterized in that the reference nodes are in a so-called “ALOHA” broadcast mode 400, in which provision is made for a “listen-before-talk” procedure with a stochastic telegram communication in an inherently known manner, however by switching off their own transmission function. The reference nodes only switch 405, 410, 415 between broadcast channels that are possibly available in order to detect the channels on which communication in this example is taking place via UWB radio technology. In accordance with another embodiment, the reference nodes distribute very short data packages on a selected broadcast channel in the UWB network, which announce their basic presence. This is especially of advantage as soon as they have found a communication on the selected broadcast channel 420. The dashed line 425 indicates that both steps 405, 410 and 415 and all the following steps in the area bordered by the dashed line 425 will be carried out by the reference nodes. The situation is comparable with the behavior of the participants shown in FIG. 2a.

[0056] The dashed line 430 shown in FIG. 4 shows that the steps contained within it are carried out by the administration node. The administration node is switched to an initial state 435 in the same way as the reference nodes. If the administration node, as mentioned in FIG. 1, does not have a data connection to a data processing unit or a control processor that starts the communication 440, it also starts communication in said “ALOHA” mode after a presettable waiting time Δt1, and it does this by transmitting 445 initialization data packages to the reference nodes (e.g. shown by the arrow 450). If the administration node has not yet detected a reference node in its vicinity, since these are still mute at the start of the initialization, it contacts a target address of a “virtual” reference node. If the administration node has a connection to an IT system, corresponding initialization packages can also be provided, triggered by the request 440 of the IT system.

[0057] The aforementioned initialization packages consist of a localization measurement request to a random participant (reference node), from a command that signalizes the segment initialization, and also contain further data that describe the network topology as well as the configuration status of the administration node. In a potential embodiment, this data may also include information on the firmware used, the number of available segments in the network and their SIDs, said UlDs of the reference nodes in the segment and/or in the entire localization network as well as the assignment of these reference nodes to the respective segments. The composition of this information requires that the administration node has an overview of the topology of the localization network. It can receive this overview via communication with an IT system or by means of configuration information 455 saved in its own read-only memory. A provisional specified LID can be assigned to the reference nodes which belong to an available network segment, and communicated by means of the initialization package. If necessary, all of the aforementioned information can also be split into several different data packages, wherein the data packages are made identifiable through the addition of page numbers. During this process, not all pages of the initialization packages must be sent directly to every possible participant in the segment, since it is also sufficient if the participants are able to also hear the total number of different pages as part of said broadcast from the communication with the other participants.

[0058] When sending these initialization packages via the administration node, all of the reference nodes in the network are initially occupied by switching through the available broadcast channels of the network 405, 410 and 415. As soon as they listen to the initialization package of a random administration node 450, they end 420 this channel switching process and continue working in the set broadcast channel. To secure the communication properties, the channel switching process can continue to take place at a ratio of too low signal to noise until (according to the process loop shown 405, 410, 415) the initialization package can be heard with a better signal to noise ratio. In this case, these are the initialization packages of an administration node from another network segment. If a reference node is arranged in terms of radio in a very shaded area, instead of the initialization package 450 of an administration node, the reception of the initialization packages which are, as described in the following, further spread, repeated and transmitted from another random reference node, can also result in the behavior described below.

[0059] By processing 465 the initialization packages 460 received in this way, first reference nodes receive necessary information with regard to the segmentation of the network and which reference nodes are assigned to which segment, regardless of whether they have set the broadcast channel of their target segment or not. In particular, they actually only receive the information at this point that they are reference nodes and not locating objects. Locating objects determine their classification by the fact that their UID is not contained in the information of the initialization packages on the network structure. They remain passive until the entire configuration process of the selected network segment is completed. However, they listen to every single described communication flow as passive participants and process the communicated data.

[0060] If a test step 470 additionally carried out by a reference node when listening to the initialization packages, reveals that the broadcast channel of a network segment, which the reference node is not assigned to, having been set, the reference node switches 475 into the broadcast channel of the correct target segment to which it is assigned. If the reference nodes in the correct segment have received 480 information on their preliminary LID, they exit the passive ALOHA mode using this LID. This behavior is alternatively also shown in FIG. 2b and the corresponding description text. On the one hand, the reference nodes make their presence 485 in the segment known via the broadcast channel. On the other hand, the reference nodes repeat the information about the structure of the network received to date from the administration node, in combination with a localization measurement of all other already detected reference nodes in the relevant segment or in the administration node. This secures the “avalanche effect” that now also almost all other reference nodes in the segment can contain the information of the administration node, if e.g., a radio shadow exists in environments with heavy interference. In addition to this it is ensured that reference nodes are not able to migrate into another segment.

[0061] Along with the described distance measurements and the data communication, the reference nodes collect 490 statistics about the reference node from which in its own segment a communication 495 can be heard, at which signal and fault signal levels and how often a distance measurement to a respective reference node has worked or has failed. More data can be collected for error diagnosis, including also the number and or a list of successfully received initialization package pages. This repetition continues to take place until the administration node announces the end of the initialization phase by communication or transmitting a further command via UWB.

[0062] In another embodiment of the method, the reference nodes can also be informed via an “a-priori” configuration that they represent reference nodes and/or to which network segment they are assigned. This means that a channel switch is not necessary. The initialization phase can be significantly reduced in this way, since only their provisional LID is communicated to the reference nodes, and a sufficient data base for the statistical information described above must be reached.

[0063] To reliably initialize a segment and to ensure that all reference nodes receive the necessary initialization information, the time period At2 that the administration node waits until it begins the next communication phase must be sufficiently long. The length of this time period At2 can have a fixed configuration, be controlled via a control processor or a data processing unit or the flow of this time can be communicated by an external signal or via UWB 500.

[0064] The initialization phase is ended 505 by the administration node in accordance with the conditions for the administration nodes described above, in this exemplary embodiment by the transmission of a command 510. By means of this command, it requests the reference nodes to stop spreading the initialization packages and instead to provide 515 the network with statistics about communication with other participants, wherein provision can be made for forgoing distance measurements for the benefit of pure data communication. During this process, in addition to this, the information collected from the reference nodes specified above relating to listened to participants, signal strengths etc. can in turn be packaged and transmitted 515 as data packages in the form of an XML string or in a text-based or binary exchange format. This exchange of statistics 515 takes place once the command that the administration node has sent, and that announces the end of the initialization phase, has been repeated. If a reference node cannot hear the administration node directly, at least in this way 520 it will be informed of the end of the initialization phase. The reference nodes process 525 the statistical data listened to via the broadcast signal regarding the neighboring situation, and thus supplement their entire database. In further communication packages, this updated and combined statistics database is then finally always made available to the entire segment. Ultimately, all reference nodes including the administration node have consistent information regarding the communication properties in the network.

[0065] After ending the statistics collection process 530, e.g. after an empirically predetermined waiting period which is initiated by an external data processing system via UWB or another signal 535, or if the statistics database has not changed any further over a long period of time, the administration node 540 or an IT system connected to it forms a stable segment structure in the form of functioning daisy chains. This behavior is also shown in FIG. 2c and the corresponding description. Preferably during this process two chains are formed from reference nodes which guarantee as reliable a data exchange as possible. Both chains are preferably of the same length. Alternatively, the chains can also be formed by a ring structure, a star structure or a branched structure of another kind, provided that a linear connection between two reference points is formed at least locally.

[0066] The reference nodes can also automatically end their spreading optionally after a period of time in which they no longer detect a change to the statistics database. The radio communication between the reference nodes can, however, also be ended by spreading the information to the daisy chain via the administration node 545 or the other reference nodes 550, in accordance with the model described below.

[0067] After the daisy chain has been generated, the administration node shares 555 this link with the first chain, along with a command prescribing the construction of the first daisy chain. The behavior of the network is in turn shown in FIG. 2c. This first chain is described in the following as C1. Among other things, the message used contains the length of the chain C1, a counter and the UlDs and final LIDs of the reference nodes in the sequential order in which they are in the chain C1. The message is sent 545 by the administration node firstly to the first reference node of the chain C1, or addressed to it. The first reference node switches to the LID 560 provided for it, increments the counter in the data package and confirms the receipt of the package to the transmitter. Afterwards, it sends the received data package with the incremented counter to the next following participant in the daisy chain. It must be noted that the described acknowledgement process and the forwarding of a piece of daisy chain information can also take place in one step. If the transmitter does not receive a confirmation of receipt of the chain information, it resends the package.

[0068] If the last reference node in the C1 chain has finally received the information about the chain and taken on the correct LID, it starts to send a response data package that confirms the acceptance and correct formation of the daisy chain. The confirmation is transmitted along the daisy chain backwards 570 to the administration node 575. Along with the acceptance confirmation, the data package contains the entire chain of LIDs of the participants via which the data package is further spread. Sender and addressee are also clearly marked in this response package.

[0069] If, for some reason, the daisy chain is interrupted, the reference node, which has lastly successfully received its daisy chain information along the daisy chain but has not received a confirmation from the forwarding process, alternatively starts to send the response acceptance package. The administration node can then decide 580 whether a chain has been formed “sufficiently” correctly, whether another chain configuration must potentially be chosen, or whether the localization segment is in an error state. If it was possible to correctly form the chain, or if the administration node decides to continue the segment configuration process despite erroneous chain formation, it continues 585 to apply 590 the same method that was used to form the chain C1 to the second chain, chain C2. This is also shown in FIG. 2d. The administration node also again receives a response 595 regarding the acceptance of the daisy chain from the formation of this chain. On the basis of this response, the administration node must, in turn, also decide 600 whether, overall, a stable communication structure was able to arise or be formed in the network segment.

[0070] It should be noted that if a ring-shaped chain exists (ring-shaped daisy chain), said response data package can be dispensed with, if the chain formation is successful, since the administration node, in turn, forms the end of the “chain”. Nevertheless, a response package which expresses the success of the process, can be advantageous for the error tolerance in a chain like this. In further structures of the chain, a similar initialization can be achieved via the chained formation of the neighboring structure. The data packages then become more extensive, and also the generation of the acceptance information.

[0071] It should be further noted that the calculation of the daisy chains can also take place in parallel on all reference nodes. By using clear hierarchization and prioritization rules and by ensuring the existence of an identical neighboring and statistics database in all reference nodes of the segment, a similar daisy chain structure in the case of a parallel, isolated calculation can be achieved.

[0072] After the daisy chain has been configured, the administration node 605 starts to communicate or distribute 610 further information that it has about the topology of the entire network firstly along the chain C1. This information consists of information on the transformation of the selected coordinates system into other coordinates systems, an almanac list (called “almanac”), as well as further information that relates to the location in the localization network or a network diagnosis. A specified almanac list includes the existing reference nodes in the entire network and their respective position in the space. In addition to this, the list includes information about each participant which is a unique identifier (“UID”) of the participant in the network unrelated to the respective position in the network, e.g. an inherently known “MAC-ID”. This information can in turn be spread on several pages of a set length. The administration node transmits the information to the first reference node of the chain C1, it receives a confirmation for every transmitted data page. If the process of sending all of the pages has finished, the addressed node 615 in turn sends the same information in the same process to the next node of the chain, and so on. This communication process is repeated until the last reference node in the chain C1 has received the full network information. From here, the receipt of the network information is once again separately acknowledged returning 620 along C1, in a similar way to the process during the formation of C1. The corresponding steps 605, 610, 615 and 620 are then repeated for C2. This process is shown in FIG. 2f. Similar types of broadcast strategies arise for other daisy chain topologies.

[0073] After the receipt and forwarding of the confirmation package by the respective reference node, it 625 generates a TDMA slot map, shown in a table in FIG. 3 as an example, for a localization segment, initially without active participants. The reference node switches to the TDMA mode during this process. After receiving the configuration confirmation from C2 in accordance with the previous paragraph, the administration node waits for a determined amount of time before it announces the successful communication and complete initialization to the network or segment by a separate command. The length of this period of time can be pre-configured, predetermined via a control processor or a data processing unit, or the flow of the time period can be communicated 630 by an external signal or via UWB. It then generates a TMDA slot map itself, which is identical with the respective TDMA slot map of the reference node 635. The network is now completely ready for activity. From this point, the correct flow of this TDMA slot map and the normal measuring process start, in which the administration node announces the successful segment configuration in the first broadcast slot of the TDMA slot map.

[0074] The TDMA slot map shown in FIG. 3a schematically shows three columns and a first column 300 indicating the respective slot (time slot), a second column 305 that indicates the respective addressed communication partner according to the specification in FIG. 1 and a third column 310 indicating the resulting action in the respective slot. The TDMA slot map in this exemplary embodiment consists of 32 slots, however, larger and smaller lengths of the TDMA slot map are also conceivable. In the case of smaller lengths, the number of participating reference nodes and therefore the size of the localization segment or the topology of the DC must be correspondingly adapted. As can be seen in FIG. 3, the administration node, in its first regular forward broadcast package in the first slot of the TDMA slot map, communicates the successful segment configuration to the localization segment. This message is propagated along the daisy chain. It receives the confirmation of this from the daisy chains of the segment via a return broadcast package. The broadcast package that communicates the successful segment configuration is repeated by the administration node with each first slot of the TDMA slot map until a confirmation has been received by all reference nodes. Normally, this is the case after the first cycle of the TDMA slot map. The network segment has then reached its configuration status and is ready for the localization of participants. The slot map used here thus only represents one possible variation and other implementations are conceivable.

[0075] As described above, locating objects behave in a passive way during the entire segment or network initialization process. If this process is complete, they begin to integrate themselves into the localization segment. It should be pointed out at this point that, if the locating object has also listened to the entire initialization communication of a network segment, the registration process drastically shortens, since all current information about the status of a network is already available, and is communicated and processed simultaneously with the transfer of the localization segment in the measurement process. The log-on process then takes place almost immediately and only while communicating a minimum amount of data.

[0076] In order to prevent crosstalk of (UWB) communication channels between different segments of the localization network, it would be advantageous to generate a total of 256 channel bundles or, correspondingly, 1792 channels. Since such a number of orthogonal, i.e. non-cross talking, channels cannot be chosen at random, an approach which can be implemented with significantly less effort is shown in FIG. 3b. The channel bundle that is used in a single segment of the localization network is specified as a whole-number rest of the division of the SID by means of a random, a-priori configurable number of channel bundles, wherein it is of course advantageous, as shown in the example in FIG. 3, to use a square number of a whole number of SIDs, which specifies the length of the edges of the tiles specified in the Figures (in the examples 9 or 25). The selected allocated sequence of SIDS in the examples shown is selected in a regular pattern which represents a suitable implementation in an isotropic space. Depending on the real implementation scenario, a random pattern adapted to the respective usage scenario can be selected to allocate the SID in order to further improve protection from cross-talking. The implementation shown therefore only constitutes one possible embodiment of the method described.

[0077] Although only a few embodiments of the present invention have been shown and described, it is to be understood that many changes and modifications may be made thereunto without departing from the spirit and scope of the invention.