CN117202305A - Rapid networking method based on efficient searching mode - Google Patents
Rapid networking method based on efficient searching mode Download PDFInfo
- Publication number
- CN117202305A CN117202305A CN202311019682.6A CN202311019682A CN117202305A CN 117202305 A CN117202305 A CN 117202305A CN 202311019682 A CN202311019682 A CN 202311019682A CN 117202305 A CN117202305 A CN 117202305A
- Authority
- CN
- China
- Prior art keywords
- node
- hop
- searching
- nodes
- network
- 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
- 238000000034 method Methods 0.000 title claims abstract description 46
- 230000006855 networking Effects 0.000 title claims abstract description 29
- 230000004044 response Effects 0.000 claims abstract description 16
- 230000001360 synchronised effect Effects 0.000 claims abstract description 14
- 238000012790 confirmation Methods 0.000 claims abstract description 7
- 230000007246 mechanism Effects 0.000 claims abstract description 7
- 230000008569 process Effects 0.000 claims description 16
- 238000004891 communication Methods 0.000 description 11
- 239000011159 matrix material Substances 0.000 description 8
- 238000010586 diagram Methods 0.000 description 5
- 238000009792 diffusion process Methods 0.000 description 3
- 238000012423 maintenance Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a quick networking method based on an efficient searching mode, which is characterized in that interception is carried out for a period of time before a master node is networking based on the efficient searching mode, if a cooperative network is not available, a searching instruction for searching a slave node is initiated, based on a response confirmation mechanism of the searching instruction, the master node obtains node information and feedback searching results of the slave node, based on the node information and the feedback searching results of the slave node, the master node determines at least one relay node according to a preset rule after obtaining a full network topological structure relationship, the master node broadcasts the full network topological structure relationship through a control command, and the master node determines slave node sequence and network time slot allocation based on the preset rule, thereby realizing quick establishment of a synchronous network. The invention can make the master node quickly and smoothly obtain the topology structure relation of the whole network, realize quick networking and avoid the phenomenon of broadcast storm in relay forwarding.
Description
Technical Field
The invention belongs to the technical field of wireless communication, and particularly relates to a rapid networking method based on an efficient searching mode.
Background
In the field of radio communications, networks carry a multitude of services, which are increasingly widely used and which are emerging for a number of very distinctive industrial applications. The network application is not separated from various basic networking technologies, and the network establishment premise is that communication nodes in a preset range can be found in time to exchange information with each other. If the number of nodes is large and the distribution range is wide, communication of some nodes requires intermediate node communication relay (such nodes are called "relay nodes"). How to discover the nodes and determine the topology relationship between them quickly before networking determines network networking time, node time slot allocation, routing, network maintenance, etc. That is, when the master node can obtain part of parameters of the network node in advance, the synchronous networking process can be quickened.
The node discovery algorithm in the existing networking mostly adopts a relay forwarding mode, namely, after receiving a synchronization signal B of a master node from a slave node A (the synchronization signal B carries master node attribute and time information, and the slave node A can align time with the master node after receiving the synchronization signal B), after completing self time synchronization, the slave node A relays and forwards the synchronization signal B, and by analogy, after repeating signal synchronization for many times, all slave nodes within a preset hop number from the master node can realize time synchronization with the master node, thereby forming the whole network diffusion type synchronization, and the diffusion type synchronization process is shown in figure 1. In the process of the diffusion synchronization, each node can also receive signals when in relay forwarding, so that each level node can obtain information of slave nodes within the respective 1-hop range, as shown in fig. 1. Although each level of node can obtain the information of the slave node in the respective 1-hop range, the information of the node in the 'override (more than 1-hop) range' cannot be obtained, so that the master node cannot obtain the topology structure relationship of the whole network in time smoothly, the topology structure of the whole network cannot be determined, and the topology structure can be determined only by means of frequent information exchange in the network maintenance stage, thereby more network overhead occurs; because each slave node receives the synchronous signal and then relays and forwards the synchronous signal, the problem that the subsequent node cannot receive the synchronous signal due to the relay and forwarding collision can occur, and when the more nodes are, the more the relay and forwarding collision is, the more a broadcasting storm which is commonly existed in the network is formed, so that the network node synchronization efficiency is seriously affected.
In view of the above, the present inventors provide a fast networking method based on an efficient search method to solve the above-mentioned technical problems.
Disclosure of Invention
The invention aims to overcome the defects of the prior art, and provides a rapid networking method based on an efficient searching mode, which is characterized in that a master node can rapidly search slave nodes in a preset hop number and obtain node information and feedback search results of the slave nodes, so that the master node obtains a full network topological structure relationship, and the master node determines node sequence, relay nodes and distribution network time slots according to the full network topological structure relationship, thereby further rapidly establishing a synchronous network.
In order to achieve the above purpose, the present invention adopts the following technical scheme:
a fast networking method based on an efficient searching mode comprises the following steps:
s1, judging whether a cooperative network exists by a master node in a interception mode, if so, adding, otherwise, switching to S2;
s2, the master node initiates a search instruction for searching the slave node, and the master node obtains node information of the slave node and a feedback search result based on a response confirmation mechanism of the search instruction;
s3, determining at least one relay node according to a preset rule after the master node obtains the full-network topological structure relation based on the node information of the slave node and the feedback search result;
s4, broadcasting the topological structure relation of the whole network by the master node through a control command;
s5, the master node determines the sequence of the slave nodes based on a preset rule, and allocates network time slots for establishing a synchronous network.
Further, in the step S2, the search instruction carries a synchronization signal for completing time alignment of the slave node in the process of searching the slave node by the master node, and meanwhile, the master node obtains node information of the slave node.
Further, in the step S2, the response confirmation mechanism sequentially responds to the upper node according to a predetermined rule after receiving the search instruction of the upper node from each slave node, and returns a search result.
Further, the step S2 includes the steps of:
s21, the master node initiates a search instruction for searching 1-hop nodes existing in a 1-hop range, and obtains node information of the 1-hop nodes;
s22, based on the node information of the 1-hop nodes obtained by the main node in the step S21, the main node prescribes the searching sequence and searching times of each 1-hop node;
s23, broadcasting each 1-hop node by the master node through a control command, sequentially implementing the searching task and the corresponding searching times of the 2-hop nodes according to the searching order, and finding out the existing 2-hop nodes;
and S24, after each 1-hop node executes the search instruction, feeding back the searched node information of the 1-hop node and the 2-hop node to the main node.
Further, in the step S22, the search order performed by each 1-hop node is an ID placement order of each 1-hop node in a control command.
Further, the step S4 includes the steps of:
s41, after the master node obtains the full network topological structure relationship, broadcasting the full network topological structure relationship of the 1-hop relay node;
s41, the 1-hop relay node broadcasts a 2-hop node full network topological structure relation.
Further, the search result is the node number and node information of the current node searching the lower node.
Further, in the step S4, the slave node can autonomously acquire a network topology relationship.
Compared with the prior art, the invention has the following beneficial effects:
1. the invention relates to a quick networking method based on an efficient searching mode, which comprises the steps that a master node firstly monitors, judges whether a cooperative network exists or not, and if so, joins the cooperative network; on the contrary, the master node initiates a search instruction for searching the slave node, and based on a response confirmation mechanism of the search instruction, the master node obtains node information and feedback search results of all the slave nodes, the master node determines the whole network topology relation according to the node information and the search results, and broadcasts the whole network topology relation through a control command, then the master node determines at least one relay node according to a preset rule, the relay node broadcasts the whole network topology relation, so that all the slave nodes obtain the whole network topology relation, finally the master node determines the node sequence according to the whole network topology and distributes network time slots, thereby achieving the aim of quickly and smoothly establishing a synchronous network.
2. According to the rapid networking method based on the efficient searching mode, the searching instruction of the rapid networking method carries the time alignment synchronous signals among the nodes in the process of searching the slave nodes by the master node, and meanwhile, the master node obtains the node information of the slave nodes, so that the master node can rapidly obtain the node information of the slave nodes.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate principles of the invention and together with the description, serve to explain the principles of the invention.
In order to more clearly illustrate the embodiments of the invention or the technical solutions of the prior art, the drawings which are used in the description of the embodiments or the prior art will be briefly described, and it will be obvious to a person skilled in the art that other drawings can be obtained from these drawings without inventive effort.
FIG. 1 is a prior art decentralized network synchronization diagram;
FIG. 2 is a schematic diagram of a network synchronization process based on an efficient search method according to the present invention;
fig. 3 is a schematic diagram of a cooperative network node topology structure of the fast networking method based on the efficient searching mode of the present invention;
FIG. 4 is a workflow diagram of the fast networking method based on the efficient search mode of the present invention;
fig. 5 is a schematic diagram of a node full-communication network of the fast networking method based on the efficient searching mode.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are not intended to represent all embodiments consistent with the invention. Rather, they are merely examples of devices that are consistent with aspects of the invention that are set forth in the following claims.
Referring to fig. 2 to fig. 4, an embodiment of the present invention provides a fast networking method based on an efficient search mode, which includes the following steps:
step 1: the master node performs wireless interception within a preset time so as to judge whether a cooperative network exists in the time, namely other networks, or whether other nodes initiate synchronous networking service, if the cooperative network exists, the master node synchronously joins the cooperative network according to the service, and if the cooperative network does not exist, the synchronous networking process is actively initiated.
Step 2: the master node initiates a search instruction by using a synchronization signal carried in the efficient search instruction, wherein the search instruction is used for searching all slave nodes in a preset hop count, and based on a response confirmation mechanism of the search instruction, the master node obtains node information and search results of all the slave nodes in the preset hop count, and specifically comprises the following steps: the method comprises the steps that a main node initiates a search instruction, searches 1-hop nodes existing in a 1-hop range, ensures that surrounding 1-hop nodes can be searched, does not generate omission, achieves time alignment synchronization of the nodes with the main node in the 1-hop node search process, and obtains all 1-hop node information, wherein the 1-hop node information comprises information such as node positions, node states and the like, the main node specifies the search order and search times of each 1-hop node according to all the searched 1-hop node information, and then broadcasts each 1-hop node through a control command to sequentially implement 2-hop node search tasks and corresponding search times according to the search order, and finds out the existing 2-hop nodes, and each 1-hop node executes the search order which is the placement order of IDs (identity) in the control command. Further, after each 1-hop node executes the search instruction, node information of the searched 1-hop node and 2-hop node is fed back to the master node.
Specifically, in the embodiment of the present invention, the node search instruction is typically implemented by a master node, and unless the master node is specified in advance, each node may become the master node, and the nodes in the network other than the master node are all slave nodes or slave nodes.
Specifically, in the embodiment of the invention, after each slave node receives the search instruction of the upper node, each slave node orderly responds to the corresponding upper node according to a preset rule, returns the node information acquired by itself to the upper node, and so on, the master node can quickly realize the whole network synchronization and acquire the whole network topological structure relationship.
Step 3: after the master node determines the full network topological structure relation based on the step 2, at least one relay node is determined according to a preset rule, then the master node broadcasts the full network topological structure relation through a control command, specifically, the master node broadcasts the full network topological structure relation of 1-hop relay nodes by using the control command, each 1-hop relay node sequentially broadcasts the full network topological structure relation for 1 time, and therefore all nodes in the network can obtain the full network topological structure relation, and service development and control are facilitated.
Step 4: the master node determines the node sequence according to the full network topological structure relation and based on a preset rule, and simultaneously allocates network time slots for quickly establishing a synchronous network and ensuring the normal operation of the network. Specifically, the rule of the node order is not limited in the present invention, as long as the sending order of the nodes can be ordered according to the order with a certain rule, and the embodiment of the present invention enumerates a specific rule: taking a master node as a center, ordering the sending sequence of the nodes by taking the distance between the slave node and the master node as a standard, taking the slave node closest to the master node as a first node, the 1 st sending information of the first node, the second slave node closest to the master node as a second node, the 2 nd sending information of the second node, and so on, and arranging the sequence of all the nodes, and if the distances between a plurality of slave nodes and the master node are equal, arranging the node sequence according to the placement sequence of the slave node IDs in the control command; the mode of allocating network time slots corresponds to the node sequence, namely, a first node allocates a first network time slot, a second node allocates a second network time slot, and so on, so that the allocation of the network time slots is completed, and finally, the synchronous networking is completed.
Preferably, in the embodiment of the present invention, the slave nodes may also autonomously acquire the network topology relationship, specifically, although there is no direct search response process between 1-hop nodes, it may acquire necessary node information and node relationship by receiving response signals of other nodes.
Specifically, the node searching process is described in detail by taking a 2-hop network as an example, and the process is as follows:
referring to fig. 3, 1-hop nodes of a master node (generally, node 0) include nodes 1, 2,3, 4, and 5, 2-hop nodes of the master node include nodes 6, 7, 8, 9, 10, 11, 12, 13, and 14, and communication is not necessarily enabled between 1-hop nodes and between 2-hop nodes. And the node No. 15 is out of the 2-hop range of the main node, and when the node needs to enter the 2-hop range, the node can be added into the existing network through a certain 1-hop relay node, wherein the nodes existing in the 2-hop range of the main node are all effective nodes.
Further, only the search of the master node in the 2-hop network cannot search for the 2-hop node, and the 1-hop node is required to continue searching until all nodes in the 2-hop range are searched, namely, the 1-hop nodes 1, 2,3, 4 and 5 are used for discovering the 6, 7, 8, 9, 10, 11, 12, 13 and 14-hop nodes 2. Therefore, after completing the 5-time searching process, the master node sends out a control instruction to instruct each 1-hop node to sequentially implement 2-hop node searching tasks and find out possible 2-hop nodes.
Specifically, the determination process of the topology structure of the whole network is as follows:
referring to fig. 5, when the nodes are not actively transmitting signals or not responding to instructions of other nodes, the nodes are in a receiving state, and can receive the instructions and obtain related information, so that a topology association matrix between the nodes can be formed, and when two nodes are communicated and opposite information can be obtained in the association matrix, a flag 1 is filled, otherwise, a flag 0 is filled.
Further, there are 6 nodes, the 1-hop node is fully connected with the network (all nodes can be connected), the master node performs search 1, and the random back-offs of the 1 st to 5 th node responses are 4, 2, 5 and 6 respectively, at this time, the 1 st and 2 nd nodes have back-off collisions (all select 4), so that other nodes including the 0 st node, the 3 rd, 4 th and 5 th nodes cannot receive response signals of the two nodes, and the 1 st and 2 nd nodes cannot receive information from each other, so that the corresponding association matrix variable is 0. 3. Nodes 4 and 5 fail to collide and successfully respond to the search instruction of the master node, and response signals of the nodes can be received by all nodes (in different response time), so that the obtained node topology association matrix is shown in table 1.
Table 1 node topology association matrix
| 0 node | 1 node | 2 node | 3 node | 4 node | 5 node | |
| 0 node | 1 | 0 | 0 | 1 | 1 | 1 |
| 1 node | 1 | 1 | 0 | 1 | 1 | 1 |
| 2 node | 1 | 0 | 1 | 1 | 1 | 1 |
| 3 node | 1 | 0 | 0 | 1 | 1 | 1 |
| 4 node | 1 | 0 | 0 | 1 | 1 | 1 |
| 5 node | 1 | 0 | 0 | 1 | 1 | 1 |
Table 1 represents the results of 1 search occurrence, and the connection relationship between the nodes cannot be judged only according to the results of this time, and more searches are required.
Further, when the master node searches for the 2 nd time, the node which has successfully responded for the 1 st time can not respond any more, and the master node writes the corresponding node ID and the control identifier in the search instruction, all the 1 st-hop slave nodes can receive the information, so that the 1 st and 2 nd nodes know that the 3 st, 4 nd and 5 nd nodes are nearby, but the 0 st, 3 nd, 4 nd and 5 nd nodes do not know the 1 st and 2 nd nodes (caused by collision). When the slave node responds to the 2 nd search instruction of the master node, the 3, 4 and 5 nodes do not respond any more (but can all receive signals), and the 1 st and 2 nd nodes have different random back-offs (2, 3), so that the 0, 3, 4 and 5 nodes can all receive the effective responses of the 1 st and 2 nd nodes and the 1 st and 2 nd nodes can also mutually receive the effective responses. After the 2 nd search, the topological relation between the nodes is shown in table 2.
As can be seen from the search process, as long as a node successfully responds to a search instruction, its information must be received by other nodes, so that the slave node can autonomously acquire the network topology relationship. Each node is so that when all nodes are searched, a complete relation matrix can be formed, and the master node can judge the topological structure relation of the whole network according to the relation matrix.
Table 2 node topology association matrix
| 0 node | 1 node | 2 node | 3 node | 4 node | 5 node | |
| 0 node | 1 | 1 | 1 | 1 | 1 | 1 |
| 1 node | 1 | 1 | 1 | 1 | 1 | 1 |
| 2 node | 1 | 1 | 1 | 1 | 1 | 1 |
| 3 node | 1 | 1 | 1 | 1 | 1 | 1 |
| 4 node | 1 | 1 | 1 | 1 | 1 | 1 |
| 5 node | 1 | 1 | 1 | 1 | 1 | 1 |
In the embodiment of the invention, no matter how many slave nodes are, the master node can search all the slave nodes (within a 1-hop range) with the probability of more than 99% only by 4-5 times of searching, and the searching mode has stronger dynamic adaptability.
Preferably, the embodiment of the invention can be popularized to a non-full-communication network, and different nodes in the network can still obtain the node topological structure. It can be seen that, as long as the master node can search all 1-hop nodes after the nth search, the communication relationship between the nodes is also all determined. When the method is under a non-full-communication network, only a master node can acquire the full-network topological structure relationship, and the master node can announce to the full network in a network announcement mode, so that each node acquires the corresponding network topological structure relationship.
Preferably, the network topology relation determining method can be generalized to a 2-hop network. For a 1-hop relay node, the search response process using the 1-hop relay node as a master node is equivalent, and the difference is that the "master node" obtaining the 2-hop node communication relationship at this time may be a plurality of 1-hop relay nodes, because there is an explicit relationship between the plurality of 1-hop relay nodes and the node information and the search result are shared to the master node, the master node can deduce the topology relationship of the whole network, and when the master node completes the search of the slave node, the master node obtains the information of all the nodes of the 2-hop network, thereby obtaining the topology relationship of the whole network result. And determining the node sequence and the 1-hop relay node based on a preset rule, and allocating network time slots for normal operation of the network.
The foregoing is only a specific embodiment of the invention to enable those skilled in the art to understand or practice the invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention.
It will be understood that the invention is not limited to what has been described above and that various modifications and changes may be made without departing from the scope thereof. The scope of the invention is limited only by the appended claims.
Claims (8)
1. The quick networking method based on the efficient searching mode is characterized by comprising the following steps of:
s1, judging whether a cooperative network exists by a master node in a interception mode, if so, adding, otherwise, switching to S2;
s2, the master node initiates a search instruction for searching the slave node, and the master node obtains node information of the slave node and a feedback search result based on a response confirmation mechanism of the search instruction;
s3, determining at least one relay node according to a preset rule after the master node obtains the full-network topological structure relation based on the node information of the slave node and the feedback search result;
s4, broadcasting the topological structure relation of the whole network by the master node through a control command;
s5, the master node determines the sequence of the slave nodes based on a preset rule, and allocates network time slots for establishing a synchronous network.
2. The method according to claim 1, wherein in step S2, the search command carries a synchronization signal for completing time alignment of the slave node in the process of searching the slave node by the master node, and the master node obtains node information of the slave node.
3. The method of claim 1, wherein in step S2, the response confirmation mechanism sequentially responds to the upper node according to a predetermined rule after each slave node receives a search instruction of the upper node, and returns a search result.
4. The method of fast networking based on efficient searching method according to claim 1, wherein the step S2 comprises the steps of:
s21, the master node initiates a search instruction for searching 1-hop nodes existing in a 1-hop range, and obtains node information of the 1-hop nodes;
s22, based on the node information of the 1-hop nodes obtained by the main node in the step S21, the main node prescribes the searching sequence and searching times of each 1-hop node;
s23, broadcasting each 1-hop node by the master node through a control command, sequentially implementing the searching task and the corresponding searching times of the 2-hop nodes according to the searching order, and finding out the existing 2-hop nodes;
and S24, after each 1-hop node executes the search instruction, feeding back the searched node information of the 1-hop node and the 2-hop node to the main node.
5. The method of fast networking based on efficient search mode according to claim 3, wherein the search order performed by each 1-hop node in the step S22 is an ID placement order of each 1-hop node in a control command.
6. The method of fast networking based on efficient searching method according to claim 1, wherein the step S4 comprises the steps of:
s41, after the master node obtains the full network topological structure relationship, broadcasting the full network topological structure relationship of the 1-hop relay node;
s41, the 1-hop relay node broadcasts a 2-hop node full network topological structure relation.
7. The method for fast networking based on an efficient search method according to claim 3, wherein the search result is the number of nodes and node information of the nodes of the current node searching the lower node.
8. The method of claim 1, wherein in step S4, the slave node can autonomously acquire a network topology relationship.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311019682.6A CN117202305A (en) | 2023-08-14 | 2023-08-14 | Rapid networking method based on efficient searching mode |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311019682.6A CN117202305A (en) | 2023-08-14 | 2023-08-14 | Rapid networking method based on efficient searching mode |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117202305A true CN117202305A (en) | 2023-12-08 |
Family
ID=89004284
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311019682.6A Pending CN117202305A (en) | 2023-08-14 | 2023-08-14 | Rapid networking method based on efficient searching mode |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117202305A (en) |
-
2023
- 2023-08-14 CN CN202311019682.6A patent/CN117202305A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110856194B (en) | Dual-mode fusion networking method and communication method | |
| US20190132784A1 (en) | Methods and Apparatus for Use in Selecting a Connection Path for Low-Latency, Deterministic Multi-Hop D2D Communications | |
| US9648548B1 (en) | WiFi mesh configuration | |
| KR101531382B1 (en) | Reducing beacon collision probability | |
| CN106059624B (en) | Multi-frequency ad hoc network suitable for power line carrier communication system and communication method | |
| CN103503540A (en) | System and method for peer to peer communications in cellular communications systems | |
| KR20120015479A (en) | Method and apparatus for data communication while base station is disrupted troyed in wireless communication system | |
| CN109412921B (en) | Network access and network exit design method for multi-cluster star network nodes | |
| CN111565474B (en) | Method and system for establishing communication connection between AP (access point) equipment and target terminal based on Mesh network | |
| CN111866897A (en) | Networking method of intelligent home system and intelligent home system | |
| CN105392185A (en) | Intelligent equipment networking method and device, and system | |
| CN111885615A (en) | Center transferable networking communication method based on TDMA | |
| KR20180126050A (en) | Method and apparatus for transmitting a sink beacon message in a NAN device | |
| US10349455B2 (en) | Method for data communication between NAN devices, and NAN device for performing data communication | |
| CN115766569A (en) | Establishing method and maintaining method of dual-mode network route and dual-mode network system | |
| WO2018028436A1 (en) | Random access method, network-side device and terminal | |
| CN105392180A (en) | Intelligent equipment networking method and device, and system | |
| CN113038511A (en) | Control method and control device of communication system and communication system | |
| CN117202305A (en) | Rapid networking method based on efficient searching mode | |
| CN113438656B (en) | Dual-mode multi-frequency networking method and system based on power line and wireless | |
| CN111542098B (en) | Communication connection method of ZigBee device and related device | |
| CN107689986B (en) | Data communication method of communication equipment in wireless self-organizing network, communication equipment and storage device | |
| EP2341755B1 (en) | Wireless network with star topology and method for operating wireless network with star topology | |
| CN109150727B (en) | Software definition-based next generation network implementation method | |
| CN116939678B (en) | Networking method and communication equipment |
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 |