CN111866845B - Data transmission method, device, equipment and computer readable storage medium - Google Patents
Data transmission method, device, equipment and computer readable storage medium Download PDFInfo
- Publication number
- CN111866845B CN111866845B CN202010733771.7A CN202010733771A CN111866845B CN 111866845 B CN111866845 B CN 111866845B CN 202010733771 A CN202010733771 A CN 202010733771A CN 111866845 B CN111866845 B CN 111866845B
- Authority
- CN
- China
- Prior art keywords
- node
- identification information
- data
- sending
- information table
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W8/00—Network data management
- H04W8/02—Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
- H04W8/08—Mobility data transfer
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Abstract
The invention discloses a data transmission method, a device, equipment and a computer readable storage medium, wherein the data transmission method comprises the following steps: when a receiving node of a network receives data information sent by a sending node, whether the sending node is a new node or not is detected based on an identification information table in the receiving node and the data information; if the sending node is a new node, storing new identification information of the sending node in the identification information table, feeding back the identification information table with the new identification information to the sending node, and detecting whether the receiving node is a target node; if the receiving node is not the target node, acquiring a plurality of preset quadrants of the receiving node, determining a target quadrant corresponding to the sending node based on each quadrant, and determining a transmission path based on a preset path planning algorithm and the target quadrant; and sending the data information to a target node based on a transmission path. Therefore, free networking of the edge network of the terminal is realized.
Description
Technical Field
The present invention relates to the field of communications network technologies, and in particular, to a data transmission method, apparatus, device, and computer-readable storage medium.
Background
In recent years, with the high-speed development of technologies and the gradual application of cloud computing, big data and edge intelligence, edge network terminal intellectualization becomes more and more important, and the current edge network mainly takes a centralized star network as a main part, and realizes the connection of various edge intelligent terminals by a central access point, such as wireless mobile networks 2G, 3G, 4G wireless base stations, hotspots, and the like. The intelligent terminal application scene represented by an industrial internet and an intelligent community needs a large number of intelligent terminals to detect, analyze, process and enable various signals, and further regional digital intellectualization is formed. Various requirements exist in the intellectualization in the area, such as the requirements of automatic addition, automatic deletion and self-management of intelligent terminals in the area, the requirements all need higher real-time performance, safety and network robustness, the requirements of the edge networks need to be met quickly, the current centralized network deployment is far from enough, and the function supplement of the edge area network which is not limited by places is urgently needed. Therefore, how to realize the edge network free networking of the terminal becomes a technical problem to be solved urgently at present.
Disclosure of Invention
The invention mainly aims to provide a data transmission method, a data transmission device, data transmission equipment and a computer readable storage medium, and aims to solve the technical problem of how to realize free networking of an edge network of a terminal.
In order to achieve the above object, the present invention provides a data transmission method, which includes the following steps:
when a receiving node of a network receives data information sent by a sending node, whether the sending node is a new node is detected based on an identification information table in the receiving node and the data information;
if the sending node is a new node, storing new identification information of the sending node in the identification information table, feeding back the identification information table with the new identification information to the sending node, and detecting whether the receiving node is a target node;
if the receiving node is not a target node, acquiring a plurality of quadrants preset by the receiving node, determining a target quadrant corresponding to the sending node based on each quadrant, and determining a transmission path based on a preset path planning algorithm and the target quadrant;
and sending the data information to a target node based on the transmission path.
Optionally, the step of detecting whether the sending node is a new node based on the identification information table and the data information in the receiving node includes:
detecting whether identification information in the data information exists in an identification information table in the receiving node;
and if not, detecting whether the sending node is a new node or not based on a detection result of detecting whether the number of the items of the identification information in the data information is smaller than a preset threshold value or not.
Optionally, after the step of detecting whether the identification information in the data information exists in the identification information table in the receiving node, the method includes:
if yes, acquiring a node name in the identification information, and detecting whether the node name is consistent with a target node name in the identification information table;
and if the node name is consistent with the target node name, determining that the data information of the sending node does not contain a new node, and updating the identification information table according to the data information.
Optionally, after the step of detecting whether the node name is the same as the target node name in the identification information table, the method includes:
and if the node name is inconsistent with the target node name, determining that the data information of the sending node contains new node identification information, sending a new node identification information confirmation request to all adjacent nodes except the target node, and deciding to add the new node identification information in the identification information table based on the confirmation information fed back by each adjacent node.
Optionally, the step of determining a transmission path based on a preset path planning algorithm and the target quadrant includes:
and calculating a plurality of path groups based on a preset path planning algorithm and the target quadrant, sequentially comparing the path groups, determining the path group with the fewest nodes based on the comparison result, and taking the path group with the fewest nodes as a transmission path.
Optionally, after the step of sending the data information to the target node based on the transmission path, the method includes:
acquiring all nodes of a network where the sending node is located, detecting an identification information table of each node based on a preset time interval, and if the identification information table of an abnormal node exists in each node, performing exception processing on the identification information table of the abnormal node.
Optionally, the step of detecting the identification information table of each node based on a preset time interval includes:
sequentially traversing the identification information table of each node, and determining whether abnormal identification information data with identification information data storage duration longer than a preset time interval exists in the identification information table of the currently traversed node;
and if the abnormal identification information data exist, deleting the abnormal identification information data for data updating until the identification information table of each node is traversed.
In addition, to achieve the above object, the present invention also provides a data transmission device, including:
the system comprises a detection module, a sending module and a receiving module, wherein the detection module is used for detecting whether a sending node is a new node or not based on an identification information table in a receiving node and data information when the receiving node of a network receives the data information sent by the sending node;
a feedback module, configured to store new identification information of the sending node in the identification information table if the sending node is a new node, feed back the identification information table with the new identification information to the sending node, and detect whether the receiving node is a target node;
an obtaining module, configured to obtain multiple quadrants preset by the receiving node if the receiving node is not a target node, determine a target quadrant corresponding to the sending node based on each of the quadrants, and determine a transmission path based on a preset path planning algorithm and the target quadrant;
and the sending module is used for sending the data information to a target node based on the transmission path.
In addition, to achieve the above object, the present invention also provides a data transmission device, including: a memory, a processor and a data transmission program stored on the memory and executable on the processor, the data transmission program, when executed by the processor, implementing the steps of the data transmission method as described above.
Furthermore, to achieve the above object, the present invention also provides a computer readable storage medium having stored thereon a data transmission program which, when executed by a processor, implements the steps of the data transmission method as described above.
When a receiving node of a network receives data information sent by a sending node, whether the sending node is a new node is detected based on an identification information table in the receiving node and the data information; if the sending node is a new node, storing new identification information of the sending node in the identification information table, feeding back the identification information table with the new identification information to the sending node, and detecting whether the receiving node is a target node; if the receiving node is not a target node, acquiring a plurality of preset quadrants of the receiving node, determining a target quadrant corresponding to the sending node based on each quadrant, and determining a transmission path based on a preset path planning algorithm and the target quadrant; and sending the data information to a target node based on the transmission path. The data information of the sending node is received at the receiving node of the network, and when the sending node is determined to be a new node according to the identification information table, the new identification information of the sending node is stored in the identification information table and is sent to the sending node together, so that automatic networking connection of the node and the network is realized, the intelligence of the node connection network is improved, when the receiving node is not a target node, a target quadrant is determined according to the sending node and the receiving node, a transmission path is determined according to a preset path planning algorithm and the target quadrant, and the data information is sent to the target node based on the transmission path, so that the transmission path of data transmission is quickly determined, the data information is quickly transmitted to the target node, the edge network free networking of the terminal is realized, and manual interference is not needed.
Drawings
FIG. 1 is a schematic diagram of a data transmission device in a hardware operating environment according to an embodiment of the present invention;
FIG. 2 is a flowchart illustrating a data transmission method according to a first embodiment of the present invention;
FIG. 3 is a flowchart illustrating a data transmission method according to a second embodiment of the present invention;
FIG. 4 is a diagram illustrating a new node accessing a network according to the data transmission method of the present invention;
FIG. 5 is a schematic diagram of a node keep-alive mechanism in the data transmission method of the present invention;
FIG. 6 is a schematic diagram of quadrant determination in the data transmission method of the present invention
Fig. 7 is a schematic diagram illustrating a transmission path planning and transmission flow in the data transmission method of the present invention.
The implementation, functional features and advantages of the objects of the present invention will be further explained with reference to the accompanying drawings.
Detailed Description
It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
As shown in fig. 1, fig. 1 is a schematic structural diagram of a data transmission device in a hardware operating environment according to an embodiment of the present invention.
The data transmission device in the embodiment of the present invention may be a terminal device such as a PC or a server (e.g., an X86 server) equipped with a virtualization platform.
As shown in fig. 1, the data transmission apparatus may include: a processor 1001, such as a CPU, a network interface 1004, a user interface 1003, a memory 1005, a communication bus 1002. The communication bus 1002 is used to implement connection communication among these components. The user interface 1003 may include a Display screen (Display), an input unit such as a Keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface, a wireless interface. The network interface 1004 may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface). The memory 1005 may be a high-speed RAM memory or a non-volatile memory (e.g., a magnetic disk memory). The memory 1005 may alternatively be a storage device separate from the processor 1001.
Those skilled in the art will appreciate that the terminal structure shown in fig. 1 is not intended to be limiting and may include more or fewer components than those shown, or some components may be combined, or a different arrangement of components.
As shown in fig. 1, a memory 1005, which is a kind of computer storage medium, may include therein an operating system, a network communication module, a user interface module, and a data transmission program.
In the terminal shown in fig. 1, the network interface 1004 is mainly used for connecting to a backend server and performing data communication with the backend server; the user interface 1003 is mainly used for connecting a client (user side) and performing data communication with the client; and the processor 1001 may be configured to invoke the data transfer program stored in the memory 1005 and perform the operations in the following embodiments of the privilege configuration method of the security component.
Based on the above hardware structure, embodiments of the data transmission method of the present invention are provided as follows.
Referring to fig. 2, fig. 2 is a schematic flowchart of a data transmission method according to a first embodiment of the present invention, where the data transmission method includes:
step S10, when a receiving node of a network receives data information sent by a sending node, whether the sending node is a new node is detected based on an identification information table in the receiving node and the data information;
in this embodiment, the data transmission method is to implement an internal network of a multipoint autonomous route of an edge intelligent terminal through location information of nodes (i.e., network nodes, one network node may correspond to one terminal, and connections among a plurality of nodes form a network), so that the intelligent terminal in the edge network can freely access the network, freely leave the network, automatically update the route, and self-organize a selected path, thereby implementing an ad hoc network architecture that does not rely on participation of a central control node. And the judgment mechanism for broadcasting and forwarding the information of the node is forwarded to other nodes in the network, so that the problem of broadcast storm in the network is avoided, and the rapid propagation of the information is realized through transmission path planning, so that the node deployment is rapid and effective. It should be noted that, in this embodiment, the network to which the data transmission method is applied can implement functions of broadcast discovery, identification information forwarding decision mechanism, node keep-alive mechanism decision, node failure deletion, transmission path planning, and the like added to the node.
Therefore, in this embodiment, when a certain node (i.e., a receiving node) of the network receives data information (the data information carries information related to a sending node) sent by a sending node (other nodes except the receiving node, such as other nodes adjacent to the sending node), it may first detect whether the sending node is a new node, and perform different operations according to different determination results. When a new node joins a network, verification is carried out firstly to determine whether the new node is an available effective node, if so, identification information formed by the ID and the position information (including outdoor position information and indoor position information, the outdoor position information can be determined according to a GPS positioning function, the indoor position information can be determined according to pre-calibrated position information) and the time information (taking forwarding time as specific time information) of the new node is broadcasted by a public channel, and the identification information is sent to all adjacent nodes (namely nodes adjacent to the new node) in the coverage range of the new node as data information, at this moment, the new node can be used as a sending node, and the adjacent nodes are used as receiving nodes. When the adjacent node receives the identification information sent by the new node, the local identification information table of the adjacent node is matched with the identification information to determine whether the local identification information table has the identification information, and if not, the identification information is stored to a first item, such as ID, time information and the like. And forwarding according to the position information of the new node and the self identification information of the adjacent node. If the adjacent node receives the identification information, whether the identification information only has one piece of data or not is judged, if the identification information only has one piece of data, the node corresponding to the identification information is determined to be a new node, and at the moment, a complete identification information table of the adjacent node can be fed back to the new node. And the new node updates the identification information table of the new node according to the received complete identification information table, and if a plurality of pieces of data exist in the identification information, the new node forwards the identification information to other adjacent nodes.
Step S20, if the sending node is a new node, storing new identification information of the sending node in the identification information table, feeding back the identification information table with the new identification information to the sending node, and detecting whether the receiving node is a target node;
when the sending node is judged to be a new node, the new identification information of the sending node is stored in the identification table, and the identification information table with the new identification information is fed back to the sending node, so that the sending node updates the identification information table of the sending node according to the fed back identification information table. In this embodiment, only when the sending node is a new node, the receiving node feeds back the identification information table to the sending node.
For example, as shown in fig. 4, a new node may send a single piece of identification information to an old node closest to the new node, the old node stores the identification information of the new node in an identification information table, and when it is determined that a node corresponding to the single piece of identification information is the new node, feeds back a complete identification information table to the new node, and simultaneously, the old node sends the identification information of the new node to a subsequent old node, and forwards the identification information of the node until the identification information table in the old node stores the identification information of the new node.
And then determining whether the receiving node is a final node (namely a target node) which needs to be sent by the sending node, if so, stopping sending the data information to other nodes after the receiving node receives the data information. However, if the sending node is not a new node and the data information carries an update command, that is, the node in the network needs to perform a node keep-alive mechanism decision (that is, the node in the network needs to perform time and location update within a specified time), after the receiving node receives the update command in the data information, the existing information in the local identification information table of the receiving node is compared with the update information carried by the update command, and if the existing information is not consistent with the update command and the update time corresponding to the update command lags behind the storage time corresponding to the existing information, the time information and the location information in the local identification information table of the receiving node are updated. And forwards this data information with the update command to other nodes than the sending node. However, if the local identification information table of the receiving node does not find the ID of the node to be updated, the receiving node sends an identification information confirmation request to the n adjacent nodes, and when the number of the fed-back confirmation information is greater than a preset value, the identification information of the updating node corresponding to the updating command is added to the local identification information table.
For example, as shown in fig. 5, when a node receives identification information, but a node ID matching the received identification information does not exist in the identification information table of the node, a node information confirmation request is performed to all nodes adjacent to the node, and when node information confirmation responses of all adjacent nodes are obtained and a preset threshold value is met, the identification information table is updated and information forwarding is performed.
Step S30, if the receiving node is not a target node, acquiring a plurality of quadrants preset by the receiving node, determining a target quadrant corresponding to the sending node based on each quadrant, and determining a transmission path based on a preset path planning algorithm and the target quadrant;
when the receiving node is found not to be the target node through judgment, a transmission path from the receiving node to the target node needs to be determined, that is, when the receiving node receives the identification information sent by the sending node, the receiving node analyzes the position information of the sending node to judge the position of the sending node relative to the receiving node, the analyzing mode can be that the receiving node takes the self node as a central point and is divided into multiple quadrants, such as 4 quadrants, and then the position information of the sending node determines that the sending node is located in one quadrant, namely the target quadrant, of the receiving node, and the receiving node forwards the data information with the identification information to the nodes which are located in other quadrants in all the identification information tables except for the quadrant where the sending node is located, namely to the nodes in the other quadrants except for the target quadrant. For example, as shown in fig. 6, if the position information of the sending node is (x 1, y 1), and the position information of the receiving node is (x 2, y 2), and then the receiving node is divided into four quadrants, the target quadrant may be determined according to the difference between the position information of the sending node and the position information of the receiving node, that is, if x2-x1 is less than 0, and y2-y1 is less than 0, the target quadrant is determined as the first quadrant; if x2-x1 is greater than 0 and y2-y1 is less than 0, determining the target quadrant as a second quadrant; if x2-x1 is greater than 0 and y2-y1 is greater than 0, determining the target quadrant as a third quadrant; if x2-x1 > 0, and y2-y1 > 0, then the target quadrant is determined to be the fourth quadrant.
After the target quadrant is determined, the transmission path needs to be determined according to a preset path planning algorithm and the target quadrant, that is, in this embodiment, each node stores a full amount of identification information tables, that is, each identification information table includes identification information of all nodes, so that path planning can be performed by using the IDs and position information in the identification information tables, that is, the target quadrant is determined according to the position information, and the ID of the next node is determined according to the target quadrant. The preset path planning algorithm may be an breadth-first algorithm, a heuristic search algorithm, or the like. For example, as shown in fig. 7, if a node x needs to transmit a group of data to a node y, that is, x transmits data to y, it is determined whether x and y are directly connected, and if x is directly connected, the node x directly transmits data to the node y, that is, x transmits data to y, and y feeds back received data to x, thereby completing data transmission. If the nodes are not directly connected, a path planning algorithm is used for searching for no less than 1 recommended path (namely a path group), a path with the fewest nodes in the recommended path is selected as a transmission path, then x is used for sequencing according to adjacent nodes in the transmission path to serve as an address string, the address of the node is deleted after every node passes through until the last address, namely, each node ID in the transmission path is sequentially used as a transmission address from near to far for protocol encapsulation, for example, a plurality of nodes x1, x2, x3.. Xn and the like are arranged in the middle of x- > y. The transmission path is: x- > x1- > x2- > x3- >. The transport protocol address header is encapsulated as: x1 address: x2 address: x3 address: adjust,. Xn addresses: y address: the x address. The arrangement can be seen that the remaining addresses are connected directly with each other except between y and x. And then transmitting according to the address formatting, deleting the self address of the node encapsulated by the protocol address head when the data is transmitted to one node, transmitting the shortened data information to the next adjacent node until the judgment that only one address is left in the residual address and the current address is not directly connected with the residual node address is made, and considering that the current address is a target address and the residual node address is an initial source address. Such as: x (x 1, x2, x3.. Xn, y, x) - > x1 (x 2, x3.. Xn, y, x) - > x2 (x 3.. Xn, y, x) - > x3 (.. Xn, y, x) - >)
xn(y,x)->y(x)
If yes, finishing the process, otherwise, finishing the transmission, and repeating the process by y to reply, namely when y receives data, performing information reply according to the process from x to y, determining that the target address y receives the data information of the source address x, and if x cannot receive the reply within the specified time, considering that the path has a problem, and reselecting the path to perform data transmission. If y receives the same data repeated twice, the path is reselected to respond. Thereby completing the transmission of data.
And S40, sending the data information to a target node based on the transmission path.
And after the transmission path is determined, the data information of the receiving node is sent to the target node to complete the data transmission process. It should be noted that, in this embodiment, each node in the network detects time information of all nodes in its own identification information table, and determines whether data after each identification information table is deleted according to a preset time interval, and if the storage time of the data after the identification information table exceeds the time interval, the data is deleted.
In this embodiment, when a receiving node of a network receives data information sent by a sending node, whether the sending node is a new node is detected based on an identification information table in the receiving node and the data information; if the sending node is a new node, storing new identification information of the sending node in the identification information table, feeding back the identification information table with the new identification information to the sending node, and detecting whether the receiving node is a target node; if the receiving node is not the target node, acquiring a plurality of preset quadrants of the receiving node, determining a target quadrant corresponding to the sending node based on each quadrant, and determining a transmission path based on a preset path planning algorithm and the target quadrant; and sending the data information to a target node based on the transmission path. The method comprises the steps that data information of a sending node is received at a receiving node of a network, when the sending node is determined to be a new node according to an identification information table, the new identification information of the sending node is stored in the identification information table and is sent to the sending node together, so that automatic networking connection of the node and the network is achieved, the intelligence of the node connection network is improved, when the receiving node is not a target node, a target quadrant is determined according to the sending node and the receiving node, a transmission path is determined according to a preset path planning algorithm and the target quadrant, and the data information is sent to the target node based on the transmission path, so that the transmission path of data transmission is determined quickly, the data information is transmitted to the target node quickly, free networking of an edge network of a terminal is achieved, and manual interference is not needed.
Further, based on the first embodiment of the present invention, a second embodiment of the data transmission method of the present invention is provided, in this embodiment, step S10 in the above embodiment, a refinement of the step of detecting whether the sending node is a new node based on the identification information table in the receiving node and the data information, includes:
step a, detecting whether the identification information in the data information exists in an identification information table in the receiving node;
in this embodiment, when determining whether the sending node is a new node, it is necessary to acquire the identification information carried in the data information, and compare the identification information with all the stored identification information in the identification information table of the receiving node, and if there is stored identification information that is the same as the identification information, it is determined that the identification information of the data information is already in the identification information table in the pre-receiving node, and if there is no stored identification information, it is determined that the identification information of the data information is not already in the identification information table in the pre-receiving node.
Step b, if not, detecting whether the sending node is a new node or not based on a detection result of detecting whether the number of the items of the identification information in the data information is smaller than a preset threshold value or not;
when it is determined through the judgment that the identification information of the data information does not exist in the identification information table in the pre-receiving node, it is required to detect the data amount (i.e., the number of entries) of the identification information in the data information, such as the number of node IDs, determine whether the data amount is smaller than a preset threshold (may be an arbitrary value set in advance, and is preferably set to 2), and perform different operations according to different detection results.
And when the data volume is smaller than the preset threshold value through judgment, determining that the sending node is a new node, and if the data volume is larger than or equal to the preset threshold value, stopping the transmission of the data information. For example, when there is only one piece of data in the data volume, the sending node is determined as a new node, and when there are a plurality of data volumes, the transmission operation of the data information is stopped.
In this embodiment, when the identification information in the data information does not exist in the identification information in the receiving node and the data volume of the identification information is smaller than the preset threshold, the sending node is determined to be the new node, so that the accuracy of determining the new node is improved.
Further, after the step of detecting whether the identification information in the data information exists in the identification information table in the receiving node, the method includes:
step d, if yes, acquiring the node name in the identification information, and detecting whether the node name is consistent with the target node name in the identification information table;
in this embodiment, when it is determined that the identification information in the data information exists in the identification information table in the receiving node, it is necessary to detect a node name, that is, an ID, carried by the identification information, detect whether the node name is the same as a target node name in the identification information table, and perform different operations based on different detection results. The storage node names in the identification information table are the same as the storage node names in the storage node name table, and the storage node names in the identification information table are used as the target node names.
And e, if the node name is consistent with the target node name, determining that the data information does not contain a new node, and updating the identification information table according to the data information.
When the node name is found to be the same as the target node name through judgment, it can be determined that the data information does not contain a new node and is an existing node in the network, and the identification information table is updated according to the data information, for example, position information and time information in the identification information table are updated.
In this embodiment, when the identification information exists in the identification information table and the node name is consistent with the target node name, it is determined that the sending node does not include a new node, and the identification information table is updated according to the data information, so that the accuracy of data information synchronization of each node is ensured.
Further, after the step of detecting whether the node name is consistent with the target node name in the identification information table, the method includes:
and f, if the node name is inconsistent with the target node name, determining that the data information contains new node identification information, sending a new node identification information confirmation request to all adjacent nodes except the target node, and deciding to add the new node identification information in the identification information table based on the confirmation information fed back by each adjacent node.
In this embodiment, when it is determined that the node name is inconsistent with the target node name, it may be determined that the data information includes new node identification information, at this time, a new node identification information confirmation request needs to be sent to all neighboring nodes except the target node to determine whether the new node has accessed the network, each neighboring node may perform determination according to the identification information confirmation request and feed back a determination result to the receiving node, and the receiving node may decide to add identification information after the identification information table according to the confirmation information fed back by each neighboring node, that is, when the number of the confirmation information fed back by the neighboring node is greater than a preset value, the identification information may be added to the identification information table.
In this embodiment, when the node name is inconsistent with the target node name, it is determined that the data information includes new node identification information, and then the new node identification information is added to the identification information table according to the confirmation information fed back by the adjacent node, thereby ensuring normal data transmission.
Further, the step of determining a transmission path based on a preset path planning algorithm and the target quadrant comprises:
and g, calculating a plurality of path groups based on a preset path planning algorithm and the target quadrant, sequentially comparing the path groups, determining the path group with the fewest nodes based on the comparison result, and taking the path group with the fewest nodes as a transmission path.
In this embodiment, when determining a transmission path, multiple path groups need to be calculated according to a preset path planning algorithm and a target quadrant, that is, when performing data transmission between a node a and a node b, a position relationship between the node a and the node b needs to be determined first, the target quadrant needs to be determined according to the position relationship, and then the node b needs to be determined according to the target quadrant and can transmit data to nodes in other quadrants except the target quadrant. And then calculating a plurality of path groups according to a preset path planning algorithm. And comparing the path groups in sequence, determining the path group with the fewest nodes according to the comparison result, and taking the path group with the fewest nodes as a transmission path.
In this embodiment, a plurality of path groups are calculated according to a preset path planning algorithm and a target quadrant, and the path groups are sequentially compared to determine a path group with the fewest nodes, and the path group with the fewest nodes is used as a transmission path, so that the accuracy of the acquired transmission path is ensured.
Further, after the step of sending the data information to the target node based on the transmission path, the method includes:
and h, acquiring all nodes of the network where the sending node is positioned, detecting the identification information table of each node based on a preset time interval, and if the identification information table of the abnormal node exists in each node, performing exception processing on the identification information table of the abnormal node.
In this embodiment, it is necessary to acquire all nodes of a network in which a sending node is located, and detect the identification information tables of all nodes, that is, detect whether there is data whose storage duration is longer than a preset time interval (any time interval set in advance by a user) in the identification information table, if there is data whose storage duration is longer than the preset time interval, use the data as an identification information table of an abnormal node, and perform exception processing on the identification information table of the abnormal node, for example, delete the data exceeding the time interval.
In this embodiment, the identification information table of each node is detected according to the preset time interval, and the identification information table of the abnormal node is subjected to abnormal processing, so that the effective operation of each node in the network is ensured.
Further, the step of detecting the identification information table of each of the nodes based on a preset time interval includes:
step k, sequentially traversing the identification information table of each node, and determining whether abnormal identification information data with identification information data storage duration longer than a preset time interval exists in the identification information table of the currently traversed node;
in this embodiment, it is necessary to sequentially traverse the identification information tables of the nodes, determine whether there is abnormal identification information data in the currently traversed identification information table of the current node, where the storage duration of the identification information data is longer than a preset time interval, and if not, determine the next identification information table.
And m, if the abnormal identification information data exist, deleting the abnormal identification information data to update the data until the identification information table of each node is traversed.
And when the abnormal data is found by judgment, taking the identification information table of the current node as the identification information table of the abnormal node, deleting the abnormal identification information data, updating the data of the identification information table of the currently traversed node after the deletion is finished, and judging the next identification information table until the traversal of the identification information table of each node is finished.
In this embodiment, the accuracy of determining the identification information table of the abnormal node is ensured by sequentially traversing each identification information table, and deleting the abnormal identification information data when it is determined that the abnormal identification information data with the identification information data storage duration longer than the preset time interval exists in the identification information table of the current node until the traversal of each identification information table is completed.
Referring to fig. 3, the present invention further provides a data transmission device, in this embodiment, the data transmission device includes:
a detecting module a10, configured to, when a receiving node of a network receives data information sent by a sending node, detect whether the sending node is a new node based on an identification information table in the receiving node and the data information;
a feedback module a20, configured to, if the sending node is a new node, store new identification information of the sending node in the identification information table, feed back the identification information table with the new identification information to the sending node, and detect whether the receiving node is a target node;
an obtaining module a30, configured to obtain multiple quadrants preset by the receiving node if the receiving node is not a target node, determine a target quadrant corresponding to the sending node based on each of the quadrants, and determine a transmission path based on a preset path planning algorithm and the target quadrant;
and a sending module a40, configured to send the data information to a target node based on the transmission path.
Optionally, the detecting module a10 is further configured to:
detecting whether identification information in the data information exists in an identification information table in the receiving node;
and if not, detecting whether the sending node is a new node or not based on a detection result of detecting whether the number of the items of the identification information in the data information is smaller than a preset threshold value or not.
Optionally, the detecting module a10 is further configured to:
if yes, acquiring a node name in the identification information, and detecting whether the node name is consistent with a target node name in the identification information table;
and if the node name is consistent with the target node name, determining that the data information does not contain a new node, and updating the identification information table according to the data information.
Optionally, the detecting module a10 is further configured to:
and if the node name is inconsistent with the target node name, determining that the data information contains new node identification information, sending a new node identification information confirmation request to all adjacent nodes except the target node, and deciding to add the new node identification information in the identification information table based on the confirmation information fed back by each adjacent node.
Optionally, the obtaining module a30 is further configured to:
and calculating a plurality of path groups based on a preset path planning algorithm and the target quadrant, comparing the path groups in sequence, determining the path group with the fewest nodes based on the comparison result, and taking the path group with the fewest nodes as a transmission path.
Optionally, the sending module a40 is further configured to:
and acquiring all nodes of a network where the sending node is positioned, detecting an identification information table of each node based on a preset time interval, and if the identification information table of the abnormal node exists in each node, performing exception processing on the identification information table of the abnormal node.
Optionally, the sending module a40 is further configured to:
sequentially traversing the identification information table of each node, and determining whether abnormal identification information data with identification information data storage duration longer than a preset time interval exists in the identification information table of the currently traversed current node;
and if the abnormal identification information data exist, deleting the abnormal identification information data to update the data until the traversal of the identification information table of each node is completed.
The method for implementing the above functional modules may refer to the embodiment of the data transmission method of the present invention, and will not be described herein again.
The present invention also provides a data transmission apparatus, including: a memory, a processor, a communication bus, and a data transfer program stored on the memory:
the communication bus is used for realizing connection communication between the processor and the memory;
the processor is configured to execute the data transmission program to implement the steps of the embodiments of the data transmission method.
The invention also provides a computer readable storage medium.
The computer-readable storage medium of the present invention has stored thereon a data transmission program which, when executed by a processor, implements the steps of the data transmission method as described above.
The method implemented when the data transmission program running on the processor is executed may refer to each embodiment of the data transmission method of the present invention, and details are not described herein again.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or system that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or system. Without further limitation, an element defined by the phrases "comprising a," "8230," "8230," or "comprising" does not exclude the presence of other like elements in a process, method, article, or system comprising the element.
The above-mentioned serial numbers of the embodiments of the present invention are only for description, and do not represent the advantages and disadvantages of the embodiments.
Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) as described above and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, an air conditioner, or a network device) to execute the method according to the embodiments of the present invention.
The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (10)
1. A data transmission method, characterized in that the data transmission method comprises the steps of:
when a receiving node of a network receives data information sent by a sending node, whether the sending node is a new node is detected based on an identification information table in the receiving node and the data information, wherein after the step of detecting whether the sending node is a new node based on the identification information table in the receiving node and the data information, the method comprises the following steps: if the sending node is not a new node and the data information comprises an update command, comparing existing information in the identification information table of the receiving node with update information in the update command, and updating time information and position information in the identification information table when the existing information is inconsistent with the update information and the update time corresponding to the update command lags behind the storage time corresponding to the existing information;
if the sending node is a new node, storing new identification information of the sending node in the identification information table, feeding back the identification information table with the new identification information to the sending node, and detecting whether the receiving node is a target node;
if the receiving node is not a target node, acquiring a plurality of quadrants preset by the receiving node, determining a target quadrant corresponding to the sending node based on each quadrant, and determining a transmission path based on a preset path planning algorithm and the target quadrant;
and sending the data information to a target node based on the transmission path.
2. The data transmission method according to claim 1, wherein the step of detecting whether the sending node is a new node based on the identification information table in the receiving node and the data information comprises:
detecting whether identification information in the data information exists in an identification information table in the receiving node;
and if not, detecting whether the sending node is a new node or not based on a detection result of detecting whether the number of the items of the identification information in the data information is smaller than a preset threshold value or not.
3. The data transmission method according to claim 2, wherein the step of detecting whether the identification information in the data information exists in an identification information table in the receiving node is followed by:
if yes, acquiring a node name in the identification information, and detecting whether the node name is consistent with a target node name in the identification information table;
and if the node name is consistent with the target node name, determining that the data information does not contain a new node, and updating the identification information table according to the data information.
4. The data transmission method according to claim 3, wherein the step of detecting whether the node name is consistent with the target node name in the identification information table is followed by:
and if the node name is not consistent with the target node name, determining that the data information contains new node identification information, sending a new node identification information confirmation request to all adjacent nodes except the target node, and deciding to add the new node identification information in the identification information table based on the confirmation information fed back by each adjacent node.
5. The data transmission method of claim 1, wherein the step of determining the transmission path based on a preset path planning algorithm and the target quadrant comprises:
and calculating a plurality of path groups based on a preset path planning algorithm and the target quadrant, comparing the path groups in sequence, determining the path group with the fewest nodes based on the comparison result, and taking the path group with the fewest nodes as a transmission path.
6. The data transmission method according to claim 1, wherein the step of transmitting the data information to the target node based on the transmission path is followed by:
and acquiring all nodes of a network where the sending node is positioned, detecting an identification information table of each node based on a preset time interval, and if the identification information table of the abnormal node exists in each node, performing exception processing on the identification information table of the abnormal node.
7. The data transmission method according to claim 6, wherein the step of detecting the identification information table of each of the nodes based on the preset time interval includes:
sequentially traversing the identification information table of each node, and determining whether abnormal identification information data with identification information data storage duration longer than a preset time interval exists in the identification information table of the currently traversed node;
and if the abnormal identification information data exist, deleting the abnormal identification information data to update the data until the traversal of the identification information table of each node is completed.
8. A data transmission apparatus, characterized in that the data transmission apparatus comprises:
a detecting module, configured to, when a receiving node of a network receives data information sent by a sending node, detect whether the sending node is a new node based on an identification information table and the data information in the receiving node, where after the step of detecting whether the sending node is a new node based on the identification information table and the data information in the receiving node, the detecting module includes: if the sending node is not a new node and the data information comprises an update command, comparing existing information in the identification information table of the receiving node with update information in the update command, and updating time information and position information in the identification information table when the existing information is inconsistent with the update information and the update time corresponding to the update command lags behind the storage time corresponding to the existing information;
a feedback module, configured to store new identification information of the sending node in the identification information table if the sending node is a new node, feed back the identification information table with the new identification information to the sending node, and detect whether the receiving node is a target node;
an obtaining module, configured to obtain multiple quadrants preset by the receiving node if the receiving node is not a target node, determine a target quadrant corresponding to the sending node based on each of the quadrants, and determine a transmission path based on a preset path planning algorithm and the target quadrant;
and the sending module is used for sending the data information to a target node based on the transmission path.
9. A data transmission device, characterized in that the data transmission device comprises: memory, processor and data transmission program stored on the memory and executable on the processor, which data transmission program, when executed by the processor, implements the steps of the data transmission method according to any one of claims 1 to 7.
10. A computer-readable storage medium, characterized in that a data transmission program is stored thereon, which when executed by a processor implements the steps of the data transmission method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010733771.7A CN111866845B (en) | 2020-07-24 | 2020-07-24 | Data transmission method, device, equipment and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010733771.7A CN111866845B (en) | 2020-07-24 | 2020-07-24 | Data transmission method, device, equipment and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111866845A CN111866845A (en) | 2020-10-30 |
| CN111866845B true CN111866845B (en) | 2022-12-13 |
Family
ID=72948324
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010733771.7A Active CN111866845B (en) | 2020-07-24 | 2020-07-24 | Data transmission method, device, equipment and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111866845B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114584490B (en) * | 2022-03-25 | 2024-04-09 | 阿里巴巴（中国）有限公司 | Data transmission detection method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104967563A (en) * | 2015-07-24 | 2015-10-07 | 国家电网公司 | Active routing method and device |
| CN109951389A (en) * | 2019-03-06 | 2019-06-28 | 篱笆墙网络科技有限公司 | Storage method of the block chain from chain data, device, equipment and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5621668B2 (en) * | 2011-03-15 | 2014-11-12 | 富士通株式会社 | Transmission system, redundant section setting method and connection node |
-
2020
- 2020-07-24 CN CN202010733771.7A patent/CN111866845B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104967563A (en) * | 2015-07-24 | 2015-10-07 | 国家电网公司 | Active routing method and device |
| CN109951389A (en) * | 2019-03-06 | 2019-06-28 | 篱笆墙网络科技有限公司 | Storage method of the block chain from chain data, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111866845A (en) | 2020-10-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8095881B2 (en) | Method for locating a teleport target station in a virtual world | |
| US6982960B2 (en) | Protocol for self-organizing network using a logical spanning tree backbone | |
| CN104468327B (en) | A kind of group Adding Way, Apparatus and system | |
| US20060285510A1 (en) | Method and apparatus for transferring frames in extended wireless LAN | |
| KR20070081733A (en) | Apparatus for setting multipath and method thereof | |
| CN108738022B (en) | Mobile management method and system for wireless communication network | |
| TWI508609B (en) | Network configuration method and wireless networking system | |
| CN104509074A (en) | Address resolution mechanism for hybrid communication networks | |
| CN113891429A (en) | Equipment network access method, device, system and storage medium | |
| JP5705030B2 (en) | Communications system | |
| CN105392185A (en) | Intelligent equipment networking method and device, and system | |
| CN111866845B (en) | Data transmission method, device, equipment and computer readable storage medium | |
| WO2016192224A1 (en) | Method for matching access point in wireless local area network, central control unit and access points | |
| CN107645789A (en) | The method, apparatus and system of networking | |
| CN107836099A (en) | Loop detection/solution and load balancing on the double concurrent transponders of double frequency-band | |
| CN108966281B (en) | Mesh network processing method, device, equipment and storage medium | |
| US20160294465A1 (en) | Information collection system, relay terminal, control method for relay terminal to connect to center system, sensor terminal, and control method for sensor terminal to connect to center system | |
| US20120163289A1 (en) | Node apparatus, node management apparatus and method, and communication system based on continuous network connectivity-lacking network | |
| US10333830B2 (en) | Passive routing in mesh network | |
| CN107634896B (en) | Data transmission method and device | |
| US20090157878A1 (en) | Method and system for connecting lower nodes to one another to increase scalability in zigbee network | |
| CN112637923B (en) | Node confirmation method and device, computer equipment and storage medium | |
| WO2012133857A1 (en) | Communication device, path search method and path search program | |
| US20180109954A1 (en) | Location-specific data sharing | |
| CN116782255A (en) | Same-frequency subnet fusion method and device, communication node and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |