Intelligent networking linkage system and method based on Internet of Things technology

Abstract

The invention belongs to the field of intelligent networking, and particularly relates to an intelligent networking linkage system and method based on the Internet of Things technology, and the method comprises the steps of current networking scoring, target initialization, initial candidate solution set generation, iterative updating, optimal solution screening and networking optimization. According to the scheme, the deployment scheme of the gateway nodes is determined by evaluating the positions and the number of the terminal devices needing to be served by adopting a heuristic algorithm, so that the coverage range of the intelligent gateway is effectively met at relatively low cost; according to the scheme, an intelligent gateway optimization method combined with the Pareto frontier technology is creatively provided, an optimal balance point is found between the system cost and the coverage quality, and a networking linkage solution capable of reducing the system cost and guaranteeing the high bit rate is found.

Description

Technical Field

[0001] The present invention belongs to the field of smart networking, and specifically relates to a smart networking linkage system and method based on Internet of Things technology. Background Art

[0002] The Internet of Things technology has greatly promoted the interconnection between intelligent devices. The smart networking linkage system and method based on the Internet of Things technology is a method that uses the Internet of Things technology to calculate and optimize the networking structure and improve the information transmission and processing capabilities of node devices in the network.

[0003] Among the existing similar solutions, for example, CN113543046B is an intelligent control system for BLEmesh networking of power grids. This solution aims at the technical problems of high power consumption, poor mobility, complex protocols, and inability to connect directly to smartphones in existing IoT network technologies. This solution uses BLE multicast technology to reduce power consumption, establishes a BLE connection between Bluetooth devices and smartphones, communicates with each other through the GATT protocol, and simultaneously issues commands to smartphones and associated devices without the need for relaying messages from other nodes. This achieves the technical effect of supporting intelligent linkage and real-time 5G transmission of high-definition video on site. However, there is a technical problem that the coverage of Bluetooth is still affected by obstacles such as terrain and buildings, and more relay points need to be deployed to achieve full coverage.

[0004] In addition, there is usually a conflict between system cost and bit rate: reducing system cost may reduce the number of smart gateways, thereby reducing bit rate, while increasing bit rate may require increasing the number of smart gateways, thereby increasing system cost. For example, CN115499282B builds a method and system for flexible networking linkage management based on native IPv6. This solution targets the technical problems that the existing technology cannot realize scenario customization according to differentiated network service requirements and the operation and maintenance management of edge routers is relatively complex. The controller sends edge router configuration, the northbound interface of the controller is responsible for network service demand customization, and the southbound interface controls the edge router. The technical means realizes the combination of network and application, meets scenario network requirements, realizes unified management and control of edge routers, effectively shields the differences in edge router equipment, and enhances the technical effects of scalability and compatibility. However, the cost of LoRa smart gateway is higher than that of other low-power wide-area network smart gateways, and the technical problem of network deployment cost is not considered. Summary of the invention

[0005] In view of the above situation, in order to overcome the defects of the prior art, the present invention provides a smart networking linkage system and method based on Internet of Things technology. In view of the technical problem that the coverage of Bluetooth in the prior art is still affected by obstacles such as terrain and buildings, and more relay points need to be deployed to achieve full coverage, this solution adopts a heuristic algorithm to determine the deployment plan of the gateway node by evaluating the location and number of terminal devices that need to be served, and effectively meets the coverage of the smart gateway at a lower cost; in view of the technical problem that the cost of the LoRa smart gateway in the prior art is higher than that of other low-power wide-area network smart gateways, and the cost of networking deployment is not taken into account, this solution creatively proposes a smart gateway optimization method combined with Pareto frontier technology to find the best balance between system cost and coverage quality, and find a networking linkage solution that can reduce system cost and ensure a higher bit rate.

[0006] The technical solution adopted by the present invention is as follows: The present invention provides a smart networking linkage system based on Internet of Things technology, the system comprising a current networking scoring module, a target initialization module, an initial candidate solution set generation module, an iterative update module, an optimal solution screening module and a networking optimization module;

[0007] The current networking scoring module evaluates the current networking quality;

[0008] The target initialization module determines a deployment cost minimization target function and a bit rate maximization target function;

[0009] The initial candidate solution set generation module generates candidate solutions to obtain an initial candidate solution set;

[0010] The iterative update module optimizes the candidate solution set;

[0011] The optimal solution screening module screens all candidate solutions to obtain non-dominated solutions, and then screens the non-dominated solutions to obtain the optimal solution;

[0012] The networking optimization module generates a networking linkage solution according to the best solution.

[0013] The present invention also provides a smart networking linkage method based on the Internet of Things technology, which includes the following steps:

[0014] Step S1: Current networking score, used to evaluate the signal quality of the current networking. Specifically, the LoRa wide area network is composed of node devices, and the node devices include terminal nodes, smart gateways, network cover devices and application cover devices. The distance between the current smart gateway and the terminal node in the LoRa wide area network is calculated. According to the distance, the signal quality is divided into different levels and the corresponding bit rate performance score is assigned. The bit rate performance score represents the signal quality between the smart gateway and the terminal node. The closer the distance between the smart gateway and the terminal node, the higher the bit rate performance score. The terminal node outside the coverage range of the smart gateway has a bit rate performance score of 0:

[0015] Step S2: target initialization;

[0016] Step S3: generating an initial set of candidate solutions, which is used to provide an initial set of solutions for selecting the location of the smart gateway in the LoRa wide area network. Specifically, according to the location and number of the current smart gateway and the terminal node, a candidate solution is randomly generated to obtain an initial set of candidate solutions, wherein the value in the candidate solution represents the priority of the location of the smart gateway that can cover any terminal node;

[0017] Step S4: iterative update, specifically, optimizing the candidate solution set under the condition that each terminal node is covered by at least one intelligent gateway and the number of terminal nodes covered by each intelligent gateway does not exceed the maximum capacity of the intelligent gateway:

[0018] Step S5: Screening the best solution;

[0019] Step S6: Network optimization, specifically, generating a network linkage solution based on the best solution, optimizing the number and location of smart gateways in the LoRa wide area network, dynamically adjusting the network topology, and realizing intelligent linkage between node devices.

[0020] Furthermore, in step S2, the target is initialized, which specifically includes the following steps:

[0021] Step S21: Cost minimization, specifically, defining a first decision variable, wherein the first decision variable indicates whether to deploy an intelligent gateway at position r. If the intelligent gateway is deployed at position r, the first decision variable is 1, otherwise the first decision variable is 0, and the deployment cost minimization objective function is calculated. The formula used is as follows: ;

[0022] In the formula, represents the deployment cost minimization objective function, represents the operating cost of deploying a smart gateway at location r, represents the first decision variable for deploying the smart gateway at location r, represents a set of candidate locations for intelligent gateways;

[0023] Step S22: bit rate maximization is used to optimize the signal coverage quality in the deployment of the intelligent gateway. Specifically, a second decision variable is defined, and the second decision variable indicates whether the intelligent gateway at position r provides coverage for the terminal node. T1 is preset, and T1 indicates the farthest distance that the intelligent gateway can cover. If the intelligent gateway at position r can cover the terminal node, and the distance between the intelligent gateway and the terminal node is less than or equal to T1, the second decision variable is 1, otherwise the second decision variable is 0, and the bit rate maximization objective function is calculated. The formula used is as follows: ;

[0024] In the formula, represents the bit rate maximization objective function, represents the total number of terminal nodes, represents the terminal node index, represents the second decision variable, represents the bit rate performance score;

[0025] Step S23: Target synthesis, specifically, using the Pareto frontier technology to construct a comprehensive target function based on the deployment cost minimization target function and the bit rate maximization target function.

[0026] Furthermore, in step S4, iterative updating specifically includes the following steps:

[0027] Step S41: Update the black box probability, which is used to dynamically adjust the weight of the black box method according to the historical performance of the black box method in each iteration. Specifically, determine M candidate solution improvement methods, record the candidate solution improvement methods as black box methods, and all black box methods constitute a black box operation set. Calculate the probability of any black box method being selected. The formula used is as follows: ; ;

[0028] In the formula, Indicates In the round iteration, select The probability of a black-box method, represents the index of the black-box method, Indicates The number of times a black-box method is selected, Indicates The black box method The average value of the comprehensive objective function of all candidate solutions in the round iteration, is the reward factor, indicating the The black box method Whether a non-dominated solution is found in the first iteration A black-box method finds a non-dominated solution, and the reward factor increases by 1. Indicated in The comprehensive objective function of the non-dominated solution found in the round iteration, Represents a temporary variable. represents the control weight, represents the scaling factor, Represents the total number of black-box methods;

[0029] Step S42: black box application, specifically, selecting a black box method from the black box operation set according to the selection probability, and using the selected black box method to update the candidate solution to obtain a new candidate solution;

[0030] Step S43: candidate solution update, used to select the candidate solution for the next iteration. Specifically, by comparing the current candidate solution with the new candidate solution improved by the black box method, it is decided whether to update the candidate solution. If the comprehensive objective function of the new candidate solution improved by the black box method is better than the comprehensive objective function of the current candidate solution, the candidate solution is updated to the new candidate solution improved by the black box method. Otherwise, the candidate solution remains unchanged. The formula used is as follows: ;

[0031] In the formula, Indicates The candidate solution The element in The value in the iteration, Indicates The candidate solution The element in The value in the iteration, Indicated in In the iteration, the first The candidate solution The value of the element, Denotes the comprehensive objective function.

[0032] Furthermore, in step S5, the best solution is selected, which specifically includes the following steps:

[0033] Step S51: Screening and obtaining non-dominated solutions from all candidate solutions, and recording all non-dominated solutions as a Pareto optimal solution set;

[0034] The non-dominated solution refers to a candidate solution that is better than other candidate solutions in at least one objective function and not inferior to other candidate solutions in other objective functions;

[0035] Step S52: constructing a decision matrix, specifically, constructing a decision matrix of the Pareto optimal solution set with the number of non-dominated solutions as rows and the number of objective functions as columns;

[0036] Step S53: Standardization, specifically, standardizing the decision matrix to a dimensionless form;

[0037] Step S54: Matrix weighting, specifically, assigning weights to the decision matrix according to the importance of the objective function, and constructing a weighted normalized matrix;

[0038] Step S55: determining a positive ideal solution and a negative ideal solution, wherein the positive ideal solution is a solution consisting of the maximum value of each objective function of all non-dominated solutions in the Pareto optimal solution set, and the negative ideal solution is a solution consisting of the minimum value of each objective function of all non-dominated solutions in the Pareto optimal solution set;

[0039] Step S56: positive ideal distance, calculating the Euclidean distance between each non-dominated solution and the positive ideal solution;

[0040] Step S57: Negative ideal distance, calculating the Euclidean distance between each non-dominated solution and the negative ideal solution;

[0041] Step S58: Calculate the relative proximity, the formula used is as follows: ;

[0042] In the formula, Relative proximity, represents the Euclidean distance between the non-dominated solution and the positive ideal solution, Shows the Euclidean distance between the non-dominated solution and the negative ideal solution;

[0043] Step S59: selecting the best solution, specifically, sorting the non-dominated solutions in the Pareto optimal solution set according to the relative proximity, and recording the non-dominated solution with the highest relative proximity as the best solution.

[0044] The beneficial effects achieved by the present invention using the above scheme are as follows:

[0045] (1) In view of the technical problem that the coverage of Bluetooth in existing technologies is still affected by obstacles such as terrain and buildings, and more relay points need to be deployed to achieve full coverage, this solution uses a heuristic algorithm to evaluate the location and number of terminal devices that need to be served, and determines the deployment plan of the gateway node, effectively meeting the coverage of the smart gateway at a lower cost;

[0046] (2) In view of the fact that the cost of LoRa smart gateway is higher than that of other low-power wide-area network smart gateways in the existing technology, and the technical problem of network deployment cost is not taken into account, this scheme creatively proposes a smart gateway optimization method combined with Pareto frontier technology to find the best balance between system cost and coverage quality, and to find a network linkage solution that can both reduce system cost and ensure a higher bit rate. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] Figure 1 A schematic diagram of a module of a campus network security emergency management system based on public opinion monitoring provided by the present invention;

[0048] Figure 2 A flow chart of a campus network security emergency management method based on public opinion monitoring provided by the present invention;

[0049] Figure 3 is a schematic diagram of step S2;

[0050] Figure 4 is a schematic diagram of step S4;

[0051] Figure 5 is a schematic diagram of step S5.

[0052] The accompanying drawings are used to provide further understanding of the present invention and constitute a part of the specification. They are used to explain the present invention together with the embodiments of the present invention and do not constitute a limitation of the present invention. DETAILED DESCRIPTION

[0053] The technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all the embodiments; based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.

[0054] In the description of the present invention, it should be understood that terms such as “upper”, “lower”, “front”, “back”, “left”, “right”, “top”, “bottom”, “inside” and “outside” indicating directions or positional relationships are based on the directions or positional relationships shown in the accompanying drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific direction, be constructed and operated in a specific direction, and therefore should not be understood as limiting the present invention.

[0055] Example 1, see Figure 1 , this embodiment provides a smart networking linkage system based on Internet of Things technology, the system includes a current networking scoring module, a target initialization module, an initial candidate solution set generation module, an iterative update module, an optimal solution screening module and a networking optimization module;

[0056] The current networking scoring module evaluates the current networking quality;

[0057] The target initialization module determines a deployment cost minimization target function and a bit rate maximization target function;

[0058] The initial candidate solution set generation module generates candidate solutions to obtain an initial candidate solution set;

[0059] The iterative update module optimizes the candidate solution set;

[0060] The optimal solution screening module screens all candidate solutions to obtain non-dominated solutions, and then screens the non-dominated solutions to obtain the optimal solution;

[0061] The networking optimization module generates a networking linkage solution according to the best solution.

[0062] Example 2, see Figure 1 and Figure 2 Based on the above embodiment, this embodiment provides a smart networking linkage method based on Internet of Things technology, which includes the following steps:

[0063] Step S1: Current networking score, used to evaluate the current networking quality. Specifically, the LoRa wide area network is composed of node devices, and the node devices include terminal nodes, smart gateways, network cover devices and application cover devices. The distance between the current smart gateway and the terminal node in the LoRa wide area network is calculated. According to the distance, the signal quality is divided into different levels and the corresponding bit rate performance score is assigned. The bit rate performance score represents the signal quality between the smart gateway and the terminal node. The closer the distance between the smart gateway and the terminal node, the higher the bit rate performance score. The terminal node outside the coverage range of the smart gateway has a bit rate performance score of 0:

[0064] Step S2: target initialization;

[0065] Step S3: generating an initial set of candidate solutions, which is used to provide an initial set of solutions for selecting the location of the smart gateway in the LoRa wide area network. Specifically, according to the location and number of the current smart gateway and the terminal node, a candidate solution is randomly generated to obtain an initial set of candidate solutions, wherein the value in the candidate solution represents the priority of the location of the smart gateway that can cover any terminal node;

[0066] Step S4: iterative update, specifically, optimizing the candidate solution set under the condition that each terminal node is covered by at least one intelligent gateway and the number of terminal nodes covered by each intelligent gateway does not exceed the maximum capacity of the intelligent gateway:

[0067] Step S5: Screening the best solution;

[0068] Step S6: Network optimization, specifically, generating a network linkage solution based on the best solution, optimizing the number and location of smart gateways in the LoRa wide area network, dynamically adjusting the network topology, and realizing intelligent linkage between node devices.

[0069] Example 3, see Figures 1 to 3 This embodiment is based on the above embodiment. In step S2, the target is initialized, which specifically includes the following steps:

[0070] Step S21: Cost minimization, specifically, defining a first decision variable, wherein the first decision variable indicates whether to deploy an intelligent gateway at position r. If the intelligent gateway is deployed at position r, the first decision variable is 1, otherwise the first decision variable is 0, and the deployment cost minimization objective function is calculated. The formula used is as follows: ;

[0071] In the formula, represents the deployment cost minimization objective function, represents the operating cost of deploying a smart gateway at location r, represents the first decision variable, represents a set of candidate locations for intelligent gateways;

[0072] Step S22: bit rate maximization is used to optimize the signal coverage quality in the deployment of the intelligent gateway. Specifically, a second decision variable is defined, and the second decision variable indicates whether the intelligent gateway at position r provides coverage for the terminal node. T1 is preset, and T1 indicates the farthest distance that the intelligent gateway can cover. If the intelligent gateway at position r can cover the terminal node, and the distance between the intelligent gateway and the terminal node is less than or equal to T1, the second decision variable is 1, otherwise the second decision variable is 0, and the bit rate maximization objective function is calculated. The formula used is as follows: ;

[0073] In the formula, represents the bit rate maximization objective function, represents the total number of terminal nodes, represents the terminal node index, represents the second decision variable, represents the bit rate performance score;

[0074] Step S23: Target synthesis, specifically, using the Pareto frontier technology to construct a comprehensive target function based on the deployment cost minimization target function and the bit rate maximization target function.

[0075] Example 4, see Figures 1 to 4 This embodiment is based on the above embodiment. In step S4, iterative updating specifically includes the following steps:

[0076] Step S41: Update the black box probability; used to dynamically adjust the weight of the black box method according to the historical performance of the black box method in each iteration, specifically, determine M candidate solution improvement methods, record the candidate solution improvement methods as black box methods, all black box methods constitute a black box operation set, and calculate the probability of any black box method being selected. The formula used is as follows: ; ;

[0077] In the formula, Indicates In the round iteration, select The probability of a black-box method, represents the index of the black-box method, Indicates The number of times a black-box method is selected, Indicates The black box method The average value of the comprehensive objective function of all candidate solutions in the round iteration, is the reward factor, indicating the The black box method Whether a non-dominated solution is found in the first iteration A black box method finds a non-dominated solution, and the reward factor increases by 1. Indicated in The comprehensive objective function of the non-dominated solution found in the round iteration, Represents a temporary variable. represents the control weight, represents the scaling factor, Represents the total number of black-box methods;

[0078] Step S42: black box application, specifically, selecting a black box method from the black box operation set according to the selection probability, and using the selected black box method to update the candidate solution to obtain a new candidate solution;

[0079] Step S43: candidate solution update, used to select the candidate solution for the next iteration. Specifically, by comparing the current candidate solution with the new candidate solution improved by the black box method, it is decided whether to update the candidate solution. If the comprehensive objective function of the new candidate solution improved by the black box method is better than the comprehensive objective function of the current candidate solution, the candidate solution is updated to the new candidate solution improved by the black box method. Otherwise, the candidate solution remains unchanged. The formula used is as follows: ;

[0080] In the formula, Indicates The candidate solution The element in The value in the iteration, Indicates The candidate solution The element in The value in the iteration, Indicated in In the iteration, the first The candidate solution The value of the element, Denotes the comprehensive objective function.

[0081] Example 5, see Figures 1 to 5 This embodiment is based on the above embodiment. In step S5, the best solution is screened, which specifically includes the following steps:

[0082] Step S51: Screening and obtaining non-dominated solutions from all candidate solutions, and recording all non-dominated solutions as a Pareto optimal solution set;

[0083] The non-dominated solution refers to a candidate solution that is better than other candidate solutions in at least one objective function and not inferior to other candidate solutions in other objective functions;

[0084] Step S52: constructing a decision matrix, specifically, constructing a decision matrix of the Pareto optimal solution set with the number of non-dominated solutions as rows and the number of objective functions as columns;

[0085] Step S53: Standardization, specifically, standardizing the decision matrix to a dimensionless form;

[0086] Step S54: Matrix weighting, specifically, assigning weights to the decision matrix according to the importance of the objective function, and constructing a weighted normalized matrix;

[0087] Step S55: determining a positive ideal solution and a negative ideal solution, wherein the positive ideal solution is a solution consisting of the maximum value of each objective function of all non-dominated solutions in the Pareto optimal solution set, and the negative ideal solution is a solution consisting of the minimum value of each objective function of all non-dominated solutions in the Pareto optimal solution set;

[0088] Step S56: positive ideal distance, calculating the Euclidean distance between each non-dominated solution and the positive ideal solution;

[0089] Step S57: Negative ideal distance, calculating the Euclidean distance between each non-dominated solution and the negative ideal solution;

[0090] Step S58: Calculate the relative proximity, the formula used is as follows: ;

[0091] In the formula, Relative proximity, represents the Euclidean distance between the non-dominated solution and the positive ideal solution, Shows the Euclidean distance between the non-dominated solution and the negative ideal solution;

[0092] Step S59: selecting the best solution, specifically, sorting the non-dominated solutions in the Pareto optimal solution set according to the relative proximity, and recording the non-dominated solution with the highest relative proximity as the best solution.

[0093] Example 6, see Figures 1 to 5 This embodiment is based on the above embodiment. In step S1, the signal quality is divided into different levels according to the distance, and corresponding bit rate performance scores are assigned. Specifically, when the distance is 0-2 kilometers, the bit rate performance score is 4 points, when the distance is 3-4 kilometers, the bit rate performance score is 3 points, when the distance is 5-6 kilometers, the bit rate performance score is 2 points, and when the distance is 7-8 kilometers, the bit rate performance score is 1 point.

[0094] Embodiment 7, see Figures 1 to 5 This embodiment is based on the above embodiment. In step S3, the dimension of the candidate solution is 1×D, where D is the terminal node.

[0095] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device.

[0096] Although embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes, modifications, substitutions and variations may be made to the embodiments without departing from the principles and spirit of the present invention, and that the scope of the present invention is defined by the appended claims and their equivalents.

[0097] The present invention and its embodiments are described above, and such description is not restrictive. The drawings show only one embodiment of the present invention, and the actual structure is not limited thereto. In short, if ordinary technicians in the field are inspired by it, without departing from the purpose of the invention, they can design a structure and embodiment similar to the technical solution without creativity, which should belong to the protection scope of the present invention.

Claims

1. A smart networking linkage method based on Internet of Things technology, characterized by: The method comprises the following steps: Step S1: Current networking score, used to evaluate the signal quality of the current networking. Specifically, the LoRa wide area network is composed of node devices, and the node devices include terminal nodes, smart gateways, network cover devices and application cover devices. The distance between the current smart gateway and the terminal node in the LoRa wide area network is calculated. According to the distance, the signal quality is divided into different levels and the corresponding bit rate performance score is assigned. The bit rate performance score represents the signal quality between the smart gateway and the terminal node. The closer the distance between the smart gateway and the terminal node, the higher the bit rate performance score. The terminal node outside the coverage range of the smart gateway has a bit rate performance score of 0: Step S2: target initialization; Step S3: generating an initial set of candidate solutions, which is used to provide an initial set of solutions for selecting the location of the smart gateway in the LoRa wide area network. Specifically, according to the location and number of the current smart gateway and the terminal node, a candidate solution is randomly generated to obtain an initial set of candidate solutions, wherein the value in the candidate solution represents the priority of the location of the smart gateway that can cover any terminal node; Step S4: iterative update, specifically, optimizing the candidate solution set under the condition that each terminal node is covered by at least one intelligent gateway and the number of terminal nodes covered by each intelligent gateway does not exceed the maximum capacity of the intelligent gateway: Step S5: Screening the best solution; Step S6: Network optimization, specifically, generating a network linkage solution based on the best solution, optimizing the number and location of smart gateways in the LoRa wide area network, dynamically adjusting the network topology, and realizing intelligent linkage between node devices.

2. The method for intelligent networking linkage based on Internet of Things technology according to claim 1 is characterized in that: In step S2, the target is initialized, which specifically includes the following steps: Step S21: Cost minimization, specifically, defining a first decision variable, wherein the first decision variable indicates whether to deploy an intelligent gateway at position r. If the intelligent gateway is deployed at position r, the first decision variable is 1, otherwise the first decision variable is 0, and the deployment cost minimization objective function is calculated. The formula used is as follows: ； In the formula, represents the deployment cost minimization objective function, represents the operating cost of deploying a smart gateway at location r, represents the first decision variable, represents a set of candidate locations for intelligent gateways; Step S22: bit rate maximization is used to optimize the signal coverage quality in the deployment of the intelligent gateway. Specifically, a second decision variable is defined, and the second decision variable indicates whether the intelligent gateway at position r provides coverage for the terminal node. T1 is preset, and T1 indicates the farthest distance that the intelligent gateway can cover. If the intelligent gateway at position r can cover the terminal node, and the distance between the intelligent gateway and the terminal node is less than or equal to T1, the second decision variable is 1, otherwise the second decision variable is 0, and the bit rate maximization objective function is calculated. The formula used is as follows: ； In the formula, represents the bit rate maximization objective function, represents the total number of terminal nodes, represents the terminal node index, represents the second decision variable, represents the bit rate performance score; Step S23: Target synthesis, specifically, using the Pareto frontier technology to construct a comprehensive target function based on the deployment cost minimization target function and the bit rate maximization target function.

3. The method for intelligent networking linkage based on Internet of Things technology according to claim 2 is characterized in that: In step S4, iterative updating specifically includes the following steps: Step S41: Update the black box probability, which is used to dynamically adjust the weight of the black box method according to the historical performance of the black box method in each iteration. Specifically, determine M candidate solution improvement methods, record the candidate solution improvement methods as black box methods, and all black box methods constitute a black box operation set. Calculate the probability of any black box method being selected. The formula used is as follows: ； ； In the formula, Indicates In the iteration, select The probability of a black-box method, represents the index of the black-box method, Indicates The number of times a black-box method is selected, Indicates The black box method The average value of the comprehensive objective function of all candidate solutions in the round iteration, is the reward factor, indicating the The black box method Whether a non-dominated solution is found in the first iteration A black-box method finds a non-dominated solution, and the reward factor increases by 1. Indicated in The comprehensive objective function of the non-dominated solution found in the round iteration, Represents a temporary variable. represents the control weight, represents the scaling factor, Represents the total number of black-box methods; Step S42: black box application, specifically, selecting a black box method from the black box operation set according to the selection probability, and using the selected black box method to update the candidate solution to obtain a new candidate solution; Step S43: candidate solution update, used to select the candidate solution for the next iteration. Specifically, by comparing the current candidate solution with the new candidate solution improved by the black box method, it is decided whether to update the candidate solution. If the comprehensive objective function of the new candidate solution improved by the black box method is better than the comprehensive objective function of the current candidate solution, the candidate solution is updated to the new candidate solution improved by the black box method. Otherwise, the candidate solution remains unchanged. The formula used is as follows: ； In the formula, Indicates The candidate solution The element in The value in the iteration, Indicates The candidate solution The element in The value in the iteration, Indicated in In the iteration, the first The candidate solution The value of the element, Denotes the comprehensive objective function.

4. The method for intelligent networking linkage based on Internet of Things technology according to claim 3 is characterized in that: In step S5, the best solution is selected, which specifically includes the following steps: Step S51: Screening and obtaining non-dominated solutions from all candidate solutions, and recording all non-dominated solutions as a Pareto optimal solution set; The non-dominated solution refers to a candidate solution that is better than other candidate solutions in at least one objective function and not inferior to other candidate solutions in other objective functions; Step S52: constructing a decision matrix, specifically, constructing a decision matrix of the Pareto optimal solution set with the number of non-dominated solutions as rows and the number of objective functions as columns; Step S53: Standardization, specifically, standardizing the decision matrix to a dimensionless form; Step S54: Matrix weighting, specifically, assigning weights to the decision matrix according to the importance of the objective function, and constructing a weighted normalized matrix; Step S55: determining a positive ideal solution and a negative ideal solution, wherein the positive ideal solution is a solution consisting of the maximum value of each objective function of all non-dominated solutions in the Pareto optimal solution set, and the negative ideal solution is a solution consisting of the minimum value of each objective function of all non-dominated solutions in the Pareto optimal solution set; Step S56: positive ideal distance, calculating the Euclidean distance between each non-dominated solution and the positive ideal solution; Step S57: Negative ideal distance, calculating the Euclidean distance between each non-dominated solution and the negative ideal solution; Step S58: Calculate the relative proximity, using the following formula: ； In the formula, Relative proximity, represents the Euclidean distance between the non-dominated solution and the positive ideal solution, Shows the Euclidean distance between the non-dominated solution and the negative ideal solution; Step S59: selecting the best solution, specifically, sorting the non-dominated solutions in the Pareto optimal solution set according to the relative proximity, and recording the non-dominated solution with the highest relative proximity as the best solution.

5. A smart networking linkage system based on Internet of Things technology, used to implement the smart networking linkage method based on Internet of Things technology as described in any one of claims 1 to 4, characterized in that: The system includes a current networking scoring module, a target initialization module, an initial candidate solution set generation module, an iterative update module, an optimal solution screening module and a networking optimization module; The current networking scoring module evaluates the current networking quality; The target initialization module determines a deployment cost minimization target function and a bit rate maximization target function; The initial candidate solution set generation module generates candidate solutions to obtain an initial candidate solution set; The iterative update module optimizes the candidate solution set; The optimal solution screening module screens all candidate solutions to obtain non-dominated solutions, and then screens the non-dominated solutions to obtain the optimal solution; The networking optimization module generates a networking linkage solution according to the best solution.

Images