CN114745763A - Method and system for updating optimal network topology - Google Patents

Method and system for updating optimal network topology Download PDF

Info

Publication number
CN114745763A
CN114745763A CN202210228874.7A CN202210228874A CN114745763A CN 114745763 A CN114745763 A CN 114745763A CN 202210228874 A CN202210228874 A CN 202210228874A CN 114745763 A CN114745763 A CN 114745763A
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.)
Granted
Application number
CN202210228874.7A
Other languages
Chinese (zh)
Other versions
CN114745763B (en
Inventor
李俊
戴定卫
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Sinobry Electronic Ltd
Original Assignee
Shenzhen Sinobry Electronic Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shenzhen Sinobry Electronic Ltd filed Critical Shenzhen Sinobry Electronic Ltd
Priority to CN202210228874.7A priority Critical patent/CN114745763B/en
Publication of CN114745763A publication Critical patent/CN114745763A/en
Application granted granted Critical
Publication of CN114745763B publication Critical patent/CN114745763B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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-routes are randomly networked, 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; 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 Nth optimal link, N is more than or equal to 2, and the Nth optimal link comprises an N-1 th sub-route and an Nth sub-route; and obtaining the optimal topological link based on the first optimal link and the M optimal links. The method and the system for updating the optimal network topology can efficiently and quickly form the optimal network topology.

Description

Method and system for updating optimal network topology
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
At present, connection topology among distributed Wi-Fi routers is mostly tree-shaped or chain-shaped. 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 refers to a network access point, the AC refers to an access controller, the AC is responsible for managing all the APs, all the AP nodes can be automatically synchronized as long as uniform configuration is carried out on the AC, and the working states of all the APs can be monitored on the AC in real time; the Mesh is also called a multi-hop network, a plurality of nodes with the same status 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.
For the related technologies, the inventor thinks that when a plurality of router nodes are powered on and started simultaneously, because each network node is usually networked according to a random topology sequence, an optimal topology cannot be efficiently and quickly formed among the plurality of routers.
Disclosure of Invention
In order to enable a plurality of routers to efficiently and quickly form an optimal topology, 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 solutions:
a method of updating an optimal network topology, comprising the steps of:
after the main route and the sub-route are randomly networked, acquiring data information of all the sub-routes, wherein the number is the same as the number of the sub-routes
The information comprises signal strength 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 Nth optimal link, N is greater than or equal to 2, the Nth optimal link comprises an N-1 th sub-route and an Nth sub-route, the N-1 th sub-route is an N-level node, and the Nth 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, the first sub-route is obtained according to the signal intensity information of the sub-route, and the first sub-route is connected with the main route to obtain the first optimal link; when N is more than or equal to 2, obtaining an Nth sub-route according to the signal intensity information and the delay information of the sub-routes, and establishing connection between the Nth sub-route and the (N-1) th sub-route to obtain an Nth optimal link; and obtaining the optimal topological link of the network through the first optimal link and the M optimal links.
Optionally, the data information further includes local area network address information, and 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-routes to the linked list;
sending 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
The best link.
Optionally, the establishing, by the first sub-route, a connection with the main route based on the first instruction includes:
reading the signal strength information between the sub-route and the main route;
and selecting the sub-route with the strongest signal intensity 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:
sending a second instruction to a sub-route other than the first sub-route based on the local area network address information;
determining the N-1 st sub-route and the N sub-route based on the second instruction;
establishing a connection between the N-1 th sub-route and the Nth sub-route to obtain the Nth optimal link;
and obtaining M best links based on the Nth best link.
Optionally, the determining the N-1 th sub-route and the nth sub-route based on the second instruction includes the following steps:
reading the signal strength information and the delay information of sub-routes except the first sub-route;
analyzing the signal intensity information and the delay information based on a weighting algorithm to obtain an analysis result;
determining the N-1 st sub-route and the N 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 solutions:
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 and is stored in the storage module, the signal strength information of the sub-route is processed through the processing module to obtain the first sub-route, and the first sub-route is connected with the main route to obtain the first optimal link; when N is more than or equal to 2, processing the signal intensity information and the delay information of the sub-route through a processing module to obtain an Nth sub-route, and establishing connection between the Nth sub-route and the N-1 th sub-route to obtain an Nth optimal link; and obtaining the optimal topological link of the network through the first optimal link and the M optimal 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 data information of the sub-route;
a connection unit for establishing a connection between the main route and the sub-route, and between the sub-route and the sub-route.
Optionally, the analysis unit comprises;
a reading subunit, configured to read signal strength information and delay information of the sub-route;
and the analysis subunit is used for analyzing the signal strength 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 solution:
a terminal device comprising a memory, a processor and a computer program stored in the memory and capable of running on the processor, the processor when loading and executing the computer program employs 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 stored in the memory so as to be loaded and executed by the processor, so that the terminal equipment is manufactured according to the memory and the processor, and the use is convenient.
In a fourth aspect, the present application provides a computer-readable storage medium, which adopts the following technical solutions:
a computer-readable storage medium, in which a computer program is stored, 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 computer program is generated by the method for updating the optimal network topology and is stored in the computer readable storage medium so as to be loaded and executed by the processor, and the computer program can be conveniently read and stored through the computer readable storage medium.
Drawings
Fig. 1 is a schematic overall flow chart of a method for updating an optimal network topology according to the present application.
Fig. 2 is a schematic flowchart illustrating steps S210 to S230 in a method for updating an optimal network topology according to the present application.
Fig. 3 is a schematic flowchart illustrating steps S231-S232 in a method for updating an optimal network topology according to the present application.
Fig. 4 is a schematic 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-S323 in a method for updating an optimal network topology according to the present application.
Fig. 6 is a block diagram illustrating an overall system for updating an optimal network topology according to the present application.
Description of reference numerals:
1. an acquisition module; 2. a storage module; 3. a processing module; 31. a transmitting unit; 32. an analysis unit; 321. reading the sub-unit; 322. an analysis subunit; 33. a connection unit.
Detailed Description
The present application is described in further detail below with reference to figures 1-6.
The embodiment of the application discloses a method for updating an optimal network topology, which refers to fig. 1 and comprises the following steps:
s100, after the main route and the sub-routes are randomly networked, 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;
s200, obtaining a first optimal link based on the signal intensity 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 the signal strength information and the delay information, wherein M is larger than or equal to 1, the M optimal links comprise at least one Nth optimal link, N is larger than or equal to 2, the Nth optimal link comprises an N-1 th sub-route and an Nth sub-route, the N-1 th sub-route is an N-level node, and the Nth sub-route is an N + 1-level node;
s400, obtaining the optimal topological link based on the first optimal link and the M optimal links.
Specifically, in step S100, in this embodiment, two networking manners, i.e., AP + AC and Mesh, may be formed among the plurality of routers; the AP refers to a network access point, the AC refers to an access controller, the AC is responsible for managing all the APs, all the AP nodes can be automatically synchronized as long as uniform configuration is carried out on the AC, and the working states of all the APs can be monitored on the AC in real time; the Mesh is also called a multi-hop network, a plurality of nodes with the same status 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. The signal strength information comprises signal strength values of all 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 the ping main routes of all the sub-routes, and the ping delay is added to avoid interference and link blockage among the routers; the nodes between the routers represent a hierarchy of the network topology.
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 first sub-route, and it is determined that the first sub-route is the first sub-route, so as to obtain the first optimal link, where the main route is at the level 1 node, and the main route updates the first sub-route to the level 2 node. Since the upper level of the sub-route one is already the main route, the delay factor of the sub-router one ping the main route is not considered any more.
Specifically, in step S300, in this embodiment, the topology M optimal links are updated to the next level from the level 2 node of the first sub-route, and the nth optimal link between nodes of each level is obtained by combining the signal strength information and the delay information of the first sub-route. Obtaining a second sub-route as a second sub-route according to the signal strength information and the delay information of the second sub-route and the third sub-route, and forming a second optimal link between the first sub-route and the second sub-route, wherein M is equal to 1, N is equal to 2, and the second sub-route is in a level 3 node; and obtaining a third sub-route as a third sub-route according to the signal strength information and the delay information of the third sub-route and the fourth sub-route, forming a third optimal link between the third sub-route and the second sub-route, wherein M is equal to 2, N is equal to 3, and the second sub-route is in 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 connections between the first optimal link and the second optimal link, and between the second optimal link and the third optimal link. The main route is connected with the first sub-route to form a first optimal link, the first sub-route is connected with the second sub-route to form a second optimal link, the second sub-route is connected with the third sub-route to form a third optimal link, and the first optimal link, the second optimal link and the third optimal link jointly form an optimal topological link.
Wherein, the data information further includes local area network address information, as shown in fig. 2, step S200 includes the following steps:
s210, establishing a linked list, and storing data information of the sub-routes to the linked list;
s220, sending a first instruction for scanning the main route to the sub-route based on the local area network address information;
and S230, the sub-route establishes connection with the main route based on the first instruction to obtain 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 sub-route for scanning the main route is weaker 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 optimal link. The local area network address information of the first sub-route is recorded in the linked list as unused char br _ mac [6], the main route sends a first instruction for scanning the main route to the sub-route according to the local area network address information of the first sub-route, the linked list records the local area network address of the first sub-route and the main route as char connect [18], the first sub-route executes the first instruction according to the local area network address connected with the main route, and then establishes connection with the main route to obtain a first optimal link.
As shown in fig. 3, step S230 includes the following steps:
s231, reading signal strength information between the sub-route and the main route;
s232, selecting the sub-route with the strongest signal intensity as the first sub-route, and establishing connection between the first sub-route and the main route.
More specifically, in this embodiment, the linked list records signal strength information of all the sub-routes scanning the main route, selects the sub-route with the strongest signal strength as the first sub-route by reading the signal strength information of the sub-route scanning the main route, and establishes a connection between the first sub-route and the main route. The main route sends a first instruction to enable all the sub-routes to scan the signal intensity of the main route at the level 1 node, 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 information and the actual running speed of the first sub-route and the second sub-route are recorded by a linked list, because the signal strength of sub-route one is-30 db better than the signal strength of sub-route two is-50 db, therefore, the first sub-route is confirmed to be the first sub-route, the first sub-route is selected to be connected with the main route, the first sub-route is updated to be the level 2 node by the chain table, because the first sub-route connected at the previous level is the main route, therefore, the delay information of the first sub-route is not considered, and the delay information of the first sub-route and the second sub-route is only needed to be sent to the linked list for recording.
As shown in fig. 4, step S300 includes the following steps:
s310, sending a second instruction to the sub-routes except the first sub-route based on the local area network address information;
s320, determining an N-1 th sub-route and an N sub-route based on the second instruction;
s330, establishing connection between the N-1 st sub-route and the Nth sub-route to obtain an Nth optimal link;
and S340, obtaining M optimal links based on the Nth optimal 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 local area network address information of the sub-routes, determines the N-1 th sub-route and the nth sub-route based on the second instruction, and obtains the nth optimal link by establishing a connection between the N-1 th sub-route and the nth sub-route, where the nth optimal link may be one or multiple, and obtains M optimal links based on the nth optimal 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-routes, 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 strength information and delay information of sub-routes except the first sub-route;
s322, analyzing the signal intensity information and the delay information based on a weighting algorithm, and obtaining an analysis result;
s323, determining the N-1 st sub-route and the N sub-route based on the analysis result.
More specifically, in step S321, in this embodiment, the linked list records signal strength information and delay information of all sub-routes, obtains a specific numerical value by reading the signal strength information and the delay information of the sub-routes, and obtains a link score according to a calculation formula: and (the signal strength of the current node and the upper level is x-1) + (the delay of the upper level route is x 5) analyzing the signal strength information and the delay information of the sub-route to obtain an analysis result, and obtaining an N-1 th sub-route and an N-th sub-route 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 three-ping main route of the sub-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 four-ping main route of the sub-route is 17 ms.
More specifically, in step S322, in this embodiment, the link scores of the sub-route three and the sub-route four are obtained according to a weighting algorithm, the link score = (signal strength of the current node and the upper level × -1) + (delay time of the upper level route × 5), and finally the link with the smallest link score is selected. The signal intensity of the third sub-route and the first sub-route is-51 db, and the delay of the third Ping main route of the sub-route is 14 ms; the signal strength of the sub-route four and the sub-route one is-58 db, and the delay of the sub-route four Ping main routes is 17 ms. And substituting the signal strength information and the delay information of the third sub-route and the fourth sub-route into a link score formula to obtain a score of 121 for the third sub-route and a score of 143 for the fourth sub-route.
More specifically, in step S323, in this embodiment, the signal strength of the sub-route three and the sub-route four and the ping main route delay are calculated by a weighting algorithm, the link score of the sub-route three is 121, and the link score of the sub-route four is 143, then the sub-route three with a small link score is selected as the second sub-route, and the sub-route three and the sub-route one are connected to obtain the second optimal link, the sub-route three sends the delay information of the ping main route to a linked list to record and store the linked list, and the sub-route three is a level 3 node. When N is equal to 2, the optimal topological link is obtained based on the first optimal link and the second optimal link.
The implementation principle of the method for updating the optimal network topology in the embodiment of the application is as follows: after the main route and the sub-routes are randomly networked, the main route collects data information of the sub-routes through a linked list, the main route sends a first instruction for scanning the main route to the corresponding sub-routes according to local area network address information of the sub-routes recorded in the linked list, the sub-routes with the strongest signal intensity are selected as the first sub-routes and are connected with the main route to form a first optimal link, the main route is updated to be a level 1 node through the linked list, and the first sub-routes are updated to be level 2 nodes; when N is more than or equal to 2, the main router sends a second instruction for scanning the N-1 sub-router to the corresponding sub-router according to the address information of the local area network of the sub-reason, reads the signal intensity information and the time delay information of the sub-router, obtains the link score of the sub-router through a weighting algorithm, selects the sub-router with the minimum score as the Nth sub-router, obtains the Nth optimal link, and updates the Nth sub-router into the N +1 level node through a linked list; and obtaining the optimal topological link based on the first optimal link and the M optimal 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 an optimal network topology, and the system comprises an acquisition module 1, a storage module 2 and a processing module 3, wherein the acquisition module 1 is connected with the storage module 2, the storage module 2 is connected with the processing module 3, the acquisition module 1 is used for acquiring data information of a sub-route, and the data information comprises signal strength information, delay information and node information; the storage module 2 is used for storing data information of the sub-route; the processing module 3 is used for updating the network to obtain the optimal topological link.
Specifically, in this embodiment, two networking modes, AP + AC and Mesh, may be formed between the plurality of routers; the AP refers to a network access point, the AC refers to an access controller, the AC is responsible for managing all the APs, all the AP nodes can be automatically synchronized as long as uniform configuration is carried out on the AC, and the working states of all the APs can be monitored on the AC in real time; the Mesh is also called a multi-hop network, a plurality of nodes with the same status 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. The main route comprises an acquisition module 1, the data information of the sub-routes is acquired 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 the main route and the sub-routes are connected; the delay information comprises delay values of the ping main routes of all the sub-routes, and the ping delay is added to avoid interference and link blockage among the routers; the nodes between the routers represent a hierarchy of the network topology. The acquisition module 1 acquires that the local area network address information of the first sub-route is unknown char br _ mac [6], the local area network address connecting the first sub-route with the main route is char connect [18], the signal strength of the first sub-route is-30 db, the time delay of the first sub-route ping main route is 12ms, and the actual running speed corresponding to the first sub-route is 720 Mbps.
Specifically, in this embodiment, the main route further includes a storage module 2, the storage module 2 may be set as a linked list, and data information of all sub-routes scanning the main route and the nth sub-route is recorded in the linked list. The signal strength of the first sub-route is-30 db through the acquisition module 1, the time delay of the first sub-route for ping the main route is 12ms, and the actual running speed corresponding to the first sub-route for measuring is 720 Mbps; the signal intensity of the second sub-route is collected to be-50 db, the time delay of the second sub-route pinging main route is 18ms, the actual running speed corresponding to the second sub-route is 520Mbps, the linked list records the signal intensity information, the time delay information and the actual running speed of the first sub-route and the second sub-route, if the first sub-route is selected to be connected with the main route, the first sub-route is determined to be the first sub-route, the first sub-route is updated to be the level 2 node through the linked list, because the last level of the first sub-route is connected with the main route, the time delay information of the first sub-route is not considered, the time delay information of the first sub-route and the second sub-route ping main route is only needed to be sent to the linked list to be recorded, if the second sub-route is selected to be connected with the first sub-route, the second sub-route is determined to be the second sub-route, and the second sub-route is updated to be the level 3 node through the linked list.
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 analyzing unit 32 is used for analyzing the data information of the sub-route; the connection unit 33 is used to establish connections between the main route and the sub-route, and between the sub-route and the sub-route.
Specifically, in the present embodiment, the sending unit 31 sends 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 first sub-route according to the address information of the local area network of the first sub-route, the signal strength of the first sub-route obtained by scanning the first sub-route is-30 db, the delay of the first sub-route is 12ms, and the actual running speed corresponding to the first sub-route is 720 Mbps.
As shown in fig. 6, the analyzing unit 32 includes a reading subunit 321 and an analyzing subunit 322, where the reading subunit 321 is configured to read signal strength information and delay information of the sub-route; the analyzing 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 the present 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 signal strength information and the delay information of the N-1 th sub-route scanned by the sub-route are read by the reading sub-unit 321, the link score of the sub-route is calculated by a weighting algorithm, and the sub-route with the smallest link score is analyzed as the nth sub-route by the analyzing sub-unit 322. The reading unit reads that 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, and the actual running speed corresponding to the second sub-route is 520Mbps, so that the signal intensity-30 db of the first sub-route is better than that of the second sub-route by-50 db, and the actual running speed of the first sub-route is higher than that of the second sub-route, so that the first sub-route is analyzed by the analyzing unit 322 and is the first sub-route; when N is equal to 2, the reading subunit 321 reads the signal strength information and the delay information of the sub-route, and obtains a specific value 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 main route scanned by the third sub-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 main route scanned by the fourth sub-route is 17 ms.
Specifically, in the present embodiment, the link scores of the sub-route three and the sub-route four are obtained according to a weighting algorithm, the link score = (signal strength of the current node and the upper level × -1) + (delay time of the upper level route × 5), and finally the link with the smallest link score is selected. The signal intensity of the first scanning sub-route of the third sub-route is-51 db, and the time delay of the third Ping main route of the sub-route is 14 ms; the signal intensity of the sub-route four scanning sub-route one is-58 db, and the time delay of the sub-route four Ping main route is 17 ms. And the signal strength information and the delay information of the third sub-route and the fourth sub-route are brought into a link score formula, the score of the third sub-route is 121, the score of the fourth sub-route is 143, and the third sub-route is analyzed as a second sub-route through the analysis sub-unit 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 sub-unit 321 reads the signal strength information and the delay information of the N-1 th sub-route scanned by the sub-route, calculates the link score of the sub-route through a weighting algorithm, analyzes the sub-route with the minimum link score as the nth sub-route through the analysis sub-unit 322, and establishes the connection between the N-1 th sub-route and the nth sub-route through the connection unit 33. The reading unit reads that the signal strength of the first sub-route is-30 db, the actual running speed corresponding to the first sub-route is 720Mbps, the signal strength of the second sub-route is-50 db, and the actual running speed corresponding to the second sub-route is 520Mbps, because the signal strength of the first sub-route is-30 db better than that of the second sub-route and the actual running speed of the first sub-route is faster than that of the second sub-route, the analysis subunit 322 analyzes that the first sub-route is the first sub-route, and the connection unit 33 establishes the connection between the first sub-route and the main route to obtain a first optimal link; when N is equal to 2, obtaining respective link scores of a sub-route three and a sub-route four according to a weighting algorithm, wherein the link score is = (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 selecting the link with the minimum link score. The signal intensity of the first scanning sub-route of the third sub-route is-51 db, and the time delay of the third Ping main route of the sub-route is 14 ms; the signal intensity of the sub-route four scanning sub-route one is-58 db, and the time delay of the sub-route four Ping main route is 17 ms. Bringing the signal strength information and the delay information of the sub-route three and the sub-route four into a link score formula to obtain a score of the sub-route three as 121 and a score of the sub-route four as 143, analyzing the sub-route three as a second sub-route through an analysis sub-unit 322, and establishing connection between the sub-route three and the sub-route two through a connection unit 33 to obtain an N +1 optimal link; when N is equal to 2, the optimal topology link is obtained by the connection unit 33 based on the first optimal link and the second optimal 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-routes are randomly networked, the main route collects data information of the sub-routes through an acquisition module 1 and stores the data information into a storage module 2, a first instruction for scanning the main route is sent to the corresponding sub-route through a sending unit 31 according to local area network address information of the sub-routes, signal intensity information of the main route scanned by the sub-routes is read through a reading sub-unit 321, the sub-route with the strongest signal intensity is selected as a first sub-route through an analysis sub-unit 322, the first sub-route is connected with the main route through a connecting unit 33 to form a first optimal link, the main route is updated to be a level 1 node by a linked list, and the first sub-route is updated to be a level 2 node; when N is more than or equal to 2, a second instruction for scanning the N-1 sub-route is sent to the corresponding sub-route through the sending unit 31 according to the address information of the local area network of the sub-reason, the signal strength information and the delay information of the sub-route are read through the reading sub-unit 321, the link score of the sub-route is obtained through a weighting algorithm, the sub-route with the minimum score is selected as the Nth sub-route through the analyzing sub-unit 322, the N-1 sub-route is connected with the Nth sub-route through the connecting unit 33, the Nth optimal link is obtained, and the Nth sub-route is updated to be an N +1 level node through a linked list; the first optimal link and the M optimal links are combined by the connection unit 33 to obtain an optimal 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 present application further discloses a terminal device, which includes a memory, a processor, and a computer program stored in the memory and capable of running on the processor, wherein when the processor executes the computer program, the method for updating an optimal network topology in the foregoing embodiments is adopted.
The terminal device may adopt 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), and of course, according to an actual use situation, other general processors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, and the like may also be used, and the general processor may be a microprocessor or any conventional processor, and the present application does not limit the present invention.
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 card memory (SMC), a secure digital card (SD) or a flash memory card (FC) equipped on the terminal device, and the memory may also be a combination of the internal storage unit of the terminal device and the external storage device, and the memory is used for storing a computer program and other programs and data required by the terminal device, and the memory may also be used for temporarily storing data that has been output or will be output, which is not limited in this application.
The terminal device stores the method for updating the optimal network topology in the embodiment in a memory of the terminal device, and the method is loaded and executed on a processor of the terminal device, so that the terminal device is convenient to use.
The embodiment of the present application further discloses a computer-readable storage medium, and the computer-readable storage medium stores a computer program, wherein when the computer program is executed by a processor, the method for updating the optimal network topology in the above-mentioned embodiments is adopted.
The computer program may be stored in a computer readable medium, the computer program includes computer program code, the computer program code may be in a source code form, an object code form, an executable file or some intermediate form, and the like, 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, and the like, and the computer readable medium includes but is not limited to the above components.
The method for updating the optimal network topology in the above embodiments is stored in the computer-readable storage medium, and is loaded and executed on the processor, so as to facilitate the storage and application of the method.
The above embodiments are preferred embodiments of the present application, and the protection scope of the present application is not limited by the above embodiments, so: all equivalent changes made according to the structure, shape and principle of the present application shall be covered by the protection scope of the present application.

Claims (10)

1. A method for updating an optimal network topology, comprising the steps of:
after a main route and sub-routes are randomly networked, acquiring data information of all 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;
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-th optimal link, N is greater than or equal to 2, the N-th optimal link comprises an N-1-th sub-route and an N-th sub-route, the N-1-th sub-route is an N-level node, and the N + 1-th 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. The method of updating an optimal network topology according to claim 1,
the data information further comprises local area network address information, and the obtaining of the first optimal link based on the signal strength information comprises the following steps:
establishing a linked list, and storing the data information of the sub-routes to the linked list;
sending 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
The best link.
3. The method of updating an optimal network topology according to claim 2,
the first sub-route establishing a 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 intensity as the first sub-route, and establishing connection between the first sub-route and the main route.
4. The method of claim 2, wherein the deriving the M best links based on the signal strength information and the delay information comprises:
sending a second instruction to a sub-route other than the first sub-route based on the local area network address information;
determining the N-1 st sub-route and the N sub-route based on the second instruction;
establishing a connection between the N-1 th sub-route and the Nth sub-route to obtain the Nth optimal link;
and obtaining the M best links based on the Nth best link.
5. The method of claim 4, wherein determining the N-1 st sub-route and the N sub-route based on the second instruction comprises:
reading the signal strength information and the delay information of sub-routes except the first sub-route;
analyzing the signal intensity information and the delay information based on a weighting algorithm to obtain an analysis result;
determining the N-1 st sub-route and the N sub-route based on the analysis result.
6. The system for updating an optimal network topology according to 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;
a storage module (2), wherein the storage module (2) is used for storing the data information of the sub-route;
a processing module (3), wherein the processing module (3) is used for updating the network to obtain the optimal topological link.
7. The system for updating an optimal network topology according to claim 6, wherein the data information further comprises local area network address information, the local area network address information is stored in the storage module (2), and the processing module (3) comprises:
a sending unit (31), the sending unit (31) being configured to send an instruction to the sub-route;
an analyzing unit (32), the analyzing unit (32) being configured to analyze data information of the sub-route;
a connection unit (33), the connection unit (33) being configured to establish a connection between the main route and the sub-route, the sub-route and the sub-route.
8. A system for updating an optimal network topology according to claim 7, characterized in that said analysis unit (32) comprises;
a reading subunit (321), the reading subunit (321) being configured to read signal strength information and delay information of the sub-routes;
an analysis subunit (322), wherein 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.
9. A terminal device comprising a memory, a processor and a computer program stored in the memory and being executable on the processor, characterized in that the method of any of claims 1-5 is used when the computer program is loaded and executed by the processor.
10. A computer-readable storage medium, in which a computer program is stored, which, when loaded and executed by a processor, carries out the method of any one of claims 1 to 5.
CN202210228874.7A 2022-03-08 2022-03-08 Method and system for updating optimal network topology Active CN114745763B (en)

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 true CN114745763A (en) 2022-07-12
CN114745763B 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 (12)

* Cited by examiner, † Cited by third party
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
US20200396669A1 (en) * 2018-03-07 2020-12-17 Espressif Systems (Shanghai) Co., Ltd. Method and System for Establishing Connectionless Mesh Network Route
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

Patent Citations (12)

* Cited by examiner, † Cited by third party
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
US20200396669A1 (en) * 2018-03-07 2020-12-17 Espressif Systems (Shanghai) Co., Ltd. Method and System for Establishing Connectionless Mesh Network Route
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 (2)

* Cited by examiner, † Cited by third party
Title
李仕锋等: "IP over WDM网络集成动态路由算法研究", 现代有线传输 *
柴艳娜等: "网络拓扑多端扫描机制的研究", 计算机技术 与发展 *

Also Published As

Publication number Publication date
CN114745763B (en) 2023-08-22

Similar Documents

Publication Publication Date Title
US9450831B2 (en) Node apparatus and communication method
US8331239B2 (en) Network system and data transfer method
CN112911671B (en) Method and device for constructing topology networking architecture
CN111314994B (en) Wireless mesh network access method and device, computing equipment and storage medium
CN113489619A (en) Network topology inference method and device based on time series analysis
CN105763468B (en) A kind of transmission method and device of bgp update message
CN112165505B (en) Decentralized data processing method, electronic device and storage medium
CN110858810B (en) Network link state monitoring method, device, system and medium
US20040158780A1 (en) Method and system for presenting neighbors of a device in a network via a graphical user interface
CN114745763A (en) Method and system for updating optimal network topology
CN109951871B (en) Method, device, terminal and storage medium for detecting node conflict
CN111510931A (en) AP channel deployment method, device, equipment and system
CN113448747B (en) Data transmission method, device, computer equipment and storage medium
CN112866013B (en) Network configuration method, device and system
CN115022186A (en) Topology generation method and device and storage medium
JP6327023B2 (en) Communication channel selection device, communication channel selection method, and communication channel selection program
US20170078457A1 (en) Communication device, relay determination method, and computer program product
CN114422409A (en) Block chain network testing method, device, equipment and storage medium
CN111917868A (en) Addressing method and device for block chain node, routing equipment and storage medium
CN114553742B (en) Network congestion node identification method and system based on ant colony algorithm
CN114980248B (en) Wireless networking method, device, equipment and storage medium
US11894997B2 (en) Methods and systems for network diagnostic
CN114826867B (en) Method, device, system and storage medium for processing data
CN104221433B (en) Communication equipment searching method, communication equipment, communication equipment search utility and ad hoc network system
JP5244838B2 (en) Degraded path detection system, degraded path detection method, and computer program

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