CN111683376B - Optimized deployment method for nodes of field collaborative irrigation communication network - Google Patents
Optimized deployment method for nodes of field collaborative irrigation communication network Download PDFInfo
- Publication number
- CN111683376B CN111683376B CN202010488218.1A CN202010488218A CN111683376B CN 111683376 B CN111683376 B CN 111683376B CN 202010488218 A CN202010488218 A CN 202010488218A CN 111683376 B CN111683376 B CN 111683376B
- Authority
- CN
- China
- Prior art keywords
- node
- irrigation
- nodes
- polyhedron
- thiessen
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- 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/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a construction method of a field collaborative irrigation communication network, in particular to a field collaborative irrigation communication network node optimization deployment method. The method solves the problems that the traditional method for constructing the field collaborative irrigation communication network cannot ensure that the field collaborative irrigation communication network meets full connectivity, and easily causes the problems of large number of nodes, large communication energy consumption and high construction cost of the field collaborative irrigation communication network. A method for optimizing and deploying a field collaborative irrigation communication network node is realized by adopting the following steps: step S1: setting the deployment number of irrigation nodes, constructing a three-dimensional coordinate system, and setting the deployment position of each irrigation node under the three-dimensional coordinate system; step S2: determining the deployment number of the relay nodes and the optimal deployment position of each relay node; step S3: determining the deployment number of the sink nodes and the optimal deployment position of each sink node; step S4: and completing deployment in the field. The method is suitable for constructing the field cooperative irrigation communication network.
Description
Technical Field
The invention relates to a construction method of a field collaborative irrigation communication network, in particular to a field collaborative irrigation communication network node optimization deployment method.
Background
With the popularization of modern agricultural automation and agricultural informatization technology, the novel agriculture scale can be rapidly increased. Irrigation of fields is used as the basis of agriculture, and the automation degree is higher and higher, and the problem of high-speed transmission of large amount of data is followed. In order to realize high-speed transmission of a large amount of data, a field cooperative irrigation communication network needs to be constructed. In a traditional method for constructing the field collaborative irrigation communication network, nodes are generally deployed in a random deployment mode, however, the random deployment mode cannot guarantee that the field collaborative irrigation communication network meets full connectivity, and the field collaborative irrigation communication network is easy to have the defects of large number of nodes, high communication energy consumption and high construction cost. Therefore, a method for optimizing and deploying the nodes of the field collaborative irrigation communication network is needed to be invented, and the problems that the traditional method for constructing the field collaborative irrigation communication network cannot ensure that the field collaborative irrigation communication network meets full connectivity, the number of the nodes of the field collaborative irrigation communication network is large, the communication energy consumption is high, and the construction cost is high are easily caused.
Disclosure of Invention
The invention provides a method for optimizing and deploying nodes of a field cooperation irrigation communication network, aiming at solving the problems that the traditional method for constructing the field cooperation irrigation communication network cannot ensure that the field cooperation irrigation communication network meets full connectivity, and is easy to cause the problems of large number of nodes, high communication energy consumption and high construction cost of the field cooperation irrigation communication network.
The invention is realized by adopting the following technical scheme:
a method for optimizing and deploying a field collaborative irrigation communication network node is realized by adopting the following steps:
step S1: setting the deployment number of irrigation nodes, constructing a three-dimensional coordinate system, and setting the deployment position of each irrigation node under the three-dimensional coordinate system;
step S2: determining the deployment number of the relay nodes and the optimal deployment position of each relay node; the method comprises the following specific steps:
step S2.1: carrying out Voronoi diagram division on each irrigation node to obtain a plurality of Thiessen polyhedrons, wherein each Thiessen polyhedron corresponds to each irrigation node one by one;
step S2.2: traversing each irrigation node by taking the information carrying capacity of the relay nodes and the maximum interval of the irrigation nodes as indexes, thereby determining the deployment number of the relay nodes and the irrigation nodes served by each relay node;
step S2.3: aiming at a certain relay node, connecting all irrigation nodes served by the relay node, thereby forming a node polyhedron; the node polyhedron comprises a plurality of Thiessen polyhedron vertexes, and each Thiessen polyhedron vertex belongs to each Thiessen polyhedron corresponding to each irrigation node served by the relay node in a one-to-one correspondence manner;
step S2.4: taking the information amount generated by the irrigation nodes in one week as a weight value of the irrigation nodes, generating a moth population at each Thiessen polyhedron vertex, and guiding each Thiessen polyhedron vertex to move by using a moth fire suppression optimization algorithm by taking the weight value of the irrigation node corresponding to each Thiessen polyhedron vertex as an index until the moth population reaches a weight balance condition; at the moment, connecting the vertexes of the Thiessen polyhedrons to form a new polyhedron, wherein the new polyhedron comprises the optimal deployment position of the current relay node;
step S2.5: generating a moth population at each vertex of the new polyhedron, and searching the optimal deployment position of the current relay node in the new polyhedron by using a moth fire suppression optimization algorithm;
step S2.6: circularly executing the step S2.3 to the step S2.5 until the optimal deployment position of each relay node is searched out;
step S3: determining the deployment number of the sink nodes and the optimal deployment position of each sink node; the method comprises the following specific steps:
step S3.1: carrying out Voronoi diagram division on each relay node to obtain a plurality of Thiessen polyhedrons, wherein each Thiessen polyhedron corresponds to each relay node one by one;
step S3.2: traversing each relay node by taking the information carrying capacity of the sink nodes and the maximum distance between the relay nodes as indexes, thereby determining the deployment number of the sink nodes and the relay nodes served by each sink node;
step S3.3: for a certain sink node, connecting all relay nodes served by the sink node, thereby forming a node polyhedron; the node polyhedron comprises a plurality of Thiessen polyhedron vertexes, and the Thiessen polyhedron vertexes are respectively and correspondingly belonged to each Thiessen polyhedron corresponding to each relay node served by the convergent node;
step S3.4: taking the information amount generated by the relay node in one week as a weight value of the relay node, generating a moth population at each Thiessen polyhedron vertex, and guiding each Thiessen polyhedron vertex to move by using a moth fire suppression optimization algorithm by taking the weight value of the relay node corresponding to each Thiessen polyhedron vertex as an index until the moth population reaches a weight balance condition; at the moment, connecting the vertexes of the Thiessen polyhedrons to form a new polyhedron, wherein the new polyhedron comprises the optimal deployment position of the current convergent node;
step S3.5: generating a moth population at each vertex of the new polyhedron, and searching the optimal deployment position of the current sink node in the new polyhedron by using a moth fire suppression optimization algorithm;
step S3.6: circularly executing the step S3.3 to the step S3.5 until the optimal deployment position of each sink node is searched out;
step S4: and completing deployment in the field according to the deployment number of the irrigation nodes, the deployment positions of the irrigation nodes, the deployment number of the relay nodes, the optimal deployment position of each relay node, the deployment number of the sink nodes and the optimal deployment position of each sink node, wherein each irrigation node, each relay node and each sink node jointly form a field cooperation irrigation communication network.
The step S2.2 specifically includes the steps of:
step S2.2.1: selecting a first irrigation node from irrigation nodes to be selected;
step S2.2.2: placing the selected irrigation nodes into an information base;
step S2.2.3: calculating the total information amount of the information base;
step S2.2.4: comparing the total information amount of the information base with the minimum information amount of the relay node;
if the total information amount of the information base is greater than the minimum information amount of the relay node, execute step S2.2.5;
if the total information amount of the information base is less than or equal to the minimum information amount of the relay node, executing step S2.2.6;
step S2.2.5: comparing the total information amount of the information base with the maximum information amount of the relay node;
if the total information amount of the information base is less than the maximum information amount of the relay node, executing step S2.2.6;
if the total information amount of the information base is larger than or equal to the maximum information amount of the relay node, executing step S2.2.7;
step S2.2.6: searching an irrigation node which is closest to the irrigation node newly placed in the information base within the maximum distance range of the irrigation nodes;
if the irrigation node meeting the above condition can be found, selecting the irrigation node, and executing step S2.2.2;
if the irrigation node meeting the above condition cannot be found, go to step S2.2.7;
step S2.2.7: setting a relay node, and determining each irrigation node in an information base as an irrigation node served by the relay node;
step S2.2.8: emptying the information base and judging whether irrigation nodes still need to be selected or not;
if the irrigation nodes still remain to be selected, circularly executing the steps S2.2.1 to S2.2.8;
and if the irrigation nodes to be selected do not exist, determining the circulation times of the steps S2.2.1-S2.2.8 as the deployment number of the relay nodes.
The step S3.2 specifically includes the steps of:
step S3.2.1: selecting a first relay node from relay nodes to be selected;
step S3.2.2: putting the selected relay node into an information base;
step S3.2.3: calculating the total information amount of the information base;
step S3.2.4: comparing the total information quantity of the information base with the minimum information quantity of the sink node;
if the total information amount of the information base is larger than the minimum information amount of the sink node, executing step S3.2.5;
if the total information amount of the information base is less than or equal to the minimum information amount of the sink node, executing step S3.2.6;
step S3.2.5: comparing the total information quantity of the information base with the maximum information quantity of the sink node;
if the total information amount of the information base is less than the maximum information amount of the sink node, go to step S3.2.6;
if the total information amount of the information base is larger than or equal to the maximum information amount of the sink node, executing step S3.2.7;
step S3.2.6: searching a relay node which is closest to the relay node which is newly put into the information base within the maximum distance range of the relay node;
if the relay node meeting the above conditions can be found, selecting the relay node, and performing step S3.2.2;
if the relay node meeting the above condition cannot be found, go to step S3.2.7;
step S3.2.7: setting a sink node, and determining each relay node in an information base as a relay node served by the sink node;
step S3.2.8: emptying the information base and judging whether the relay nodes still need to be selected or not;
if the relay node still remains to be selected, circularly executing the step S3.2.1 to the step S3.2.8;
and if no relay node to be selected exists, determining the cycle times of the steps S3.2.1-S3.2.8 as the deployment number of the sink nodes.
In step S2.4, the weight balance condition is expressed as follows:
in the formula:
representing the weight value of an irrigation node corresponding to the ith Thiessen polyhedron vertex;
representing the weight value of an irrigation node corresponding to the (i + 1) th Thiessen polyhedron vertex; dm,iRepresenting the distance between an irrigation node corresponding to the ith Thiessen polyhedron vertex and the corresponding moth population; dm,i+1And (3) representing the distance between the irrigation node corresponding to the i +1 th Thiessen polyhedron vertex and the corresponding moth population.
In step S3.4, the weight balance condition is expressed as follows:
in the formula:
representing the weight value of the relay node corresponding to the ith Thiessen polyhedron vertex;
representing the weight value of the relay node corresponding to the (i + 1) th Thiessen polyhedron vertex; dm,iRepresenting the distance between a relay node corresponding to the vertex of the ith Thiessen polyhedron and the corresponding moth population; d is a radical ofm,i+1And (3) representing the distance between the relay node corresponding to the i +1 th Thiessen polyhedron vertex and the corresponding moth population.
The irrigation nodes comprise spray irrigation equipment and spray irrigation equipment; the sink node is an irrigation equipment control center.
Compared with the traditional method for constructing the field collaborative irrigation communication network, the method for optimizing and deploying the nodes of the field collaborative irrigation communication network is based on a layered deployment strategy (firstly deploying the relay nodes and then deploying the sink nodes) and combines Voronoi diagram division and a moth fire suppression optimization algorithm (MFO algorithm) to realize the construction of the field collaborative irrigation communication network, so that the field collaborative irrigation communication network realizes the minimum number of the nodes, the minimum communication energy consumption and the minimum construction cost on the premise of satisfying full connectivity, and has good economical efficiency and energy saving performance.
The method effectively solves the problems that the traditional method for constructing the field collaborative irrigation communication network cannot ensure that the field collaborative irrigation communication network meets full connectivity, and is easy to cause large quantity of nodes, large communication energy consumption and high construction cost of the field collaborative irrigation communication network, and is suitable for constructing the field collaborative irrigation communication network.
Drawings
FIG. 1 is a schematic diagram of a field collaborative irrigation communication network according to the present invention.
FIG. 2 is a schematic diagram of steps S2.2.1 through S2.2.7 in the present invention.
FIG. 3 is a schematic diagram of steps S3.2.1-S3.2.7 in the present invention.
FIG. 4 is a schematic diagram of a nodal polyhedron and the vertices of the various Thiessen polyhedrons contained therein in accordance with the present invention.
FIG. 5 is a schematic diagram of a node polyhedron and a new polyhedron of the present invention.
In the figure: polyhedron ABCDE represents a node polyhedron; the first, the second, the third, the fourth and the fifth represent the vertexes of the Thiessen polyhedron contained in the node polyhedron; the polyhedron is expressed by the polyhedron- (III) and the new polyhedron is expressed by the polyhedron- (V).
Detailed Description
A method for optimizing and deploying a field collaborative irrigation communication network node is realized by adopting the following steps:
step S1: setting the deployment number of irrigation nodes, constructing a three-dimensional coordinate system, and setting the deployment position of each irrigation node under the three-dimensional coordinate system;
step S2: determining the deployment number of the relay nodes and the optimal deployment position of each relay node; the method comprises the following specific steps:
step S2.1: carrying out Voronoi diagram division on each irrigation node to obtain a plurality of Thiessen polyhedrons, wherein each Thiessen polyhedron corresponds to each irrigation node one by one;
step S2.2: traversing each irrigation node by taking the information carrying capacity of the relay nodes and the maximum interval of the irrigation nodes as indexes, thereby determining the deployment number of the relay nodes and the irrigation nodes served by each relay node;
step S2.3: aiming at a certain relay node, connecting all irrigation nodes served by the relay node, thereby forming a node polyhedron; the node polyhedron comprises a plurality of Thiessen polyhedron vertexes, and each Thiessen polyhedron vertex belongs to each Thiessen polyhedron corresponding to each irrigation node served by the relay node in a one-to-one correspondence manner;
step S2.4: taking the information amount generated by the irrigation nodes in one week as a weight value of the irrigation nodes, generating a moth population at each Thiessen polyhedron vertex, and guiding each Thiessen polyhedron vertex to move by using a moth fire suppression optimization algorithm by taking the weight value of the irrigation node corresponding to each Thiessen polyhedron vertex as an index until the moth population reaches a weight balance condition; at the moment, connecting the vertexes of the Thiessen polyhedrons to form a new polyhedron, wherein the new polyhedron comprises the optimal deployment position of the current relay node;
step S2.5: generating a moth population at each vertex of the new polyhedron, and searching the optimal deployment position of the current relay node in the new polyhedron by using a moth fire suppression optimization algorithm;
step S2.6: step S2.3-step S2.5 are executed in a circulating manner until the optimal deployment position of each relay node is searched out;
step S3: determining the deployment number of the sink nodes and the optimal deployment position of each sink node; the method comprises the following specific steps:
step S3.1: carrying out Voronoi diagram division on each relay node to obtain a plurality of Thiessen polyhedrons, wherein each Thiessen polyhedron corresponds to each relay node one by one;
step S3.2: traversing each relay node by taking the information carrying capacity of the sink nodes and the maximum distance between the relay nodes as indexes, thereby determining the deployment number of the sink nodes and the relay nodes served by each sink node;
step S3.3: aiming at a certain convergent node, connecting all relay nodes served by the convergent node, thereby forming a node polyhedron; the node polyhedron comprises a plurality of Thiessen polyhedron vertexes, and the Thiessen polyhedron vertexes are respectively and correspondingly belonged to each Thiessen polyhedron corresponding to each relay node served by the convergent node;
step S3.4: taking the information amount generated by the relay node in one week as a weight value of the relay node, generating a moth population at each Thiessen polyhedron vertex, and guiding each Thiessen polyhedron vertex to move by using a moth fire suppression optimization algorithm by taking the weight value of the relay node corresponding to each Thiessen polyhedron vertex as an index until the moth population reaches a weight balance condition; at the moment, connecting the vertexes of the Thiessen polyhedrons to form a new polyhedron, wherein the new polyhedron comprises the optimal deployment position of the current convergent node;
step S3.5: generating a moth population at each vertex of the new polyhedron, and searching the optimal deployment position of the current sink node in the new polyhedron by using a moth fire suppression optimization algorithm;
step S3.6: step 3.3 to step 3.5 are executed in a circulating way until the optimal deployment position of each sink node is searched;
step S4: and completing deployment in the field according to the deployment number of the irrigation nodes, the deployment positions of the irrigation nodes, the deployment number of the relay nodes, the optimal deployment position of each relay node, the deployment number of the sink nodes and the optimal deployment position of each sink node, wherein each irrigation node, each relay node and each sink node jointly form a field collaborative irrigation communication network.
The step S2.2 specifically includes the steps of:
step S2.2.1: selecting a first irrigation node from irrigation nodes to be selected;
step S2.2.2: placing the selected irrigation nodes into an information base;
step S2.2.3: calculating the total information amount of the information base;
step S2.2.4: comparing the total information amount of the information base with the minimum information amount of the relay node;
if the total information amount of the information base is greater than the minimum information amount of the relay node, execute step S2.2.5;
if the total information amount of the information base is less than or equal to the minimum information amount of the relay node, executing step S2.2.6;
step S2.2.5: comparing the total information amount of the information base with the maximum information amount of the relay node;
if the total information amount of the information base is less than the maximum information amount of the relay node, executing step S2.2.6;
if the total information amount of the information base is greater than or equal to the maximum information amount of the relay node, executing step S2.2.7;
step S2.2.6: searching an irrigation node which is closest to the irrigation node newly placed in the information base within the maximum distance range of the irrigation nodes;
if the irrigation node meeting the above condition can be found, selecting the irrigation node, and executing step S2.2.2;
if the irrigation node meeting the above condition cannot be found, go to step S2.2.7;
step S2.2.7: setting a relay node, and determining each irrigation node in an information base as an irrigation node served by the relay node;
step S2.2.8: emptying the information base and judging whether irrigation nodes still need to be selected or not;
if the irrigation nodes still remain to be selected, circularly executing the steps S2.2.1 to S2.2.8;
and if the irrigation nodes to be selected do not exist, determining the number of the circulation times from the step S2.2.1 to the step S2.2.8 as the deployment number of the relay nodes.
The step S3.2 specifically includes the steps of:
step S3.2.1: selecting a first relay node from relay nodes to be selected;
step S3.2.2: putting the selected relay node into an information base;
step S3.2.3: calculating the total information amount of the information base;
step S3.2.4: comparing the total information quantity of the information base with the minimum information quantity of the sink node;
if the total information amount of the information base is larger than the minimum information amount of the sink node, executing step S3.2.5;
if the total information amount of the information base is less than or equal to the minimum information amount of the sink node, executing step S3.2.6;
step S3.2.5: comparing the total information quantity of the information base with the maximum information quantity of the sink node;
if the total information amount of the information base is less than the maximum information amount of the sink node, go to step S3.2.6;
if the total information amount of the information base is larger than or equal to the maximum information amount of the sink node, executing step S3.2.7;
step S3.2.6: searching a relay node which is closest to the relay node which is newly put into the information base within the maximum distance range of the relay node;
if the relay node meeting the above conditions can be found, selecting the relay node, and performing step S3.2.2;
if the relay node meeting the above condition cannot be found, go to step S3.2.7;
step S3.2.7: setting a sink node, and determining each relay node in an information base as a relay node served by the sink node;
step S3.2.8: emptying an information base and judging whether the relay nodes still need to be selected or not;
if the relay node still remains to be selected, circularly executing the step S3.2.1 to the step S3.2.8;
and if no relay node to be selected exists, determining the cycle times from the step S3.2.1 to the step S3.2.8 as the deployment number of the sink nodes.
In step S2.4, the weight balance condition is expressed as follows:
in the formula:
representing the weight value of an irrigation node corresponding to the ith Thiessen polyhedron vertex;
representing the weight value of an irrigation node corresponding to the (i + 1) th Thiessen polyhedron vertex; d is a radical ofm,iRepresenting the distance between an irrigation node corresponding to the ith Thiessen polyhedron vertex and the corresponding moth population; dm,i+1And (4) representing the distance between the irrigation node corresponding to the vertex of the i +1 th Thiessen polyhedron and the corresponding moth population.
In step S3.4, the weight balance condition is expressed as follows:
in the formula:
representing the weight value of the relay node corresponding to the ith Thiessen polyhedron vertex;
representing the weight value of the relay node corresponding to the (i + 1) th Thiessen polyhedron vertex; dm,iRepresenting the distance between a relay node corresponding to the ith Thiessen polyhedron vertex and the corresponding moth population; dm,i+1And (3) representing the distance between the relay node corresponding to the i +1 th Thiessen polyhedron vertex and the corresponding moth population.
The irrigation nodes comprise spray irrigation equipment and spray irrigation equipment; the sink node is an irrigation equipment control center.
While specific embodiments of the invention have been described above, it will be understood by those skilled in the art that these are by way of example only, and that the scope of the invention is defined by the appended claims. Various changes and modifications to these embodiments may be made by those skilled in the art without departing from the spirit and scope of the invention, and these changes and modifications are within the scope of the invention.
Claims (4)
1. A method for optimizing and deploying field collaborative irrigation communication network nodes is characterized by comprising the following steps: the method is realized by adopting the following steps:
step S1: setting the deployment number of irrigation nodes, constructing a three-dimensional coordinate system, and setting the deployment position of each irrigation node under the three-dimensional coordinate system;
step S2: determining the deployment number of the relay nodes and the optimal deployment position of each relay node; the method comprises the following specific steps:
step S2.1: carrying out Voronoi diagram division on each irrigation node to obtain a plurality of Thiessen polyhedrons, wherein each Thiessen polyhedron corresponds to each irrigation node one by one;
step S2.2: traversing each irrigation node by taking the information carrying capacity of the relay nodes and the maximum interval of the irrigation nodes as indexes, thereby determining the deployment number of the relay nodes and the irrigation nodes served by each relay node;
step S2.3: aiming at a certain relay node, connecting all irrigation nodes served by the relay node, thereby forming a node polyhedron; the node polyhedron comprises a plurality of Thiessen polyhedron vertexes, and each Thiessen polyhedron vertex belongs to each Thiessen polyhedron corresponding to each irrigation node served by the relay node in a one-to-one correspondence manner;
step S2.4: taking the information amount generated by the irrigation nodes in one week as a weight value of the irrigation nodes, generating a moth population at each Thiessen polyhedron vertex, and guiding each Thiessen polyhedron vertex to move by using a moth fire suppression optimization algorithm by taking the weight value of the irrigation node corresponding to each Thiessen polyhedron vertex as an index until the moth population reaches a weight balance condition; at the moment, the vertexes of all Thiessen polyhedrons are connected to form a new polyhedron, and the new polyhedron contains the optimal deployment position of the current relay node;
step S2.5: generating a moth population at each vertex of the new polyhedron, and searching the optimal deployment position of the current relay node in the new polyhedron by using a moth fire suppression optimization algorithm;
step S2.6: circularly executing the step S2.3 to the step S2.5 until the optimal deployment position of each relay node is searched out;
step S3: determining the deployment number of the sink nodes and the optimal deployment position of each sink node; the method comprises the following specific steps:
step S3.1: carrying out Voronoi diagram division on each relay node to obtain a plurality of Thiessen polyhedrons, wherein each Thiessen polyhedron corresponds to each relay node one by one;
step S3.2: traversing each relay node by taking the information carrying capacity of the sink nodes and the maximum distance between the relay nodes as indexes, thereby determining the deployment number of the sink nodes and the relay nodes served by each sink node;
step S3.3: aiming at a certain convergent node, connecting all relay nodes served by the convergent node, thereby forming a node polyhedron; the node polyhedron comprises a plurality of Thiessen polyhedron vertexes, and the Thiessen polyhedron vertexes are respectively and correspondingly belonged to each Thiessen polyhedron corresponding to each relay node served by the convergent node;
step S3.4: taking the information amount generated by the relay node in one week as a weight value of the relay node, generating a moth population at each Thiessen polyhedron vertex, and guiding each Thiessen polyhedron vertex to move by using a moth fire suppression optimization algorithm by taking the weight value of the relay node corresponding to each Thiessen polyhedron vertex as an index until the moth population reaches a weight balance condition; at the moment, the vertexes of all Thiessen polyhedrons are connected to form a new polyhedron, and the new polyhedron contains the optimal deployment position of the current convergent node;
step S3.5: generating a moth population at each vertex of the new polyhedron, and searching the optimal deployment position of the current sink node in the new polyhedron by using a moth fire suppression optimization algorithm;
step S3.6: circularly executing the step S3.3 to the step S3.5 until the optimal deployment position of each sink node is searched out;
step S4: completing deployment in a field according to the deployment number of the irrigation nodes, the deployment positions of the irrigation nodes, the deployment number of the relay nodes, the optimal deployment positions of the relay nodes, the deployment number of the sink nodes and the optimal deployment positions of the sink nodes, wherein the irrigation nodes, the relay nodes and the sink nodes form a field cooperation irrigation communication network;
the step S2.2 specifically includes the steps of:
step S2.2.1: selecting a first irrigation node from irrigation nodes to be selected;
step S2.2.2: placing the selected irrigation nodes into an information base;
step S2.2.3: calculating the total information amount of the information base;
step S2.2.4: comparing the total information amount of the information base with the minimum information amount of the relay node;
if the total information amount of the information base is greater than the minimum information amount of the relay node, execute step S2.2.5;
if the total information amount of the information base is less than or equal to the minimum information amount of the relay node, executing step S2.2.6;
step S2.2.5: comparing the total information amount of the information base with the maximum information amount of the relay node;
if the total information amount of the information base is less than the maximum information amount of the relay node, executing step S2.2.6;
if the total information amount of the information base is larger than or equal to the maximum information amount of the relay node, executing step S2.2.7;
step S2.2.6: searching an irrigation node which is closest to the irrigation node newly placed in the information base within the maximum distance range of the irrigation nodes;
if the irrigation node meeting the above condition can be found, selecting the irrigation node, and executing step S2.2.2;
if the irrigation node meeting the above condition cannot be found, go to step S2.2.7;
step S2.2.7: setting a relay node, and determining each irrigation node in an information base as an irrigation node served by the relay node;
step S2.2.8: emptying the information base and judging whether irrigation nodes still need to be selected or not;
if the irrigation nodes still remain to be selected, circularly executing the steps S2.2.1 to S2.2.8;
if the irrigation nodes to be selected do not exist, determining the cycle times of the steps S2.2.1-S2.2.8 as the deployment number of the relay nodes;
the step S3.2 specifically includes the steps of:
step S3.2.1: selecting a first relay node from relay nodes to be selected;
step S3.2.2: putting the selected relay node into an information base;
step S3.2.3: calculating the total information amount of the information base;
step S3.2.4: comparing the total information quantity of the information base with the minimum information quantity of the sink node;
if the total information amount of the information base is larger than the minimum information amount of the sink node, executing step S3.2.5;
if the total information amount of the information base is less than or equal to the minimum information amount of the sink node, executing step S3.2.6;
step S3.2.5: comparing the total information quantity of the information base with the maximum information quantity of the sink node;
if the total information amount of the information base is less than the maximum information amount of the sink node, go to step S3.2.6;
if the total information amount of the information base is larger than or equal to the maximum information amount of the sink node, executing step S3.2.7;
step S3.2.6: searching a relay node which is closest to the relay node which is newly put into the information base within the maximum distance range of the relay node;
if the relay node meeting the above conditions can be found, selecting the relay node, and performing step S3.2.2;
if the relay node meeting the above condition cannot be found, go to step S3.2.7;
step S3.2.7: setting a sink node, and determining each relay node in an information base as a relay node served by the sink node;
step S3.2.8: emptying the information base and judging whether the relay nodes still need to be selected or not;
if the relay node still remains to be selected, circularly executing the step S3.2.1 to the step S3.2.8;
and if no relay node to be selected exists, determining the cycle times of the steps S3.2.1-S3.2.8 as the deployment number of the sink nodes.
2. The optimized deployment method of the nodes of the field collaborative irrigation communication network according to claim 1, characterized in that: in step S2.4, the weight balance condition is expressed as follows:
in the formula:
representing the weight value of an irrigation node corresponding to the ith Thiessen polyhedron vertex;
representing the weight value of an irrigation node corresponding to the (i + 1) th Thiessen polyhedron vertex; dm,iRepresenting the distance between an irrigation node corresponding to the vertex of the ith Thiessen polyhedron and the corresponding moth population; dm,i+1And (3) representing the distance between the irrigation node corresponding to the i +1 th Thiessen polyhedron vertex and the corresponding moth population.
3. The optimized deployment method of the nodes of the field collaborative irrigation communication network according to claim 1, characterized in that: in step S3.4, the weight balance condition is expressed as follows:
in the formula:
representing the weight value of the relay node corresponding to the ith Thiessen polyhedron vertex;
representing the weight value of the relay node corresponding to the (i + 1) th Thiessen polyhedron vertex; dm,iRepresenting the distance between a relay node corresponding to the ith Thiessen polyhedron vertex and the corresponding moth population; d is a radical ofm,i+1And (3) representing the distance between the relay node corresponding to the i +1 th Thiessen polyhedron vertex and the corresponding moth population.
4. The optimized deployment method of the nodes of the field collaborative irrigation communication network according to claim 1, characterized in that: the irrigation nodes comprise spray irrigation equipment and jet irrigation equipment; the sink node is an irrigation equipment control center.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010488218.1A CN111683376B (en) | 2020-06-02 | 2020-06-02 | Optimized deployment method for nodes of field collaborative irrigation communication network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010488218.1A CN111683376B (en) | 2020-06-02 | 2020-06-02 | Optimized deployment method for nodes of field collaborative irrigation communication network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111683376A CN111683376A (en) | 2020-09-18 |
| CN111683376B true CN111683376B (en) | 2022-06-24 |
Family
ID=72434527
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010488218.1A Active CN111683376B (en) | 2020-06-02 | 2020-06-02 | Optimized deployment method for nodes of field collaborative irrigation communication network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111683376B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010045971A1 (en) * | 2008-10-22 | 2010-04-29 | Telecom Italia S.P.A. . | Method and system for the deployment of nodes of a wireless communications network |
| CN103249179A (en) * | 2013-04-25 | 2013-08-14 | 中山大学 | Multi-objective mother foraging algorithm based optimization method for relay node deployment in wireless sensor network |
| CN103402276A (en) * | 2013-07-24 | 2013-11-20 | 中北大学 | System and method for efficiently transmitting mass sensing data of internet of things |
| CN103716803A (en) * | 2013-12-03 | 2014-04-09 | 西安交通大学 | Wireless sensor network relay node deployment method |
| CN105357732A (en) * | 2015-12-10 | 2016-02-24 | 中北大学 | Wireless sensor network edge node recognition method independent of position information |
| CN108184239A (en) * | 2016-12-08 | 2018-06-19 | 中国科学院沈阳自动化研究所 | A kind of relay node deployment method in Delay Constraint wireless sensor network |
| CN110011774A (en) * | 2017-12-21 | 2019-07-12 | 华硕电脑股份有限公司 | Backhaul link transmission and received method and apparatus in wireless communication system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105704732B (en) * | 2014-11-27 | 2019-01-25 | 中国科学院沈阳自动化研究所 | Relay node robust covering method towards double-layer structure wireless sensor network |
-
2020
- 2020-06-02 CN CN202010488218.1A patent/CN111683376B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010045971A1 (en) * | 2008-10-22 | 2010-04-29 | Telecom Italia S.P.A. . | Method and system for the deployment of nodes of a wireless communications network |
| CN103249179A (en) * | 2013-04-25 | 2013-08-14 | 中山大学 | Multi-objective mother foraging algorithm based optimization method for relay node deployment in wireless sensor network |
| CN103402276A (en) * | 2013-07-24 | 2013-11-20 | 中北大学 | System and method for efficiently transmitting mass sensing data of internet of things |
| CN103716803A (en) * | 2013-12-03 | 2014-04-09 | 西安交通大学 | Wireless sensor network relay node deployment method |
| CN105357732A (en) * | 2015-12-10 | 2016-02-24 | 中北大学 | Wireless sensor network edge node recognition method independent of position information |
| CN108184239A (en) * | 2016-12-08 | 2018-06-19 | 中国科学院沈阳自动化研究所 | A kind of relay node deployment method in Delay Constraint wireless sensor network |
| CN110011774A (en) * | 2017-12-21 | 2019-07-12 | 华硕电脑股份有限公司 | Backhaul link transmission and received method and apparatus in wireless communication system |
Non-Patent Citations (2)
| Title |
|---|
| ADP-MAC: An Adaptive and Dynamic Polling-Based MAC Protocol for Wireless Sensor Networks;Shama Siddiqui;《IEEE Sensors Journal 》;20171109;全文 * |
| 一种面向航空集群的无人机中继网络部署策略;刘创等;《计算机工程》;20180515(第05期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111683376A (en) | 2020-09-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106712076B (en) | A kind of transmission system optimization method under marine wind electric field cluster scale | |
| CN110334391A (en) | A kind of various dimensions constraint wind power plant collection electric line automatic planning | |
| CN108448620B (en) | High-permeability distributed power supply cluster division method based on comprehensive performance indexes | |
| CN106779153A (en) | Optimization method is distributed in a kind of intelligent three-dimensional warehouse goods yard | |
| CN108075975B (en) | Method and system for determining route transmission path in Internet of things environment | |
| CN110162041A (en) | A kind of robot path planning method based on self-adapted genetic algorithm | |
| CN105976048A (en) | Power transmission network extension planning method based on improved artificial bee colony algorithm | |
| CN107609694B (en) | Structure optimization method for offshore wind power cluster power transmission system and storage medium | |
| CN106067074B (en) | A method of network system robustness is promoted by optimizing the switch state of link | |
| CN112163808B (en) | Method for solving logistics center addressing problem by self-adaptive whale algorithm based on opponent learning | |
| CN106685745B (en) | A kind of constructing network topology method and device | |
| WO2023245740A1 (en) | Fourth-party logistics transportation edge planning method based on ant colony optimization algorithm | |
| CN112668129A (en) | Power distribution network multi-level grid intelligent division method based on space load clustering | |
| CN113688488B (en) | Power grid line planning method based on improved artificial fish swarm algorithm | |
| CN110533280A (en) | A kind of dynamic zoning method and system of electricity market | |
| CN111683376B (en) | Optimized deployment method for nodes of field collaborative irrigation communication network | |
| CN110189230B (en) | Construction method of analytic model of dynamic partition | |
| CN111146815B (en) | Distributed power generation planning configuration method for intelligent power distribution network | |
| CN116520084A (en) | Fault positioning method, device and storage medium for source-containing power distribution network | |
| CN115169754B (en) | Energy scheduling method and device, electronic equipment and storage medium | |
| CN116108982A (en) | Reservoir group multi-target scheduling collaborative searching method and system | |
| CN115438451A (en) | Photovoltaic module serial line arrangement determining method and device and electronic equipment | |
| CN111934901B (en) | Topology control method and system of unmanned platform information-aware network | |
| CN111062515B (en) | Distribution network distributed power supply configuration method | |
| CN111542069B (en) | Method for realizing wireless AP deployment optimization based on rapid non-dominant genetic algorithm |
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 |