Method and technical system for data transmission

Abstract

The invention relates to a method for data transmission between a first participant (20) and a second participant (20) of a wireless network in a technical system (10), wherein the network has a plurality of participants (20), wherein a characteristic value is assigned to each communication connection (50) between two participants (20) of the wireless network, the characteristic value indicating the probability of correct data transmission via the corresponding communication connection (50); a characteristic value is assigned to a plurality of communication paths between the first participant (20) and the second participant (20), the communication paths each including at least one communication connection (50) between the two participants (20), the characteristic value indicating the probability of correct data transmission via the corresponding communication path; at least one communication path is selected for data transmission based on the characteristic value assigned to the communication path; and data between the first participant (20) and the second participant (20) is transmitted via the at least one selected communication path. The invention also relates to a technical system (10) comprising a wireless network having a plurality of participants (20).

Description

Technical Field

[0001] The invention relates to a method for data transmission between a first participant / user and a second participant of a wireless network in a technical system, wherein the network has a plurality of participants. The invention also relates to a technical system comprising a wireless network with a plurality of participants. Background Art

[0002] The technical system is in particular an industrial application, such as a production plant. The participants of the wireless network are in particular mobile units of the technical system (such as an autonomous vehicle), but also stationary participants (such as gateways, access points or base stations). The participants can communicate with each other via the wireless network and transfer data.

[0003] From the publication DE 102009043060 A1 a technical system is known, which comprises a base station and a plurality of mobile robots. Each of the mobile robots has a communication device, by means of which a communication connection with the base station can be established when the robot is within the effective transmission range of the base station. The robot can also establish a communication connection with other robots via its communication device. The robots and the base station are participants in a wireless network.

[0004] In network technology, a communication connection between two network nodes, i.e. between two participants, is usually modeled binary as being present or not present. Based on this information, data is transmitted via a suitable existing communication connection. This is desirable for communication via a wired network, since interference is physically excluded, in particular, by line shielding. The distribution of data traffic via multiple communication paths that may be required in a mesh network is achieved by load balancing methods, such as the shortest path bridging method (which is described in the IEEE 802.1aq standard).

[0005] In wireless networks, it is not the primary purpose to record a single communication connection between two participants in a binary manner as being present or not present. Due to signal attenuation and possible interference from neighboring systems (especially other participants), a single communication connection may exist, but the quality of data transmission via this communication connection may not be satisfactory.

[0006] The laid-open document DE 10 2010 023 543 A1 discloses a method for data transmission between participants in a wireless network, wherein the data is transmitted via a data channel in a repeated manner.

[0007] The laid-open document DE 10 2007 017 515 B3 discloses a method for data transmission between participants in a wireless network, in particular video telephony or Internet telephony, wherein a method for obtaining link or routing hops is used.

[0008] Publication US 2016 / 0 094 398 A1 discloses a method for transmitting data between participants in a wired or wireless network.

[0009] Publication US 2002 / 0 186 665 A1 discloses a method for data transmission between participants in a wireless network, wherein each node can obtain the routes of other nodes. Summary of the invention

[0010] The object of the invention is to improve a method and a technical system for data transmission between a first participant and a second participant of a wireless network in a technical system. In particular, the quality of the data transmission should be improved. The method enables communication between two participants that cannot communicate directly with each other and evaluates the quality of this indirect connection.

[0011] A method for data transmission between a first participant and a second participant of a wireless network, such as a WLAN, in a technical system is proposed. The technical system is in particular an industrial application, in particular a production plant. The wireless network has a plurality of participants, in particular mobile units, such as autonomous vehicles, and installed participants, such as gateways, access points or base stations.

[0012] According to the invention, a characteristic value is assigned to each communication connection between two participants in a wireless network. The characteristic value indicates the probability of correct data transmission via the corresponding communication connection. The larger the characteristic value, the higher the probability of correct data transmission and the higher the quality of data transmission via the communication connection. In this regard, a communication connection between two participants is understood to be a direct, non-indirect connection between the two participants without an intermediate connection of another participant.

[0013] Furthermore, characteristic values ​​are respectively assigned to a plurality of communication paths between the first participant and the second participant. The characteristic value represents the probability of correct data transmission via the corresponding communication path. The larger the characteristic value, the higher the probability of correct data transmission at this time, and thus the higher the quality of data transmission via the communication path. Here, the communication paths each include at least one direct communication connection between two participants of the wireless network. Here, the plurality of communication paths represent direct connections via a plurality of communication interfaces. Here, the communication interfaces are in particular interfaces using different transmission media, transmission frequencies, modulation types and / or coding.

[0014] Depending on the characteristic values ​​assigned to the communication paths, at least one communication path is selected for data transmission between the first participant and the second participant, and data is transmitted between the first participant and the second participant via the at least one selected communication path.

[0015] Compared to methods for data transmission known from prior art computing, the method for data transmission between a first participant and a second participant in a wireless network according to the invention significantly improves the quality of data transmission. If no direct communication connection is available between the first participant and the second participant, or if the quality of data transmission via a direct communication connection between the first participant and the second participant is unsatisfactory, a communication path can be selected for data transmission, i.e., if such a communication path exists, the quality of data transmission is satisfactory in this communication path. By assigning characteristic values ​​representing the probability of correct data transmission to the communication connection and the communication path, the quality of data transmission can be reflected in more detail and closer to reality than by simply stating the existence of a communication connection between the first participant and the second participant in a binary manner.

[0016] The communication path between the first participant and the second participant comprises, for example, exactly one direct communication connection between the first participant and the second participant. However, it can also be provided that the at least one communication path between the first participant and the second participant comprises a plurality of communication connections respectively between two participants of the wireless network. Here, these communication connections are arranged in series. For example, the communication path between the first participant and the second participant comprises a direct communication connection between the first participant and another participant and a direct communication connection between the other participant and the second participant.

[0017] According to a preferred design of the present invention, the characteristic value assigned to each communication connection between two participants is in the range of 0 to 1. If the characteristic value is equal to 1, the data transmission via the communication connection is completely correct. If the characteristic value is equal to 0, the data transmission via the communication connection is not feasible. Here, the characteristic value assigned to the one communication path is calculated as the product of the characteristic values ​​of the communication connections arranged in series of the communication path. As a result, the characteristic value assigned to the one communication path is also in the range of 0 to 1.

[0018] For example, a communication path includes a first communication connection assigned with a characteristic value P1 and a second communication connection assigned with a second characteristic value P2. Then, the characteristic value P calculated as follows is assigned to the communication path:

[0019] P=P1*P2.

[0020] According to an advantageous embodiment of the invention, a communication path between the first participant and the second participant is selected for data transmission, that is, the communication path is assigned the maximum characteristic value of the characteristic values ​​assigned to the communication paths. In particular, exactly one communication path is selected at this time. If there are multiple communication paths with the same characteristic value, other criteria are used for selection. For example, in this case, the communication path with the least number of direct communication connections is selected.

[0021] According to another advantageous embodiment of the invention, a communication path between the first participant and the second participant is selected for data transmission, the characteristic value of which exceeds a preset limit value. In particular, exactly one communication path is selected at this time. If there are multiple communication paths whose characteristic values ​​exceed the limit value, other criteria are used for selection. For example, in this case, the communication path with the largest characteristic value is selected, or the communication path with the least number of direct communication connections.

[0022] According to another advantageous embodiment of the present invention, multiple communication paths are selected for data transmission. Here, the selected communication paths form a communication group. Here, the communication group is assigned a characteristic value representing the probability of correct data transmission through the communication paths of the communication group.

[0023] According to a further advantageous embodiment of the invention, a plurality of communication paths forming a communication group are selected for data transmission, wherein a characteristic value assigned to the communication group exceeds a predefined limit value.

[0024] According to another advantageous embodiment of the present invention, the communication paths of a communication group are arranged in parallel, so that the communication paths of the communication group are redundant.

[0025] According to an advantageous design of the present invention, the characteristic value assigned to the communication path is in the range of 0 to 1. If the characteristic value is equal to 1, the data transmission through the communication path is completely correct. If the characteristic value is equal to 0, the data transmission through the communication path is not feasible. Here, the characteristic value assigned to the communication group is calculated as the complement of the product of the complements of the characteristic values ​​of the individual communication paths of the communication group. Here, the complement is the difference from 1. As a result, the characteristic value assigned to the communication group is also in the range of 0 to 1.

[0026] For example, a communication group includes a first communication path assigned with a characteristic value P1 and a second parallel communication path assigned with a characteristic value P2. Then, the communication group is assigned with a characteristic value P calculated as follows:

[0027] P = 1-(1-P1)*(1-P2).

[0028] According to an advantageous design of the present invention, the first participant assigns a characteristic value to a communication path between the first participant and the second participant, and / or selects at least one communication path for data transmission. That is, the assignment of characteristic values ​​and the selection of communication paths are performed in a decentralized manner. Preferably, each participant of the wireless network assigns characteristic values ​​to the communication paths from the corresponding participant to other participants, preferably all other participants. Subsequently, the corresponding participant selects a communication path to another participant as required.

[0029] According to another advantageous embodiment of the present invention, the central computer assigns characteristic values ​​to the communication paths between the first participant and the second participant and / or selects at least one communication path for data transmission. That is, the assignment of characteristic values ​​and the selection of communication paths are performed centrally. Preferably, the central computer assigns characteristic values ​​to the communication paths from all participants of the wireless network to other participants, preferably all other participants. Subsequently, the central computer selects the communication path from one participant to another participant as required.

[0030] The technical system according to the invention comprises a wireless network with a plurality of participants. Here, the technical system is configured to implement the method according to the invention.

[0031] According to an advantageous embodiment of the invention, at least one of the participants is designed as a mobile unit, in particular an autonomous vehicle.

[0032] The present invention is not limited to the combination of features described in the claims. For those skilled in the art, other reasonable combinations of the claims and / or individual claim features and / or features of the specification and / or drawings can be obtained, especially from the purpose setting and / or the purpose proposed by comparison with the prior art. BRIEF DESCRIPTION OF THE DRAWINGS

[0033] Now, the invention is explained in detail with reference to the drawings. The invention is not limited to the drawings of the illustrated embodiments. The drawings merely schematically illustrate the subject of the invention. Among them:

[0034] Figure 1 shows a schematic diagram of the technical system,

[0035] Figure 2 A schematic diagram showing the communication connections,

[0036] Figure 3 A schematic diagram showing a communication path,

[0037] Figure 4 shows a schematic diagram of a communication group,

[0038] Figure 5A flow chart with the steps of a method for data transmission is shown. DETAILED DESCRIPTION

[0039] Figure 1 A schematic diagram of a technical system 10 is shown. The technical system 10 is an industrial application, for example a production plant. The technical system 10 has a wireless network, for example a WLAN. The wireless network comprises a plurality of participants 20, in particular mobile units (for example autonomous vehicles) and installed participants (for example gateways, access points or base stations). Data is exchanged between the participants 20 via the wireless network.

[0040] The participant 20 shown here has a first wireless communication interface 1 and a second wireless communication interface 2. The communication interfaces 1, 2 are, for example, WiFi interfaces, Bluetooth interfaces, ZigBee interfaces, optical interfaces or radar interfaces. There is a communication connection 50 between the second wireless communication interfaces 2 of the participant 20. The communication interfaces 1, 2 are not necessarily compatible with each other. For example, wireless communication between the first wireless communication interface 1 and the second wireless communication interface 2 cannot be realized.

[0041] Figure 2 By way of example, a schematic diagram of a communication connection 50 between a first participant 20 designated “A” and a second participant 20 designated “B” is shown. The communication connection 50 is a direct, non-indirect connection between two participants 20 without another participant 20 being connected in between.

[0042] A characteristic value is assigned to the communication connection 50, which represents the probability of a correct data transmission via the communication connection 50. The characteristic value, denoted here by "PAB", lies in the range of 0 to 1.

[0043] Figure 3 By way of example, a schematic diagram of a communication path between a first participant 20 denoted by “A” and a second participant 20 denoted by “C” is shown.

[0044] The communication path includes a communication connection 50 between a first participant 20 denoted by "A" and a further participant 20 denoted by "B", to which the characteristic value denoted by "PAB" is assigned. In addition, the communication path includes a communication connection 50 between the further participant 20 denoted by "B" and a second participant 20 denoted by "C", to which the characteristic value denoted by "PBC" is assigned. In this case, the two communication connections 50 are arranged in series. The communication path is assigned the characteristic value "PAC", which is calculated as the product of the characteristic values ​​of the individual communication connections 50 as follows:

[0045] PAC=PAB*PBC.

[0046] Figure 4 By way of example, a schematic diagram of a communication group between a first participant 20 denoted by “A” and a second participant 20 denoted by “D” is shown. In this case, the communication group comprises two parallel communication paths, whereby the communication paths are redundant.

[0047] The one communication path comprises a communication connection 50 between a first participant 20 denoted by "A" and another participant 20 denoted by "B", to which the characteristic value denoted by "PAB" is assigned. In addition, the one communication path comprises a communication connection 50 between the other participant 20 denoted by "B" and a second participant 20 denoted by "D", to which the characteristic value denoted by "PBD" is assigned. In this case, the two communication connections 50 are arranged in series.

[0048] The further communication path includes a communication connection 50 between a first participant 20 denoted by "A" and a further participant 20 denoted by "C", to which the characteristic value denoted by "PAC" is assigned. In addition, the further communication path includes a communication connection 50 between the further participant 20 denoted by "C" and a second participant 20 denoted by "D", to which the characteristic value denoted by "PCD" is assigned. In this case, the two communication connections 50 are arranged in series.

[0049] The communication group is assigned a characteristic value "PAD" which is calculated as the complement of the product of the complements of the characteristic values ​​of the individual communication paths as follows:

[0050] PAD=1-(1-PAB*PBD)*(1-PAC*PCD).

[0051] Figure 5 A flow chart with the steps of a method for data transmission is shown. The method starts with step S0.

[0052] In step S1, each participant 20 of the wireless network receives information about the communication connections 50 with adjacent directly reachable participants 20 during operation of the wireless network. This information is received, for example, in the form of a data block error rate or a complement of a data block error rate. It is conceivable that backup traffic is generated when no communication is taking place via the wireless communication interface 1, 2 of the participant 20. In this case, the backup traffic consists in particular of beacon frames or Hello messages of different network protocols.

[0053] The data group error rate is determined over a defined time period as the ratio of the number of messages not received in the time period to the total number of messages predicted. Typically, the time period lasts on the order of 1 s to 100 s. In very dynamic networks, when the participants move relatively quickly and frequently, the time period is selected to be shorter, and in static applications with essentially stationary participants 20, the time period is selected to be longer. Short time periods allow for a rapid update of information. Long time periods allow for a high resolution in the data group error rate. In messages in which time-critical information is transmitted (in which a maximum waiting time is preset), the communication quality is calculated in a time period whose duration corresponds to the waiting time or a portion of the waiting time.

[0054] In step S2, each participant 20 of the wireless network exchanges information about the quality of all communication connections 50 with directly reachable participants 20. The quality of a communication connection 50 is defined by the probability that a data packet can be transmitted via this communication connection 50. The probability is calculated as the complement of the previously determined data set error rate. A characteristic value representing the probability is assigned to each communication connection 50, and the characteristic value is in the range of 0 to 1. A communication connection 50 that does not exist between two participants 20 is assigned the characteristic value 0.

[0055] The information received by the directly reachable participants 20 of the wireless network about the quality of the communication connection 50 is combined to form network connection information about the quality of the direct connection. The collection and combination of the network connection information can be carried out decentralized or centrally. In the case of decentralized combination, single points of failure are eliminated, which leads to a higher stability of the entire system. In the case of central combination, due to the greater available storage resources, the information for large wireless networks with many participants 20 can also be stored completely.

[0056] In step S3, the quality of the indirect connection within the network is calculated from the network connection information. Here, the calculation takes into account the transmission probability through serial and parallel connections. For example, such an eigenvalue is assigned to a communication path including a plurality of serially arranged communication connections 50, that is, the eigenvalue is calculated as the product of the eigenvalues ​​of the individual communication connections 50 arranged in series. For example, such an eigenvalue is assigned to a communication group including a plurality of parallelly arranged communication paths, that is, the eigenvalue is calculated as the complement of the product of the complements of the eigenvalues ​​of the individual communication paths of the communication group. This calculation method can eliminate loops within the communication path and thus bring more efficient communication.

[0057] In step S4, based on the existing network connection information, possible routes from individual participants 20 of the wireless network to other participants 20 are evaluated. Here, based on the characteristic values ​​assigned to the communication paths and the communication groups, at least one communication path for data transmission between the first participant 20 and the second participant 20 is selected.

[0058] In a first possible embodiment, the communication path assigned with the largest characteristic value is selected for data transmission between the first participant 20 and the second participant 20. That is, the most reliable communication path from the first participant 20 to the second participant 20 is selected, which has the highest transmission probability. If two communication paths have the same transmission probability, the shorter communication path is selected. The length of the communication path is defined by the number of serial communication connections 50 of the communication path. If two communication paths have the same transmission probability and the same length, the communication path that is discovered first is selected.

[0059] In a second feasible embodiment, a communication group including a plurality of parallel communication paths is selected for data transmission between a first participant 20 and a second participant 20. Here, the characteristic value assigned to the communication group exceeds a preset limit value. For example, the number of redundant communication paths required for a transmission probability preset by a data packet or application is calculated, and the limit value corresponds to this number. Selecting a communication group with a plurality of redundant communication paths brings many advantages. In particular, for time-critical data groups, transmission security is achieved by redundant communication paths rather than by repetition of messages. When the waiting time requirements for data transmission packets require it, the length of the available communication path can be limited. By using redundant partial paths, the transmission probability is increased even if the destination of the communication path is not fully redundantly bound.

[0060] The entire wireless network can be evaluated, while only the information for the direct communication connection 50 is recorded. This reduced need for network monitoring reduces interference with primary communication. Complex multi-hop routes can also be selected without a complete network scan. This reduces the latency of transmission in the network with low overhead. The description of the communication path for the transmitted data group is achieved by the distance vector method, wherein the method described above optimizes the distance vector method because the individual participants 20 can respond to topological changes in their direct neighbors and can exchange available network information more frequently under the same network load. In the distance vector method, the transmitted data group only contains the final destination, but does not contain information about the route to be used. At this time, each participant 20 that should continue to transmit the data group uses its known network information to determine the optimal route. This method is used at this time because it is possible and likely that the topological information about the remote network part is outdated at the transmitting participant 20. Here, the possibility of updating the route of the data group as the distance from the receiver increases improves the probability of successful transmission.

[0061] The decentralized provision and analysis of connection information increases the stability of the entire system. Incompatible communication standards can be combined mathematically into a single network and allow the wireless network to be evaluated across interfaces. Incompatible, redundant communication standards between two communication standards are considered as parallel communication paths. The connection quality can be modeled relatively simply by the ratio of the number of received and sent, or rather predicted, messages, regardless of why no messages were received. Possible reasons for this are, for example, interference from similar systems, noise or signal attenuation.

[0062] The method is a method for selecting a route for a message, in particular a communication path, through a complex multi-hop network. The method is able to calculate the reliability of the network based on random data for local communication connections 50 (i.e. communication connections 50 that are directly topologically adjacent to a participant 20) and global connections (i.e. connections to participants 20 that are indirectly reachable via a communication path). Based on the calculated reliability, the most reliable communication path can be selected. The system is able not only to calculate the probability of a successful transmission between a sender and a receiver, but also to determine the most reliable communication path between them.

[0063] Each participant 20 performs the operations described below for distributing information within the wireless network. First, in step S1, the entire network is acquired directly and indirectly based on the available information. In step S2, information is exchanged. In step S3, the information is evaluated. Next, in step S4, the most reliable route to all other participants 20 is searched. Based on the found route and the information about the entire network, messages are sent to the network and messages are received from the network. If global network information is received, it is received as an update. In addition, local information can be updated based on the sent and received data. Next, the evaluation is repeated based on the updated information.

[0064] In a method for evaluating an entire network, a network with n participants 20 is shown, for example, in the form of an n*n-dimensional connection matrix. The connection matrix contains eigenvalues ​​representing the probability of direct successful data transmission between all possible communication connections 50. These eigenvalues ​​range from 0 (inclusive) to 1 (inclusive). The eigenvalue "0" indicates that direct transmission is impossible, and the eigenvalue "1" means that error-free transmission is guaranteed. The model is able to superimpose parallel networks using different communication methods and calculate the probability of transmission through indirect connections. Indirect connection means that the message is continuously transmitted through the participant 20 in the network through the communication path. Here, the model can consider that the network is loop-free. This means that, after transmitting a message, for example, through connection AB, the message will not be retransmitted through connection AB or connection BA.

[0065] The proposed system is able to identify and use redundant communication paths. In this case, the communication paths can be redundant in different ways. A non-redundant communication path means that there is only exactly one connection between the sender and the receiver. In addition, the communication path can be partially redundant or completely redundant. Partial redundancy means that parts of the communication path between the sender and the receiver can be copied via parallel communication paths. In addition, it is not possible to distinguish whether a part of the communication path is single-time redundant or multi-time redundant. With this system, not only sending via other participants 20 but also using other communication methods can be called redundant. Finally, there are also completely redundant communication paths, in which there are complete alternative routes between the sender and the receiver. Complete redundancy is mainly manifested in that there are no common participants 20 on at least two completely redundant communication paths.

[0066] As explained in step S4 of the method, two different implementations of the selection of the route are conceivable. In this case, the first implementation is used when the application does not specify a target transmission probability. In this case, the highest possible transmission probability is then sought, while taking into account the current network load when redundant routes are occupied. If a target transmission probability is specified by the application, the number of redundant communication paths used can be limited, for example to the three most reliable communication paths.

[0067] A variety of network protocols all contain so-called Hello messages or Beacon messages that can be advantageously used by the methods described herein. This is a message sent at regular intervals by each participant of the network. The message is sent as a broadcast and is received by each other participant that is within the effective distance of the sender. In a wireless network, the effective distance is mostly a distance related to the presence of obstacles that weaken the signal. The participant examines how frequently he or she receives Hello messages or Beacon messages from other participants. It is also assumed that each participant knows which other participant is in the wireless network. This information is obtained, for example, through the participant's programming or local configuration scheme, or is obtained by querying at the superior system before starting operation. It is also feasible to subsequently join the participant in the network.

[0068] When participant p observes the network for a certain period of time, the possible number of messages that participant p receives from participant n during this period is M n N of the Beacon messages n Thus, for the direct communication connection 50, the reliability is obtained:

[0069]

[0070] Here, the following apply: Combined with the information about the received data sets of all other participants, this results in the connection vector with the i+1 participants in the network:

[0071]

[0072] This is also called local network information. The participants then send this information to the network with other participants. Thus, the participants can obtain information about indirect connections.

[0073] In an advantageous embodiment, connection information is not simultaneously sent to participants from whom no message was received (i.e., applicable ), which saves network resources. Depending on the type of network used, the network load and the configuration scheme of the system described here, this information is distributed in the network in different ways.

[0074] In an advantageous embodiment, the probabilities are written as a matrix. In this case, the addresses of the known participants are associated with the indices of the matrix. The advantage of this embodiment using matrix calculations is that it can be implemented very efficiently in a computer system.

[0075] Now, if a participant receives local area information of other participants, said participant can supplement this local area information to its own local area information:

[0076]

[0077] This is the global connection information for direct communication connections. In this case, the corresponding participant updates the row when there is new information. 1 is a square matrix, since for every connection AB stored in this matrix, a connection BA must also be stored. 1 It does not need to be a symmetric matrix. To determine the multi-hop routing in this network, continue to process R 1 .

[0078] First, according to dR, it is assumed that the R of the variable R that changes in the subsequent process j (At the beginning = R 1 ). In this case, j is the maximum number of communication connections for which the network is currently checked for depth. The depth of the network here refers to the maximum number of possible transfers on a route. It is checked how the connection of participant i is spread out for d communication connections. The method can then be repeated for the other communication connections and for the remaining participants.

[0079] in,

[0080] and,

[0081] Here, represents an element-by-element multiplication operation. I defines an identity matrix of a certain size, in this case, an identity matrix of size (i+1):

[0082]

[0083] In order to continue the calculation step, the node's connection with itself is first removed from the matrix, or more precisely, set to 0. S (A) is the random complement of the element-by-element probability in the matrix A. The information of the connection of participant i is stored in the vector c i , and this information is removed from the matrix by setting column i in dR to 0. For each communication connection d for which the network should be checked, the following process is performed:

[0084] By C i =B(C i ) i Expanded into a square matrix. Among them:

[0085]

[0086] The probabilities of two successive communication connections are combined by element-wise multiplication: Next, the random complement of the matrix is ​​reduced in the row direction by multiplication to obtain the connection probability of the node under consideration: in:

[0087]

[0088] Next, the result is combined with the previously calculated connection probability c i Combined into C b =[K S (c i ,D i )], and then again multiply in the row direction and calculate the complementary probability:

[0089] The combination, or more precisely the concatenation, of two vectors / matrices is calculated as follows:

[0090]

[0091] After all these operations, each communication connection that has already been used for transmission in this case is removed from dR. This removal of the communication connections that have already been involved ensures that the network under consideration has no loops and that the calculated probabilities are correct. A loop in a network always means that a communication connection is double-checked in at least one direction. Therefore, by removing the communication connections whose transmission probability is already included in the reachability probability of the node, the formation of loops that distort the reachability probability of the achievable node in the mathematical consideration is prevented.

[0092]

[0093] Here, It is an element-by-element multiplication operation. is the transposed matrix C i .

[0094] Here, |φ i |(A) means setting the elements of the matrix to 1 or 0 depending on their contents.

[0095]

[0096] To perform the next operation, use the new probability C i =C b . The probability of sending to itself is set to 0 again. Therefore, the connection probability for the longer communication path j can be calculated.

[0097] To evaluate the entire network, this process is carried out for each known participant up to the longest number of significant communication connections. The method is optimal for computer-based calculations of very large networks and can be fully vectorized and parallelized.

[0098] Reference numerals list

[0099] 1 First wireless communication interface

[0100] 2 Second wireless communication interface

[0101] 3 Data processing unit

[0102] 4. First data storage unit

[0103] 5 Second data storage unit

[0104] 10 Technical Systems

[0105] 20 participants

[0106] 50 Communication Connections

Claims

1. A method for data transmission between a first participant (20) and a second participant (20) of a wireless network in a technical system (10), wherein: The network has a plurality of participants (20), wherein: A characteristic value is respectively assigned to each communication connection (50) between two participants (20) in a wireless network. The characteristic value represents the probability of correct data transmission via the corresponding communication connection (50); Assigning characteristic values ​​to a plurality of communication paths between the first participant (20) and the second participant (20), the communication paths each comprising at least one communication connection (50) between two participants (20), the characteristic values ​​representing the probability of correct data transmission via the corresponding communication path; selecting at least one communication path for data transmission based on the characteristic values ​​assigned to the communication paths; transmitting data between a first participant (20) and a second participant (20) via the selected at least one communication path; It is characterized in that the following multiple communication paths are selected for data transmission, that is, the communication group formed by the multiple communication paths is assigned a characteristic value representing the probability of correct data transmission through the communication paths of the communication group, wherein the communication paths of a communication group are arranged in parallel, and wherein the characteristic value assigned to the communication group exceeds a preset limit value.

2. The method according to claim 1, characterized in that At least one communication path includes a plurality of serially arranged communication connections (50).

3. The method according to claim 2, characterized in that The characteristic value assigned to a communication connection (50) is in the range from 0 to 1, and The characteristic value assigned to a communication path is calculated as the product of the characteristic values ​​of the individual serially arranged communication connections (50) of the communication path.

4. The method according to claim 1, characterized in that: Exactly one communication path is selected for data transmission, ie the communication path to which the greatest characteristic value of the characteristic values ​​assigned to the communication paths is assigned.

5. The method according to claim 1, characterized in that Exactly one communication path is selected for data transmission, ie the characteristic value of said communication path exceeds a predefined limit value.

6. The method according to claim 1, characterized in that The number of redundant communication paths required for a transmission probability specified by a data packet or an application is calculated, and the limit value corresponds to this number.

7. The method according to claim 1, characterized in that The characteristic value assigned to a communication path ranges from 0 to 1. The eigenvalue assigned to a communication group is calculated as the complement of the product of the complements of the eigenvalues ​​of the respective communication paths of the communication group.

8. The method according to claim 1, characterized in that A first participant (20) assigns a characteristic value to a communication path between the first participant (20) and a second participant (20) and / or selects the at least one communication path for data transmission.

9. The method according to claim 1, characterized in that: A central computer assigns characteristic values ​​to communication paths between a first participant (20) and a second participant (20) and / or selects at least one communication path for data transmission.

10. A technical system (10) comprising a wireless network with a plurality of participants (20), characterized in that The technical system is designed to carry out the method according to any of the preceding claims.

11. The technical system (10) according to claim 10, characterized in that At least one of the participants (20) is designed as a mobile unit.

Images