CN109803265A - A kind of optimization method based on the ant group algorithm of Voronoi diagram in WSN fence overlay strategy - Google Patents
A kind of optimization method based on the ant group algorithm of Voronoi diagram in WSN fence overlay strategy Download PDFInfo
- Publication number
- CN109803265A CN109803265A CN201910028083.8A CN201910028083A CN109803265A CN 109803265 A CN109803265 A CN 109803265A CN 201910028083 A CN201910028083 A CN 201910028083A CN 109803265 A CN109803265 A CN 109803265A
- Authority
- CN
- China
- Prior art keywords
- fence
- mobile node
- covering
- loophole
- group algorithm
- 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.)
- Pending
Links
Abstract
A kind of optimization method based on the ant group algorithm of Voronoi diagram in WSN fence overlay strategy, it is related to a kind of wireless sensor network optimizing method, this method covers loophole by voronoi polygon detecting fence, then the padding scheme using ant group algorithm control mobile node is proposed, for ant colony, search starting point and terminal are set, it enables ant colony forward lookup and is scanned for according to the most short side of the delaunay triangulation network, mobile node is filled for distance with every 2Rs further according to the filling method of mobile node, to obtain a shortest 1- fence covering；The present invention finds fence using voronoi figure and covers loophole, optimize ant group algorithm (Delaunay Ant Colony Optimization, D-ACO) to wireless sensor network (wireless sensor networks, WSNs) fence overlay strategy, the overall performance of WSN is improved.
Description
Technical field
The present invention relates to a kind of wireless sensor network optimizing methods, more particularly to a kind of ant based on Voronoi diagram
Optimization method of group's algorithm in WSN fence overlay strategy.
Background technique
With the development of science and technology with the popularization and application of wireless sensor network, life of the wireless sensor network at us
It is played an increasingly important role in work, especially at sea in terms of the natural calamities such as monitoring, forest fire, the condition of a disaster information
It obtains in time and all brings huge convenience to us.Effective fence nerve of a covering can not be formed for the stationary nodes of no locomotivity
Network, addition mobile node method is complicated, and fence length is too long.In order to improve repair fence covering loophole efficiency propose it is a kind of by
The fence of hybrid wireless sensor network disposition covers, and (is called Tyson by the Voronoi polygon that stationary nodes are formed first
Polygon or Dirichlet figure) the covering loophole that judge fence, recycle improved ant group algorithm control mobile node according to
The search strategy of the most short side of the delaunay triangulation network is disposed, to form complete 1- fence covering.It is tied by emulation
Fruit analysis shows, the D-ACO algorithm optimization fence overlay strategy of hybrid sensor network can effectively detect invasion mesh
Mark.
Summary of the invention
The purpose of the present invention is to provide one kind, which is directed to the deficiency of ant group algorithm, schemes to find grid using voronoi
Column covers loophole, optimizes ant group algorithm (Delaunay Ant Colony Optimization, D-ACO) to wireless sensor
Network (wireless sensor networks, WSNs) fence overlay strategy, improves the overall performance of WSN.
The purpose of the present invention is what is be achieved through the following technical solutions:
A kind of optimization method based on the ant group algorithm of Voronoi diagram in WSN fence overlay strategy, the method includes following
Process:
This method covers loophole by voronoi polygon detecting fence, then proposes to control mobile node using ant group algorithm
Padding scheme, search starting point and terminal are set for ant colony, enable ant colony forward lookup and according to the most short of the delaunay triangulation network
While scanning for, mobile node is filled for distance with every 2Rs further according to the filling method of mobile node, to obtain one most short
1- fence covering；
It specifically includes:
(1) maximum value of euclidean distance between node pair should be taken to obtain distance d when judgement covering loophole, then has formula
(1)；
(2) improvement of ant group algorithm, comprising:
A: it is scanned for according to the delaunay triangulation network most short side；
B: forward lookup；
(3) mobile node method is filled
Filling mobile node number calculation formula be
(2)；
(4) algorithm implementation procedure.
A kind of optimization method based on the ant group algorithm of Voronoi diagram in WSN fence overlay strategy, the calculation
Specific step is as follows for method implementation procedure:
Step1: in the long and narrow belt-like zone of target area A*B a large amount of stationary nodes of random placement and the starting point at both ends and
The stationary nodes of the fixed position of two of terminal, and corresponding voronoi polygon is generated according to stationary nodes deployment scenario；
Step2: judge to cover loophole with the presence or absence of fence between origin-to-destination by voronoi polygon, and if it exists, into
Row Step3 repairs fence and covers loophole；Fence covers loophole if it does not exist, then this covering meets fence covering and requires, and exits calculation
Method；
Step3: constructing the delaunay triangulation network according to the distribution of stationary nodes, then according to improved ant group algorithm, according to
Forward lookup rule is searched for and executed to the delaunay triangulation network most short side, and obtained path is the fence covering for needing to repair
Path, and calculate the length in path；
Step4: being the filling that distance carries out mobile node with 2Rs according to filling mobile node method；
Step5: fence covering leakage is judged whether there is to the long and narrow belt-like zone building voronoi polygon of whole A*B again
Hole；If still having, goes to Step3 and repair fence covering loophole, then go to Step6 if it does not exist；
Step6: it records the final position of mobile node and generates final wireless sensor network 1- fence covering coverage diagram.
The advantages and effects of the present invention are:
Barrier Coverage Problem is the basic problem in Wireless Sensor Network Coverage Problem.The invention proposes one kind to be based on
Optimization method of the ant group algorithm of Voronoi diagram in WSN fence overlay strategy, sheds in elongated zones at random for controlling
Stationary nodes in filling mobile node formed fence covering deployment strategy, thus solve need radio sensor network monitoring
The hybrid wireless sensor network of effective 1- fence covering can not be formed when intrusion target.
Detailed description of the invention
Fig. 1 includes or covers；
Fig. 2 one or more intersection point；
Fig. 3 certainly exists covering loophole；
Fig. 4 BC < 2Rs；
Fig. 5 BC=2Rs；
Fig. 6 BC > 2Rs；
Fig. 7 fills mobile node method.
Specific embodiment
The following describes the present invention in detail with reference to examples.
The present invention passes through voronoi polygon detecting fence covering loophole first, then proposes to control using ant group algorithm
The padding scheme of mobile node is arranged search starting point and terminal for ant colony, enables ant colony forward lookup and according to delaunay triangle
The most short side of net scans for, and mobile node is filled with every 2Rs further according to the filling method of mobile node for distance, to obtain
One shortest 1- fence covering.
The judgment method of 2.1 Voronoi polygon fence covering loophole
The graphics feature of Voronoi polygon is very suitable for judging that fence covering with the presence or absence of loophole, is covered in long and narrow fence
In cover area, pass through the maximum value and section of the distance between all sides to certain wireless sensor node to voronoi polygon d
The size of point the perception radius Rs is compared, and distance d is equal to two adjacent node Oa、ObThe maximum value of the half of distance.Wherein,
Some wireless sensor node is indicated to the maximum value of voronoi polygon edge distance with d, wireless sensor node indicates with O,
Length of each wireless sensor node apart from surrounding neighbours node is different, and judges that euclidean distance between node pair should be taken when covering loophole
Maximum value obtain distance d, then have formula
(1)
Each wireless sensor node, which has to obtain own location information and have, obtains adjacent node in voronoi polygon
The ability of location information.With the presence or absence of covering loophole between node, can be closed by comparing the size of distance d and node perceived radius
System, as d≤Rs, there is no covering loopholes then to certainly exist covering loophole as d > Rs.The sensing range of node and place
There may be following three kinds of positional relationships between voronoi polygon, regular hexagon indicates voronoi Polygonal Boundary, round
Indicate node perceived range.
1) coverage area of Voronoi polygon may completely include the sensing region of node, and distance d is greater than perception at this time
Radius Rs then certainly exists fence covering loophole；The coverage area of voronoi polygon may also be completely by the Perception Area of node
Domain is covered, and distance d is less than the perception radius Rs at this time, and there is no covering loopholes at this time.As shown in Fig. 2 .1.
2) side of the sensing range of node and Voronoi polygon is there are one, two or more intersection points, may with wherein
One side intersection, distance d is equal to the perception radius Rs at this time, and there is no covering loopholes.It may also intersect with plurality of side.At this time
Distance d is less than the perception radius Rs, and there is no covering loopholes, as shown in Fig. 2 .2.
3) when there is several wireless sensor nodes adjacent, as shown in Fig. 2 .3.The distance of three nodes between any two is all big
In the perception diameter 2Rs of sensor node, then fence covering loophole is certainly existed between wireless sensor node.
To sum up by analysis it is found that certainly exist covering loophole as d > Rs, according to the length of loophole on path, ant is utilized
Group's algorithm carries out the filling of mobile node.
The improvement of 2.2 ant group algorithms
In traditional ant group algorithm, ant towards food direction search for during can continuous release pheromone, Bu Guoxin
The concentration of breath element is increased as time increases, therefore ant is lower in the initial information element concentration at search initial stage, leads
Cause algorithm initial ranging efficiency slow, convergence rate is slow；With continuing to increase for pheromone concentration, into ant group algorithm after
Phase, pheromone concentration is excessively high to cause algorithm to fall into local optimum.For the two disadvantages, following two o'clock is carried out and has improved.
A: it is scanned for according to the delaunay triangulation network most short side
Initial ant group algorithm is that the pheromones left due to ant can be volatilized as time goes by, so elapsed time
The concentration of more long message element is also lower, and on the shorter path of distance, the ant round-trip time is shorter, the generation of pheromones
It is many that speed is greater than evaporation rate, therefore the concentration of pheromones is higher and higher, other ants also can preferentially select this pheromones
Then the higher shorter path of concentration produces new pheromones again, the round-trip number of ant on this final paths is most, letter
Cease plain concentration highest.But result in the initial information element of ant group algorithm deficient in this way, initial ranging low efficiency.And improved ant
Group's algorithm is scanned for according to the most short side of the delaunay triangulation network, is eliminated the time in many selection paths, is improved calculation
The initial ranging efficiency of method.Judge whether to need to fill mobile node thus according to delaunay triangle side length, divides three below
Kind situation is discussed.
(1) as BC < 2Rs, i.e., the distance of two wireless sensor nodes is less than the perception diameter of wireless sensor node
When, then there is no fence to cover loophole between two wireless sensor nodes of BC, does not need filling mobile node at this time.Such as Fig. 2 .4
It is shown.
Fig. 2 .4 BC < 2Rs
Fig.2.4 BC<2Rs
(2) as BC=2Rs, i.e., when the distance of two wireless sensor nodes is equal to the perception diameter of wireless sensor node, then
There is no fence to cover loophole between two wireless sensor nodes of BC, does not need filling mobile node at this time.As shown in Fig. 2 .5.
(3) as BC > 2Rs, i.e., the distance of two wireless sensor nodes is greater than the perception diameter of wireless sensor node
When, there is covering loophole and needs to fill mobile node in fence at this time.As shown in Fig. 2 .6.
B: forward lookup
Since simple regulation algorithm scans for being not enough to fill fence covering loophole according to the most short side of delaunay triangle,
Therefore regulation forward lookup rule.Search starting point and terminal are set for ant group algorithm first, that is, choose long and narrow fence overlay area
The stationary nodes of the leftmost side are search starting point, while the stationary nodes of the chosen area rightmost side are search terminal.Relative to tradition
Ant group algorithm for, forward lookup is the starting point that enables ant colony from elongated zones as terminal carries out forward lookup, it is not possible to negative side
To search.Endpoint algorithm is searched to stop.The optimal 1- fence covering road of a known beginning and end is finally obtained in this way
Diameter.
4.2.3 filling mobile node method
The 1- fence that forward lookup is decided is being carried out according to the most short side of improved ant group algorithm and the delaunay triangulation network
Mobile node is filled on overlay path, recycles improved ant group algorithm often to carry out the filling of mobile node for distance, directly
Until searching the stationary nodes of the rightmost side of long and narrow fence overlay area, the covering of 1- fence is ultimately formed.Fill movable joint
Point number calculation formula be
(2)
It needs to be rounded N at this time and is.As shown in Fig. 2 .7, there are fence coverings between BC two o'clock
Loophole is that distance is filled with 4 mobile nodes altogether with 2Rs.
4.2.4 algorithm implementation procedure
Specific step is as follows for algorithm:
Step1: in the long and narrow belt-like zone of target area A*B a large amount of stationary nodes of random placement and the starting point at both ends and
The stationary nodes of the fixed position of two of terminal, and corresponding voronoi polygon is generated according to stationary nodes deployment scenario.
Step2: judged by voronoi polygon from whether there is fence covering loophole between origin-to-destination, if depositing
It is carrying out Step3 and is repairing fence covering loophole；Fence covers loophole if it does not exist, then this covering meets fence covering and requires, and moves back
Algorithm out.
Step3: constructing the delaunay triangulation network according to the distribution of stationary nodes, then according to improved ant group algorithm,
Forward lookup rule is searched for and executed according to the delaunay triangulation network most short side, and obtained path is the fence for needing to repair
Overlay path, and calculate the length in path.
Step4: being the filling that distance carries out mobile node with 2Rs according to filling mobile node method.
Step5: fence is judged whether there is to the long and narrow belt-like zone building voronoi polygon of whole A*B again and is covered
Lid loophole.If still having, goes to Step3 and repair fence covering loophole, then go to Step6 if it does not exist.
Step6:, which recording the final position of mobile node, and generates final wireless sensor network 1- fence covers
Gai Tu.
Claims (2)
1. a kind of optimization method based on the ant group algorithm of Voronoi diagram in WSN fence overlay strategy, which is characterized in that institute
The method of stating includes following procedure:
This method covers loophole by voronoi polygon detecting fence, then proposes to control mobile node using ant group algorithm
Padding scheme, search starting point and terminal are set for ant colony, enable ant colony forward lookup and according to the most short of the delaunay triangulation network
While scanning for, mobile node is filled for distance with every 2Rs further according to the filling method of mobile node, to obtain one most short
1- fence covering；
It specifically includes:
(1) maximum value of euclidean distance between node pair should be taken to obtain distance d when judgement covering loophole, then has formula
(1)；
(2) improvement of ant group algorithm, comprising:
A: it is scanned for according to the delaunay triangulation network most short side；
B: forward lookup；
(3) mobile node method is filled
Filling mobile node number calculation formula be
(2)；
(4) algorithm implementation procedure.
2. a kind of optimization based on the ant group algorithm of Voronoi diagram in WSN fence overlay strategy according to claim 1
Method, which is characterized in that specific step is as follows for the algorithm implementation procedure:
Step1: in the long and narrow belt-like zone of target area A*B a large amount of stationary nodes of random placement and the starting point at both ends and
The stationary nodes of the fixed position of two of terminal, and corresponding voronoi polygon is generated according to stationary nodes deployment scenario；
Step2: judge to cover loophole with the presence or absence of fence between origin-to-destination by voronoi polygon, and if it exists, into
Row Step3 repairs fence and covers loophole；Fence covers loophole if it does not exist, then this covering meets fence covering and requires, and exits calculation
Method；
Step3: constructing the delaunay triangulation network according to the distribution of stationary nodes, then according to improved ant group algorithm, according to
Forward lookup rule is searched for and executed to the delaunay triangulation network most short side, and obtained path is the fence covering for needing to repair
Path, and calculate the length in path；
Step4: being the filling that distance carries out mobile node with 2Rs according to filling mobile node method；
Step5: fence covering leakage is judged whether there is to the long and narrow belt-like zone building voronoi polygon of whole A*B again
Hole；If still having, goes to Step3 and repair fence covering loophole, then go to Step6 if it does not exist；
Step6: it records the final position of mobile node and generates final wireless sensor network 1- fence covering coverage diagram.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910028083.8A CN109803265A (en) | 2019-01-11 | 2019-01-11 | A kind of optimization method based on the ant group algorithm of Voronoi diagram in WSN fence overlay strategy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910028083.8A CN109803265A (en) | 2019-01-11 | 2019-01-11 | A kind of optimization method based on the ant group algorithm of Voronoi diagram in WSN fence overlay strategy |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109803265A true CN109803265A (en) | 2019-05-24 |
Family
ID=66557170
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910028083.8A Pending CN109803265A (en) | 2019-01-11 | 2019-01-11 | A kind of optimization method based on the ant group algorithm of Voronoi diagram in WSN fence overlay strategy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109803265A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112231939A (en) * | 2020-01-03 | 2021-01-15 | 郑州轻工业大学 | Ant colony sequencing positioning method for circular layout in cable processing |
| CN115119215A (en) * | 2022-07-04 | 2022-09-27 | 河南科技大学 | Optimal path repairing method for grid coverage hole in natural protected ground |
| CN115598670A (en) * | 2022-09-29 | 2023-01-13 | 西安邮电大学（Cn） | Method for monitoring and positioning interference source by combining triangulation network and ant colony algorithm |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104159236A (en) * | 2014-06-23 | 2014-11-19 | 江南大学 | Wireless sensor network node coverage optimization method based on Voronoi diagram for blind area |
| CN107295534A (en) * | 2017-07-06 | 2017-10-24 | 北京农业信息技术研究中心 | A kind of oriented sensor coverage Enhancement Method of agriculture wireless multimedia sensor network |
| CN107734510A (en) * | 2017-11-03 | 2018-02-23 | 中国矿业大学(北京) | A kind of fence covering method of hybrid wireless sensor node |
-
2019
- 2019-01-11 CN CN201910028083.8A patent/CN109803265A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104159236A (en) * | 2014-06-23 | 2014-11-19 | 江南大学 | Wireless sensor network node coverage optimization method based on Voronoi diagram for blind area |
| CN107295534A (en) * | 2017-07-06 | 2017-10-24 | 北京农业信息技术研究中心 | A kind of oriented sensor coverage Enhancement Method of agriculture wireless multimedia sensor network |
| CN107734510A (en) * | 2017-11-03 | 2018-02-23 | 中国矿业大学(北京) | A kind of fence covering method of hybrid wireless sensor node |
Non-Patent Citations (2)
| Title |
|---|
| 党小超 等: "基于Voronoi的无线传感器网络栅栏覆盖策略", 《计算机工程与应用》 * |
| 张娟: "改进ACO算法在DTSP中的应用研究", 《中国优秀博硕士学位论文全文数据库(硕士) 信息科技辑》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112231939A (en) * | 2020-01-03 | 2021-01-15 | 郑州轻工业大学 | Ant colony sequencing positioning method for circular layout in cable processing |
| CN112231939B (en) * | 2020-01-03 | 2024-02-02 | 郑州轻工业大学 | Ant colony sequencing and positioning method for circular layout in cable processing |
| CN115119215A (en) * | 2022-07-04 | 2022-09-27 | 河南科技大学 | Optimal path repairing method for grid coverage hole in natural protected ground |
| CN115119215B (en) * | 2022-07-04 | 2023-09-22 | 河南科技大学 | Optimal path repairing method for fence coverage holes in natural protected area |
| CN115598670A (en) * | 2022-09-29 | 2023-01-13 | 西安邮电大学（Cn） | Method for monitoring and positioning interference source by combining triangulation network and ant colony algorithm |
| CN115598670B (en) * | 2022-09-29 | 2024-03-05 | 西安邮电大学 | Method for monitoring and positioning interference source by combining triangular network and ant colony algorithm |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109803265A (en) | A kind of optimization method based on the ant group algorithm of Voronoi diagram in WSN fence overlay strategy | |
| Yan et al. | Connectivity-based distributed coverage hole detection in wireless sensor networks | |
| CN105979508B (en) | Node method for secret protection based on orientation stochastic route in wireless sensor network | |
| US20130058352A1 (en) | Method and device for forwarding data packets | |
| Rathore et al. | Towards Trusted Green Computing for Wireless Sensor Networks: Multi Metric Optimization Approach. | |
| CN112954769A (en) | Underwater wireless sensor network routing method based on reinforcement learning | |
| CN109547351A (en) | Method for routing based on Q study and trust model in Ad Hoc network | |
| CN110267279A (en) | Three-dimensional ECDV-Hop localization method based on differential evolution | |
| Khan et al. | Delay and throughput performance improvement in wireless sensor and actor networks | |
| Chang et al. | Active route-guiding protocols for resisting obstacles in wireless sensor networks | |
| CN109511152A (en) | A kind of balanced cluster-dividing method of terminaloriented communication access net perception monitoring | |
| CN107566984B (en) | Source position privacy protection method based on sector area in WSNs | |
| CN104125572B (en) | The Sybil attack detection methods cooperated based on node | |
| CN105611536B (en) | The method for resisting black hole attack in wireless sensor network based on active probe | |
| Tian et al. | Energy-efficient data dissemination protocol for detouring routing holes in wireless sensor networks | |
| CN108540989B (en) | Simple complex simplification method and equipment for wireless sensor network | |
| Zhu et al. | DESLR: Energy-efficient and secure layered routing based on channel-aware trust model for UASNs | |
| Ghosh et al. | Limiting the impact of mobility on ad hoc clustering | |
| CN106713477A (en) | Internet of Vehicles network dynamic evolution method based on population competition | |
| CN107172676B (en) | Wireless sensor network routing method based on node redundancy and graph coloring algorithm | |
| Zhou et al. | Improving mobile target detection on randomly deployed sensor networks | |
| Lemmon et al. | Review of Location-Aware Routing Protocols. | |
| Uzun et al. | Distributed connectivity restoration in underwater acoustic sensor networks via depth adjustment | |
| CN110708704B (en) | Underwater acoustic sensor network node deployment method based on depth adjustment | |
| Golshahi et al. | Implementing an ACO routing algorithm for AD-HOC networks |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190524 |
|
| WD01 | Invention patent application deemed withdrawn after publication |