CN109905883B - Method and terminal for connecting wireless sensor network - Google Patents
Method and terminal for connecting wireless sensor network Download PDFInfo
- Publication number
- CN109905883B CN109905883B CN201910249858.4A CN201910249858A CN109905883B CN 109905883 B CN109905883 B CN 109905883B CN 201910249858 A CN201910249858 A CN 201910249858A CN 109905883 B CN109905883 B CN 109905883B
- Authority
- CN
- China
- Prior art keywords
- triangle
- wireless sensor
- fermat
- wireless
- points
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a method and a terminal for connecting a wireless sensor network, and belongs to the field of wireless communication. The invention presets a plurality of wireless sensors; the plurality of wireless sensors are deployed at different locations; grouping the plurality of wireless sensors to obtain a plurality of wireless sensor groups; the method specifically comprises the following steps: generating a set of points with the plurality of wireless sensors as vertices; triangulating the point set to obtain a triangle set; the vertex of each triangle in the set of triangles is the wireless sensor; the wireless sensor groups correspond to triangles in the triangle set one by one; acquiring the Fermat point of each wireless sensor group to obtain a plurality of Fermat points; and acquiring the deployment positions of the repeaters according to the plurality of Fermat points so as to communicate the wireless sensor network through the deployment repeaters. Reduction of repeater resources required to connect to a wireless sensor network is achieved.
Description
Technical Field
The invention relates to a method and a terminal for connecting a wireless sensor network, and belongs to the field of wireless communication.
Background
Connectivity repair is an important means for ensuring the effectiveness and reliability of the wireless sensor network. Existing connectivity repair strategies can be largely divided into two categories. Wherein, a part of strategies uses the ratio (namely approximate ratio) of resources (relay nodes) consumed by constructing the SMT-MSP and the resources (relay nodes) required by the theoretically optimal SMT-MSP as a measurement standard, the smaller the approximate ratio is, the better the performance of the algorithm is, and the other part of strategies adopts a simulation experiment to verify the performance of the algorithm.
Chen(Chen D,Du D Z,Hu X D,et al.Approximations for Steiner trees with minimum number of Steiner points[J]Journal of Global Optimization,2000,18(1):17-33) proposes an approximation algorithm based on a quadrilateral construction, which proves that not only the approximation ratio of the algorithm is 3, but also the approximation ratio of the algorithm is 3 when the method of Steiner minimum spanning tree MST is used alone to repair connectivity. Wherein the approximate ratio refers to the ratio of the resources consumed for constructing the SMT-MSP (relay nodes) to the resources required for the theoretically optimal SMT-MSP (relay nodes). For example, as shown in FIG. 1, S1、S2、S3、S4And S5Respectively five sensors of the wireless sensor network. Repairing connectivity, i.e., on-edge S, using minimum spanning tree approach1S2And side S2S3And side S3S4And an edge S3S5The repeaters are deployed.
However, the adoption of the method needs to deploy more repeaters to maintain the connectivity of the wireless sensor network.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: how to reduce the repeater resources required to connect to the wireless sensor network.
In order to solve the technical problems, the invention adopts the technical scheme that:
the invention provides a method for connecting a wireless sensor network, which comprises the following steps:
presetting a plurality of wireless sensors; the plurality of wireless sensors are deployed at different locations;
grouping the plurality of wireless sensors to obtain a plurality of wireless sensor groups; the method specifically comprises the following steps: generating a set of points with the plurality of wireless sensors as vertices; triangulating the point set to obtain a triangle set; the vertex of each triangle in the set of triangles is the wireless sensor; the wireless sensor groups correspond to triangles in the triangle set one by one;
acquiring the Fermat point of each wireless sensor group to obtain a plurality of Fermat points;
and acquiring the deployment positions of the repeaters according to the plurality of Fermat points so as to communicate the wireless sensor network through the deployment repeaters.
Preferably, before obtaining the fermat point of each wireless sensor group, the method further includes:
s101, acquiring the Fermat point of each triangle to obtain a plurality of Fermat points;
s102, acquiring the triangle from the triangle set to obtain a current triangle;
s103, calculating the sum of any two sides of the current triangle to obtain a first distance;
s104, calculating the sum of the distances from the Fermat point corresponding to the current triangle to three vertexes of the current triangle to obtain a second distance;
s105, calculating the ratio of the first distance to the second distance to obtain a factor;
s106, repeatedly executing the step S101 to the step S105 to obtain a plurality of factors;
s107, if the two triangles have overlapped edges, deleting the triangle with the smaller factor in the two triangles from the triangle set
Preferably, the fermat point of each wireless sensor group is obtained to obtain a plurality of fermat points, specifically:
s201, acquiring the wireless sensor group to obtain a current wireless sensor group;
s202, iteratively obtaining Fermat points corresponding to the current wireless sensor group to obtain a plurality of Fermat points;
the formula for calculating the number of iterations is:
wherein k is the number of iterations, niGreater than or equal to 3.
S203, repeatedly executing the step S201 to the step S202 until the plurality of wireless sensor groups are traversed.
Preferably, the deployment positions of the repeaters are acquired according to the plurality of fermat points, so that the repeaters are deployed to communicate with the wireless sensor network, specifically:
constructing a shortest inscribed tree based on the plurality of Fermat points;
presetting a communication radius of a repeater;
and calculating the deployment position of the repeater between the adjacent Fermat points of the shortest inscribed tree according to the communication radius of the repeater.
Preferably, the method further comprises the following steps:
constructing a minimum spanning tree by taking the plurality of wireless sensors as vertexes;
deleting the edge which forms a ring with the shortest inscribed tree in the minimum spanning tree;
and calculating the deployment position of the repeater between the adjacent vertexes of the minimum spanning tree according to the communication radius of the repeater.
The present invention also provides a terminal for connecting to a wireless network, comprising one or more processors and a memory, the memory storing a program and configured to perform the following steps by the one or more processors:
presetting a plurality of wireless sensors; the plurality of wireless sensors are deployed at different locations;
grouping the plurality of wireless sensors to obtain a plurality of wireless sensor groups; the method specifically comprises the following steps: generating a set of points with the plurality of wireless sensors as vertices; triangulating the point set to obtain a triangle set; the vertex of each triangle in the set of triangles is the wireless sensor; the wireless sensor groups correspond to triangles in the triangle set one by one;
acquiring the Fermat point of each wireless sensor group to obtain a plurality of Fermat points;
and acquiring the deployment positions of the repeaters according to the plurality of Fermat points so as to communicate the wireless sensor network through the deployment repeaters.
Preferably, before obtaining the fermat point of each wireless sensor group, the method further includes:
s101, acquiring the Fermat point of each triangle to obtain a plurality of Fermat points;
s102, acquiring the triangle from the triangle set to obtain a current triangle;
s103, calculating the sum of any two sides of the current triangle to obtain a first distance;
s104, calculating the sum of the distances from the Fermat point corresponding to the current triangle to three vertexes of the current triangle to obtain a second distance;
s105, calculating the ratio of the first distance to the second distance to obtain a factor;
s106, repeatedly executing the step S101 to the step S105 to obtain a plurality of factors;
s107, if the two triangles have overlapped edges, deleting the triangle with the smaller factor in the two triangles from the triangle set
Preferably, the fermat point of each wireless sensor group is obtained to obtain a plurality of fermat points, specifically:
s201, acquiring the wireless sensor group to obtain a current wireless sensor group;
s202, iteratively obtaining Fermat points corresponding to the current wireless sensor group to obtain a plurality of Fermat points;
the formula for calculating the number of iterations is:
wherein k is the number of iterations, niGreater than or equal to 3.
S203, repeatedly executing the step S201 to the step S202 until the plurality of wireless sensor groups are traversed.
Preferably, the deployment positions of the repeaters are acquired according to the plurality of fermat points, so that the repeaters are deployed to communicate with the wireless sensor network, specifically:
constructing a shortest inscribed tree based on the plurality of Fermat points;
presetting a communication radius of a repeater;
and calculating the deployment position of the repeater between the adjacent Fermat points of the shortest inscribed tree according to the communication radius of the repeater.
Preferably, the method further comprises the following steps:
constructing a minimum spanning tree by taking the plurality of wireless sensors as vertexes;
deleting the edge which forms a ring with the shortest inscribed tree in the minimum spanning tree;
and calculating the deployment position of the repeater between the adjacent vertexes of the minimum spanning tree according to the communication radius of the repeater.
The invention has the following beneficial effects:
1. the invention provides a method and a terminal for connecting a wireless sensor network, wherein a Fermat point is a point which is positioned in a triangle and has the shortest sum of distances from three vertexes of the triangle, and the sum of the distances from the Fermat point to the three vertexes of the triangle is smaller than the sum of any two sides of the triangle. The invention combines the geometric property of the graph and the topological structure of the network, and realizes that the wireless sensor network can be communicated by using less repeater resources.
2. Further, the invention adopts triangulation technology to divide the graph generated by taking a plurality of wireless sensors as vertexes into a plurality of triangles, and selects the least triangles capable of communicating the plurality of wireless sensors from the graphs. The effect of the retained triangle after being optimized by using the Fermat point is higher than that of the deleted triangle after being optimized by using the Fermat point, and the relay resource required by communicating a wireless sensor network is reduced.
3. Further, the sum of the distances from the Fermat point to the three vertexes of the triangle is less than or equal to the sum of any two sides of the triangle
Iteration is known by limit calculation
The optimal optimization effect can be obtained.
4. Furthermore, the repeater can transmit information within a certain radius range, and the purpose of communicating two sensors can be achieved by arranging a plurality of repeaters between two sensors which are far away.
5. Furthermore, as the premise of acquiring the Fermat points is that the sensors are used as vertexes to form a triangle, the invention finds out the wireless sensors which cannot be connected by paths formed by a plurality of Fermat points through the minimum spanning tree, and deploys the repeaters among the wireless sensors which are not connected through the Fermat points, thereby ensuring the connectivity of the wireless sensor network.
Drawings
FIG. 1 is a schematic diagram of a repeater deployed using a minimum spanning tree approach;
FIG. 2 is a block flow diagram illustrating an embodiment of a method for communicating with a wireless sensor network;
FIG. 3 is a schematic diagram of the results of the triangular subdivision diagram;
FIG. 4 is a diagram of an iterative construction of a shortest inscribed tree;
FIG. 5 is a schematic of a repeater deployment;
FIG. 6 is a schematic diagram of a minimum spanning tree;
fig. 7 is a block diagram of a specific embodiment of a terminal connected to a wireless sensor network according to the present invention;
FIG. 8 is a schematic illustration of a Fermat point;
description of reference numerals:
1. a processor; 2. A memory.
Detailed Description
The invention is described in detail below with reference to the figures and the specific embodiments.
Referring to fig. 1 to 8 of the drawings,
the first embodiment of the invention is as follows:
as shown in fig. 1, the present embodiment provides a method for connecting a wireless sensor network, including:
s1, presetting a plurality of wireless sensors; the plurality of wireless sensors are deployed at different locations.
For example, the plurality of wireless sensors are arranged in a relationship S as shown in FIG. 11、S2、S3、S4And S5Respectively, five sensors in the wireless sensor network. Because the distance between every two sensors is long, a repeater is needed to enable the whole wireless sensor network to be communicated.
The information can be transmitted within a certain radius range, and the purpose of communicating two sensors can be achieved by arranging a plurality of repeaters between the two sensors which are far away from each other.
S2, grouping the wireless sensors to obtain a plurality of wireless sensor groups; the method specifically comprises the following steps:
s201, generating a point set by taking the plurality of wireless sensors as vertexes.
S202, triangulating the point set to obtain a triangle set; the vertex of each triangle in the set of triangles is the wireless sensor; the groups of wireless sensors correspond one-to-one to the triangles in the set of triangles.
Wherein a triangulation T ═ { V, E } of the set of points V is a plan G which satisfies the following condition: 1. edges in the plan view do not contain any points in the set of points, except for the endpoints; 2. there are no intersecting edges; 3. all the faces in plan view are triangular faces.
For example, the results of triangulating the graph are shown in FIG. 3, resulting in three triangles, triangle S1S2S3Triangle S1S3S5And a triangle S3S4S5。
S203, acquiring the Fermat points of each triangle to obtain a plurality of Fermat points.
Wherein, as shown in FIG. 8, the Fermat point f is a point located on the triangle PiPjPkInner and to three vertices P of a trianglei、PjAnd PkThe point with the shortest sum of distances, i.e. the shortest inscribed tree of a triangle, is the side fpiEdge fpjAnd fp edgeskUnion of。
For example, the solid circles in fig. 3 represent fermat points. Triangle S1S2S3Fermat point distance S1、S2、S3Is at least smaller than the triangle S1S2S3Half of any two sides
S204, obtaining the triangle from the triangle set to obtain the current triangle.
S205, calculating the sum of any two sides of the current triangle to obtain a first distance.
S206, calculating the sum of the distances from the Fermat point corresponding to the current triangle to the three vertexes of the current triangle to obtain a second distance.
And S207, calculating the ratio of the first distance to the second distance to obtain a factor.
And S208, repeatedly executing the step S203 to the step S207 to obtain a plurality of factors.
Wherein a larger value of the factor indicates a larger number of repeaters that can be saved using the fermat point to repair network connectivity.
And S209, if the two triangles have overlapped edges, deleting the triangle with the smaller factor from the two triangles from the triangle set.
For example, as shown in FIG. 3, a triangle S1S3S5And triangle S1S2S3With a common edge S1S3Triangle S1S3S5And triangle S3S4S5With a common edge S3S5. Calculate the triangle S separately1S3S5Triangle S1S2S3And a triangle S3S4S5Factor of (e.g. triangle S)1S3S5At the side S1S5And an edge S1S3On deployment of repeaters, 10 are neededRepeaters, while those deployed on the inscribed tree of the Fermat point, require 8 repeaters, triangle S1S3S5Has a factor value of 10/8. Similarly, triangle S1S2S3Has a factor value of 3, triangle S3S4S5Has a factor of 2, triangle S1S3S5Is smaller than the triangle S1S2S3Is also smaller than the triangle S3S4S5Factor value of (2). A larger factor indicates a greater number of repeaters can be saved using the fermat point optimized repeater deployment scheme. Thus, let triangle S1S3S5Delete, i.e. edge S1S5And (5) deleting. Will be limited by S1S5After deletion, five sensors in the wireless sensor network still have connectivity.
In the embodiment, a triangulation technology is adopted to divide a graph generated by taking a plurality of wireless sensors as vertexes into a plurality of triangles, and the least triangles capable of communicating the plurality of wireless sensors are selected from the graphs. The effect of the retained triangle after being optimized by using the Fermat point is higher than that of the deleted triangle after being optimized by using the Fermat point, and the relay resource required by communicating a wireless sensor network is reduced.
S210, the wireless sensor groups correspond to the triangles in the triangle set one by one.
For example, the first packet includes sensor S1And a sensor S2And a sensor S3The second group comprising the sensor S3And a sensor S5And a sensor S4。
And S3, acquiring the Fermat points of each wireless sensor group to obtain a plurality of Fermat points. The method specifically comprises the following steps:
s301, obtaining the wireless sensor group to obtain the current wireless sensor group.
And S302, iteratively obtaining the Fermat points corresponding to the current wireless sensor group to obtain a plurality of Fermat points.
The formula for calculating the iteration times is as follows:
wherein k is the number of iterations, niGreater than or equal to 3.
Wherein the sum of the distances from the Fermat point to the three vertexes of the triangle is less than or equal to the sum of any two sides of the triangle
Iteration is known by limit calculation
The optimal optimization effect can be obtained.
And S303, repeatedly executing the step S301 to the step S302 until the plurality of wireless sensor groups are traversed.
For example, for the triangle S1S2S3And a triangle S3S4S5The shortest inscribed tree structure based on the Fermat point is repeated, and the number of times of repeatedly constructing the shortest inscribed tree for one triangle is K. As shown in fig. 4, a triangle S1S2S3A 3-wheel construction was performed and a triangle S3S4S5Only a 2-round configuration is performed, with the dashed lines indicating the longest edges that need to be deleted in each round configuration.
And S4, acquiring the deployment position of the repeater according to the plurality of Fermat points so as to communicate the wireless sensor network through the deployment repeater. The method specifically comprises the following steps:
constructing a shortest inscribed tree based on the plurality of Fermat points;
presetting a communication radius of a repeater;
and calculating the deployment position of the repeater between the adjacent Fermat points of the shortest inscribed tree according to the communication radius of the repeater.
For example, as shown in fig. 5, the repeaters are arranged in the shortest inscribed tree at intervals of communication radius of the repeaters.
S5, constructing a minimum spanning tree by taking the plurality of wireless sensors as vertexes;
deleting the edge which forms a ring with the shortest inscribed tree in the minimum spanning tree;
and calculating the deployment position of the repeater between the adjacent vertexes of the minimum spanning tree according to the communication radius of the repeater.
For example, as shown in FIG. 6, the sensor S31And a sensor S32There is no fermat point between them, if the wireless sensor of the repeater deployed according to the shortest inscribed tree formed by the fermat point is divided into two parts, it can not be connected. At this time, according to the sensor S1、S2、S31、S32、S4And S5And generating a minimum spanning tree. Minimum spanning tree from edge S in FIG. 61S2And side S2S31And side S31S32And side S32S4And an edge S4S5And (4) forming. Wherein the side S1S2And side S2S31And side S32S4And an edge S4S5A ring is formed with the shortest inscribed tree constructed from the fermat point. For example, the edge S of the minimum spanning tree1S2With the edge FS of the shortest inscribed tree2And edge FS1Form a ring, inscribing the side FS of the tree in the shortest way2And edge FS1The deployment of repeaters already makes it possible to connect the sensors S1And a sensor S2Therefore, there is no need to have the edge S of the minimum spanning tree again1S2Deploying sensors to minimize the edges S of the spanning tree1S2And (5) deleting. While the edge S of the minimum spanning tree31S32Since the ring is not formed with any edge of the shortest inscribed tree, the edge S of the minimum spanning tree should be31S32Deploying repeaters to communicate with the sensors S31And a sensor S32Thereby connecting the whole wireless sensor network.
The invention finds out the wireless sensors which are composed of a plurality of Fermat points and cannot be communicated by using the minimum spanning tree, and arranges the repeaters among the wireless sensors which are not communicated by the Fermat points, thereby ensuring the connectivity of the wireless sensor network.
The repeater is deployed on the path from the Fermat point to the wireless sensor, and compared with the prior art that the repeater is deployed on the edge of the minimum spanning tree, the repeater resource required to be deployed is greatly reduced. According to the embodiment, the wireless sensor network can be communicated by using less repeater resources by combining the geometric property of the graph and the topological structure of the network.
The second embodiment of the invention is as follows:
as shown in fig. 7, the present embodiment provides a terminal connected to a wireless sensor network, including one or more processors 1 and a memory 2, where the memory 2 stores programs and is configured to be executed by the one or more processors 1 to perform the following steps:
s1, presetting a plurality of wireless sensors; the plurality of wireless sensors are deployed at different locations.
For example, the plurality of wireless sensors are arranged in a relationship S as shown in FIG. 11、S2、S3、S4And S5Respectively, five sensors in the wireless sensor network. Because the distance between every two sensors is long, a repeater is needed to enable the whole wireless sensor network to be communicated.
The information can be transmitted within a certain radius range, and the purpose of communicating two sensors can be achieved by arranging a plurality of repeaters between the two sensors which are far away from each other.
S2, grouping the wireless sensors to obtain a plurality of wireless sensor groups; the method specifically comprises the following steps:
s201, generating a point set by taking the plurality of wireless sensors as vertexes.
S202, triangulating the point set to obtain a triangle set; the vertex of each triangle in the set of triangles is the wireless sensor; the groups of wireless sensors correspond one-to-one to the triangles in the set of triangles.
Wherein a triangulation T ═ { V, E } of the set of points V is a plan G which satisfies the following condition: 1. edges in the plan view do not contain any points in the set of points, except for the endpoints; 2. there are no intersecting edges; 3. all the faces in plan view are triangular faces.
For example, the results of triangulating the graph are shown in FIG. 3, resulting in three triangles, triangle S1S2S3Triangle S1S3S5And a triangle S3S4S5。
S203, acquiring the Fermat points of each triangle to obtain a plurality of Fermat points.
Wherein, as shown in FIG. 8, the Fermat point f is a point located on the triangle PiPjPkInner and to three vertices P of a trianglei、PjAnd PkThe point with the shortest sum of distances, i.e. the shortest inscribed tree of a triangle, is the side fpiEdge fpjAnd fp edgeskThe union of (a).
For example, the solid circles in fig. 3 represent fermat points. Triangle S1S2S3Fermat point distance S1、S2、S3Is at least smaller than the triangle S1S2S3Half of any two sides
S204, obtaining the triangle from the triangle set to obtain the current triangle.
S205, calculating the sum of any two sides of the current triangle to obtain a first distance.
S206, calculating the sum of the distances from the Fermat point corresponding to the current triangle to the three vertexes of the current triangle to obtain a second distance.
And S207, calculating the ratio of the first distance to the second distance to obtain a factor.
And S208, repeatedly executing the step S203 to the step S207 to obtain a plurality of factors.
Wherein a larger value of the factor indicates a larger number of repeaters that can be saved using the fermat point to repair network connectivity.
And S209, if the two triangles have overlapped edges, deleting the triangle with the smaller factor from the two triangles from the triangle set.
For example, as shown in FIG. 3, a triangle S1S3S5And triangle S1S2S3With a common edge S1S3Triangle S1S3S5And triangle S3S4S5With a common edge S3S5. Calculate the triangle S separately1S3S5Triangle S1S2S3And a triangle S3S4S5Factor of (e.g. triangle S)1S3S5At the side S1S5And an edge S1S3If 10 repeaters are deployed, and 8 repeaters are deployed on the inscribed tree of the Fermat point, triangle S1S3S5Has a factor value of 10/8. Similarly, triangle S1S2S3Has a factor value of 3, triangle S3S4S5Has a factor of 2, triangle S1S3S5Is smaller than the triangle S1S2S3Is also smaller than the triangle S3S4S5Factor value of (2). A larger factor indicates a greater number of repeaters can be saved using the fermat point optimized repeater deployment scheme. Thus, let triangle S1S3S5Delete, i.e. edge S1S5And (5) deleting. Will be limited by S1S5After deletion, five sensors in the wireless sensor network still have connectivity.
In the embodiment, a triangulation technology is adopted to divide a graph generated by taking a plurality of wireless sensors as vertexes into a plurality of triangles, and the least triangles capable of communicating the plurality of wireless sensors are selected from the graphs. The effect of the retained triangle after being optimized by using the Fermat point is higher than that of the deleted triangle after being optimized by using the Fermat point, and the relay resource required by communicating a wireless sensor network is reduced.
S210, the wireless sensor groups correspond to the triangles in the triangle set one by one.
For example, the first packet includes sensor S1And a sensor S2And a sensor S3The second group comprising the sensor S3And a sensor S5And a sensor S4。
And S3, acquiring the Fermat points of each wireless sensor group to obtain a plurality of Fermat points. The method specifically comprises the following steps:
s301, obtaining the wireless sensor group to obtain the current wireless sensor group.
And S302, iteratively obtaining the Fermat points corresponding to the current wireless sensor group to obtain a plurality of Fermat points.
The formula for calculating the iteration times is as follows:
wherein k is the number of iterations, niGreater than or equal to 3.
Wherein the sum of the distances from the Fermat point to the three vertexes of the triangle is less than or equal to the sum of any two sides of the triangle
Iteration is known by limit calculation
The optimal optimization effect can be obtained.
And S303, repeatedly executing the step S301 to the step S302 until the plurality of wireless sensor groups are traversed.
For example, for the triangle S1S2S3And a triangle S3S4S5The shortest inscribed tree structure based on the Fermat point is repeated, and the number of times of repeatedly constructing the shortest inscribed tree for one triangle is K. As shown in fig. 4, a triangle S1S2S3A 3-wheel construction was performed and a triangle S3S4S5Only a 2-round configuration is performed, with the dashed lines indicating the longest edges that need to be deleted in each round configuration.
And S4, acquiring the deployment position of the repeater according to the plurality of Fermat points so as to communicate the wireless sensor network through the deployment repeater. The method specifically comprises the following steps:
constructing a shortest inscribed tree based on the plurality of Fermat points;
presetting a communication radius of a repeater;
and calculating the deployment position of the repeater between the adjacent Fermat points of the shortest inscribed tree according to the communication radius of the repeater.
For example, as shown in fig. 5, the repeaters are arranged in the shortest inscribed tree at intervals of communication radius of the repeaters.
S5, constructing a minimum spanning tree by taking the plurality of wireless sensors as vertexes;
deleting the edge which forms a ring with the shortest inscribed tree in the minimum spanning tree;
and calculating the deployment position of the repeater between the adjacent vertexes of the minimum spanning tree according to the communication radius of the repeater.
For example, as shown in FIG. 6, the sensor S31And a sensor S32There is no fermat point between them, if the wireless sensor of the repeater deployed according to the shortest inscribed tree formed by the fermat point is divided into two parts, it can not be connected. At this time, according to the sensor S1、S2、S31、S32、S4And S5And generating a minimum spanning tree. Minimum spanning tree from edge S in FIG. 61S2And side S2S31And side S31S32And side S32S4And an edge S4S5And (4) forming. Wherein the side S1S2And side S2S31And side S32S4And an edge S4S5A ring is formed with the shortest inscribed tree constructed from the fermat point. For example, the edge S of the minimum spanning tree1S2With the edge FS of the shortest inscribed tree2And edge FS1Form a ring, inscribing the side FS of the tree in the shortest way2And edge FS1The deployment of repeaters already makes it possible to connect the sensors S1And a sensor S2Therefore, there is no need to have the edge S of the minimum spanning tree again1S2Deploying sensors to minimize the edges S of the spanning tree1S2And (5) deleting. While the edge S of the minimum spanning tree31S32Since the ring is not formed with any edge of the shortest inscribed tree, the edge S of the minimum spanning tree should be31S32Deploying repeaters to communicate with the sensors S31And a sensor S32Thereby connecting the whole wireless sensor network.
The invention finds out the wireless sensors which are composed of a plurality of Fermat points and cannot be communicated by using the minimum spanning tree, and arranges the repeaters among the wireless sensors which are not communicated by the Fermat points, thereby ensuring the connectivity of the wireless sensor network.
The repeater is deployed on the path from the Fermat point to the wireless sensor, and compared with the prior art that the repeater is deployed on the edge of the minimum spanning tree, the repeater resource required to be deployed is greatly reduced. According to the embodiment, the wireless sensor network can be communicated by using less repeater resources by combining the geometric property of the graph and the topological structure of the network.
The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes performed by the present specification and drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (2)
1. A method of communicating with a wireless sensor network, comprising:
s1, presetting a plurality of wireless sensors; the plurality of wireless sensors are deployed at different locations;
s2, grouping the wireless sensors to obtain a plurality of wireless sensor groups; the method specifically comprises the following steps:
s201, generating a point set by taking the plurality of wireless sensors as vertexes;
s202, triangulating the point set to obtain a triangle set; the vertex of each triangle in the set of triangles is the wireless sensor; the wireless sensor groups correspond to triangles in the triangle set one by one;
s203, acquiring the Fermat points of each triangle to obtain a plurality of Fermat points and calculating factors;
s204, acquiring the triangle from the triangle set to obtain a current triangle;
s205, calculating the sum of any two sides of the current triangle to obtain a first distance;
s206, calculating the sum of the distances from the Fermat point corresponding to the current triangle to the three vertexes of the current triangle to obtain a second distance;
s207, calculating the ratio of the first distance to the second distance to obtain a factor;
s208, repeatedly executing the step S203 to the step S207 to obtain a plurality of factors;
s209, if the two triangles have overlapped edges, deleting the triangle with the smaller factor from the triangle set;
s3, acquiring the Fermat points of each wireless sensor group to obtain a plurality of Fermat points; the method specifically comprises the following steps:
s301, acquiring the wireless sensor group to obtain a current wireless sensor group;
s302, iteratively obtaining Fermat points corresponding to the current wireless sensor group to obtain a plurality of Fermat points;
the formula for calculating the number of iterations is:
wherein k is the number of iterations, niGreater than or equal to 3;
s303, repeatedly executing the step S301 to the step S302 until the plurality of wireless sensor groups are traversed;
s4, acquiring the deployment positions of the repeaters according to the Fermat points so as to communicate the wireless sensor network through the repeaters, specifically: constructing a shortest inscribed tree based on the plurality of Fermat points; presetting a communication radius of a repeater; calculating the deployment position of the repeater between the adjacent Fermat points of the shortest inscribed tree according to the communication radius of the repeater;
s5, constructing a minimum spanning tree by taking the plurality of wireless sensors as vertexes; deleting the edge which forms a ring with the shortest inscribed tree in the minimum spanning tree; and calculating the deployment position of the repeater between the adjacent vertexes of the minimum spanning tree according to the communication radius of the repeater.
2. A terminal communicating with a wireless network, comprising one or more processors and memory, the memory storing a program and configured to perform the method of communicating with a wireless sensor network as recited in claim 1, by the one or more processors.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910249858.4A CN109905883B (en) | 2019-03-29 | 2019-03-29 | Method and terminal for connecting wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910249858.4A CN109905883B (en) | 2019-03-29 | 2019-03-29 | Method and terminal for connecting wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109905883A CN109905883A (en) | 2019-06-18 |
| CN109905883B true CN109905883B (en) | 2021-11-09 |
Family
ID=66954224
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910249858.4A Active CN109905883B (en) | 2019-03-29 | 2019-03-29 | Method and terminal for connecting wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109905883B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111770547B (en) * | 2020-07-28 | 2022-04-22 | 重庆邮电大学 | Fermat point-based three-dimensional regional multicast routing method for wireless sensor network |
| CN113438014B (en) * | 2021-07-05 | 2022-04-22 | 重庆邮电大学 | Low-energy-consumption routing method based on inter-satellite communication |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20070050243A (en) * | 2005-11-10 | 2007-05-15 | 울산대학교 산학협력단 | Determination method of aggregation node in wireless sensor network |
| KR20110005558A (en) * | 2009-07-10 | 2011-01-18 | 국민대학교산학협력단 | Method for configuring peer to peer network using a network distances and delaunay triangulation |
| UA64391U (en) * | 2011-03-25 | 2011-11-10 | Тернопольский Национальный Технический Университет Имени Ивана Пулюя | Method for visualization of wormhole in a wireless sensor network |
| CN102625401A (en) * | 2012-03-01 | 2012-08-01 | 迈普通信技术股份有限公司 | Triangulation-based data transmission system and transmission method for sensor networks |
| CN104363612A (en) * | 2014-10-31 | 2015-02-18 | 西安电子科技大学 | Partitioned wireless sensor network repair method based on mobile relay scheduling |
| CN105722091A (en) * | 2016-04-28 | 2016-06-29 | 杭州电子科技大学 | Directional charging base station deployment method of wireless rechargeable sensor network |
| WO2018028226A1 (en) * | 2016-08-08 | 2018-02-15 | 华为技术有限公司 | Method and apparatus for updating network real time kinematic (rtk) reference station network |
| CN108650002A (en) * | 2018-05-21 | 2018-10-12 | 西安电子科技大学 | A kind of two layers of cellular network down collaboration transmission method with closed solutions |
-
2019
- 2019-03-29 CN CN201910249858.4A patent/CN109905883B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20070050243A (en) * | 2005-11-10 | 2007-05-15 | 울산대학교 산학협력단 | Determination method of aggregation node in wireless sensor network |
| KR20110005558A (en) * | 2009-07-10 | 2011-01-18 | 국민대학교산학협력단 | Method for configuring peer to peer network using a network distances and delaunay triangulation |
| UA64391U (en) * | 2011-03-25 | 2011-11-10 | Тернопольский Национальный Технический Университет Имени Ивана Пулюя | Method for visualization of wormhole in a wireless sensor network |
| CN102625401A (en) * | 2012-03-01 | 2012-08-01 | 迈普通信技术股份有限公司 | Triangulation-based data transmission system and transmission method for sensor networks |
| CN104363612A (en) * | 2014-10-31 | 2015-02-18 | 西安电子科技大学 | Partitioned wireless sensor network repair method based on mobile relay scheduling |
| CN105722091A (en) * | 2016-04-28 | 2016-06-29 | 杭州电子科技大学 | Directional charging base station deployment method of wireless rechargeable sensor network |
| WO2018028226A1 (en) * | 2016-08-08 | 2018-02-15 | 华为技术有限公司 | Method and apparatus for updating network real time kinematic (rtk) reference station network |
| CN108650002A (en) * | 2018-05-21 | 2018-10-12 | 西安电子科技大学 | A kind of two layers of cellular network down collaboration transmission method with closed solutions |
Non-Patent Citations (3)
| Title |
|---|
| Distributed fermat-point location estimation for wireless sensor network applications;Jiann-Liang Chen;《2007 IEEE Sarnoff Symposium》;20080716;全文 * |
| Physical-layer Network Coding and Connected Dominating Set based Routing Protocol in Wireless Multi-hop Network;Li Xu;《2012 Fourth International Conference on Intelligent Networking and Collaborative Systems》;20121231;全文 * |
| 低开销低延迟WSN多费马点链多地域群播算法;苏畅;《传感技术学报》;20120615;第837-841页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109905883A (en) | 2019-06-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105050130B (en) | A kind of construction method of multidimensional interference space model | |
| Kashyap et al. | Relay Placement for Higher Order Connectivity in Wireless Sensor Networks. | |
| CN109905883B (en) | Method and terminal for connecting wireless sensor network | |
| WO2018028226A1 (en) | Method and apparatus for updating network real time kinematic (rtk) reference station network | |
| TWI328177B (en) | Method of evolutionary optimization algorithm for structure design | |
| Liu et al. | On coverage of wireless sensor networks for rolling terrains | |
| Zhou et al. | A distributed triangulation algorithm for wireless sensor networks on 2D and 3D surface | |
| CN108966120B (en) | Combined trilateral positioning method and system for dynamic cluster network improvement | |
| Wang et al. | Connectivity-based sensor network localization with incremental delaunay refinement method | |
| CN110856184A (en) | Double-layer structure wireless sensor network node deployment method based on K-means algorithm | |
| CN105654552A (en) | Fast Delaunay triangulation method for arbitrarily-distributed large-scale point cloud data | |
| US8473261B2 (en) | Methods and systems for improving meshes used in computational fluid simulations | |
| US11159952B2 (en) | Analysis method and device for network design in wireless communication system | |
| CN107133377B (en) | Modeling method and device for bolt connection | |
| CN112598724B (en) | Improved TIN-based vector data center line extraction method | |
| CN104363612B (en) | Piecemeal wireless sensor network restorative procedure based on mobile relay scheduling | |
| Oktug et al. | 3D coverage analysis under heterogeneous deployment strategies in wireless sensor networks | |
| CN112291102A (en) | Optimal rigid graph-based vehicle-road cooperative roadside unit layout topology design method | |
| Liu et al. | Optimal relay node placement for connectivity recovery in underwater acoustic sensor networks | |
| US20230396506A1 (en) | Determination of path arrangement of infrastructure link network with trunk-and-branch topology | |
| CN107644139B (en) | Attribute mapping method from CAD model to CAE model | |
| Klymash et al. | Algorithm for greedy routing based on the Thurston algorithm in sensor networks | |
| CN109754449B (en) | Triangularization determination method for two-dimensional grid graph | |
| Lillis et al. | On the efficiency of a local iterative algorithm to compute delaunay realizations | |
| CN114117837A (en) | Integral finite element modeling method and system for electrostatically-formed thin film reflector antenna |
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 |