CN112351509A - Self-organizing network protocol based on determinacy management method - Google Patents
Self-organizing network protocol based on determinacy management method Download PDFInfo
- Publication number
- CN112351509A CN112351509A CN202011170933.7A CN202011170933A CN112351509A CN 112351509 A CN112351509 A CN 112351509A CN 202011170933 A CN202011170933 A CN 202011170933A CN 112351509 A CN112351509 A CN 112351509A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- forwarding
- local
- received
- 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.)
- Granted
Links
- 238000007726 management method Methods 0.000 title claims abstract description 60
- 230000007246 mechanism Effects 0.000 claims abstract description 21
- 238000000034 method Methods 0.000 claims description 28
- 230000008569 process Effects 0.000 claims description 26
- 238000004364 calculation method Methods 0.000 claims description 6
- 238000005516 engineering process Methods 0.000 abstract description 10
- 230000006855 networking Effects 0.000 abstract description 7
- 238000001514 detection method Methods 0.000 description 17
- 238000004891 communication Methods 0.000 description 16
- 238000011144 upstream manufacturing Methods 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000011664 signaling Effects 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- QVFWZNCVPCJQOP-UHFFFAOYSA-N chloralodol Chemical compound CC(O)(C)CC(C)OC(O)C(Cl)(Cl)Cl QVFWZNCVPCJQOP-UHFFFAOYSA-N 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
Images
Classifications
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/44—Star or tree networks
-
- 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/16—Multipoint routing
-
- 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/22—Alternate routing
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W80/00—Wireless network protocols or protocol adaptations to wireless operation
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a self-organizing network protocol based on a determinability management method, which comprises a gateway node and a control center which are connected through a network, wherein a self-organizing network with a tree-shaped topological structure is formed among the gateway node, each child node and a father node, each node is defined with a backup path discovery mechanism of an uplink route and a downlink route, and a network level management address is defined to each father node connected with the child nodes; wherein the network level management address comprises a network level, a current level forwarding node number and a current node forwarding order. The self-organizing network protocol based on the determinability management method provided by the technical scheme can solve the problems that the existing wireless networking technology does not optimize a large-scale control scene and a special management method is lacked in the aspect of time delay control.
Description
Technical Field
The invention relates to the technical field of self-organizing network protocols, in particular to a self-organizing network protocol based on a determinability management method.
Background
With many scenes in the field of internet of things, objects need to be connected with each other in a wireless manner to acquire information. For scenes with large data throughput, such as video applications, WiFi networks, 5G/4G and other wireless technologies supporting high rates are used for connection. Under some situations, such as ambient temperature and humidity acquisition, the required data volume is small, and a low-rate wireless technology is required for networking. Currently, the mainstream wireless low-rate networking technologies include LoRaWAN, NB-IoT and the like, and the technologies have the common characteristic of adopting a star networking scheme, that is, a terminal and a gateway or a base station directly communicate. The processing capacity and the rate of the terminal are generally lower, but the processing capacity of the gateway and the base station is higher, so that massive terminal connection is supported. However, since the distance of wireless communication is usually limited by the transmission power and environmental factors, it cannot be guaranteed that the terminal and the gateway or the base station always keep normal connection in specific applications, for example, if the LoRaWAN terminal is deployed in an underground pipeline, it is difficult to communicate with the gateway deployed on the ground. The conventional solution is to increase the deployment density of gateways and to install more gateways in a location close to the terminal in an environment with limited communication, which is costly and cannot ensure the installation of gateways when the power supply is limited. Therefore, the wireless ad hoc network technology can be used, when the terminal node and the gateway cannot be directly connected, the terminal is added between the terminal node and the gateway to automatically form a forwarding network, the coverage area of the network can be expanded without depending on a base station, meanwhile, the terminal can be driven by energy sources such as batteries and the like, and the use of a wired power supply does not need to be considered. Similar wireless networking technologies are also used in the market, such as ZigBee, but are not optimized for certain scenarios, such as large-scale street lamp control. When the street lamps have the requirements of unified switching and the like, the ZigBee technology can be realized, but no special management method is provided in the aspects of time delay control and the like. Therefore, it is necessary to design a new technical solution to comprehensively solve the problems in the prior art.
Disclosure of Invention
The invention aims to provide a self-organizing network protocol based on a determinacy management method, which can solve the problems that the existing wireless networking technology does not optimize a large-scale control scene and a special management method is lacked in the aspect of time delay control.
In order to solve the technical problems, the invention adopts the following technical scheme:
a self-organizing network protocol based on a determinacy management method comprises a gateway node and a control center which are connected through a network, wherein a self-organizing network with a tree-shaped topological structure is formed among the gateway node, each child node and a father node, each node is defined with a backup path discovery mechanism of an uplink route and a downlink route, and a network level management address is defined to each father node connected with the child nodes; wherein the network level management address comprises a network level, a current level forwarding node number and a current node forwarding order.
The flow of the self-organizing network protocol comprises the following steps:
network level management distribution, running on gateway nodes; after a certain node successfully accesses the network, a request is sent to a father node, and if the father node is already allocated with a network level management address, no processing is carried out; if the network level management address of the father node is currently set to not forward the broadcast, requesting the gateway node to reconfigure the network level management address of the father node;
a network downlink broadcasting process, which is operated on the branch node; after receiving the broadcast, the branch node checks the local network level management address of the branch node, and if the network level management address of the branch node is not forwarded, the flow is ended; if the network level management address of the branch node is forwarding, broadcast forwarding is realized according to the network level management address setting of the branch node;
an uplink alternative path discovery mechanism, which operates on the branch node; after receiving the broadcast message, the branch node checks the local network hierarchy management address of the branch node and the network hierarchy management address of the sending node, and if the network hierarchy of the sending node is smaller than that of the branch node, the sending node is used as a forwarding node of an uplink path; if the network level of the sending node is larger than that of the branch node, no processing is carried out;
a downlink alternative path discovery mechanism which operates on all nodes; the gateway node sends a request to a father node which can be connected to a destination terminal node, and if the gateway node receives a reply within a specified time, the gateway node updates a routing table and establishes an alternative downlink path; if the gateway node does not receive the reply within the specified time, the process is ended.
In the network downlink broadcasting process, the network level and the forwarding order of the network level management address of the branch node are both 1, and then the branch node updates the local network level management address into the broadcasting information for broadcasting and forwarding.
In the network downlink broadcasting process, the network level and the forwarding order of the network level management address of the branch node are not 1, and the network level management address is calculated according to the following delay calculation method:
Delay＝(Slocal-Sreceived-1) T1 (when S)local>Sreceived，Llocal＝Lreceived)
＝(Nreceived-Sreceived+Slocal-1) T1 (when Llocal＝(Lreceived+1))
In the formula: slocalIndicating the forwarding order of the local node at the current level in the local network level management address, SreceivedIndicating the sending sequence of the forwarding nodes of the received broadcast messages at the current layer, and T1 indicating the time required for forwarding one broadcast message; n is a radical ofreceivedIndicating received broadcastHow many forwarding nodes, L, are in total on the layer where the forwarding node broadcasting the message is locatedreceivedIndicating that the forwarding node of the received broadcast message is at the network level, LlocalThe local network level management address indicates that the local node is at the network level.
When the self-organizing network protocol based on the determinacy management method uses low-speed wireless equipment to carry out networking, unnecessary network control signaling is removed, and wireless bandwidth is reserved for users as much as possible; meanwhile, the network can support the establishment of redundant paths (including an uplink path (from any terminal to the gateway) and a downlink path (from the gateway to any terminal)), so that the robustness and the reliability of the network are ensured, and when a user instruction requires traversing the whole network in a broadcast mode, the traversing time is determined to be controllable.
The self-organizing network protocol based on the determinability management method provided in the above technical solution can be implemented by establishing a broadcast forwarding management mechanism, an uplink alternative path discovery mechanism, and a downlink alternative route discovery mechanism:
(1) the ordered and conflict-free downlink broadcast mechanism ensures that a control signaling or a user command can quickly and reliably reach all nodes in the network.
(2) And (3) establishing an uplink alternative path and a downlink alternative path, wherein the alternative path is the guarantee of the reliability and the flexibility of the network, and if the current path is unavailable, the communication between nodes in the network can bypass the problem node and maintain the network communication.
(3) All communication is controlled by the gateway, and the nodes in the network are in the interception state most of the time and only respond when needed. Bandwidth resources within the network are efficiently utilized.
(4) The time delay of the uplink and downlink communication of the broadcast and unicast in the network is controllable, and the method is suitable for time-sensitive application with control requirements.
(5) The time delay of the communication in the network depends on the specification of the adopted physical communication technology, and the management in the network basically does not influence the communication delay.
Drawings
FIG. 1 is a diagram of a tree based system topology;
FIG. 2 is a schematic diagram of an intra-network broadcast forwarding management mechanism;
FIG. 3 illustrates an upstream backup path discovery mechanism;
fig. 4 is a downlink backup path discovery mechanism;
FIG. 5 is a flow chart of the allocation of network level management addresses for gateway nodes;
fig. 6 is a flow chart of downlink broadcast forwarding;
fig. 7 is a flowchart of uplink alternate path discovery;
fig. 8 is a diagram of a gateway initiating node detection and alternative downlink path discovery process;
FIG. 9 illustrates an intermediate node performing a detection request forwarding process;
fig. 10 is a network node forwarding detection reply process.
Detailed Description
In order that the objects and advantages of the invention will be more clearly understood, the following description is given in conjunction with the accompanying examples. It is to be understood that the following text is merely illustrative of one or more specific embodiments of the invention and does not strictly limit the scope of the invention as specifically claimed.
Referring to fig. 1, on one hand, a gateway node is connected with a remote control center through a public network or a private network, and on the other hand, the gateway node forms a self-organizing network based on a tree topology with each child node and a parent node. Meanwhile, each node is defined with a backup path discovery mechanism of an uplink route and a downlink route, and defines a Network Level Management Address (NLMADDDR) to each parent node connected with a child node (as shown in FIG. 2 and FIG. 5); the NLMADDDR comprises a network level, the number of forwarding nodes of a current level and a forwarding order of the current nodes.
In the process of forming the tree network, after a certain node is successfully accessed to the network, a request needs to be sent to a father node, which indicates that the current node is set as the father node. If the parent node has been assigned NLMADDDR, no processing is done. If the NLMADDDR of the father node is set to not forward the broadcast at present, a request needs to be sent to the gateway node to request the gateway to configure the NLMADDDR.
In another case, the detection request of the gateway to the terminal node is sent by the tree structure standard during the downstream communication, i.e. the detection message is forwarded by the parent node of the detected node. According to this situation, if the child node is found to not respond many times and all the recorded child nodes are the same, the parent node will also send an update NLMADDR request to the gateway, requiring no forwarding.
When the gateway receives the NLMADDDR request of the node, whether the request is applied as a forwarding node is checked from the request, if the request is not forwarded, the NLMADDDR corresponding to the node is set to be not forwarded, the database is updated, and the updated NLMADDDR is issued to the request node.
If the request is applied as a forwarding node, the gateway node firstly extracts the network level L of the request node attached to the request, and then checks the database. If the database records that the number of the nodes with the forwarding function of the level reaches the upper limit, the NLMADDDR capable of being forwarded is not distributed, but the NLMADDDR is set to be not forwarded, the database is updated, and the result is issued to the request node. If the level can also distribute forwarding nodes, new NLMADDDR is distributed to the application nodes, the database is updated, and then the new NLMADDDR is issued to the application nodes.
For example, the NLMADDR of node 2 is 0 × 010202, where 0 × 01 indicates that the current node is 1 deep in the network, i.e., at the first level; the first 02 indicates that 2 nodes with forwarding functions in the same layer exist, and the second 02 indicates that the current node is the second forwarding node in the current layer; similarly, the NLMADDR of node 1 is 0 × 010201, which indicates that node 1 is in the first layer and is the first node in the first layer to forward the broadcast. The NLMADDR of the node 5 is 0 × 020201, which indicates that the node 5 is in the second layer, 2 nodes in the current layer have forwarding function, and the node 5 is the first node to forward in the second layer. Node 4 is also a backbone node but does not need forwarding because it has no children, its NLMADDR is 0 × 020200, meaning that it is at the second level of the network (0 × 02) with two forwarding nodes (0 × 02), but the current node does not need forwarding (0 × 00). The NLMADDR address of node 7 indicates that the current node is at the second level, being the second forwarding node. Each node reports to the gateway node according to the actual situation whether the node is connected with the subnode, and the gateway node is responsible for distributing NLMADDDR information.
Each node forwarding the broadcast message needs to include its own NLMADDR information into the message, so that the next node with forwarding function receiving the broadcast message can calculate immediately when the message should be forwarded.
Assuming that the transmission of a broadcast message takes a time period T1, taking fig. 2 as an example, when the gateway transmits the broadcast:
(1) both the node 1 and the node 2 receive the broadcast, and the node 1 obtains a conclusion by calculating NLMADDDR and immediately forwards the message; the node 2 calculates NLMADDR to obtain a result, and forwards the result after delaying the time duration of T1 × 1.
(2) After the T1 time passes, the node 4 receives the broadcast message sent by the node 1, but the node 4 does not need to forward the broadcast message;
(3) after the time T1 elapses, the node 2 starts forwarding;
(4) after 2 × T1 time elapses, nodes 5 and 7 receive the broadcast message forwarded by node 2, and by checking that node 2 updates NAMADDR of node 2 that enters the broadcast message, node 5 calculates that the broadcast message has been forwarded at the first layer of the network, and it will immediately perform the first forwarding at the second layer; the node 7 calculates that the broadcast message has been forwarded at the first layer of the network, and needs to wait for T1 time before forwarding at the second position;
(5) after 3 × T1 time elapses, node 5 completes broadcast forwarding, and node 7 starts broadcast forwarding;
(6) after 4 × T1 time has elapsed, the broadcast is complete and the gateway information arrives at each node of the entire network.
The time delay is completed by a timer on the wireless communication equipment, and a certain redundancy is set according to the error range of the timer on the premise of controlling the number of forwarding nodes and the network scale, so that the error of the timer can not influence the broadcast forwarding.
As shown in fig. 6, the network downlink broadcast process is executed on a node other than the gateway, and when the node receives the broadcast, the node first checks the local NLMADDR, and if it is set to not forward, the process ends. If the node is a broadcast forwarding node, checking the level L setting and the forwarding order setting S of the local NLMADDDR, if L is 1 and S is 1, indicating that the current node is the first node needing forwarding in the first layer, namely the broadcast is directly obtained from a gateway, updating the local NLMADDDR into a broadcast message by the node, and immediately performing broadcast forwarding.
If the current node is not the first forwarding node of the first layer, delay is calculated according to NLMADDDR of the sending node attached in the broadcast message, and the calculation process is as follows:
Delay＝(Slocal-Sreceived-1) T1 (when S)local>Sreceived，Llocal＝Lreceived)
＝(Nreceived-Sreceived+Slocal-1) T1 (when Llocal＝(Lreceived+1))
Wherein SlocalIndicating the forwarding order of the local node at the current layer in the local NLMADDDR, SreceivedIndicating the transmission order of the forwarding nodes of the received broadcast message at the current layer, and T1 indicating the time required for forwarding one broadcast message. If the current node receives the messages of the forwarding nodes of the same layer and the forwarding order of the forwarding nodes is smaller than that of the local node, the delay is calculated.
NreceivedIndicating how many forwarding nodes, L, are in common at the level of the forwarding node of the received broadcast messagereceivedIndicating that the forwarding node of the received broadcast message is at the network level, LlocalIndicating that the local node is at the home network level in the local network level management address, if the local node is at a network level 1 layer greater than the forwarding node of the received broadcast message, the delay is calculated.
If the delay can be calculated, the local NLMADDDR is updated into the broadcast message and a timer is started. When the timer expires, the broadcast is forwarded. Otherwise, the process is stopped without calculation.
This is because if the network layer where the current node and the forwarder of the intercepted broadcast message are located are the same, the calculation of the delay is based on the difference between the order of the current node and the intercepted forwarding node.
If the network layer where the forwarder of the broadcast message sensed by the current node is located is larger than the current node or smaller than the current node (the difference is larger than 1), the current node does not need to consider delay calculation, because the forwarding of the message may be completed on the current layer or the previous layer of the current layer is not reached yet, and the delay cannot be calculated.
Defining an uplink backup path discovery mechanism for each node as shown in fig. 3 and 7, the gateway node periodically initiates a whole network broadcast process, when each node receives a broadcast message or a forwarded broadcast message, the current node checks NLMADDR and local NLMADDR of a message sending node, and if the network level of the sending node is smaller than the network level of the current node through comparison, the sending node is used as a forwarding node of an uplink path and is updated to a local routing table. If the node is not the parent of the current node, it is equivalent to adding an alternative path.
The method specifically comprises the following steps: when the gateway node is idle and has no task, a downlink broadcast mechanism is started periodically (the time interval is controlled by the gateway and is determined according to the total number of nodes and the busy degree of the user task). In fig. 3, a parent node of a node 5 is a node 2, and in the operation process of the broadcast mechanism, after the broadcast of the node 1 is completed, if the node 5 can receive the broadcast forwarding, it finds that it is in the first layer of the network by analyzing NLMADDR of the broadcast forwarder; because the NLMADDR of node 5 indicates that node 5 is at the second layer of the network and that the broadcast forwarder is not its parent, node 5 may update node 1 to the local routing table as an alternative path to the upstream route; in subsequent upstream communications, if node 2 is unable to communicate, and before node 5 initiates a mechanism to relocate the parent node, node 5 may attempt to use node 1 as an upstream path; every time the downlink broadcasting mechanism is operated, all nodes in the network can discover and update the uplink alternative path.
In general, a terminal node is required to actively report a heartbeat packet in a network, and the existence of the heartbeat packet is reported to a gateway. However, in a low-rate network, the node actively reports the heartbeat packet, which occupies the network bandwidth and affects the downlink communication of the gateway. For example, the maximum rate of the LoRa terminal under the Sub-1Ghz band is only 37.5 kbps. If a large number of nodes are deployed in the network and each node autonomously decides the heartbeat packet transmission, communication collision is easily caused. The detection of the terminal node specified in the protocol of the invention is actively initiated by the gateway, namely the gateway sends an inquiry packet to the terminal node, and the terminal node replies the inquiry. Therefore, all nodes are in a receiving state at ordinary times, the transmitting operation is generated only when the gateway inquires, and because the unicast communication is adopted, a plurality of nodes cannot transmit at the same time; if the gateway temporarily receives the user command, downlink communication needs to be sent, and terminal detection can be stopped at any time until the user task is completed.
Defining a downlink backup path discovery mechanism for each node as shown in fig. 4 and 8, when a gateway prepares to perform a node detection process, if it is desired to simultaneously execute an alternative downlink path discovery process, setting a DDS to 1, then selecting a parent node capable of being connected to a destination terminal node as a forwarding node according to the requirement of a tree topology structure, and sending a request; after the detection request is sent out, the gateway is in a waiting state. If a reply is received within the specified time, the routing table is updated. Because DDS is set to 1, if there are paths other than the downstream path specified according to the tree topology, the reply should be reported from the available alternative paths to the gateway. Whereby the gateway can establish or update an alternative downstream path to the specified destination node. If no reply is received upon timeout, the process ends.
For example, in fig. 4, the gateway node initiates a device detection message for the node 5, and sets a downlink routing management switch parameter (DDS) to 1, where the message first passes through the node 2, i.e., a parent node of the node 5, and then reaches the node 5; after receiving the detection message, the node 5 prepares to send a reply. If DDS in the gateway detection message is set to be 0, the node 5 sends a reply back to the gateway through the father node 2 according to the provision of the tree network; if DDS is set to 1, node 5 checks the routing table, and if there is a backup upstream path, sends a reply using the backup path, i.e. node 1 in the above figure. After the gateway receives the reply from node 1, an alternate path may be established from the gateway to node 5, i.e., forwarded through node 1. At the same time, node 1 also establishes a downlink path to node 5.
The intermediate node performs a detection request forwarding process as shown in fig. 9, where the detection request initiated by the gateway is forwarded along a downlink in the network. When a certain node receives a request, if the node is not the destination node, selecting a child node which can be connected to the destination node according to the tree topology structure for forwarding. If the node is the destination node, the DDS setting is checked. If DDS is set to 0, the parent node is selected to send a detection reply. If DDS is set to 1, alternative uplink paths are detected. And if the alternative uplink path exists, selecting the alternative path to send the reply, and otherwise, still selecting the parent node to send the reply.
The network node forwarding detection reply process is as shown in fig. 10, and when the network node receives the network detection reply, if the current node is the destination node, the process is ended. Otherwise, the setting of DDS in reply is checked. If DDS is set to 0, the father node is selected to forward the reply. If DDS is set to 1, whether an alternative uplink path exists locally is checked. If so, selecting an alternative path to forward the reply, otherwise, selecting a parent node to forward the reply.
The present invention is not limited to the above embodiments, and those skilled in the art can make various equivalent changes and substitutions without departing from the principle of the present invention after learning the content of the present invention, and these equivalent changes and substitutions should be considered as belonging to the protection scope of the present invention.
Claims (4)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011170933.7A CN112351509B (en) | 2020-10-28 | 2020-10-28 | A self-organizing network management method based on determinism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011170933.7A CN112351509B (en) | 2020-10-28 | 2020-10-28 | A self-organizing network management method based on determinism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112351509A true CN112351509A (en) | 2021-02-09 |
| CN112351509B CN112351509B (en) | 2025-02-07 |
Family
ID=74358855
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011170933.7A Active CN112351509B (en) | 2020-10-28 | 2020-10-28 | A self-organizing network management method based on determinism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112351509B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114363357A (en) * | 2021-12-28 | 2022-04-15 | 山东浪潮科学研究院有限公司 | Distributed database network connection management method based on Gossip |
| CN114390476A (en) * | 2022-02-10 | 2022-04-22 | 重庆邮电大学 | Aviation ad hoc network routing method based on end-to-end quality parameters |
| CN114629518A (en) * | 2022-03-31 | 2022-06-14 | 厦门骐俊物联科技股份有限公司 | Dynamic ad hoc network method of digital interphone |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050152305A1 (en) * | 2002-11-25 | 2005-07-14 | Fujitsu Limited | Apparatus, method, and medium for self-organizing multi-hop wireless access networks |
| KR20100068153A (en) * | 2008-12-12 | 2010-06-22 | 한국전자통신연구원 | Path setting apparatus and method based on attributes of an ad-hoc network |
| CN103781144A (en) * | 2014-02-28 | 2014-05-07 | 东南大学 | Zigbee network tree-shaped routing method for neighbor table mode interaction |
-
2020
- 2020-10-28 CN CN202011170933.7A patent/CN112351509B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050152305A1 (en) * | 2002-11-25 | 2005-07-14 | Fujitsu Limited | Apparatus, method, and medium for self-organizing multi-hop wireless access networks |
| KR20100068153A (en) * | 2008-12-12 | 2010-06-22 | 한국전자통신연구원 | Path setting apparatus and method based on attributes of an ad-hoc network |
| CN103781144A (en) * | 2014-02-28 | 2014-05-07 | 东南大学 | Zigbee network tree-shaped routing method for neighbor table mode interaction |
Non-Patent Citations (2)
| Title |
|---|
| MINGQIANG ZHU: "A Smart collaborative Routing Protocol for Delay sensitive Applications in Industrial IoT", 《IEEE ACESS》, 3 January 2020 (2020-01-03) * |
| 王宇昆: "认知无线自组网中组网算法的研究", 《CNKI优秀硕士论文电子期刊》, 15 October 2018 (2018-10-15) * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114363357A (en) * | 2021-12-28 | 2022-04-15 | 山东浪潮科学研究院有限公司 | Distributed database network connection management method based on Gossip |
| CN114363357B (en) * | 2021-12-28 | 2024-01-19 | 上海沄熹科技有限公司 | Distributed database network connection management method based on Gossip |
| CN114390476A (en) * | 2022-02-10 | 2022-04-22 | 重庆邮电大学 | Aviation ad hoc network routing method based on end-to-end quality parameters |
| CN114390476B (en) * | 2022-02-10 | 2025-02-14 | 重庆邮电大学 | A routing method for aviation ad hoc networks based on end-to-end quality parameters |
| CN114629518A (en) * | 2022-03-31 | 2022-06-14 | 厦门骐俊物联科技股份有限公司 | Dynamic ad hoc network method of digital interphone |
| CN114629518B (en) * | 2022-03-31 | 2024-03-01 | 厦门骐俊物联科技股份有限公司 | Dynamic ad hoc network method of digital interphone |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112351509B (en) | 2025-02-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8081628B2 (en) | Multicast distribution tree establishment and maintenance in a wireless multi-hop relay communication system | |
| CN100591029C (en) | A Multi-hop Wireless Ad Hoc Network Construction Method Based on Partition Tree | |
| CN100442786C (en) | Routing Method Based on Tree Structure | |
| CA3148150A1 (en) | Connection establishment method,device,integrated access backhaul node and storage medium | |
| Jawhar et al. | Quality of service routing in mobile ad hoc networks | |
| CN112351509B (en) | A self-organizing network management method based on determinism | |
| EP2769510B1 (en) | Peer-to-peer communications in ami with source-tree routing | |
| CN104125620A (en) | Relay selection routing method and relay selection routing device based on terminal device-to-device communication | |
| WO2009039012A1 (en) | Method and device for providing an alternative backhaul portal in a mesh network | |
| CN103428089A (en) | Method and system for optimizing low-voltage power line carrier communication network | |
| CN112073920A (en) | Networking method of wireless grid network node and network node equipment | |
| CN106953683B (en) | Route realization method suitable for large-scale dynamic networking based on MF-TDMA satellite channel | |
| CN106330731B (en) | A kind of multicast tree method for building up of wireless self-networking | |
| CN101102283A (en) | A method and device for optimizing unknown unicast forward at wireless access point | |
| CN105873169A (en) | Wireless ad-hoc network communication method | |
| CN109510769B (en) | Converged routing system suitable for wide-narrow combined network and method thereof | |
| CN113572691A (en) | Method for realizing hybrid routing protocol based on time pulse source | |
| WO2002078272A1 (en) | A method and system for providing bridged mobile ad-hoc networks | |
| EP1699169A1 (en) | Wireless base station, wireless mobile device, and wireless access network for reducing signalling traffic | |
| Jin et al. | MANET for Disaster Relief based on NDN | |
| CN103178983A (en) | Method and device for configuring shortest path first protocol interface area identifications | |
| WO2019149035A1 (en) | Method for discovering device in mesh network | |
| CN114845287A (en) | Low-voltage acquisition system based on Bluetooth mesh and clustering ad hoc network method | |
| CN112995043B (en) | Information processing method and device in wireless mesh network and electronic equipment | |
| KR101371651B1 (en) | A method for constructing a tree in mobile ad hoc network |
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 |