CN109905883A - A kind of method and terminal being connected to wireless sensor network - Google Patents
A kind of method and terminal being connected to wireless sensor network Download PDFInfo
- Publication number
- CN109905883A CN109905883A CN201910249858.4A CN201910249858A CN109905883A CN 109905883 A CN109905883 A CN 109905883A CN 201910249858 A CN201910249858 A CN 201910249858A CN 109905883 A CN109905883 A CN 109905883A
- Authority
- CN
- China
- Prior art keywords
- wireless sensor
- triangle
- fermat
- repeater
- point
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of methods and terminal for being connected to wireless sensor network, belong to field of wireless communication.The present invention is by presetting multiple wireless sensors；The multiple wireless sensor is deployed in different positions；It is grouped the multiple wireless sensor, obtains multiple wireless sensor groups；Specifically: point set is generated by vertex of the multiple wireless sensor；Point set described in triangulation, obtains triangle sets；Each vertex of a triangle is the wireless sensor in the triangle sets；The wireless sensor grouping is corresponded with the triangle in the triangle sets；The Fermat point for obtaining each wireless sensor group obtains multiple Fermat points；The deployed position of repeater is obtained according to the multiple Fermat point, so as to be connected to wireless sensor network by deployment repeater.Repeater resource needed for realizing reduction connection wireless sensor network.
Description
Technical field
The present invention relates to a kind of methods and terminal for being connected to wireless sensor network, belong to field of wireless communication.
Background technique
Connectivity reparation is to guarantee wireless sensor network validity, the important means of reliability.Existing connectivity is repaired
Multiple strategy can be divided mainly into two classes.Wherein, a part strategy utilizes resource (relay node) consumed by construction SMT-MSP and reason
It is used as measurement standard by the ratio (i.e. approximation ratio) of resource (relay node) needed for upper optimal SMT-MSP, approximation ratio is smaller so to be calculated
The performance of method is better, and another part strategy then uses emulation experiment to carry out verification algorithm performance.
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 it) proposes the approximate algorithm based on quadrangular configuration, not only proves that this algorithm approximation ratio is 3, and demonstrate simple
The method of stainer minimum spanning tree MST is used to repair connectivity its approximation ratio also for 3.Wherein, approximation ratio refers to construction
The ratio of resource (relay node) needed for resource consumed by SMT-MSP (relay node) and theoretically optimal SMT-MSP.For example,
As shown in Figure 1, S1、S2、S3、S4And S5Respectively five sensors of wireless sensor network.It is repaired using minimum spanning tree method
The multiply-connected general character is i.e. in side S1S2, side S2S3, side S3S4With side S3S5Upper deployment repeater.
But need to dispose more repeater using the above method to safeguard the connectivity of wireless sensor network.
Summary of the invention
The technical problems to be solved by the present invention are: repeater needed for how reducing connection wireless sensor network provides
Source.
In order to solve the above-mentioned technical problem, the technical solution adopted by the present invention are as follows:
The present invention provides a kind of method for being connected to wireless sensor network, comprising:
Preset multiple wireless sensors；The multiple wireless sensor is deployed in different positions；
It is grouped the multiple wireless sensor, obtains multiple wireless sensor groups；Specifically: with the multiple wireless sensing
Device is that vertex generates point set；Point set described in triangulation, obtains triangle sets；Each triangle in the triangle sets
Vertex is the wireless sensor；The wireless sensor grouping is corresponded with the triangle in the triangle sets；
The Fermat point for obtaining each wireless sensor group obtains multiple Fermat points；
The deployed position of repeater is obtained according to the multiple Fermat point, so as to be connected to wireless sensing by deployment repeater
Device network.
Preferably, the Fermat point for obtaining each wireless sensor group, before obtaining multiple Fermat points, further includes:
S101, the Fermat point for obtaining each triangle, obtain multiple Fermat points；
S102, a triangle is obtained from the triangle sets, obtain current triangle；
S103, the sum for calculating any two sides of current triangle, obtain first distance；
S104, it calculates at a distance from Fermat point to three vertex of the current triangle corresponding with the current triangle
With obtain second distance；
S105, the ratio for calculating the first distance and the second distance, obtain the factor；
S106, step S101 to step S105 is repeated, obtains multiple factors；
If S107, two triangles have the side of overlapping, two described three are deleted from the triangle sets
The lesser triangle of the factor described in angular.
Preferably, the Fermat point for obtaining each wireless sensor group, obtains multiple Fermat points, specifically:
S201, a wireless sensor group is obtained, obtains current wireless sensor group；
S202, iteration obtain Fermat point corresponding with the current wireless sensor group, obtain multiple Fermat points；
Calculate the formula of the number of iterations are as follows:
Wherein, the k is the number of iterations, niMore than or equal to 3.
S203, step S201 to step S202 is repeated, until the multiple wireless sensor group is traversed.
Preferably, the deployed position of repeater is obtained according to the multiple Fermat point, so as to pass through deployment repeater connection
Wireless sensor network, specifically:
Construct the most short inscribed tree based on the multiple Fermat point；
The communication radius of default repeater；
Repeater is calculated between the adjacent Fermat point of the most short inscribed tree according to the communication radius of the repeater
Deployed position.
Preferably, further includes:
Minimum spanning tree is constructed by vertex of the multiple wireless sensor；
Delete the side for constituting ring in the minimum spanning tree with the most short inscribed tree；
According to the communication radius of the repeater, the portion of repeater is calculated between the adjacent vertex of the minimum spanning tree
Affix one's name to position.
It is described the present invention also provides a kind of terminal for being connected to wireless network, including one or more processors and memory
Memory is stored with program, and is configured to execute following steps by one or more of processors:
Preset multiple wireless sensors；The multiple wireless sensor is deployed in different positions；
It is grouped the multiple wireless sensor, obtains multiple wireless sensor groups；Specifically: with the multiple wireless sensing
Device is that vertex generates point set；Point set described in triangulation, obtains triangle sets；Each triangle in the triangle sets
Vertex is the wireless sensor；The wireless sensor grouping is corresponded with the triangle in the triangle sets；
The Fermat point for obtaining each wireless sensor group obtains multiple Fermat points；
The deployed position of repeater is obtained according to the multiple Fermat point, so as to be connected to wireless sensing by deployment repeater
Device network.
Preferably, the Fermat point for obtaining each wireless sensor group, before obtaining multiple Fermat points, further includes:
S101, the Fermat point for obtaining each triangle, obtain multiple Fermat points；
S102, a triangle is obtained from the triangle sets, obtain current triangle；
S103, the sum for calculating any two sides of current triangle, obtain first distance；
S104, it calculates at a distance from Fermat point to three vertex of the current triangle corresponding with the current triangle
With obtain second distance；
S105, the ratio for calculating the first distance and the second distance, obtain the factor；
S106, step S101 to step S105 is repeated, obtains multiple factors；
If S107, two triangles have the side of overlapping, two described three are deleted from the triangle sets
The lesser triangle of the factor described in angular.
Preferably, the Fermat point for obtaining each wireless sensor group, obtains multiple Fermat points, specifically:
S201, a wireless sensor group is obtained, obtains current wireless sensor group；
S202, iteration obtain Fermat point corresponding with the current wireless sensor group, obtain multiple Fermat points；
Calculate the formula of the number of iterations are as follows:
Wherein, the k is the number of iterations, niMore than or equal to 3.
S203, step S201 to step S202 is repeated, until the multiple wireless sensor group is traversed.
Preferably, the deployed position of repeater is obtained according to the multiple Fermat point, so as to pass through deployment repeater connection
Wireless sensor network, specifically:
Construct the most short inscribed tree based on the multiple Fermat point；
The communication radius of default repeater；
Repeater is calculated between the adjacent Fermat point of the most short inscribed tree according to the communication radius of the repeater
Deployed position.
Preferably, further includes:
Minimum spanning tree is constructed by vertex of the multiple wireless sensor；
Delete the side for constituting ring in the minimum spanning tree with the most short inscribed tree；
According to the communication radius of the repeater, the portion of repeater is calculated between the adjacent vertex of the minimum spanning tree
Affix one's name to position.
The invention has the following beneficial effects:
1, the present invention provides a kind of method and terminal for being connected to wireless sensor network, since Fermat point is to be located at triangle
It is interior and to the shortest point of the sum of Atria vertex distance, and Fermat point to the sum of Atria vertex distance less than triangle
The sum on any two sides of shape, the present invention utilize this characteristic of Fermat point, on path of the Fermat point to wireless sensor in deployment
After device, compared with the prior art disposes repeater on the side of minimum spanning tree, in deployment needed for largely reducing
After device resource.The present invention is realized and is provided using less repeater by combining the geometric properties of figure and the topological structure of network
Source can be connected to wireless sensor network.
2, further, the present invention uses Triangulation Technique to divide the figure generated using multiple wireless sensors as vertex
For multiple triangles, and therefrom select the least triangle that multiple wireless sensors can be connected to.Wherein, the triangle of reservation
Shape is higher than deleted triangulation point using the effect after the optimization of Fermat point and uses the effect after the optimization of Fermat point, the company of advantageously reducing
Repeater resource needed for logical wireless sensor network.
3, further, Fermat point is less than or equal to any two side sums of triangle to the sum of Atria vertex distanceIt is calculated by the limit and knows iterationIt is secondary that optimal effect of optimization can be obtained.
4, further, repeater can transmit information in certain radius, at two apart from farther away sensor
Between dispose multiple repeaters may be implemented connection two sensors purpose.
5, further, since the premise for obtaining Fermat point is to can make up triangle, this hair for sensor as vertex
The wireless sensor that the bright path for finding out multiple Fermat point compositions by minimum spanning tree cannot be connected to, and passing through Fermat point still
Repeater is disposed between the wireless sensor not being connected to, to ensure that the connectivity of wireless sensor network.
Detailed description of the invention
Fig. 1 is the schematic diagram that repeater is disposed using minimum spanning tree method；
Fig. 2 is a kind of flow chart element of the specific embodiment of method for being connected to wireless sensor network provided by the invention
Figure；
The result schematic diagram of Fig. 3 triangulated graph；
Fig. 4 is the schematic diagram of the most short inscribed tree of iterative construction；
Fig. 5 is that repeater disposes schematic diagram；
Fig. 6 is minimum spanning tree schematic diagram；
Fig. 7 is a kind of structural frames of the specific embodiment of terminal for being connected to wireless sensor network provided by the invention
Figure；
Fig. 8 is Fermat point schematic diagram；
Label declaration:
1, processor；2, memory.
Specific embodiment
It is next in the following with reference to the drawings and specific embodiments that the present invention will be described in detail.
Fig. 1 to Fig. 8 is please referred to,
The embodiment of the present invention one are as follows:
As shown in Figure 1, the present embodiment provides a kind of methods for being connected to wireless sensor network, comprising:
S1, multiple wireless sensors are preset；The multiple wireless sensor is deployed in different positions.
For example, the positional relationship of the multiple wireless sensor is as shown in Figure 1, S1、S2、S3、S4And S5It is respectively wireless to pass
Five sensors in sensor network.Farther out due to the distance of sensor between any two, repeater is needed to make entire wireless sensing
Device network-in-dialing.
Wherein, information can be transmitted in certain radius, is disposed between farther away sensor at two multiple
The purpose of two sensors of connection may be implemented in repeater.
S2, the multiple wireless sensor of grouping, obtain multiple wireless sensor groups；Specifically:
S201, point set is generated by vertex of the multiple wireless sensor.
Point set described in S202, triangulation, obtains triangle sets；Each vertex of a triangle in the triangle sets
For the wireless sensor；The wireless sensor grouping is corresponded with the triangle in the triangle sets.
Wherein, a triangulation T={ V, E } of point set V is a Let G, which meets the following conditions: 1.
In addition to endpoint, the side in plan view does not include any point that point is concentrated；2. there is no intersection edges；3. all faces are all in plan view
Triangular facet.
For example, the result of figure described in triangulation is as shown in figure 3, obtain three triangles, triangle S1S2S3, triangle
S1S3S5With triangle S3S4S5。
S203, the Fermat point for obtaining each triangle, obtain multiple Fermat points.
Wherein, as shown in figure 8, Fermat point f, which is one, is located at triangle PiPjPkIt is interior and arrive Atria vertex Pi、PjWith
PkThe most short inscribed tree of the shortest point of sum of the distance, i.e. triangle is side fpi, side fpjWith side fpkUnion.
For example, the black circle in Fig. 3 indicates Fermat point.Triangle S1S2S3Fermat point away from S1、S2、S3Distance and extremely
When young in triangle S1S2S3The two of any two side sums/
S204, a triangle is obtained from the triangle sets, obtain current triangle.
S205, the sum for calculating any two sides of current triangle, obtain first distance.
S206, it calculates at a distance from Fermat point to three vertex of the current triangle corresponding with the current triangle
With obtain second distance.
S207, the ratio for calculating the first distance and the second distance, obtain the factor.
S208, step S203 to step S207 is repeated, obtains multiple factors.
Wherein, the repeater quantity that the bigger explanation of the value of the factor uses Fermat point reparation network connectivty that can save is more
It is more.
If S209, two triangles have the side of overlapping, two described three are deleted from the triangle sets
The lesser triangle of the factor described in angular.
For example, as shown in figure 3, triangle S1S3S5With triangle S1S2S3There is common edge S1S3, triangle S1S3S5With triangle
Shape S3S4S5There is common edge S3S5.Calculate separately triangle S1S3S5, triangle S1S2S3With triangle S3S4S5The factor, for example, three
Angular S1S3S5In side S1S5With side S1S3Upper deployment repeater needs 10 repeaters, and disposes on the inscribed tree of Fermat point
Repeater needs 8 repeaters, then triangle S1S3S5Factor values be 10/8.Similarly, triangle S1S2S3Factor values be 3,
Triangle S3S4S5Factor values be 2, triangle S1S3S5Factor values be less than triangle S1S2S3Factor values, again smaller than triangle
Shape S3S4S5Factor values.The bigger quantity for indicating that repeater can be saved using Fermat point optimization repeater deployment scheme of the factor
It is more.Therefore, by triangle S1S3S5It deletes, i.e., by side S1S5Deletion.By side S1S5After deletion, in wireless sensor network
Five sensors still there is connectivity.
Wherein, the present embodiment uses Triangulation Technique that will be divided into using multiple wireless sensors as the figure that vertex generates more
A triangle, and therefrom select the least triangle that multiple wireless sensors can be connected to.Wherein, the triangle of reservation makes
It is higher than deleted triangulation point using the effect after the optimization of Fermat point with the effect after the optimization of Fermat point, advantageously reduces connection nothing
Repeater resource needed for line sensor network.
S210, wireless sensor grouping are corresponded with the triangle in the triangle sets.
For example, the first grouping includes sensor S1, sensor S2With sensor S3, second packet includes sensor S3, sensing
Device S5With sensor S4。
S3, the Fermat point for obtaining each wireless sensor group, obtain multiple Fermat points.Specifically:
S301, a wireless sensor group is obtained, obtains current wireless sensor group.
S302, iteration obtain Fermat point corresponding with the current wireless sensor group, obtain multiple Fermat points.
Wherein, the formula of the number of iterations is calculated are as follows:
Wherein, the k is the number of iterations, niMore than or equal to 3.
Wherein, Fermat point is less than or equal to any two side sums of triangle to the sum of Atria vertex distanceIt is logical
Cross iteration known to limit calculatingIt is secondary that optimal effect of optimization can be obtained.
S303, step S301 to step S302 is repeated, until the multiple wireless sensor group is traversed.
For example, respectively to triangle S1S2S3With triangle S3S4S5The most short inscribed tree structure based on Fermat point is repeated
It makes, the number for constructing most short inscribed tree repeatedly to a triangle is K.As shown in figure 4, triangle S1S2S33 wheel structures are carried out
It makes, and triangle S3S4S52 wheel constructions are only carried out, wherein dotted line indicates the longest edge for needing to delete in every wheel construction.
S4, the deployed position that repeater is obtained according to the multiple Fermat point, so that wireless by deployment repeater connection
Sensor network.Specifically:
Construct the most short inscribed tree based on the multiple Fermat point；
The communication radius of default repeater；
Repeater is calculated between the adjacent Fermat point of the most short inscribed tree according to the communication radius of the repeater
Deployed position.
For example, as shown in figure 5, repeater is arranged on most short inscribed tree using the communication radius of repeater as interval.
S5, minimum spanning tree is constructed by vertex of the multiple wireless sensor；
Delete the side for constituting ring in the minimum spanning tree with the most short inscribed tree；
According to the communication radius of the repeater, the portion of repeater is calculated between the adjacent vertex of the minimum spanning tree
Affix one's name to position.
For example, as shown in fig. 6, sensor S31With sensor S32Between there is no Fermat point, if only according to Fermat point formed
Most short inscribed tree deployment repeater wireless sensor is divided into two parts, and can not be connected to.At this point, according to sensor S1、S2、
S31、S32、S4And S5Generate minimum spanning tree.Minimum spanning tree in Fig. 6 is by side S1S2, side S2S31, side S31S32, side S32S4The side and
S4S5Composition.Wherein, side S1S2, side S2S31, side S32S4With side S4S5It can be constituted with the most short inscribed tree constructed according to Fermat point
Ring.For example, the side S of minimum spanning tree1S2With the side FS of most short inscribed tree2With side FS1Ring is constituted, in the side FS of most short inscribed tree2
With side FS1Connection sensor S has may be implemented in upper deployment repeater1With sensor S2, it is therefore not necessary to again in minimum spanning tree
Side S1S2Upper deployment sensor, by the side S of minimum spanning tree1S2It deletes.And the side S of minimum spanning tree31S32It is not inscribed with most short
Any side of tree constitutes ring therefore should be in the side S of minimum spanning tree31S32Upper deployment repeater, to be connected to sensor S31And biography
Sensor S32, to be connected to entire wireless sensor network.
Wherein, since the premise for obtaining Fermat point is to can make up triangle for sensor as vertex, the present invention passes through
Minimum spanning tree finds out the wireless sensor that the path of multiple Fermat point compositions cannot be connected to, and is not yet connected to by Fermat point
Wireless sensor between dispose repeater, to ensure that the connectivity of wireless sensor network.
Wherein, since Fermat point is to be located in triangle and arrive the shortest point of the sum of Atria vertex distance, and take
Horse point is less than the sum on any two sides of triangle to the sum of Atria vertex distance, this characteristic of the present embodiment horse point,
Repeater is disposed on Fermat point to the path of wireless sensor, disposes repeater phase on the side of minimum spanning tree with the prior art
Than the repeater resource disposed needed for largely reducing.The present embodiment passes through the geometric properties and network in conjunction with figure
Topological structure, realizing using less repeater resource can be connected to wireless sensor network.
The embodiment of the present invention two are as follows:
As shown in fig. 7, the present embodiment provides a kind of terminal for being connected to wireless sensor network, including one or more processing
Device 1 and memory 2, the memory 2 are stored with program, and be configured to by one or more of processors 1 execute with
Lower step:
S1, multiple wireless sensors are preset；The multiple wireless sensor is deployed in different positions.
For example, the positional relationship of the multiple wireless sensor is as shown in Figure 1, S1、S2、S3、S4And S5It is respectively wireless to pass
Five sensors in sensor network.Farther out due to the distance of sensor between any two, repeater is needed to make entire wireless sensing
Device network-in-dialing.
Wherein, information can be transmitted in certain radius, is disposed between farther away sensor at two multiple
The purpose of two sensors of connection may be implemented in repeater.
S2, the multiple wireless sensor of grouping, obtain multiple wireless sensor groups；Specifically:
S201, point set is generated by vertex of the multiple wireless sensor.
Point set described in S202, triangulation, obtains triangle sets；Each vertex of a triangle in the triangle sets
For the wireless sensor；The wireless sensor grouping is corresponded with the triangle in the triangle sets.
Wherein, a triangulation T={ V, E } of point set V is a Let G, which meets the following conditions: 1.
In addition to endpoint, the side in plan view does not include any point that point is concentrated；2. there is no intersection edges；3. all faces are all in plan view
Triangular facet.
For example, the result of figure described in triangulation is as shown in figure 3, obtain three triangles, triangle S1S2S3, triangle
S1S3S5With triangle S3S4S5。
S203, the Fermat point for obtaining each triangle, obtain multiple Fermat points.
Wherein, as shown in figure 8, Fermat point f, which is one, is located at triangle PiPjPkIt is interior and arrive Atria vertex Pi、PjWith
PkThe most short inscribed tree of the shortest point of sum of the distance, i.e. triangle is side fpi, side fpjWith side fpkUnion.
For example, the black circle in Fig. 3 indicates Fermat point.Triangle S1S2S3Fermat point away from S1、S2、S3Distance and extremely
When young in triangle S1S2S3The two of any two side sums/
S204, a triangle is obtained from the triangle sets, obtain current triangle.
S205, the sum for calculating any two sides of current triangle, obtain first distance.
S206, it calculates at a distance from Fermat point to three vertex of the current triangle corresponding with the current triangle
With obtain second distance.
S207, the ratio for calculating the first distance and the second distance, obtain the factor.
S208, step S203 to step S207 is repeated, obtains multiple factors.
Wherein, the repeater quantity that the bigger explanation of the value of the factor uses Fermat point reparation network connectivty that can save is more
It is more.
If S209, two triangles have the side of overlapping, two described three are deleted from the triangle sets
The lesser triangle of the factor described in angular.
For example, as shown in figure 3, triangle S1S3S5With triangle S1S2S3There is common edge S1S3, triangle S1S3S5With triangle
Shape S3S4S5There is common edge S3S5.Calculate separately triangle S1S3S5, triangle S1S2S3With triangle S3S4S5The factor, for example, three
Angular S1S3S5In side S1S5With side S1S3Upper deployment repeater needs 10 repeaters, and disposes on the inscribed tree of Fermat point
Repeater needs 8 repeaters, then triangle S1S3S5Factor values be 10/8.Similarly, triangle S1S2S3Factor values be 3,
Triangle S3S4S5Factor values be 2, triangle S1S3S5Factor values be less than triangle S1S2S3Factor values, again smaller than triangle
Shape S3S4S5Factor values.The bigger quantity for indicating that repeater can be saved using Fermat point optimization repeater deployment scheme of the factor
It is more.Therefore, by triangle S1S3S5It deletes, i.e., by side S1S5Deletion.By side S1S5After deletion, in wireless sensor network
Five sensors still there is connectivity.
Wherein, the present embodiment uses Triangulation Technique that will be divided into using multiple wireless sensors as the figure that vertex generates more
A triangle, and therefrom select the least triangle that multiple wireless sensors can be connected to.Wherein, the triangle of reservation makes
It is higher than deleted triangulation point using the effect after the optimization of Fermat point with the effect after the optimization of Fermat point, advantageously reduces connection nothing
Repeater resource needed for line sensor network.
S210, wireless sensor grouping are corresponded with the triangle in the triangle sets.
For example, the first grouping includes sensor S1, sensor S2With sensor S3, second packet includes sensor S3, sensing
Device S5With sensor S4。
S3, the Fermat point for obtaining each wireless sensor group, obtain multiple Fermat points.Specifically:
S301, a wireless sensor group is obtained, obtains current wireless sensor group.
S302, iteration obtain Fermat point corresponding with the current wireless sensor group, obtain multiple Fermat points.
Wherein, the formula of the number of iterations is calculated are as follows:
Wherein, the k is the number of iterations, niMore than or equal to 3.
Wherein, Fermat point is less than or equal to any two side sums of triangle to the sum of Atria vertex distanceIt is logical
Cross iteration known to limit calculatingIt is secondary that optimal effect of optimization can be obtained.
S303, step S301 to step S302 is repeated, until the multiple wireless sensor group is traversed.
For example, respectively to triangle S1S2S3With triangle S3S4S5The most short inscribed tree structure based on Fermat point is repeated
It makes, the number for constructing most short inscribed tree repeatedly to a triangle is K.As shown in figure 4, triangle S1S2S33 wheel structures are carried out
It makes, and triangle S3S4S52 wheel constructions are only carried out, wherein dotted line indicates the longest edge for needing to delete in every wheel construction.
S4, the deployed position that repeater is obtained according to the multiple Fermat point, so that wireless by deployment repeater connection
Sensor network.Specifically:
Construct the most short inscribed tree based on the multiple Fermat point；
The communication radius of default repeater；
Repeater is calculated between the adjacent Fermat point of the most short inscribed tree according to the communication radius of the repeater
Deployed position.
For example, as shown in figure 5, repeater is arranged on most short inscribed tree using the communication radius of repeater as interval.
S5, minimum spanning tree is constructed by vertex of the multiple wireless sensor；
Delete the side for constituting ring in the minimum spanning tree with the most short inscribed tree；
According to the communication radius of the repeater, the portion of repeater is calculated between the adjacent vertex of the minimum spanning tree
Affix one's name to position.
For example, as shown in fig. 6, sensor S31With sensor S32Between there is no Fermat point, if only according to Fermat point formed
Most short inscribed tree deployment repeater wireless sensor is divided into two parts, and can not be connected to.At this point, according to sensor S1、S2、
S31、S32、S4And S5Generate minimum spanning tree.Minimum spanning tree in Fig. 6 is by side S1S2, side S2S31, side S31S32, side S32S4The side and
S4S5Composition.Wherein, side S1S2, side S2S31, side S32S4With side S4S5It can be constituted with the most short inscribed tree constructed according to Fermat point
Ring.For example, the side S of minimum spanning tree1S2With the side FS of most short inscribed tree2With side FS1Ring is constituted, in the side FS of most short inscribed tree2
With side FS1Connection sensor S has may be implemented in upper deployment repeater1With sensor S2, it is therefore not necessary to again in minimum spanning tree
Side S1S2Upper deployment sensor, by the side S of minimum spanning tree1S2It deletes.And the side S of minimum spanning tree31S32It is not inscribed with most short
Any side of tree constitutes ring therefore should be in the side S of minimum spanning tree31S32Upper deployment repeater, to be connected to sensor S31And biography
Sensor S32, to be connected to entire wireless sensor network.
Wherein, since the premise for obtaining Fermat point is to can make up triangle for sensor as vertex, the present invention passes through
Minimum spanning tree finds out the wireless sensor that the path of multiple Fermat point compositions cannot be connected to, and is not yet connected to by Fermat point
Wireless sensor between dispose repeater, to ensure that the connectivity of wireless sensor network.
Wherein, since Fermat point is to be located in triangle and arrive the shortest point of the sum of Atria vertex distance, and take
Horse point is less than the sum on any two sides of triangle to the sum of Atria vertex distance, this characteristic of the present embodiment horse point,
Repeater is disposed on Fermat point to the path of wireless sensor, disposes repeater phase on the side of minimum spanning tree with the prior art
Than the repeater resource disposed needed for largely reducing.The present embodiment passes through the geometric properties and network in conjunction with figure
Topological structure, realizing using less repeater resource can be connected to wireless sensor network.
The above description is only an embodiment of the present invention, is not intended to limit the scope of the invention, all to utilize this hair
Equivalent structure or equivalent flow shift made by bright specification and accompanying drawing content is applied directly or indirectly in other relevant skills
Art field, is included within the scope of the present invention.
Claims (10)
1. a kind of method for being connected to wireless sensor network characterized by comprising
Preset multiple wireless sensors；The multiple wireless sensor is deployed in different positions；
It is grouped the multiple wireless sensor, obtains multiple wireless sensor groups；Specifically: it is with the multiple wireless sensor
Vertex generates point set；Point set described in triangulation, obtains triangle sets；Each vertex of a triangle in the triangle sets
For the wireless sensor；The wireless sensor grouping is corresponded with the triangle in the triangle sets；
The Fermat point for obtaining each wireless sensor group obtains multiple Fermat points；
The deployed position of repeater is obtained according to the multiple Fermat point, so as to be connected to wireless sensor network by deployment repeater
Network.
2. the method for connection wireless sensor network according to claim 1, which is characterized in that obtain each described wireless
The Fermat point of sensor group, before obtaining multiple Fermat points, further includes:
S101, the Fermat point for obtaining each triangle, obtain multiple Fermat points；
S102, a triangle is obtained from the triangle sets, obtain current triangle；
S103, the sum for calculating any two sides of current triangle, obtain first distance；
S104, calculate at a distance from corresponding with current triangle Fermat point to three vertex of the current triangle and,
Obtain second distance；
S105, the ratio for calculating the first distance and the second distance, obtain the factor；
S106, step S101 to step S105 is repeated, obtains multiple factors；
If S107, two triangles have the side of overlapping, two triangles are deleted from the triangle sets
Described in the lesser triangle of the factor.
3. the method for connection wireless sensor network according to claim 1, which is characterized in that obtain each described wireless
The Fermat point of sensor group obtains multiple Fermat points, specifically:
S201, a wireless sensor group is obtained, obtains current wireless sensor group；
S202, iteration obtain Fermat point corresponding with the current wireless sensor group, obtain multiple Fermat points；
Calculate the formula of the number of iterations are as follows:
Wherein, the k is the number of iterations, niMore than or equal to 3.
S203, step S201 to step S202 is repeated, until the multiple wireless sensor group is traversed.
4. the method for connection wireless sensor network according to claim 1, which is characterized in that according to the multiple Fermat
The deployed position of point acquisition repeater, so as to wireless sensor network is connected to by deployment repeater, specifically:
Construct the most short inscribed tree based on the multiple Fermat point；
The communication radius of default repeater；
The deployment of repeater is calculated between the adjacent Fermat point of the most short inscribed tree according to the communication radius of the repeater
Position.
5. the method for connection wireless network according to claim 4, which is characterized in that further include:
Minimum spanning tree is constructed by vertex of the multiple wireless sensor；
Delete the side for constituting ring in the minimum spanning tree with the most short inscribed tree；
According to the communication radius of the repeater, the deployment position of repeater is calculated between the adjacent vertex of the minimum spanning tree
It sets.
6. a kind of terminal for being connected to wireless network, which is characterized in that including one or more processors and memory, the storage
Device is stored with program, and is configured to execute following steps by one or more of processors:
Preset multiple wireless sensors；The multiple wireless sensor is deployed in different positions；
It is grouped the multiple wireless sensor, obtains multiple wireless sensor groups；Specifically: it is with the multiple wireless sensor
Vertex generates point set；Point set described in triangulation, obtains triangle sets；Each vertex of a triangle in the triangle sets
For the wireless sensor；The wireless sensor grouping is corresponded with the triangle in the triangle sets；
The Fermat point for obtaining each wireless sensor group obtains multiple Fermat points；
The deployed position of repeater is obtained according to the multiple Fermat point, so as to be connected to wireless sensor network by deployment repeater
Network.
7. the terminal of connection wireless sensor network according to claim 6, which is characterized in that obtain each described wireless
The Fermat point of sensor group, before obtaining multiple Fermat points, further includes:
S101, the Fermat point for obtaining each triangle, obtain multiple Fermat points；
S102, a triangle is obtained from the triangle sets, obtain current triangle；
S103, the sum for calculating any two sides of current triangle, obtain first distance；
S104, calculate at a distance from corresponding with current triangle Fermat point to three vertex of the current triangle and,
Obtain second distance；
S105, the ratio for calculating the first distance and the second distance, obtain the factor；
S106, step S101 to step S105 is repeated, obtains multiple factors；
If S107, two triangles have the side of overlapping, two triangles are deleted from the triangle sets
Described in the lesser triangle of the factor.
8. the terminal of connection wireless sensor network according to claim 6, which is characterized in that obtain each described wireless
The Fermat point of sensor group obtains multiple Fermat points, specifically:
S201, a wireless sensor group is obtained, obtains current wireless sensor group；
S202, iteration obtain Fermat point corresponding with the current wireless sensor group, obtain multiple Fermat points；
Calculate the formula of the number of iterations are as follows:
Wherein, the k is the number of iterations, niMore than or equal to 3.
S203, step S201 to step S202 is repeated, until the multiple wireless sensor group is traversed.
9. the terminal of connection wireless sensor network according to claim 6, which is characterized in that according to the multiple Fermat
The deployed position of point acquisition repeater, so as to wireless sensor network is connected to by deployment repeater, specifically:
Construct the most short inscribed tree based on the multiple Fermat point；
The communication radius of default repeater；
The deployment of repeater is calculated between the adjacent Fermat point of the most short inscribed tree according to the communication radius of the repeater
Position.
10. the terminal of connection wireless network according to claim 9, which is characterized in that further include:
Minimum spanning tree is constructed by vertex of the multiple wireless sensor；
Delete the side for constituting ring in the minimum spanning tree with the most short inscribed tree；
According to the communication radius of the repeater, the deployed position of repeater is calculated between the adjacent vertex of the minimum spanning tree.
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 true CN109905883A (en) | 2019-06-18 |
| CN109905883B 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) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111770547A (en) * | 2020-07-28 | 2020-10-13 | 重庆邮电大学 | Fermat point-based three-dimensional regional multicast routing method for wireless sensor network |
| CN113438014A (en) * | 2021-07-05 | 2021-09-24 | 重庆邮电大学 | 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 |
|---|
| JIANN-LIANG CHEN: "Distributed fermat-point location estimation for wireless sensor network applications", 《2007 IEEE SARNOFF SYMPOSIUM》 * |
| LI XU: "Physical-layer Network Coding and Connected Dominating Set based Routing Protocol in Wireless Multi-hop Network", 《2012 FOURTH INTERNATIONAL CONFERENCE ON INTELLIGENT NETWORKING AND COLLABORATIVE SYSTEMS》 * |
| 苏畅: "低开销低延迟WSN多费马点链多地域群播算法", 《传感技术学报》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111770547A (en) * | 2020-07-28 | 2020-10-13 | 重庆邮电大学 | Fermat point-based three-dimensional regional multicast routing method for wireless sensor network |
| CN111770547B (en) * | 2020-07-28 | 2022-04-22 | 重庆邮电大学 | Fermat point-based three-dimensional regional multicast routing method for wireless sensor network |
| CN113438014A (en) * | 2021-07-05 | 2021-09-24 | 重庆邮电大学 | Low-energy-consumption routing method based on inter-satellite communication |
| CN113438014B (en) * | 2021-07-05 | 2022-04-22 | 重庆邮电大学 | Low-energy-consumption routing method based on inter-satellite communication |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109905883B (en) | 2021-11-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101203015B (en) | Method and apparatus for determining base station wireless field strength overlay area range | |
| CN109905883A (en) | A kind of method and terminal being connected to wireless sensor network | |
| US11387776B2 (en) | Method and system for optimizing the configuration of a solar power system | |
| CN108572999B (en) | Method and device for searching AOI contour of interest surface | |
| CN104142156A (en) | Path navigation method | |
| CN112902970A (en) | Routing inspection path planning method and routing inspection robot | |
| CN104102637A (en) | Method and device for generating hot spot region | |
| US20130158954A1 (en) | Method and system for optimizing the configuration of a solar power system | |
| CN105654552A (en) | Fast Delaunay triangulation method for arbitrarily-distributed large-scale point cloud data | |
| CN109903388A (en) | The cloud processing method and system of cabinet body generation three-view diagram | |
| CN103064953B (en) | Position-based is registered the POI update method of data | |
| CN107798182A (en) | A kind of quick calculating of base station radiation scope and update method | |
| CN109344513A (en) | A kind of minimal path planing method, system and computer storage medium | |
| JP2014232240A (en) | Road grade data creation device, vehicle energy consumption calculation device and road grade data creation method | |
| CN107273193A (en) | A kind of data processing method and system towards many Computational frames based on DAG | |
| CN106294407B (en) | A kind of coincidence section determines method and apparatus | |
| CN108519096A (en) | A kind of multi-route road screening method and system for planning based on tile | |
| CN104519082A (en) | Expansion method and device of cloud computation | |
| CN115081122B (en) | Method, equipment and medium for automatically extracting geometric middle plane of plate-shell structure | |
| CN115662267A (en) | Map simplifying method, map simplifying device, storage medium and equipment | |
| CN107644139B (en) | Attribute mapping method from CAD model to CAE model | |
| US8813001B2 (en) | System and method for efficient and optimal minimum area retiming | |
| Pettarin et al. | Infectious random walks | |
| CN113538465A (en) | Automatic dividing method and device for regular and irregular polygon areas and storage medium | |
| CN108768735B (en) | Bipartite graph sampling method and device for test bed topological structure |
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 |