CN112511434A - Internet of things node access path planning method, device, equipment and storage medium - Google Patents
Internet of things node access path planning method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN112511434A CN112511434A CN202011337455.4A CN202011337455A CN112511434A CN 112511434 A CN112511434 A CN 112511434A CN 202011337455 A CN202011337455 A CN 202011337455A CN 112511434 A CN112511434 A CN 112511434A
- Authority
- CN
- China
- Prior art keywords
- internet
- node
- things
- nodes
- paths
- 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.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
- G16Y10/00—Economic sectors
- G16Y10/75—Information technology; Communication
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
- G16Y40/00—IoT characterised by the purpose of the information processing
- G16Y40/30—Control
- G16Y40/35—Management of things, i.e. controlling in accordance with a policy or in order to achieve specified objectives
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/24—Multipath
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
Landscapes
- Engineering & Computer Science (AREA)
- Computing Systems (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Business, Economics & Management (AREA)
- General Business, Economics & Management (AREA)
- Economics (AREA)
- Development Economics (AREA)
- Accounting & Taxation (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention discloses a method and a device for planning an access path of a node of the Internet of things, node equipment of the Internet of things and a storage medium. The method comprises the following steps: acquiring the transition probability of the nodes of the Internet of things, and confirming the connection relation of the nodes of the Internet of things on the basis of the transition probability; disconnecting a first internet of things node with a preset network external arrival rate from a currently connected second internet of things node; taking a first Internet of things node as a root node, and sequentially adding non-sink nodes as child nodes of the first Internet of things to obtain leaf nodes; deleting leaf nodes with node numbers overlapped with the corresponding father nodes and the layers where the brother nodes are located; and traversing the currently reserved child nodes from the first Internet of things node, and outputting all paths capable of reaching the second Internet of things node. When the path confirmation is carried out on the queuing network, the path between the two nodes is quickly optimized and realized, and the calculation task and the calculation force requirement of the whole internet of things during path planning are effectively reduced.
Description
Technical Field
The embodiment of the invention relates to the technical field of networks, in particular to a method, a device, equipment and a storage medium for planning an access path of a node of an Internet of things.
Background
Internet of Things (IoT) is regarded as a major development and transformation opportunity in the information field, and is expected to bring revolutionary transformation, which will have all-round impact in various fields such as industry, agriculture, property, city management, security and fire fighting in a relatively common view. But technically, the internet of things not only changes the main body of data transmission, but also differs significantly from the conventional communication. For example, a feature of the large-scale internet of things is that a large number of users sporadically transmit very small packets, unlike conventional cellular communications.
The inventor finds that access of a large number of users in the process of applying the large-scale internet of things causes the complexity of a traditional user detection scheme to be too high to use, particularly for a queuing network formed by a wireless sensor network, an optimal path can be determined after the time delay of each node is calculated, and the calculation task in the whole internet of things path planning process is aggravated.
Disclosure of Invention
The invention provides a method, a device, equipment and a storage medium for planning an access path of a node of the Internet of things, which aim to solve the technical problem that the calculation task is aggravated in the path planning process of the Internet of things in the prior art.
In a first aspect, an embodiment of the present invention provides a method for planning an access path of a node of an internet of things, including:
acquiring the transition probability of the nodes of the Internet of things, and confirming the connection relation of the nodes of the Internet of things on the basis of the transition probability;
disconnecting a first internet of things node with a preset network external arrival rate from a currently connected second internet of things node;
taking the first Internet of things node as a root node, and sequentially adding non-sink nodes as child nodes of the first Internet of things to obtain leaf nodes;
deleting leaf nodes with node numbers overlapped with the corresponding father nodes and the layers where the brother nodes are located;
and traversing the currently reserved child nodes from the first internet of things node, and outputting all paths capable of reaching the second internet of things node.
Further, after traversing the currently reserved child nodes from the first internet of things node and outputting all paths capable of reaching the second internet of things node, the method further includes:
and comparing all the paths based on the service rate of the nodes to obtain at least one preferred path.
Further, the comparing all the paths based on the node service rate to obtain at least one preferred path includes:
comparing all the paths by taking the service rate of the nodes as a weight, and deleting the paths with redundant nodes;
and taking all the remaining paths or paths with the delay effect within the set range in the remaining paths as the preferred paths.
Further, the method further comprises:
and if the actual path currently selected from the preferred paths is in a blocking state, selecting other paths from the preferred paths as the actual paths.
In a second aspect, an embodiment of the present invention further provides an internet of things node access path planning apparatus, including:
the relationship confirmation unit is used for acquiring the transition probability of the nodes of the Internet of things and confirming the connection relationship of the nodes of the Internet of things based on the transition probability;
the node disconnection unit is used for disconnecting a first Internet of things node with a preset network external arrival rate from a second Internet of things node which is connected currently;
the node adding unit is used for sequentially adding non-aggregation nodes as child nodes of the first internet of things by taking the first internet of things node as a root node so as to obtain leaf nodes;
a node deleting unit, configured to delete a leaf node having a node number coinciding with a layer where the corresponding parent node and the sibling node are located;
and the path output unit is used for traversing the currently reserved child nodes from the first internet of things node and outputting all paths capable of reaching the second internet of things node.
Further, the apparatus further includes:
and the path optimization unit is used for comparing all the paths based on the service rate of the nodes to obtain at least one optimized path.
Further, the path optimization unit includes:
the path deleting module is used for comparing all the paths by taking the node service rate as a weight and deleting the paths with redundant nodes;
and the path selection module is used for taking all the paths or the paths with the delay effect within the set range in the remaining paths as the preferred paths.
Further, the apparatus further includes:
and the path switching unit is used for selecting other paths from the preferred paths as the actual paths if the actual paths currently selected from the preferred paths are in a blocking state.
In a third aspect, an embodiment of the present invention further provides an internet of things node device, including:
one or more processors;
a memory for storing one or more programs;
when the one or more programs are executed by the one or more processors, the node device of the internet of things is enabled to implement the method for planning an access path of a node of the internet of things according to any one of the first aspect.
In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the method for planning an access path of a node of an internet of things according to the first aspect.
The method and the device for planning the access path of the node of the internet of things, the node equipment of the internet of things and the storage medium acquire the transition probability of the node of the internet of things, and confirm the connection relation of the node of the internet of things based on the transition probability; disconnecting a first internet of things node with a preset network external arrival rate from a currently connected second internet of things node; taking the first Internet of things node as a root node, and sequentially adding non-sink nodes as child nodes of the first Internet of things to obtain leaf nodes; deleting leaf nodes with node numbers overlapped with the corresponding father nodes and the layers where the brother nodes are located; and traversing the currently reserved child nodes from the first internet of things node, and outputting all paths capable of reaching the second internet of things node. When the path confirmation is carried out on the queuing network, the path between the two nodes is quickly optimized and realized, and the calculation task and the calculation force requirement of the whole internet of things during path planning are effectively reduced.
Drawings
Fig. 1 is a flowchart of a method for planning an access path of a node of an internet of things according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of an internet of things node access path planning device according to a second embodiment of the present invention;
fig. 3 is a schematic structural diagram of an internet of things node device according to a third embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are for purposes of illustration and not limitation. It should be further noted that, for the convenience of description, only some of the structures related to the present invention are shown in the drawings, not all of the structures.
It should be noted that, for the sake of brevity, this description does not exhaust all alternative embodiments, and it should be understood by those skilled in the art after reading this description that any combination of features may constitute an alternative embodiment as long as the features are not mutually inconsistent.
The following examples are described in detail.
Example one
Fig. 1 is a flowchart of a method for planning an access path of a node of an internet of things according to an embodiment of the present invention. The method for planning the access path of the node of the internet of things provided in the embodiment may be executed by various operation devices (mainly node devices of the internet of things) for planning the access path of the node of the internet of things, the operation devices may be implemented in a software and/or hardware manner, and the operation devices may be formed by two or more physical entities or may be formed by one physical entity.
The application scenario specifically aimed at by the scheme is a large-scale wireless sensor network, and the current wireless sensor network generally adopts a clustering structure. Taking two clusters as an example, an arrival node, a transmission node and a sink node may exist in each cluster, wherein the sink node is responsible for communication between a sensing node in the cluster and a sink node in another cluster. Data transmission is carried out between all nodes of the wireless sensor network for monitoring the temperature for statistics, and the data packet transfer probability between all the nodes can be obtained.
Specifically, referring to fig. 1, the method for planning the access path of the node of the internet of things specifically includes:
step S101: and acquiring the transition probability of the nodes of the Internet of things, and confirming the connection relation of the nodes of the Internet of things based on the transition probability.
In communication theory, a markov chain consists of m states, and history is translated into a sequence of the m states. Starting from any state, one of the states 1, 2, … …, m must occur through any transition, and the transition between the states is called transition probability. In the scheme, the transmission transfer relation of the data packets in each internet of things node is described specifically through a transfer probability matrix, and if the sum of values of one row in the transfer probability matrix is not equal to 1, the corresponding internet of things node has a data packet leaving probability. According to the difference of the arrival rates, the node can be determined to be the sink node or not.
Step S102: and disconnecting the first Internet of things node with the preset external network arrival rate from the currently connected second Internet of things node.
According to the transition probability obtained in the step S101, the first internet of things with the preset network external arrival rate is further disconnected from the currently connected second internet of things node, so that a path is re-planned on the basis of the first internet of things node in the following.
Step S103: and taking the first Internet of things node as a root node, and sequentially adding non-aggregation nodes as child nodes of the first Internet of things to obtain leaf nodes.
When a path is specifically planned, the first internet of things node is taken as a root node, non-sink nodes are gradually added as leaf nodes of the first internet of things node for standby, a path prototype based on the first internet of things node is preliminarily constructed, and the path is planned on the basis of the path prototype. The path planning strategy based on the non-convergent nodes can effectively improve the utilization rate of relatively idle nodes, so that data transmission tasks in the whole Internet of things are distributed in a balanced manner, and the data transmission efficiency of the whole Internet of things is improved.
Step S104: and deleting the leaf nodes which are overlapped with the node numbers of the layers where the corresponding parent nodes and the brother nodes are located.
In the specific path planning process, other optional nodes are sequentially added to a path tree taking the first internet of things as a root node, and in the node relationship of the path tree, a father node can send a data packet to a byte point. Of course, all optional nodes added to the path tree are not retained as nodes of a new path, but are deleted according to the node number relationship between the node and a parent node and a sibling node, and mainly leaf nodes with the same node number are deleted.
Step S105: and traversing the currently reserved child nodes from the first internet of things node, and outputting all paths capable of reaching the second internet of things node.
For the currently reserved child nodes, only smooth transmission of time data packets from the first internet of things node to each node can be ensured, and finally a path from the first internet of things node to the second internet of things node needs to be planned, so that the currently reserved child nodes need to be traversed, the path formed by the first internet of things node passing through all levels of nodes in the path tree can be ensured to reach the second internet of things, and as for the path strength which cannot reach the second internet of things node, subsequent processing is not performed, and the original connection state is maintained.
On the basis of all the traversed paths, the paths can be further compared and optimized, specifically, which one or more of the obtained paths has a better transmission effect through the node service rate, if a plurality of paths exist, the paths can be switched to another path according to the path state in the subsequent specific transmission process, that is: and comparing all the paths based on the service rate of the nodes to obtain at least one preferred path. All data packets can obtain good transmission indexes as much as possible under various data transmission requirements, and waiting or time delay during path blocking is reduced.
In summary, in the process of implementing the preferred path confirmation, the following two steps can be implemented:
comparing all the paths by taking the service rate of the nodes as a weight, and deleting the paths with redundant nodes;
and taking all the remaining paths or paths with the time delay effect within a set range in the remaining paths as the preferred paths.
The time delay effect may be that the absolute effect of the time delay is in the setting range, or that the relative effect of the time delay is in the setting range. The absolute effect means that the specific index of the time delay reaches the set standard, and the relative effect means that the ranking of the time delay in all paths reaches the set standard.
When the planning path of the scheme is used specifically, if the actual path currently selected from the preferred paths is in a blocking state, other paths are selected from the preferred paths as the actual paths. Considering that the data transmission state in the network is a constantly and dynamically changing process, the currently selected optimal path may become blocked along with the time, and one of the original planned paths may be selected as a new actual path to ensure a good transmission effect. Further, if the path is switched constantly at a higher frequency, the path planning method in the present solution may be executed again to obtain multiple paths again for data transmission.
On the whole, through the scheme, the fact that different types of Internet of things nodes in the existing Internet of things have different service rates is considered, and then specific problems are correspondingly solved. Assuming that the service rate of the arriving node and the leaving node is 10 packets/second, the service rate of the transmitting node is 20 packets/second, and the service rate of the sink node is 30 packets/second, the delay of any path of the internet of things queued by the wireless sensor can be calculated based on the relevant parameters of the above service rates. In fact, because the number of the paths in the queuing network is large, if the time delay of each path is calculated, a larger calculation task is brought, the cost and the timeliness of the path optimization are poor, and the actual data transmission requirement of the internet of things in the use process can not be met. According to the scheme, on the basis of the prior art, the path planning cost is effectively reduced, and meanwhile, good transmission parameter indexes of the planned path are guaranteed.
Acquiring the transition probability of the nodes of the Internet of things, and confirming the connection relation of the nodes of the Internet of things based on the transition probability; disconnecting a first internet of things node with a preset network external arrival rate from a currently connected second internet of things node; taking the first Internet of things node as a root node, and sequentially adding non-sink nodes as child nodes of the first Internet of things to obtain leaf nodes; deleting leaf nodes with node numbers overlapped with the corresponding father nodes and the layers where the brother nodes are located; and traversing the currently reserved child nodes from the first internet of things node, and outputting all paths capable of reaching the second internet of things node. When the path confirmation is carried out on the queuing network, the path between the two nodes is quickly optimized and realized, and the calculation task and the calculation force requirement of the whole internet of things during path planning are effectively reduced. Especially, the path planning strategy based on the non-convergent nodes can effectively improve the utilization rate of relatively idle nodes, so that data transmission tasks in the whole internet of things are distributed in a balanced manner, and the data transmission efficiency of the whole internet of things is improved.
Example two
Fig. 2 is a schematic structural diagram of an internet of things node access path planning device according to a second embodiment of the present invention. Referring to fig. 2, the internet of things node access path planning apparatus includes: a relationship confirming unit 210, a node disconnecting unit 220, a node adding unit 230, a node deleting unit 240, and a path outputting unit 250.
The relationship confirming unit 210 is configured to obtain a transition probability of an internet of things node, and confirm a connection relationship of the internet of things node based on the transition probability; a node disconnection unit 220, configured to disconnect a first internet of things node having a preset network external arrival rate from a currently connected second internet of things node; a node adding unit 230, configured to take the first internet of things node as a root node, and sequentially add non-aggregation nodes as child nodes of the first internet of things to obtain leaf nodes; a node deleting unit 240 configured to delete a leaf node having a node number that coincides with a node number of a layer where the corresponding parent node and the sibling node are located; and a path output unit 250, configured to traverse the currently reserved child nodes from the first internet of things node, and output all paths that can reach the second internet of things node.
On the basis of the above embodiment, the node adding unit 230 includes:
the first adding module is used for sequentially adding non-sink nodes as child nodes of the first internet of things by taking the first internet of things node as a root node so as to obtain leaf nodes;
on the basis of the above embodiment, the node deleting unit 240 includes:
and the first deleting module is used for deleting the leaf nodes which are overlapped with the node numbers of the corresponding father nodes and the layers where the brother nodes are located.
On the basis of the above embodiment, the apparatus further includes:
and the path optimization unit is used for comparing all the paths based on the service rate of the nodes to obtain at least one optimized path.
On the basis of the above embodiment, the path optimizing unit includes:
the path deleting module is used for comparing all the paths by taking the node service rate as a weight and deleting the paths with redundant nodes;
and the path selection module is used for taking all the paths or the paths with the delay effect within the set range in the remaining paths as the preferred paths.
On the basis of the above embodiment, the apparatus further includes:
and the path switching unit is used for selecting other paths from the preferred paths as the actual paths if the actual paths currently selected from the preferred paths are in a blocking state.
The internet of things node access path planning device provided by the embodiment of the invention is included in the internet of things node access path planning equipment, can be used for executing any one of the internet of things node access path planning methods provided by the first embodiment of the invention, and has corresponding functions and beneficial effects.
EXAMPLE III
Fig. 3 is a schematic structural diagram of a node device of the internet of things according to a third embodiment of the present invention, as shown in fig. 3, the terminal device includes a processor 310, a memory 320, an input device 330, an output device 340, and a communication device 350; the number of the processors 310 in the terminal device may be one or more, and one processor 310 is taken as an example in fig. 3; the processor 310, the memory 320, the input device 330, the output device 340 and the communication device 350 in the terminal equipment may be connected by a bus or other means, and the connection by the bus is taken as an example in fig. 3.
The memory 320 is a computer-readable storage medium, and can be used to store software programs, computer-executable programs, and modules, such as program instructions/modules corresponding to the internet of things node access path planning method in the embodiment of the present invention (for example, the relationship confirming unit 210, the node disconnecting unit 220, the node adding unit 230, the node deleting unit 240, and the path outputting unit 250 in the internet of things node access path planning apparatus). The processor 310 executes various functional applications and data processing of the terminal device by running the software programs, instructions and modules stored in the memory 320, that is, the method for planning the access path of the node of the internet of things is implemented.
The memory 320 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application program required for at least one function; the storage data area may store data created according to the use of the terminal device, and the like. Further, the memory 320 may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some examples, memory 320 may further include memory located remotely from processor 310, which may be connected to the terminal device via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The input device 330 may be used to receive input numeric or character information and generate key signal inputs related to user settings and function control of the terminal apparatus. The output device 340 may include a display device such as a display screen.
The terminal equipment comprises the Internet of things node access path planning device, can be used for executing any Internet of things node access path planning method, and has corresponding functions and beneficial effects.
Example four
Embodiments of the present invention further provide a storage medium containing computer-executable instructions, where the computer-executable instructions are executed by a computer processor to perform relevant operations in the method for planning an access path of a node of an internet of things provided in any embodiment of the present invention, and have corresponding functions and advantages.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product.
Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein. The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks. These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks. These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory. The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). The memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus 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 apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.
It is to be noted that the foregoing is only illustrative of the preferred embodiments of the present invention and the technical principles employed. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, although the present invention has been described in greater detail by the above embodiments, the present invention is not limited to the above embodiments, and may include other equivalent embodiments without departing from the spirit of the present invention, and the scope of the present invention is determined by the scope of the appended claims.
Claims (10)
1. An Internet of things node access path planning method is characterized by comprising the following steps:
acquiring the transition probability of the nodes of the Internet of things, and confirming the connection relation of the nodes of the Internet of things on the basis of the transition probability;
disconnecting a first internet of things node with a preset network external arrival rate from a currently connected second internet of things node;
taking the first Internet of things node as a root node, and sequentially adding non-sink nodes as child nodes of the first Internet of things to obtain leaf nodes;
deleting leaf nodes with node numbers overlapped with the corresponding father nodes and the layers where the brother nodes are located;
and traversing the currently reserved child nodes from the first internet of things node, and outputting all paths capable of reaching the second internet of things node.
2. The method according to claim 1, wherein after traversing the currently reserved child nodes from the first internet of things node and outputting all paths that can reach the second internet of things node, further comprising:
and comparing all the paths based on the service rate of the nodes to obtain at least one preferred path.
3. The method of claim 2, wherein said comparing all of said paths based on node service rates to obtain at least one preferred path comprises:
comparing all the paths by taking the service rate of the nodes as a weight, and deleting the paths with redundant nodes;
and taking all the remaining paths or paths with the delay effect within the set range in the remaining paths as the preferred paths.
4. The method of claim 3, further comprising:
and if the actual path currently selected from the preferred paths is in a blocking state, selecting other paths from the preferred paths as the actual paths.
5. An internet of things node access path planning device is characterized by comprising:
the relationship confirmation unit is used for acquiring the transition probability of the nodes of the Internet of things and confirming the connection relationship of the nodes of the Internet of things based on the transition probability;
the node disconnection unit is used for disconnecting a first Internet of things node with a preset network external arrival rate from a second Internet of things node which is connected currently;
the node adding unit is used for sequentially adding non-aggregation nodes as child nodes of the first internet of things by taking the first internet of things node as a root node so as to obtain leaf nodes;
a node deleting unit, configured to delete a leaf node having a node number coinciding with a layer where the corresponding parent node and the sibling node are located;
and the path output unit is used for traversing the currently reserved child nodes from the first internet of things node and outputting all paths capable of reaching the second internet of things node.
6. The apparatus of claim 5, further comprising:
and the path optimization unit is used for comparing all the paths based on the service rate of the nodes to obtain at least one optimized path.
7. The apparatus of claim 6, wherein the path preference unit comprises:
the path deleting module is used for comparing all the paths by taking the node service rate as a weight and deleting the paths with redundant nodes;
and the path selection module is used for taking all the paths or the paths with the delay effect within the set range in the remaining paths as the preferred paths.
8. The apparatus of claim 5, further comprising:
and the path switching unit is used for selecting other paths from the preferred paths as the actual paths if the actual paths currently selected from the preferred paths are in a blocking state.
9. An internet of things node device, comprising:
one or more processors;
a memory for storing one or more programs;
when executed by the one or more processors, cause the node device of the internet of things to implement the method of internet of things node access path planning as claimed in any of claims 1-4.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, implements the method for internet of things node access path planning according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011337455.4A CN112511434A (en) | 2020-11-25 | 2020-11-25 | Internet of things node access path planning method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011337455.4A CN112511434A (en) | 2020-11-25 | 2020-11-25 | Internet of things node access path planning method, device, equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112511434A true CN112511434A (en) | 2021-03-16 |
Family
ID=74959311
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011337455.4A Pending CN112511434A (en) | 2020-11-25 | 2020-11-25 | Internet of things node access path planning method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112511434A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114928568A (en) * | 2022-06-16 | 2022-08-19 | 中国联合网络通信集团有限公司 | Routing path selection method, device and computer readable storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104572430A (en) * | 2013-10-24 | 2015-04-29 | 腾讯科技（深圳）有限公司 | Method, device and system for testing terminal application interface |
| CN108075975A (en) * | 2017-12-28 | 2018-05-25 | 吉林大学 | The definite method and definite system in the route transmission path in a kind of environment of internet of things |
-
2020
- 2020-11-25 CN CN202011337455.4A patent/CN112511434A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104572430A (en) * | 2013-10-24 | 2015-04-29 | 腾讯科技（深圳）有限公司 | Method, device and system for testing terminal application interface |
| CN108075975A (en) * | 2017-12-28 | 2018-05-25 | 吉林大学 | The definite method and definite system in the route transmission path in a kind of environment of internet of things |
Non-Patent Citations (1)
| Title |
|---|
| 邱铁: "物联网中大规模感知节点建模与性能优化", 《CNKI博士论文全文数据库》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114928568A (en) * | 2022-06-16 | 2022-08-19 | 中国联合网络通信集团有限公司 | Routing path selection method, device and computer readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3353952B1 (en) | Managing groups of servers | |
| CN105103492A (en) | Controlling a topology of a network | |
| KR20170134576A (en) | Method and apparatus for selecting time-based nodes | |
| WO2017215378A1 (en) | Software-defined network, node, path calculation method and device, and storage medium | |
| JP2004208297A (en) | System and method for rapid selection of device in tree topology network | |
| US10771372B2 (en) | Transmitting test traffic on a communication link | |
| CN111147372B (en) | Downlink message sending and forwarding method and device | |
| CN112583716A (en) | Path selection method and device based on data transmission of Internet of things | |
| CN106130960A (en) | Judgement system, load dispatching method and the device of steal-number behavior | |
| Biswas et al. | A novel leader election algorithm based on resources for ring networks | |
| CN112511434A (en) | Internet of things node access path planning method, device, equipment and storage medium | |
| CN112583941B (en) | Method for supporting access of multiple power terminals, unit node and power Internet of things | |
| US10474644B2 (en) | Systems and methods for optimizing selection of a replication data node in a distributed file system | |
| CN105743786A (en) | A software defined wireless network mapping method and device | |
| CN102769495B (en) | A kind of optical fiber access network equipment communication means, Apparatus and system | |
| US10700890B1 (en) | Spanning tree protocol port-based link selection system | |
| CN112468317A (en) | Cluster topology updating method, system, equipment and computer storage medium | |
| CN104509043A (en) | Phase-based packet prioritization | |
| CN112533263A (en) | Sensor network path optimization method, device, equipment and storage medium | |
| CN112512093A (en) | Internet of things node access path updating method, device, equipment and storage medium | |
| CN101163106B (en) | Method of executing combined service in wireless self-organizing network | |
| CN102647424A (en) | Data transmission method and data transmission device | |
| CN108848156B (en) | Access gateway processing method, device and storage medium | |
| CN112770271A (en) | Data transmission method, device, system and storage medium based on information broadcast | |
| CN112769697B (en) | Transmission path distribution method and device for multi-user access |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210316 |