Data transmission method based on neighbor domain broadcast

Abstract

The invention discloses a data transmission method based on neighbor domain broadcast. The method comprises the following steps: acquiring network topology structure information and routing table information; acquiring source node information, to-be-sent data and destination node information; performing neighborhood analysis processing on the source node information and the network topology structure information to obtain a source node neighborhood node set; and according to the network topology structure information, the routing table information and the source node neighborhood node set, performing neighborhood broadcast transmission processing on the source node information, the to-be-sent data and the destination node information to complete the data transmission process of the to-be-sent data. According to the method, neighbor domain broadcast and unicast are combined, transmission of network data is completed, the adaptability of the mobile ad hoc network to node movement is improved, and the method can be used for solving the problem of supporting node mobility by centerless wireless networks such as a wireless mobile ad hoc network and a sensor network.

Description

Technical Field

[0001] The present invention relates to the field of network communication and the technical field of self-organizing network, and in particular to a data transmission method based on neighbor domain broadcasting. Background Art

[0002] Unicast and broadcast are terms used to describe the communication between network nodes. The communication between network nodes is like a conversation between people. If one person talks to another person, it is described as "unicast" in network technology terms. At this time, the reception and transmission of information are only carried out between two nodes. Unicast has been widely used in the network, and most of the data on the network is transmitted in the form of unicast. "Point to Point" is usually used instead of "unicast", and unicast is generally used in contrast to broadcast.

[0003] Broadcast is a one-to-all communication mode between nodes. The network unconditionally replicates and forwards the signals sent by each node. All nodes can receive all information regardless of whether they need it or not. Since it does not require path selection, its network cost can be very low. Broadcast is widely used in the network. For example, the process of a client automatically obtaining an IP address through DHCP is achieved through broadcast. Compared with unicast, broadcast occupies almost all bandwidth of the network within the subnet and is prone to collision and interference.

[0004] In wireless networks, both unicast and broadcast are sent through shared wireless channels, and all nodes within the communication range can receive the sent data. The difference is that nodes do not process unicast data whose destination address is not their own, but need to process and forward received broadcast data. In addition, the transmission of unicast data in the network requires the prior knowledge of the data transmission path, and the data is passed to the destination node through the nodes on the transmission path (relay nodes). Generally speaking, the transmission path problem is solved through routing protocols; while the transmission of broadcast data does not require the prior knowledge of the data transmission path.

[0005] For the broadcast mode, the quality of existing network data transmission depends on the quality of the routing algorithm, and the existing table-driven wireless routing protocol and its improved protocol can only adapt to the network topology changes caused by link status changes, node movement, etc. to a certain extent. If the network topology changes and the routing protocol has not completed the routing table update caused by the topology change, data transmission according to the routing table during the data transmission process will cause packet loss, affecting the data transmission performance of the network. Summary of the invention

[0006] The present invention mainly solves the problem that the existing network data transmission protocol is difficult to adapt to the network topology changes caused by link state changes, node movement and other reasons, resulting in the limitation of network transmission protocol.

[0007] In a first aspect of an embodiment of the present application, a data transmission method based on neighbor domain broadcast is disclosed, including:

[0008] S1, obtaining network topology information and routing table information; the routing table information includes the information transmission path between every two nodes in the communication network; the information transmission path is a sequence of several nodes in a preset order; the network topology information includes node information included in the communication network and connection information between each node; the connection information includes whether it is connected and the length of the connection path;

[0009] S2, obtain source node information, data to be sent and destination node information;

[0010] S3, performing neighborhood analysis on the source node information and the network topology structure information to obtain a set of neighboring nodes of the source node;

[0011] S4, performing neighbor domain broadcast transmission processing on the source node information, the data to be sent and the destination node information according to the network topology information, the routing table information and the source node neighbor node set, and completing the data transmission process of the data to be sent.

[0012] The neighborhood analysis process is performed on the source node information and the network topology structure information to obtain a source node neighborhood node set, including:

[0013] S301, setting the maximum hop value y;

[0014] S302, acquiring hop values ​​from all nodes connected to the source node to the source node according to the source node information and the network topology information;

[0015] S303, determining that among all nodes connected to the source node, nodes having a hop value less than or equal to y are adjacent nodes of the source node;

[0016] S304: Determine all adjacent nodes of the source node as a neighborhood node set of the source node.

[0017] The neighborhood analysis process is performed on the source node information and the network topology structure information to obtain a source node neighborhood node set, including:

[0018] Using the network topology information, a node distance matrix and a node hop count matrix are constructed; the element R in the i-th row and j-th column of the node distance matrix ij, represents the distance information between the i-th node and the j-th node in the communication network; the element T of the i-th row and j-th column of the node hop count matrix ij , represents the hop value between the i-th node and the j-th node in the communication network;

[0019] Performing distance threshold calculation processing on the node distance matrix and the node hop count matrix to obtain a distance threshold vector; the elements of the distance threshold vector are the distance thresholds of each node;

[0020] Obtaining a distance threshold of a source node from the distance threshold vector;

[0021] A source node neighborhood node set is constructed by using all nodes in the communication network whose distances to the source node are less than a distance threshold.

[0022] The expression for the distance threshold calculation process is:

[0023]

[0024] Among them, d i is the i-th element of the distance threshold vector, is the distance threshold of the i-th node, M is the total number of nodes in the communication network, ω 1 and ω 2 are the preset first weight value and the second weight value respectively, and ξ is the preset deviation value.

[0025] The process of performing neighbor domain broadcast transmission processing on the source node information, the data to be sent and the destination node information according to the network topology information, the routing table information and the source node neighbor node set to complete the data transmission process of the data to be sent includes:

[0026] S41, searching and obtaining the information transmission path from the source node to the destination node in the routing table information;

[0027] S42, determining the next-hop relay node R1 of the source node according to the information transmission path;

[0028] S43, encapsulating the data to be sent, the relay node R1 information, the life cycle, the source node information and the destination node information to obtain broadcast data information; setting the life cycle of the broadcast data information to y; the life cycle of the broadcast data information is y, which means that the broadcast data information can be broadcast and transmitted at most y times in the source node neighboring node set of the source node;

[0029] S44, broadcasting the broadcast data information in a set of neighboring nodes of the source node; for a node that receives the broadcast data information, reducing the life cycle of the received broadcast data information by 1;

[0030] S45, determining a node in the source node neighboring node set that receives the broadcast data information;

[0031] S46, determining whether the node receiving the broadcast data information is a destination node, and obtaining a first determination result;

[0032] If the first determination result is yes, extract the data to be sent from the broadcast data information, and complete the data transmission process of the data to be sent;

[0033] If the first determination result is no, execute S47;

[0034] S47, determining whether the node receiving the broadcast data information is the relay node R1, and obtaining a second determination result; if the second determination result is yes, determining whether the relay node R1 receives the broadcast data information for the first time, and obtaining a third determination result;

[0035] If the third determination result is yes, according to the information transmission path, using the relay node R1 as the source node, performing neighborhood analysis processing on the source node information and the network topology structure information to obtain a source node neighborhood node set, and executing S42; if the third determination result is no, no operation is performed;

[0036] If the second determination result is no, a transmission selection determination operation is performed on the node that receives the broadcast data information.

[0037] The step of performing a transmission selection and discrimination operation on the node receiving the broadcast data information includes:

[0038] Determine whether the node receiving the broadcast data information satisfies two conditions at the same time: receiving the broadcast data information for the first time and the life cycle of the broadcast data information being greater than 0, to obtain a fourth determination result;

[0039] If the fourth determination result is yes, performing a domain update transmission operation on the node and network topology structure information that received the broadcast data information;

[0040] If the fourth determination result is no, no operation is performed.

[0041] The performing a domain update transmission operation on the node and network topology structure information that received the broadcast data information includes:

[0042] Performing neighborhood analysis processing on the nodes and network topology information that received the broadcast data information to obtain a set of receiving neighborhood nodes; determining whether the set of receiving neighborhood nodes includes an active node or a relay node R1 to obtain a fifth discrimination result; when performing neighborhood analysis processing on the nodes and network topology information that received the broadcast data information, the maximum hop value set is the life cycle of the broadcast data information;

[0043] If the fifth determination result is yes, the source node neighbor node set is updated to the receiving neighbor node set, the source node is updated to the node that receives the broadcast data information, and S44 is executed;

[0044] If the fifth determination result is no, no operation is performed.

[0045] In a second aspect of an embodiment of the present application, a data transmission device based on neighbor domain broadcast is disclosed, the device comprising:

[0046] A memory storing executable program code;

[0047] a processor coupled to the memory;

[0048] The processor calls the executable program code stored in the memory to execute the data transmission method based on neighbor domain broadcast.

[0049] According to a third aspect of an embodiment of the present application, a computer-storable medium is disclosed, wherein the computer-storable medium stores computer instructions, and when the computer instructions are called by a computer, they are used to execute the data transmission method based on neighbor domain broadcast.

[0050] According to a fourth aspect of the embodiments of the present application, an information data processing terminal is disclosed, wherein the information data processing terminal is used to implement the data transmission method based on neighbor domain broadcast.

[0051] The beneficial effects of the present invention are:

[0052] This scheme uses the properties of unicast transmission to determine the next hop of data transmission by querying the routing table; combined with the properties of broadcast, by broadcasting in the n-hop neighbor domain, the direction and range of data transmission are constrained, and the data to be transmitted is correctly delivered to the next hop node. This data transmission method can well avoid the situation where the next hop in the transmission path is unreachable due to changes in network topology and failure to update the routing table in time, improve the success rate of data transmission during the convergence of the routing protocol, increase the network's support for node mobility and link state changes, and enhance the robustness of network data transmission. The forwarding method of the n-hop neighbor domain and non-relay nodes directly controls the direction and maximum range of local data broadcast (when n=2, the maximum broadcast range is 2 hops; when n=3, the maximum broadcast range is 3 hops). This value should not be too large, and it is best to take 2. When n is 3 or even larger, on the one hand, local broadcast will cause a sharp increase in system overhead; on the other hand, if the sent data has reached the next hop node in the 1-hop or 2-hop broadcast process, the additional broadcast does not bring any benefits. The node determines whether it is the first time to receive certain data by, but is not limited to, using the data packet sequence number, that is, each data packet generates a fixed sequence number at the source node, and the sequence number remains unchanged during the data transmission and forwarding process.

[0053] The present invention organically combines local broadcast and unicast, and improves the success rate of receiving data at the next hop in the transmission path when the network topology changes and the node's routing table is not updated in time, increases the network's support for node mobility and link status changes, and enhances the robustness of network data transmission. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] Figure 1 1 is a flow chart for implementing the method of the present invention;

[0055] Figure 2 A schematic diagram of a mobile ad hoc network of the present invention;

[0056] Figure 3 A diagram showing the topological structure change of the mobile ad hoc network caused by the movement of node 15;

[0057] Figure 4 This is a diagram showing the topology changes of the mobile ad hoc network caused by the movement of node 7. DETAILED DESCRIPTION

[0058] In order to better understand the content of the present invention, an embodiment is given here.

[0059] Figure 1 1 is a flow chart for implementing the method of the present invention; Figure 2 A schematic diagram of a mobile ad hoc network of the present invention; Figure 3 A diagram showing the topological structure change of the mobile ad hoc network caused by the movement of node 15; Figure 4 This is a diagram showing the topology changes of the mobile ad hoc network caused by the movement of node 7.

[0060] In a first aspect of an embodiment of the present application, a data transmission method based on neighbor domain broadcast is disclosed, including:

[0061] S1, obtaining network topology information and routing table information; the network topology information and the routing table information include an information transmission path between every two nodes in the communication network; the information transmission path is a sequence of several nodes in a preset order; the network topology information includes node information included in the communication network and connection information between each node; the connection information includes whether it is connected and the length of the connection path;

[0062] S2, obtain source node information, data to be sent and destination node information;

[0063] S3, performing neighborhood analysis on the source node information and the network topology structure information to obtain a set of neighboring nodes of the source node;

[0064] S4, performing neighbor domain broadcast transmission processing on the source node information, the data to be sent and the destination node information according to the network topology information, the routing table information and the source node neighbor node set, and completing the data transmission process of the data to be sent.

[0065] The neighborhood analysis process is performed on the source node information and the network topology structure information to obtain a source node neighborhood node set, including:

[0066] S301, setting the maximum hop value y;

[0067] S302, acquiring hop values ​​from all nodes connected to the source node to the source node according to the source node information and the network topology information;

[0068] S303, determining that among all nodes connected to the source node, nodes having a hop value less than or equal to y are adjacent nodes of the source node;

[0069] Determine all adjacent nodes of the source node as the source node neighborhood node set;

[0070] The neighborhood analysis process is performed on the source node information and the network topology structure information to obtain a source node neighborhood node set, including:

[0071] Using the network topology information, a node distance matrix and a node hop count matrix are constructed; the element R in the i-th row and j-th column of the node distance matrix ij , represents the distance information between the i-th node and the j-th node in the communication network; the element T of the i-th row and j-th column of the node hop count matrixij , represents the hop value between the i-th node and the j-th node in the communication network;

[0072] Performing distance threshold calculation processing on the node distance matrix and the node hop count matrix to obtain a distance threshold vector; the elements of the distance threshold vector are the distance thresholds of each node;

[0073] Obtaining a distance threshold of a source node from the distance threshold vector;

[0074] Using all nodes in the communication network whose distance from the source node is less than a distance threshold, a neighborhood node set of the source node is constructed;

[0075] The expression for the distance threshold calculation process is:

[0076]

[0077] Among them, d i is the i-th element of the distance threshold vector, is the distance threshold of the i-th node, M is the total number of nodes in the communication network, ω 1 and ω 2 are respectively a preset first weight value and a second weight value;

[0078] The process of performing neighbor domain broadcast transmission processing on the source node information, the data to be sent and the destination node information according to the network topology information, the routing table information and the source node neighbor node set to complete the data transmission process of the data to be sent includes:

[0079] S41, searching and obtaining the information transmission path from the source node to the destination node in the routing table information;

[0080] S42, determining the next-hop relay node R1 of the source node according to the information transmission path;

[0081] S43, encapsulating the data to be sent, the relay node R1 information, the life cycle, the source node information and the destination node information to obtain broadcast data information; setting the life cycle of the broadcast data information to y; the life cycle of the broadcast data information is y, which means that the broadcast data information can be broadcast at most y times in the source node neighboring node set of the source node;

[0082] S44, broadcasting the broadcast data information in a set of neighboring nodes of the source node; the node receiving the broadcast data information reduces the life cycle of the broadcast data information by 1;

[0083] S45, determining a node in the source node neighboring node set that receives the broadcast data information;

[0084] S46, determining whether the node receiving the broadcast data information is a destination node, and obtaining a first determination result;

[0085] If the first determination result is yes, extract the data to be sent from the broadcast data information, and complete the data transmission process of the data to be sent;

[0086] If the first determination result is no, execute S47;

[0087] S47, determining whether the node receiving the broadcast data information is the relay node R1, and obtaining a second determination result; if the second determination result is yes, determining whether the relay node R1 receives the broadcast data information for the first time, and obtaining a third determination result;

[0088] If the third determination result is yes, according to the information transmission path, using the relay node R1 as the source node, performing neighborhood analysis processing on the source node information and the network topology structure information to obtain a source node neighborhood node set, and executing S42; if the third determination result is no, no operation is performed;

[0089] If the second determination result is no, performing a transmission selection determination operation on the node receiving the broadcast data information;

[0090] The step of performing a transmission selection and discrimination operation on the node receiving the broadcast data information includes:

[0091] Determine whether the node receiving the broadcast data information satisfies two conditions at the same time: receiving the broadcast data information for the first time and the life cycle of the broadcast data information being greater than 0, to obtain a fourth determination result;

[0092] If the fourth determination result is yes, performing a domain update transmission operation on the node and network topology structure information that received the broadcast data information;

[0093] If the fourth determination result is no, no operation is performed;

[0094] The performing a domain update transmission operation on the node and network topology structure information that received the broadcast data information includes:

[0095] Performing neighborhood analysis processing on the nodes and network topology information that received the broadcast data information to obtain a set of receiving neighborhood nodes; determining whether the set of receiving neighborhood nodes includes an active node or a relay node R1 to obtain a fifth discrimination result; when performing neighborhood analysis processing on the nodes and network topology information that received the broadcast data information, the maximum hop value set is the life cycle of the broadcast data information;

[0096] If the fifth determination result is yes, the source node neighbor node set is updated to the receiving neighbor node set, the source node is updated to the node that receives the broadcast data information, and S44 is executed;

[0097] If the fifth determination result is no, no operation is performed;

[0098] When performing neighborhood analysis on the nodes and network topology information of the broadcast data information to obtain a set of receiving neighborhood nodes, the method from S301 to S303 may be used, and the maximum hop value set is the life cycle of the broadcast data information;

[0099] The neighborhood analysis process of the source node information and the network topology structure information described in S47 to obtain the source node neighborhood node set may adopt the methods of S301 to S303.

[0100] The distance threshold calculation process is calculated as follows:

[0101]

[0102] Among them, R ij is the element in the i-th row and j-th column of the node distance matrix R, T ij is the element of the i-th row and j-th column of the node hop count matrix T, d i is the i-th element of the distance threshold vector, is the distance threshold of the i-th node, and M is the total number of nodes in the communication network.

[0103] The broadcasting of the broadcast data information in the source node neighboring node set is to send the broadcast data information to all nodes in the source node neighboring node set.

[0104] The broadcast transmission is to send a message to all nodes in the network or neighborhood node set.

[0105] In a second aspect of an embodiment of the present application, a data transmission device based on neighbor domain broadcast is disclosed, the device comprising:

[0106] A memory storing executable program code;

[0107] a processor coupled to the memory;

[0108] The processor calls the executable program code stored in the memory to execute the data transmission method based on neighbor domain broadcast.

[0109] According to a third aspect of an embodiment of the present application, a computer-storable medium is disclosed, wherein the computer-storable medium stores computer instructions, and when the computer instructions are called by a computer, they are used to execute the data transmission method based on neighbor domain broadcast.

[0110] According to a fourth aspect of the embodiments of the present application, an information data processing terminal is disclosed, wherein the information data processing terminal is used to implement the data transmission method based on neighbor domain broadcast.

[0111] The fifth aspect of the embodiment of the present application discloses a data transmission method based on neighbor domain broadcasting. The prerequisite for the operation of this method is that the mobile self-organizing network completes network synchronization, neighbor discovery and route selection processes, that is, the nodes in the network have the ability to send network data according to the routing table, but the specific implementation methods of network synchronization, neighbor discovery, route selection, etc. are not limited here.

[0112] The neighbor domain of node a refers to the local area centered on node a through the neighbor discovery process, which contains node a and its neighbor nodes. If the maximum number of hops from the neighbor nodes in the neighbor domain of node a to node a is n, then the neighbor domain is called the n-hop neighbor domain of node a, denoted by N a [n].

[0113] The network node establishes a transmission path to the destination node through the routing selection process. The routing selection can adopt active routing or passive routing. The transmission path can be recorded by recording the entire path or the next hop. This method does not restrict the specific implementation method of the above strategy, but requires the network node to obtain at least the next hop node to the destination node through the routing selection process.

[0114] At this time, when the source node in the network has data to send to the destination node, it follows the following strategy:

[0115] The source node S queries the routing table to determine the next-hop relay node Ri to the destination node D, and encapsulates the source address S_id, the destination address D_id and the address Ri_id of the next-hop relay node into the data to be sent, and encapsulates the data to be sent as broadcast data, setting the life cycle of the broadcast data to n-1 (the data can be broadcast n times, that is, the data can be broadcast in the n-hop neighbor domain N centered on the source node S). S [n] broadcast), and then broadcast the data.

[0116] Node A that receives the broadcast data parses the data and obtains information such as the source address S_id, destination address D_id, next-hop relay node address Ri_id, and life cycle n-1. If node A is a relay node Ri, it determines whether the data is received for the first time:

[0117] If the data is received for the first time, the next hop relay node R to the destination node D is determined according to the routing table. i+1 , the source address S_id, the destination address D_id and the address R of the next hop relay node i+1 _id is encapsulated into the data to be sent, and the data to be sent is encapsulated as broadcast data, the life cycle of the broadcast data is set to n-1, and then the data is broadcast;

[0118] If this is not the first time the data is received, it will not be processed.

[0119] Node B that receives the broadcast data parses the data and obtains the source address S_id, destination address D_id, next-hop relay node address Ri_id, life cycle n-1, etc. If node B is neither relay node Ri nor destination node D, and n-1>0, and the data is received for the first time, then query node B's n-1-hop neighbor domain N B [n-1], determine whether the relay node Ri or the destination node D belongs to the neighboring domain:

[0120] If R i _id∈N B [n-1] or D i _id∈N B [n-1], then node B will subtract 1 from the lifetime, and broadcast the data without changing the source address S_id, destination address D_id, next-hop relay node address Ri_id, etc.

[0121] if and No processing will be done.

[0122] If the node C receiving the broadcast data is the destination node D_id, the node parses the data and performs corresponding processing.

[0123] Node E that receives the broadcast data parses the data and obtains information such as the source address S_id, destination address D_id, next-hop relay node address Ri_id, and life cycle n-1. If node C is not the relay node Ri or the destination node D_id, and the data life cycle n-1=0 or the data has been received, no processing is performed.

[0124] As mentioned above, this solution uses the properties of unicast transmission to determine the next hop of data transmission by querying the routing table; combined with the properties of broadcast, it constrains the direction and range of data transmission by broadcasting within the n-hop neighbor domain, and correctly passes the data to be transmitted to the next hop node. This data transmission method can effectively avoid the situation where the next hop in the transmission path is unreachable due to changes in the network topology and the failure to update the routing table in time, improve the success rate of data transmission during the convergence of the routing protocol, increase the network's support for node mobility and link state changes, and enhance the robustness of network data transmission.

[0125] Among them, the forwarding method of the n-hop neighbor domain and non-relay node directly controls the direction and maximum range of local data broadcast (when n=2, the maximum broadcast range is 2 hops; when n=3, the maximum broadcast range is 3 hops). This value should not be too large, and it is best to take 2. When n is 3 or even larger, on the one hand, local broadcast will cause a sharp increase in system overhead; on the other hand, if the sent data has reached the next hop node during the 1-hop or 2-hop broadcast process, the additional broadcast does not bring any benefit. The way in which the node determines whether a certain data is received for the first time can be, but is not limited to, using the data packet sequence number, that is, each data packet generates a fixed sequence number at the source node, and the sequence number remains unchanged during the data transmission and forwarding process.

[0126] The following is Figure 2 A network with 9 nodes is taken as an example to illustrate the working process of the data transmission method based on local broadcast and its support for mobility. Assume that the parameter of local broadcast is n=2. Figure 2 As shown, the mobile self-organizing network has completed the process of network synchronization, neighbor discovery and route selection. The nodes in the network have established routing tables. The figure shows the situation of node 1 and node 7 establishing routing tables. It can be seen that the nodes have obtained the next hop node information to other nodes in the network.

[0127] (1) Scenario 1

[0128] Assume that node 1 has data to send to node 7. At this time, source node 1 knows from the routing table that the next-hop relay node of destination node 7 is node 3. Therefore, according to the data transmission method of this scheme, node 1 writes source node 1, destination node 7, next-hop node 3, and life cycle 1 into the data to be sent and broadcasts the data. In the case that the topology does not change, the data transmission is completed through the following process:

[0129] In the first cycle, after receiving the data, node 3 parses the data and finds that the next-hop relay node is itself. At the same time, it queries the routing table and finds that the destination address 7 is its 1-hop neighbor. Therefore, it encapsulates the source node 1, destination node 7, next-hop node 7, and life cycle 1 into the data to be forwarded, and then broadcasts the data. After receiving the data, node 5 finds that it is neither the next-hop address nor the destination address. The data life cycle is greater than 0, but the next-hop node 3 does not belong to its 1-hop neighbor domain (n-1-hop neighbor domain), so it does not process it.

[0130] In the second cycle, node 7 receives the data forwarded by relay node 3, finds that the destination address is itself, parses the data and performs subsequent processing as needed to complete the data transmission; node 15 receives the data forwarded by the relay node, and after parsing, finds that it is neither the next hop address nor the destination address. The data life cycle is greater than 0, and the destination address belongs to its own 1-hop neighbor domain (n-1-hop neighbor domain), so it subtracts 1 from the life cycle and continues to broadcast the data.

[0131] In the third cycle, node 7 and node 3 receive the data forwarded by node 15 and find that it is not the first time to receive the data, so they do not process it. Node 6 receives the data forwarded by node 15 and finds that it is neither the next hop address nor the destination address after analysis, and the data life cycle is 0, so it does not perform any subsequent processing.

[0132] It can be seen that in this example, data is transmitted along the direction from the source node to the destination node, and is delivered through multiple paths at the last hop to the destination node, which increases the reliability of data transmission.

[0133] (2) Second scenario

[0134] At this time, when node 7 has data to send to node 15, node 7 knows from the routing table that node 15 is its 1-hop neighbor. Therefore, according to the data transmission method of this solution, node 7 writes the source node 7, the destination node 15, the next hop node 15, and the life cycle 1 into the data to be sent and broadcasts the data. In the case that the topology does not change, the data transmission is completed after two transmission cycles:

[0135] In the first cycle, after receiving the data, node 15 finds that the destination address is itself, parses the data and performs subsequent processing as needed to complete the data transmission; at the same time, when nodes 3 and 6 receive the data, they find that they are neither the next hop address nor the destination address, the data life cycle is greater than 0, and the destination address belongs to their own 1-hop neighbor domain (n-1-hop neighbor domain), so they subtract 1 from the life cycle and continue to broadcast the data.

[0136] In the second cycle, node 15 receives the data forwarded by node 3 and node 6. After parsing, it finds that it has received the data before and does not perform any subsequent processing. At the same time, node 1 receives the data forwarded by node 3 and finds that it is neither the next hop address nor the destination address. The data life cycle is 0 and no further processing is performed.

[0137] It can be seen that this example again shows that sending data through multiple paths at the last hop to the destination node increases the reliability of data transmission and supports the destination node to move quickly within a certain range. The following example 3 shows the support for the destination node movement.

[0138] (3) The third scenario

[0139] like Figure 3 As shown, assuming that node 15 moves to the position shown in the figure at time t1, its connection with nodes 3 and 7 is disconnected, but the routing tables of nodes 3 and 7 have not been updated in time, that is, the routing protocol has not converged. At this time, if node 7 still has data to send to node 15, node 7 knows from the routing table that node 15 is its 1-hop neighbor. According to the traditional data transmission method, node 7 directly sends the data to the next-hop address node 15, but node 15 cannot receive the data, resulting in data transmission failure. According to the data transmission method of this scheme, node 7 writes the source node 7, the destination node 15, the next-hop node 15, and the life cycle 1 into the data to be sent, and broadcasts the data. At this time, after two transmission cycles, the data transmission is successfully completed:

[0140] In the first cycle, nodes 3 and 6 receive the data and find that they are neither the next hop address nor the destination address. The data lifetime is greater than 0, and the destination address belongs to their own 1-hop neighbor domain (n-1-hop neighbor domain). Therefore, they subtract 1 from the lifetime and continue to broadcast the data.

[0141] In the second cycle, node 15 receives the data forwarded by node 6 and finds that the destination address is itself. It parses the data and performs subsequent processing as needed to complete the data transmission. Node 1 receives the data forwarded by node 3 and finds that it is neither the next hop address nor the destination address, and the data life cycle is 0, so it does not perform subsequent processing.

[0142] Similarly, when node 7 has data to send to node 5, and Figure 4 As shown, node 7 moves to the position shown in the figure at time t1, disconnects from node 3, and fails to update the routing table in time. At this time, according to the data transmission method given in this scheme, node 7 writes the source node 7, the destination node 5, the next hop node 3, and the life cycle 1 into the data to be sent, broadcasts the data, and then completes the data transmission through the following process:

[0143] In the first cycle, node 15 receives the data and finds that it is neither the next hop address nor the destination address. The data lifetime is greater than 0, and the next hop node 3 belongs to its own 1-hop neighbor domain (n-1-hop neighbor domain). Therefore, it subtracts 1 from the lifetime and continues to broadcast the data. Node 6 receives the data and finds that it is neither the next hop address nor the destination address. The data lifetime is greater than 0, but neither the destination node 5 nor the next hop node 3 belongs to its own 1-hop neighbor domain (n-1-hop neighbor domain). Therefore, it does not process the data.

[0144] In the second cycle, node 3 receives the data forwarded by node 15 and finds that it is the next hop address in the data. Therefore, it queries the routing table and determines that the next hop address is 1. It then writes the source node 7, destination node 5, next hop node 1, and life cycle 1 into the data to be sent and broadcasts the data.

[0145] In the third cycle, node 1 receives the data forwarded by node 3 and finds that it is the next hop address in the data, so it queries the routing table and determines that the next hop address is 5, and writes the source node 7, destination node 5, next hop node 5, and life cycle 1 into the data to be sent, and broadcasts the data; node 15 receives the data forwarded by node 3 and finds that it is neither the next hop address nor the destination address. The data life cycle is greater than 0, but the destination node 5 and the next hop node 1 do not belong to their own 1-hop neighbor domain (n-1-hop neighbor domain), so no processing is performed.

[0146] In the fourth cycle, node 5 receives the data forwarded by node 1, finds that the destination address is itself, parses the data and performs subsequent processing as needed to complete the data transmission.

[0147] Therefore, when the network topology changes and the node's routing table is not updated in time, local broadcast is combined with unicast, and the sending and forwarding nodes send data to the next hop in the transmission link through local broadcast, which improves the success rate of the next hop receiving data in the transmission path, increases the network's support for node mobility and link status changes, and enhances the robustness of network data transmission.

[0148] The above is only an embodiment of the present application and is not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.

Claims

1. A data transmission method based on neighbor domain broadcast, characterized in that: include: S1, obtaining network topology information and routing table information; the routing table information includes an information transmission path between every two nodes in the communication network; The information transmission path is a sequence of several nodes in a preset order; The network topology information includes node information contained in the communication network and connection information between each node; the connection information includes whether it is connected and the length of the connection path; S2, obtain source node information, data to be sent and destination node information; S3, performing neighborhood analysis on the source node information and the network topology structure information to obtain a set of neighboring nodes of the source node; S4, performing neighbor domain broadcast transmission processing on the source node information, the data to be sent and the destination node information according to the network topology information, the routing table information and the source node neighbor node set, and completing the data transmission process of the data to be sent.

2. The data transmission method based on neighbor domain broadcasting according to claim 1, characterized in that: The neighborhood analysis process is performed on the source node information and the network topology structure information to obtain a source node neighborhood node set, including: S301, setting the maximum hop value y; S302, acquiring hop values ​​from all nodes connected to the source node to the source node according to the source node information and the network topology information; S303, determining that among all nodes connected to the source node, nodes having a hop value less than or equal to y are adjacent nodes of the source node; S304: Determine all adjacent nodes of the source node as a neighborhood node set of the source node.

3. The data transmission method based on neighbor domain broadcasting according to claim 2, characterized in that: The neighborhood analysis process is performed on the source node information and the network topology structure information to obtain a source node neighborhood node set, including: Using the network topology information, a node distance matrix and a node hop count matrix are constructed; the element R in the i-th row and j-th column of the node distance matrix ij , represents the distance information between the i-th node and the j-th node in the communication network; the element T of the i-th row and j-th column of the node hop count matrix ij , represents the hop value between the i-th node and the j-th node in the communication network; Performing distance threshold calculation processing on the node distance matrix and the node hop count matrix to obtain a distance threshold vector; the elements of the distance threshold vector are the distance thresholds of each node; Obtaining a distance threshold of a source node from the distance threshold vector; A source node neighborhood node set is constructed by using all nodes in the communication network whose distances to the source node are less than a distance threshold.

4. The data transmission method based on neighbor domain broadcasting according to claim 3, characterized in that: The expression for the distance threshold calculation process is: Among them, d i is the i-th element of the distance threshold vector, is the distance threshold of the i-th node, M is the total number of nodes in the communication network, ω1 and ω2 are the preset first weight value and second weight value respectively, and ξ is the preset deviation value.

5. The data transmission method based on neighbor domain broadcasting according to claim 2, characterized in that: The process of performing neighbor domain broadcast transmission processing on the source node information, the data to be sent and the destination node information according to the network topology information, the routing table information and the source node neighbor node set to complete the data transmission process of the data to be sent includes: S41, searching and obtaining the information transmission path from the source node to the destination node in the routing table information; S42, determining the next-hop relay node R1 of the source node according to the information transmission path; S43, encapsulating the data to be sent, the relay node R1 information, the life cycle, the source node information and the destination node information to obtain broadcast data information; setting the life cycle of the broadcast data information to y; the life cycle of the broadcast data information is y, which means that the broadcast data information can be broadcast and transmitted at most y times in the source node neighboring node set of the source node; S44, broadcasting the broadcast data information in a set of neighboring nodes of the source node; for a node that receives the broadcast data information, reducing the life cycle of the received broadcast data information by 1; S45, determining a node in the source node neighboring node set that receives the broadcast data information; S46, determining whether the node receiving the broadcast data information is a destination node, and obtaining a first determination result; If the first determination result is yes, extract the data to be sent from the broadcast data information, and complete the data transmission process of the data to be sent; If the first determination result is no, execute S47; S47, determining whether the node receiving the broadcast data information is the relay node R1, and obtaining a second determination result; if the second determination result is yes, determining whether the relay node R1 receives the broadcast data information for the first time, and obtaining a third determination result; If the third determination result is yes, according to the information transmission path, using the relay node R1 as the source node, performing neighborhood analysis processing on the source node information and the network topology structure information to obtain a source node neighborhood node set, and executing S42; if the third determination result is no, no operation is performed; If the second determination result is no, a transmission selection determination operation is performed on the node that receives the broadcast data information.

6. The data transmission method based on neighbor domain broadcasting according to claim 5, characterized in that: The step of performing a transmission selection and discrimination operation on the node receiving the broadcast data information includes: Determine whether the node receiving the broadcast data information satisfies two conditions at the same time: receiving the broadcast data information for the first time and the life cycle of the broadcast data information being greater than 0, to obtain a fourth determination result; If the fourth determination result is yes, performing a domain update transmission operation on the node and network topology structure information that received the broadcast data information; If the fourth determination result is no, no operation is performed.

7. The data transmission method based on neighbor domain broadcasting according to claim 6, characterized in that: The performing a domain update transmission operation on the node and network topology structure information that received the broadcast data information includes: Performing neighborhood analysis processing on the nodes and network topology information that received the broadcast data information to obtain a set of receiving neighborhood nodes; determining whether the set of receiving neighborhood nodes includes an active node or a relay node R1 to obtain a fifth discrimination result; when performing neighborhood analysis processing on the nodes and network topology information that received the broadcast data information, the maximum hop value set is the life cycle of the broadcast data information; If the fifth determination result is yes, the source node neighbor node set is updated to the receiving neighbor node set, the source node is updated to the node that receives the broadcast data information, and S44 is executed; If the fifth determination result is no, no operation is performed.

8. A data transmission device based on neighbor domain broadcast, characterized in that: The device comprises: A memory storing executable program code; a processor coupled to the memory; The processor calls the executable program code stored in the memory to execute the data transmission method based on neighbor domain broadcast according to any one of claims 1 to 7.

9. A computer storable medium, characterized in that: The computer storable medium stores computer instructions, and when the computer instructions are called by a computer, they are used to execute the data transmission method based on neighbor domain broadcasting as described in any one of claims 1 to 7.

10. An information data processing terminal, characterized in that: The information data processing terminal is used to implement the data transmission method based on neighbor domain broadcasting as described in any one of claims 1 to 7.

Images