CN114745763B - Method and system for updating optimal network topology - Google Patents
Method and system for updating optimal network topology Download PDFInfo
- Publication number
- CN114745763B CN114745763B CN202210228874.7A CN202210228874A CN114745763B CN 114745763 B CN114745763 B CN 114745763B CN 202210228874 A CN202210228874 A CN 202210228874A CN 114745763 B CN114745763 B CN 114745763B
- Authority
- CN
- China
- Prior art keywords
- route
- sub
- information
- optimal
- link
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- 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/02—Topology update or discovery
-
- 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
- H04W40/248—Connectivity information update
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B17/00—Monitoring; Testing
- H04B17/30—Monitoring; Testing of propagation channels
- H04B17/309—Measuring or estimating channel quality parameters
- H04B17/318—Received signal strength
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B17/00—Monitoring; Testing
- H04B17/30—Monitoring; Testing of propagation channels
- H04B17/309—Measuring or estimating channel quality parameters
- H04B17/364—Delay profiles
-
- 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/121—Shortest path evaluation by minimising delays
-
- 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
Abstract
The present application relates to the field of communications technologies, and in particular, to a method and a system for updating an optimal network topology. The method comprises the following steps: after the main route and the sub-route are connected with a network, data information of all the sub-routes is obtained, wherein the data information comprises signal intensity information, delay information and node information of the sub-routes; obtaining a first optimal link based on the signal strength information, wherein the first optimal link comprises a main route and a first sub-route; obtaining M optimal links based on the signal strength information and the delay information, wherein the M optimal links comprise at least one N optimal link, N is more than or equal to 2, and the N optimal link comprises an N-1 sub-route and an N sub-route; and obtaining the best topological link based on the first best link and the M best links. The method and the system for updating the optimal network topology can efficiently and quickly form the optimal network topology.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a method and a system for updating an optimal network topology.
Background
The connection topology between distributed Wi-Fi routers at present is mostly tree-like or chained. In order to achieve a better network coverage effect, the routers can be flexibly networked, and two networking modes of AP+AC and Mesh can be formed among a plurality of routers; the AP is a network access point, the AC is an access controller, the AC is responsible for managing all APs, all AP nodes can be automatically synchronized as long as unified configuration is carried out on the AC, and the working states of all APs can be monitored on the AC in real time; mesh is also called as a multi-hop network, a plurality of nodes with the same position are connected with each other in a wired or wireless mode to form a plurality of paths, and finally the paths are connected to a network manager connected with the Internet, so that a control node exists in the network to manage all the nodes and issue configuration data.
In view of the above related art, the inventors consider that when a plurality of router nodes are powered on at the same time, since networking is generally performed between each network node according to a random topology sequence, an optimal topology cannot be efficiently and quickly formed between the plurality of routers.
Disclosure of Invention
In order to enable a plurality of routers to form an optimal topology efficiently and quickly, the application provides a method and a system for updating the optimal network topology.
In a first aspect, the present application provides a method for updating an optimal network topology, which adopts the following technical scheme:
a method of updating an optimal network topology, comprising the steps of:
after the main route and the sub-route are connected with a network, the data information of all the sub-routes is obtained, and the number is calculated
The information comprises signal intensity information, delay information and node information of the sub-route, wherein the node information refers to N-level nodes where the main route and the sub-route are located;
obtaining a first optimal link based on the signal strength information, wherein the first optimal link comprises a main route and a first sub-route, the main route is a level 1 node, and the first sub-route is a level 2 node;
obtaining M optimal links based on the signal strength information and the delay information, wherein M is greater than or equal to 1, the M optimal links comprise at least one N optimal link, N is greater than or equal to 2, the N optimal link comprises an N-1 sub-route and an N sub-route, the N-1 sub-route is an N level node, and the N sub-route is an N+1 level node;
and obtaining an optimal topological link based on the first optimal link and the M optimal links.
By adopting the technical scheme, a first sub-route is obtained according to the signal intensity information of the sub-route, and the first sub-route is connected with a main route to obtain a first optimal link; when N is more than or equal to 2, an N sub-route is obtained according to the signal intensity information and the delay information of the sub-route, and connection is established between the N sub-route and the N-1 sub-route to obtain an N optimal link; and obtaining the best topological link of the network through the first best link and the M best links.
Optionally, the data information further includes local area network address information, and the obtaining the first best link based on the signal strength information includes the following steps:
establishing a linked list, and storing the data information of the sub-route to the linked list;
transmitting a first instruction for scanning the main route to the sub-route based on the local area network address information;
the sub-route establishes connection with the main route based on the first instruction to obtain the first route
Optimal link.
Optionally, the establishing the connection between the first sub-route and the main route based on the first instruction includes the following steps:
reading the signal strength information between the sub-route and the main route;
and selecting the sub-route with the strongest signal strength as the first sub-route, and establishing connection between the first sub-route and the main route.
Optionally, the obtaining M best links based on the signal strength information and the delay information includes the following steps:
transmitting a second instruction to a sub-route other than the first sub-route based on the local area network address information;
determining the nth-1 sub-route and the nth sub-route based on the second instruction;
establishing connection between the N-1 th sub-route and the N th sub-route to obtain the N th optimal link;
and obtaining M optimal links based on the Nth optimal link.
Optionally, determining the N-1 th sub-route and the N-th sub-route based on the second instruction includes the steps of:
reading the signal strength information and the delay information of the sub-routes except the first sub-route;
analyzing the signal intensity information and the delay information based on a weighting algorithm, and obtaining an analysis result;
and determining the N-1 th sub-route and the N-th sub-route based on the analysis result.
In a second aspect, the present application further provides a system for updating an optimal network topology, which adopts the following technical scheme:
a system for updating an optimal network topology, comprising:
the acquisition module is used for acquiring data information of the sub-route, wherein the data information comprises signal strength information, delay information and node information;
the storage module is used for storing the data information of the sub-route;
and the processing module is used for updating the network to obtain the optimal topological link.
By adopting the technical scheme, the data information of the sub-route is acquired according to the acquisition module, the data information is stored in the storage module, the signal intensity information of the sub-route is processed through the processing module, so that a first sub-route is obtained, and the first sub-route is connected with the main route to obtain a first optimal link; when N is more than or equal to 2, processing signal intensity information and delay information of the sub-routes through a processing module to obtain an N sub-route, and establishing connection between the N sub-route and the N-1 sub-route to obtain an N optimal link; and obtaining the best topological link of the network through the first best link and the M best links.
Optionally, the data information further includes local area network address information, the local area network address information is stored in the storage module, and the processing module includes:
a sending unit, configured to send a scan instruction to the sub-route;
an analysis unit for analyzing the data information of the sub-route;
and the connection unit is used for establishing connection between the main route and the sub route and between the sub route and the sub route.
Optionally, the analysis unit includes;
the reading subunit is used for reading the signal intensity information and the delay information of the sub-route;
and the analysis subunit is used for analyzing the signal intensity information and the delay information of the sub-route and obtaining an analysis result.
In a third aspect, the present application provides a terminal device, which adopts the following technical scheme:
a terminal device comprising a memory, a processor and a computer program stored in the memory and capable of running on the processor, said processor, when loaded and executing the computer program, employing a method of updating an optimal network topology as described above.
By adopting the technical scheme, the computer program is generated by the method for updating the optimal network topology and is stored in the memory to be loaded and executed by the processor, so that the terminal equipment is manufactured according to the memory and the processor, and the method is convenient to use.
In a fourth aspect, the present application provides a computer readable storage medium, which adopts the following technical scheme:
a computer readable storage medium having stored therein a computer program which, when loaded and executed by a processor, employs a method of updating an optimal network topology as described above.
By adopting the technical scheme, the method for updating the optimal network topology generates the computer program, and stores the computer program in the computer readable storage medium so as to be loaded and executed by the processor, and the computer program is convenient to read and store by the computer readable storage medium.
Drawings
Fig. 1 is a schematic overall flow chart of a method of updating an optimal network topology according to the present application.
Fig. 2 is a flowchart illustrating steps S210 to S230 in a method for updating an optimal network topology according to the present application.
Fig. 3 is a flowchart illustrating steps S231-S232 in a method for updating an optimal network topology according to the present application.
Fig. 4 is a flowchart illustrating steps S310 to S340 in a method for updating an optimal network topology according to the present application.
Fig. 5 is a flowchart illustrating steps S321 to S323 in a method for updating an optimal network topology according to the present application.
Fig. 6 is a schematic diagram of the overall module of a system for updating an optimal network topology according to the present application.
Reference numerals illustrate:
1. an acquisition module; 2. a storage module; 3. a processing module; 31. a transmitting unit; 32. an analysis unit; 321. a read subunit; 322. an analysis subunit; 33. and a connection unit.
Detailed Description
The application is described in further detail below with reference to fig. 1-6.
The embodiment of the application discloses a method for updating an optimal network topology, which comprises the following steps with reference to fig. 1:
s100, after a main route and a sub-route are connected with a network, acquiring data information of all the sub-routes, wherein the data information comprises signal strength information, delay information and node information of the sub-routes, and the node information refers to N-level nodes where the main route and the sub-routes are located;
s200, obtaining a first optimal link based on signal strength information, wherein the first optimal link comprises a main route and a first sub-route, the main route is a level 1 node, and the first sub-route is a level 2 node;
s300, obtaining M optimal links based on signal strength information and delay information, wherein M is greater than or equal to 1, the M optimal links comprise at least one N optimal link, N is greater than or equal to 2, the N optimal link comprises an N-1 sub-route and an N sub-route, the N-1 sub-route is an N level node, and the N sub-route is an N+1 level node;
s400, obtaining the best topological link based on the first best link and the M best links.
Specifically, in step S100, in this embodiment, two networking modes including ap+ac and Mesh may be formed between the routers; the AP is a network access point, the AC is an access controller, the AC is responsible for managing all APs, all AP nodes can be automatically synchronized as long as unified configuration is carried out on the AC, and the working states of all APs can be monitored on the AC in real time; mesh is also called as a multi-hop network, a plurality of nodes with the same position are connected with each other in a wired or wireless mode to form a plurality of paths, and finally the paths are connected to a network manager connected with the Internet, so that a control node exists in the network to manage all the nodes and issue configuration data. The signal strength information comprises signal strength values of all the sub-routes, and the signal strength determines the upper throughput limit of the main route and the sub-routes after connection among the sub-routes; the delay information comprises delay values of ping main routes of all sub routes, and the ping delay is added to avoid interference and link blockage between routers; the nodes between routers represent a hierarchy of network topologies.
Specifically, in step S200, in this embodiment, a connection is established between the first sub-route and the main route according to the signal strength information of the sub-route, and the first sub-route is confirmed to be the first sub-route, so as to obtain the first best link, at this time, the main route is at the level 1 node, and the main route updates the first sub-route to the level 2 node. Because the upper level of sub-router one is already the main route, the delay factor of sub-router one ping the main route is not considered.
Specifically, in step S300, in this embodiment, the topology M best links are updated from the level 2 node of the sub-route one to the lower level, and the nth best link between the nodes of each level is obtained by combining the signal strength information and the delay information of the sub-route. Obtaining a second sub-route serving as a second sub-route according to signal intensity information and delay information of the second sub-route and the third sub-route, wherein a second optimal link is formed between the first sub-route and the second sub-route, M is equal to 1, N is equal to 2, and the second sub-route is at a 3-level node; and obtaining the sub-route three as a third sub-route according to the signal intensity information and the delay information of the sub-route three and the sub-route four, wherein a third optimal link is formed between the sub-route three and the sub-route two, at the moment, M is equal to 2, N is equal to 3, and the sub-route two is at a 4-level node.
Specifically, in step S400, in the present embodiment, when M is equal to 2, an optimal topology link is formed based on the connection between the first optimal link and the second optimal link, and between the second optimal link and the third optimal link. The first optimal link, the second optimal link and the third optimal link form the optimal topological link together.
The data information further includes lan address information, as shown in fig. 2, step S200 includes the following steps:
s210, establishing a linked list, and storing the data information of the sub-route to the linked list;
s220, a first instruction for scanning the main route is sent to the sub-route based on local area network address information;
and S230, establishing connection between the sub-route and the main route based on the first instruction, and obtaining a first optimal link.
More specifically, in this embodiment, the main route establishes a linked list according to the collected data information of the sub-route, the linked list updates and records the data information in real time, the linked list records that the main route is a level 1 node, the main route sends a first instruction for scanning the signal intensity of the main route to the sub-route according to the local area network address information of the sub-route, if the signal intensity of the scanning main route of the sub-route is less than-60 db, the sub-route does not need to be considered, and the sub-route meeting the condition establishes connection with the main route according to the first instruction, so as to obtain a first best link. The method includes the steps that local area network address information of a first sub-route is recorded in a linked list to be unsigned char_mac [6], a first instruction for scanning the main route is sent to the sub-route by the main route according to the local area network address information of the first sub-route, the link list records that the local area network address of the first sub-route is char connect [18], the first instruction is executed by the first sub-route according to the local area network address of the first sub-route, and then connection is established with the main route to obtain a first optimal link.
As shown in fig. 3, step S230 includes the following steps:
s231, reading signal intensity information between the sub-route and the main route;
s232, selecting the sub-route with the strongest signal strength as a first sub-route, and establishing connection between the first sub-route and the main route.
More specifically, in this embodiment, signal intensity information of all sub-route scanning main routes is recorded in the linked list, a sub-route with the strongest signal intensity is selected as a first sub-route by reading the signal intensity information of the sub-route scanning main routes, and a connection is established between the first sub-route and the main route. The method comprises the steps that a primary route sends a first instruction to enable all sub-routes to scan the signal intensity of a primary route of a node at a level 1, the signal intensity of the first sub-route is-30 db, the actual running speed of the first sub-route is 720Mbps, the signal intensity of the second sub-route is-50 db, the actual running speed of the second sub-route is 520Mbps, the signal intensity information of the first sub-route and the second sub-route and the actual running speed of the second sub-route are recorded by a linked list, the signal intensity of the first sub-route is confirmed to be the first sub-route because the signal intensity of the first sub-route is-50 db, the first sub-route is selected to be connected with the primary route, the linked list updates the first sub-route to be the node at a level 2 because the first sub-route is connected with the primary route, and the delay information of the first sub-route and the second sub-route is only required to be sent to the linked list.
As shown in fig. 4, step S300 includes the following steps:
s310, sending a second instruction to the sub-route except the first sub-route based on the local area network address information;
s320, determining an N-1 sub-route and an N sub-route based on the second instruction;
s330, establishing connection between the N-1 th sub-route and the N th sub-route to obtain an N th optimal link;
s340, obtaining M best links based on the Nth best link.
More specifically, in this embodiment, when N is greater than or equal to 2, the main route sends a second instruction to the sub-routes other than the first sub-route according to the lan address information of the sub-routes, determines the N-1 th sub-route and the N-th sub-route based on the second instruction, and obtains the N-th best link by establishing a connection between the N-1 th sub-route and the N-th sub-route, wherein the N-th best link may be one or more, and obtains the M-th best link based on the N-th best link. When N is equal to 2, the main route sends a second instruction for scanning the first sub-route to the sub-routes except the first sub-route according to the local area network address information of the sub-route, the first sub-route and the second sub-route are determined based on the second instruction, connection between the first sub-route and the second sub-route is established, a second optimal link is obtained, and 1 optimal link is obtained based on the second optimal link.
As shown in fig. 5, step S320 includes the following steps:
s321, reading signal intensity information and delay information of sub-routes except the first sub-route;
s322, analyzing the signal strength information and the delay information based on a weighting algorithm, and obtaining an analysis result;
s323, determining the N-1 th sub-route and the N th sub-route based on the analysis result.
More specifically, in step S321, in this embodiment, signal strength information and delay information of all sub-routes are recorded in the linked list, specific numerical values are obtained by reading the signal strength information and delay information of the sub-routes, and a calculation formula of the link score is used: and (the signal intensity of the current node and the signal intensity of the upper level are multiplied by-1) + (the delay of the upper level route is multiplied by 5), the signal intensity information and the delay information of the sub-route are analyzed, an analysis result is obtained, and the N-1 sub-route and the N sub-route are obtained based on the analysis result. When N is equal to 2, the main route sends the information of the first sub-route to the third sub-route and the fourth sub-route, so that the third sub-route and the fourth sub-route scan the first sub-route, the signal intensity of the first sub-route scanned by the third sub-route is-51 db, the delay of the third sub-route ping main route is 14ms, the signal intensity of the first sub-route scanned by the fourth sub-route is-58 db, and the delay of the fourth sub-route ping main route is 17ms.
More specifically, in step S322, in this embodiment, the respective link scores of the sub-route three and the sub-route four are obtained according to the weighting algorithm, the link score= (the signal strength of the current node and the upper level x-1) + (the delay of the upper level route x 5), and finally the link with the smallest link score is selected. The signal intensity of the sub-route III and the sub-route I is-51 db, and the delay of the sub-route three Ping main route is 14ms; the signal intensity of the sub-route four and the sub-route one is-58 db, and the delay of the sub-route four Ping main route is 17ms. And bringing the signal intensity information and the delay information of the sub-route three and the sub-route four into a link scoring formula to obtain the score of the sub-route three as 121 and the score of the sub-route four as 143.
More specifically, in step S323, in this embodiment, the signal strength and the ping main route delay of the sub-route three and the sub-route four are calculated by a weighting algorithm, the link score of the sub-route three is 121, the link score of the sub-route four is 143, the sub-route three with the small link score is selected as the second sub-route, the sub-route three and the sub-route one are connected to obtain the second best link, the sub-route three sends the delay information of the ping main route to the linked list for record storage, and the linked list updates the sub-route three as the level 3 node. When N is equal to 2, the best topology link is obtained based on the first best link and the second best link.
The implementation principle of the method for updating the optimal network topology in the embodiment of the application is as follows: after a main route and a sub route are connected with a network, the main route collects data information of the sub route through a linked list, the main route sends a first instruction for scanning the main route to the corresponding sub route according to local area network address information of the sub route recorded in the linked list, the sub route scans signal intensity information of the main route by reading the sub route, the sub route with the strongest signal intensity is selected as a first sub route, a first optimal link is formed by establishing connection with the main route, the linked list updates the main route to be a 1-level node, and the first sub route is updated to be a 2-level node; when N is greater than or equal to 2, the main route sends a second instruction for scanning the N-1 sub-route to the corresponding sub-route according to the sub-reason local area network address information, reads the signal intensity information and the delay information of the sub-route, obtains the link score of the sub-route through a weighting algorithm, selects the sub-route with the smallest score as the N-th sub-route to obtain the N optimal link, and updates the N-th sub-route to be an N+1 level node; and obtaining the best topological link based on the first best link and the M best links. The method for updating the optimal network topology can enable a plurality of routers to efficiently and quickly form the optimal topology under the networking condition.
The embodiment of the application discloses a system for updating optimal network topology, referring to fig. 6, comprising a collection module 1, a storage module 2 and a processing module 3, wherein the collection module 1 is connected with the storage module 2, the storage module 2 is connected with the processing module 3, the collection module 1 is used for collecting data information of sub-routes, and the data information comprises signal intensity information, delay information and node information; the storage module 2 is used for storing the data information of the sub-route; the processing module 3 is configured to update the network to obtain the best topology link.
Specifically, in this embodiment, two networking modes of ap+ac and Mesh may be formed between the routers; the AP is a network access point, the AC is an access controller, the AC is responsible for managing all APs, all AP nodes can be automatically synchronized as long as unified configuration is carried out on the AC, and the working states of all APs can be monitored on the AC in real time; mesh is also called as a multi-hop network, a plurality of nodes with the same position are connected with each other in a wired or wireless mode to form a plurality of paths, and finally the paths are connected to a network manager connected with the Internet, so that a control node exists in the network to manage all the nodes and issue configuration data. The main route comprises an acquisition module 1, data information of the sub-routes is collected through the acquisition module 1, the signal strength information comprises local area network address information, signal strength numerical values, delay information and node information of all the sub-routes, and the signal strength determines the throughput upper limit after connection between the main route and the sub-routes and between the sub-routes; the delay information comprises delay values of ping main routes of all sub routes, and the ping delay is added to avoid interference and link blockage between routers; the nodes between routers represent a hierarchy of network topologies. The acquisition module 1 is used for acquiring that local area network address information of a first sub-route is unsigned char_mac [6], the local area network address of the connection of the first sub-route and a main route is char connect [18], the signal strength of the first sub-route is minus 30db, the time delay of the first sub-route for ping the main route is 12ms, and the corresponding actual running speed of the first sub-route is 720Mbps.
Specifically, in this embodiment, the main route further includes a storage module 2, where the storage module 2 may be set as a linked list, and the linked list records data information of all sub-routes scanning the main route and the nth sub-route. The signal intensity of the first sub-route is-30 db, the delay of the first sub-route ping main route is 12ms, and the corresponding actual running speed of the first sub-route is 720Mbps; the signal intensity of the secondary route is minus 50db, the delay of the secondary route ping main route is 18ms, the actual running speed corresponding to the secondary route ping main route is 520Mbps, the linked list records the signal intensity information, the delay information and the actual running speed of the secondary route ping first and secondary routes, if the secondary route ping first establishes connection with the main route, the secondary route ping first is confirmed to be the first secondary route, the linked list updates the secondary route ping first to be the level 2 node, because the primary route ping first is connected, the delay information of the secondary route ping first is not considered, only the delay information of the secondary route ping first and the secondary route ping main route is needed to be sent to the linked list to be recorded, if the secondary route ping second is selected to be connected with the secondary route ping first, the secondary route ping second is confirmed to be the second secondary route, and the linked list updates the secondary route ping second to be the level 3 node.
As shown in fig. 6, the processing module 3 includes a sending unit 31, an analyzing unit 32, and a connecting unit 33, where the sending unit 31 is configured to send a scan instruction to the sub-route; the analysis unit 32 is configured to analyze the data information of the sub-route; the connection unit 33 is used for establishing a connection between the main route and the sub-route, and between the sub-route and the sub-route.
Specifically, in the present embodiment, the transmitting unit 31 transmits the scan instruction to the corresponding sub-route according to the local area network address information of the sub-route. The sending unit 31 sends a first instruction for scanning the main route to the sub-route according to the local area network address information unsigned char_mac [6] of the sub-route, the signal strength of the sub-route is-30 db after the scanning of the sub-route, the delay of the sub-route for the ping main route is 12ms, and the actual running speed corresponding to the sub-route is 720Mbps.
As shown in fig. 6, the analysis unit 32 includes a reading subunit 321 and an analysis subunit 322, where the reading subunit 321 is configured to read signal strength information and delay information of the sub-route; the analysis subunit 322 is configured to analyze the signal strength information and the delay information of the sub-route, and obtain an analysis result.
Specifically, in this embodiment, the reading subunit 321 reads the signal strength information of the sub-route scanning main route, and the analyzing subunit 322 analyzes the sub-route with the strongest signal strength as the first sub-route; the reading subunit 321 reads the signal strength information and the delay information of the N-1 th sub-route of the sub-route scanning, calculates the link score of the sub-route through a weighting algorithm, and analyzes the sub-route with the minimum link score as the N-th sub-route through the analyzing subunit 322. The signal intensity of the first sub-route is-30 db, the actual running speed of the first sub-route is 720Mbps, the signal intensity of the second sub-route is-50 db, the actual running speed of the second sub-route is 520Mbps, because the signal intensity of the first sub-route is-30 db better than the signal intensity of the second sub-route, and the actual running speed of the first sub-route is faster than the second sub-route, the first sub-route is obtained through analysis of the analysis sub-unit 322; when N is equal to 2, the signal strength information and the delay information of the sub-route are read by the reading subunit 321, and specific numerical values are obtained by reading the signal strength information and the delay information of the sub-route. The main route sends the information of the first sub-route to the third sub-route and the fourth sub-route, so that the third sub-route and the fourth sub-route scan the first sub-route, the signal intensity of the first sub-route scanned by the third sub-route is-51 db, the delay of the third sub-route ping main route is 14ms, the signal intensity of the first sub-route scanned by the fourth sub-route is-58 db, and the delay of the fourth sub-route ping main route is 17ms.
Specifically, in this embodiment, the respective link scores of the sub-route three and the sub-route four are obtained according to a weighting algorithm, the link score= (the signal strength of the current node and the upper level x-1) + (the delay of the upper level route x 5), and finally the link with the smallest link score is selected. The signal intensity of the sub-route three scanning sub-route one is-51 db, and the delay of the sub-route three Ping main route is 14ms; the signal intensity of the sub-route four scanning sub-route one is-58 db, and the delay of the sub-route four Ping main route is 17ms. And bringing the signal intensity information and the delay information of the sub-route III and the sub-route IV into a link score formula to obtain the score of the sub-route III as 121, obtain the score of the sub-route IV as 143, and analyzing the sub-route III as a second sub-route through an analysis subunit 322.
Specifically, in this embodiment, the reading subunit 321 reads the signal strength information of the sub-route scanning main route, the analyzing subunit 322 analyzes the sub-route with the strongest signal strength as the first sub-route, and the connection unit 33 establishes the connection between the main route and the first sub-route; the reading subunit 321 reads the signal intensity information and the delay information of the N-1 th sub-route of the sub-route scanning, calculates the link score of the sub-route through a weighting algorithm, analyzes the sub-route with the minimum link score as the N-th sub-route through the analysis subunit 322, and establishes the connection between the N-1 th sub-route and the N-th sub-route through the connection unit 33. The signal intensity of the first sub-route is-30 db, the actual running speed corresponding to the first sub-route is 720Mbps, the signal intensity of the second sub-route is-50 db, the actual running speed corresponding to the second sub-route is 520Mbps, and the signal intensity of the first sub-route is-30 db better than the signal intensity of the second sub-route and is faster than the signal intensity of the second sub-route, so that the first sub-route is obtained by analyzing the first sub-route through the analyzing sub-unit 322, and the connection between the first sub-route and the main route is established through the connecting unit 33, and a first optimal link is obtained; when N is equal to 2, the respective link scores of the sub-route three and the sub-route four are obtained according to a weighting algorithm, the link score= (the signal strength of the current node and the upper level is x-1) + (the delay of the upper level route is x 5), and finally the link with the minimum link score is selected. The signal intensity of the sub-route three scanning sub-route one is-51 db, and the delay of the sub-route three Ping main route is 14ms; the signal intensity of the sub-route four scanning sub-route one is-58 db, and the delay of the sub-route four Ping main route is 17ms. Bringing signal intensity information and delay information of the third sub-route and the fourth sub-route into a link score formula to obtain a score of 121 of the third sub-route and a score of 143 of the fourth sub-route, analyzing the third sub-route into a second sub-route by an analysis subunit 322, and establishing connection between the third sub-route and the second sub-route by a connection unit 33 to obtain an n+1th optimal link; when N is equal to 2, the best topology link is obtained by the connection unit 33 based on the first best link and the second best link.
The implementation principle of the system for updating the optimal network topology in the embodiment of the application is as follows: after the main route and the sub route are connected with a network, the main route collects data information of the sub route through the acquisition module 1, the data information is stored in the storage module 2, a first instruction for scanning the main route is sent to the corresponding sub route through the sending unit 31 according to local area network address information of the sub route, signal intensity information of the sub route scanning the main route is read through the reading subunit 321, the sub route with the strongest signal intensity is selected as a first sub route through the analyzing subunit 322, connection is established between the first sub route and the main route through the connection unit 33, a first optimal link is formed, the linked list updates the main route to be a 1-level node, and the first sub route is updated to be a 2-level node; when N is greater than or equal to 2, according to the address information of the local area network by the sending unit 31, sending a second instruction for scanning the N-1 sub-route to the corresponding sub-route, reading the signal intensity information and the delay information of the sub-route by the reading sub-unit 321, obtaining the link score of the sub-route by a weighting algorithm, selecting the sub-route with the smallest score as the nth sub-route by the analyzing sub-unit 322, establishing connection between the N-1 sub-route and the nth sub-route by the connecting unit 33, obtaining the nth optimal link, and updating the nth sub-route into an n+1 level node by the linked list; the first best link is combined with M best links by the connection unit 33 to obtain the best topology link. The system for updating the optimal network topology can enable a plurality of routers to efficiently and quickly form the optimal topology under the networking condition.
The embodiment of the application also discloses a terminal device which comprises a memory, a processor and a computer program stored in the memory and capable of running on the processor, wherein the method for updating the optimal network topology in the embodiment is adopted when the processor executes the computer program.
The terminal device may be a computer device such as a desktop computer, a notebook computer, or a cloud server, and the terminal device includes, but is not limited to, a processor and a memory, for example, the terminal device may further include an input/output device, a network access device, a bus, and the like.
The processor may be a Central Processing Unit (CPU), or of course, according to actual use, other general purpose processors, digital Signal Processors (DSP), application Specific Integrated Circuits (ASIC), ready-made programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc., and the general purpose processor may be a microprocessor or any conventional processor, etc., which is not limited in this respect.
The memory may be an internal storage unit of the terminal device, for example, a hard disk or a memory of the terminal device, or an external storage device of the terminal device, for example, a plug-in hard disk, a Smart Memory Card (SMC), a secure digital card (SD), or a flash memory card (FC) provided on the terminal device, or the like, and may be a combination of the internal storage unit of the terminal device and the external storage device, where the memory is used to store a computer program and other programs and data required by the terminal device, and the memory may be used to temporarily store data that has been output or is to be output, which is not limited by the present application.
The method for updating the optimal network topology in the embodiment is stored in the memory of the terminal device through the terminal device, and is loaded and executed on the processor of the terminal device, so that the method is convenient to use.
The embodiment of the application also discloses a computer readable storage medium, and the computer readable storage medium stores a computer program, wherein the computer program is executed by a processor, and the method for updating the optimal network topology in the embodiment is adopted.
The computer program may be stored in a computer readable medium, where the computer program includes computer program code, where the computer program code may be in a source code form, an object code form, an executable file form, or some middleware form, etc., and the computer readable medium includes any entity or device capable of carrying the computer program code, a recording medium, a usb disk, a removable hard disk, a magnetic disk, an optical disk, a computer memory, a read-only memory (ROM), a Random Access Memory (RAM), an electrical carrier signal, a telecommunication signal, a software distribution medium, etc., where the computer readable medium includes, but is not limited to, the above components.
The method for updating the optimal network topology in the above embodiment is stored in the computer readable storage medium through the computer readable storage medium, and is loaded and executed on a processor, so as to facilitate the storage and application of the method.
The above embodiments are not intended to limit the scope of the present application, so: all equivalent changes in structure, shape and principle of the application should be covered in the scope of protection of the application.
Claims (7)
1. A method of updating an optimal network topology, comprising the steps of:
after a main route and a sub-route are connected with a network, acquiring data information of all the sub-routes, wherein the data information comprises signal intensity information, delay information and node information of the sub-routes, and the node information refers to N-level nodes where the main route and the sub-routes are located;
establishing a linked list, storing the data information of the sub-route into the linked list, wherein the data information also comprises local area network address information,
transmitting a first instruction for scanning the main route to the sub-route based on the local area network address information, wherein the sub-route establishes a connection with the main route based on the first instruction to obtain a first optimal link, the first optimal link comprises the main route and a first sub-route, the main route is a level 1 node, and the first sub-route is a level 2 node;
transmitting a second instruction to a sub-route except the first sub-route based on the local area network address information, reading the signal intensity information and the delay information of the sub-route except the first sub-route, analyzing the signal intensity information and the delay information based on a weighting algorithm, obtaining an analysis result, determining an N-1 sub-route and an N sub-route based on the analysis result, establishing a connection between the N-1 sub-route and the N sub-route, obtaining an N optimal link, obtaining M optimal links based on the N optimal link, wherein M is greater than or equal to 1, the M optimal links comprise at least one N optimal link, N is greater than or equal to 2, the N optimal link comprises the N-1 sub-route and the N sub-route, the N-1 sub-route is an N-level node, and the N sub-route is an N+1-level node;
and obtaining an optimal topological link based on the first optimal link and the M optimal links.
2. A method of updating an optimal network topology as recited in claim 1,
the first sub-route establishing connection with the main route based on the first instruction includes the steps of:
reading the signal strength information between the sub-route and the main route;
and selecting the sub-route with the strongest signal strength as the first sub-route, and establishing connection between the first sub-route and the main route.
3. A system for updating an optimal network topology for implementing the method of claim 1, comprising:
the acquisition module (1) is used for acquiring data information of the sub-route, wherein the data information comprises signal strength information, delay information and node information;
the storage module (2) is used for storing the data information of the sub-route;
-a processing module (3), said processing module (3) being configured to update the network to obtain said optimal topology link.
4. A system for updating an optimal network topology according to claim 3, characterized in that the data information further comprises local area network address information, which is stored in the storage module (2), the processing module (3) comprising:
-a sending unit (31), the sending unit (31) being configured to send instructions to the sub-routes;
-an analysis unit (32), the analysis unit (32) being adapted to analyze data information of the sub-routes;
-a connection unit (33), the connection unit (33) being arranged for establishing a connection between the main route and the sub-route, the sub-route and the sub-route.
5. A system for updating an optimal network topology according to claim 4, wherein the analysis unit (32) comprises;
a reading subunit (321), wherein the reading subunit (321) is used for reading signal strength information and delay information of the sub-route;
and the analysis subunit (322) is used for analyzing the signal strength information and the delay information of the sub-route and obtaining an analysis result.
6. A terminal device comprising a memory, a processor and a computer program stored in the memory and capable of running on the processor, characterized in that the method according to any of claims 1-2 is used when the computer program is loaded and executed by the processor.
7. A computer readable storage medium having a computer program stored therein, characterized in that the method according to any of claims 1-2 is employed when the computer program is loaded and executed by a processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210228874.7A CN114745763B (en) | 2022-03-08 | 2022-03-08 | Method and system for updating optimal network topology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210228874.7A CN114745763B (en) | 2022-03-08 | 2022-03-08 | Method and system for updating optimal network topology |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114745763A CN114745763A (en) | 2022-07-12 |
| CN114745763B true CN114745763B (en) | 2023-08-22 |
Family
ID=82276066
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210228874.7A Active CN114745763B (en) | 2022-03-08 | 2022-03-08 | Method and system for updating optimal network topology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114745763B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104539315A (en) * | 2014-12-02 | 2015-04-22 | 上海电器科学研究院 | Rapid networking method for power line carrier communication |
| CN106658645A (en) * | 2016-12-23 | 2017-05-10 | 上海斐讯数据通信技术有限公司 | Ad hoc network connection method and system based on wireless signal strength |
| CN107404745A (en) * | 2017-06-13 | 2017-11-28 | 广东广业开元科技有限公司 | A kind of fire detector remote detecting system based on MANET |
| CN108712334A (en) * | 2018-04-24 | 2018-10-26 | 四川斐讯信息技术有限公司 | A kind of routing self-organizing method and its system |
| CN109429117A (en) * | 2017-08-30 | 2019-03-05 | 中国移动通信集团设计院有限公司 | Route selection method and equipment |
| CN110401594A (en) * | 2019-07-02 | 2019-11-01 | 杭州迪普科技股份有限公司 | Message forwarding method, device, electronic equipment and machine readable storage medium |
| CN111683384A (en) * | 2020-06-10 | 2020-09-18 | 广州空天通讯技术服务有限公司 | Network optimization method for realizing dynamic weighting of communication link by artificial intelligence |
| CN112333092A (en) * | 2020-10-22 | 2021-02-05 | 华能阜新风力发电有限责任公司 | Method and system for routing addressing of multi-hop ad hoc network |
| CN112533264A (en) * | 2020-11-10 | 2021-03-19 | 烽火通信科技股份有限公司 | Method and device for realizing networking scene mode |
| CN112738834A (en) * | 2021-01-04 | 2021-04-30 | 烽火通信科技股份有限公司 | MESH networking network emergency management method and electronic equipment |
| WO2021135746A1 (en) * | 2019-12-30 | 2021-07-08 | 中兴通讯股份有限公司 | Route calculation method and data transmission method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108401227B (en) * | 2018-03-07 | 2020-11-10 | 乐鑫信息科技（上海）股份有限公司 | Method and system for establishing connectionless mesh network route |
-
2022
- 2022-03-08 CN CN202210228874.7A patent/CN114745763B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104539315A (en) * | 2014-12-02 | 2015-04-22 | 上海电器科学研究院 | Rapid networking method for power line carrier communication |
| CN106658645A (en) * | 2016-12-23 | 2017-05-10 | 上海斐讯数据通信技术有限公司 | Ad hoc network connection method and system based on wireless signal strength |
| CN107404745A (en) * | 2017-06-13 | 2017-11-28 | 广东广业开元科技有限公司 | A kind of fire detector remote detecting system based on MANET |
| CN109429117A (en) * | 2017-08-30 | 2019-03-05 | 中国移动通信集团设计院有限公司 | Route selection method and equipment |
| CN108712334A (en) * | 2018-04-24 | 2018-10-26 | 四川斐讯信息技术有限公司 | A kind of routing self-organizing method and its system |
| CN110401594A (en) * | 2019-07-02 | 2019-11-01 | 杭州迪普科技股份有限公司 | Message forwarding method, device, electronic equipment and machine readable storage medium |
| WO2021135746A1 (en) * | 2019-12-30 | 2021-07-08 | 中兴通讯股份有限公司 | Route calculation method and data transmission method |
| CN111683384A (en) * | 2020-06-10 | 2020-09-18 | 广州空天通讯技术服务有限公司 | Network optimization method for realizing dynamic weighting of communication link by artificial intelligence |
| CN112333092A (en) * | 2020-10-22 | 2021-02-05 | 华能阜新风力发电有限责任公司 | Method and system for routing addressing of multi-hop ad hoc network |
| CN112533264A (en) * | 2020-11-10 | 2021-03-19 | 烽火通信科技股份有限公司 | Method and device for realizing networking scene mode |
| CN112738834A (en) * | 2021-01-04 | 2021-04-30 | 烽火通信科技股份有限公司 | MESH networking network emergency management method and electronic equipment |
Non-Patent Citations (1)
| Title |
|---|
| IP over WDM网络集成动态路由算法研究;李仕锋等;现代有线传输;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114745763A (en) | 2022-07-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8817616B2 (en) | Node device and computer readable storage medium storing program | |
| US8085672B2 (en) | Wireless routing implementation | |
| US20150023214A1 (en) | Node apparatus and communication method | |
| CN102821414B (en) | System and method for managing CWSN (cloud wireless sensor network) communication data based on GUI (graphical user interface) | |
| US8305934B2 (en) | Computer program, apparatus, and method for managing network | |
| KR20140051447A (en) | Cloud computing enhanced gateway for communication networks | |
| US8331239B2 (en) | Network system and data transfer method | |
| CN112532408B (en) | Method, device and storage medium for extracting fault propagation condition | |
| CN112911671A (en) | Method and device for constructing topology networking architecture | |
| Alejandrino et al. | Protocol-independent data acquisition for precision farming | |
| JP2006081077A (en) | Relay node installation point selecting method/program/recording medium/apparatus, base station, and multi-hop network system | |
| WO2018137361A1 (en) | Method and device for forwarding data | |
| CN105763468B (en) | A kind of transmission method and device of bgp update message | |
| Guo et al. | Pangu: Towards a software-defined architecture for multi-function wireless sensor networks | |
| Bounceur et al. | Brogo: a new low energy consumption algorithm for leader election in wsns | |
| CN114615706A (en) | Method for increasing communication capacity of micropower wireless network in smart power grid | |
| CN114745763B (en) | Method and system for updating optimal network topology | |
| CN113347059A (en) | In-band network telemetering optimal detection path planning method based on fixed probe position | |
| US20040158780A1 (en) | Method and system for presenting neighbors of a device in a network via a graphical user interface | |
| US9185028B2 (en) | Wireless communication apparatus, a computer-readable recording medium and wireless communication method | |
| JP7056207B2 (en) | Topology determination device, topology determination method, topology determination program and communication system | |
| WO2020022193A1 (en) | Route selection device, route selection method, and program | |
| CN109951871A (en) | Detection method, device, terminal and the storage medium of node conflict | |
| CN111641969B (en) | Wireless multi-hop ad hoc network data distribution method and device based on edge calculation | |
| CN113595750B (en) | Network topology dividing method and device and network topology management 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |