CN110708679B - Coverage method for wireless sensor network to distinguish different attention areas - Google Patents
Coverage method for wireless sensor network to distinguish different attention areas Download PDFInfo
- Publication number
- CN110708679B CN110708679B CN201910825734.6A CN201910825734A CN110708679B CN 110708679 B CN110708679 B CN 110708679B CN 201910825734 A CN201910825734 A CN 201910825734A CN 110708679 B CN110708679 B CN 110708679B
- Authority
- CN
- China
- Prior art keywords
- nodes
- node
- monitoring
- coverage
- key
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/38—Services specially adapted for particular environments, situations or purposes for collecting sensor information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/08—Testing, supervising or monitoring using real traffic
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Testing Or Calibration Of Command Recording Devices (AREA)
- Arrangements For Transmission Of Measured Signals (AREA)
Abstract
The invention discloses a covering method for distinguishing areas with different attention degrees by a wireless sensor network, relates to a wireless network area covering method, and mainly aims at solving the problem that the underwater wireless sensor network lacks attention degree covering with priority distinguishing, and designs a special low-cost underwater wireless sensor network covering method in the water areas with different attention degrees. The method utilizes an improved virtual force field method to adjust the node position, and different attention levels in the water area are distinguished under the condition that low redundancy and low coverage holes of the nodes are guaranteed. And reduces system cost using a lower cost mobility-limited node compared to autonomous underwater vehicles. The underwater wireless sensor network has lower system cost while meeting the coverage of a monitored water area, and is more excellent in small-scale underwater wireless sensor network.
Description
Technical Field
The invention relates to a wireless network area coverage method, in particular to a coverage method for distinguishing areas with different attention degrees by a wireless sensor network.
Background
The coverage control problem is a fundamental work of wireless sensor network research, and is also one of important influence factors for determining the performance of the wireless sensor network in the water environment, and the coverage quality is influenced by the network scale and the system cost. At present, most of underwater wireless sensor network coverage methods only consider uniformly covering a monitoring area, and do not consider the problem of priority layering in the monitoring area. Under the condition that saturation coverage of a monitored water area is not needed, coverage redundancy of the nodes can be increased by using a uniform coverage method, the consumption of the number of the nodes is increased, the cost of the system is increased, and the further application of the underwater wireless sensor network is not facilitated.
Disclosure of Invention
The invention aims to provide a covering method for distinguishing different attention areas of a wireless sensor network, and designs a special low-cost covering method for the underwater wireless sensor network in the water areas with different attention degrees, which mainly aims at solving the problem that the underwater wireless sensor network lacks attention coverage with priority distinguishing. The coverage of a monitored water area is met, meanwhile, the system cost is lower, and the performance is more excellent in a small-scale underwater wireless sensor network.
The purpose of the invention is realized by the following technical scheme:
a coverage method for distinguishing areas with different attention degrees by a wireless sensor network divides a monitored water area into two areas: a key focus layer and a non-key focus layer; the key layer of concern is the level that most nodes need to be invested in the network coverage method to ensure the coverage rate of the nodes, and the performance of the network is determined; the closer to the position of the key attention layer, the higher the density of the nodes is, the higher the coverage quality is; the non-key attention layer only needs to ensure lower coverage strength in a network system, only a small number of nodes are needed for covering the area, and the weight occupied in the network is smaller; the monitoring area is divided into a key monitoring water surface layer and a low-priority lower water surface, the monitoring requirements of a key monitoring layer are met preferentially, on the premise that the requirements of the key monitoring layer are guaranteed, the settlement nodes complete low-priority level monitoring, and the nodes in the detection area are not uniformly arranged; the virtual force algorithm is mostly applied to a two-dimensional space ground environment, and sensor nodes are uniformly distributed in a monitoring range through multiple iterations; the two-dimensional virtual force algorithm in the underwater environment cannot meet the requirements, so that the virtual force field algorithm needs to be improved adaptively; the underwater environment is complex, the node cost is high, the method is not suitable for intensive deployment, and the nodes with the lowest cost and the lowest possible number are required to be deployed;
the sensor node can be subjected to more than one virtual force from other nodes in the network, and the virtual force F of a plurality of nodesvtExpressed as:
wherein the plurality of nodes generate a force F due to different coordinates in the X-axis and Z-axismAlso of different magnitude, angle theta being FmAnd FnThe included angle of (A);
and a virtual resultant force F between the nodesvrExpressed as:
the coverage method for distinguishing areas with different attention degrees by using the wireless sensor network is characterized in that the height h of the monitoring layer of the key water areadAnd FbThe relationship exists as follows:
node S2Is subjected to S3Is removed and replaced by the gravity F given by the surface layer of the water surfacebAdjusting the heights of the nodes and the key monitoring water areas, wherein omega is a key attention coefficient, k is a virtual force parameter, and the adjustment is carried out according to experience;
said FnIs a node S1Is applied to node S2Repulsive force Fn，FmIs FnFunction as FmVertically downward force.
The coverage method for distinguishing areas with different attention degrees by the wireless sensor network is characterized in that the distance between the two nodes is √ 3RsThus, the distance threshold d between two sensor nodes can be settIs arranged as √ 3Rs(ii) a If the distance between nodes is less than √ 3RsWhen the distance between the nodes is too close, the adjustment is needed; the distance it needs to move is:
wherein (x)i,xj），（yi,yj），（zi,zj) Are respectively S1，S2，S3Coordinates of three points, dtIs the distance threshold between two sensor nodes; and solving the moving distance of each node according to the formula, updating the network position, increasing the distance of the mobile node and reducing the coverage redundancy.
The coverage method for distinguishing the areas with different attention degrees by the wireless sensor network comprises the following steps:
step 1, determining the length, width, height, L, H, W, the number n of sensor nodes and the sensing radius R of a monitoring area rangesRadius of communication RcThreshold value dtMaximum number of iterations;
step 4, calculating the virtual resultant force F borne by the nodes according to the formulas (2) and (3)vrAnd updating the node position according to the formula (4);
step 5, iteration is carried out for multiple times, the iteration is stopped when the maximum iteration time is reached, and otherwise, the step 3 is returned;
step 6 ends the algorithm.
The invention has the advantages and effects that:
the invention utilizes the improved virtual force field method to adjust the node position, and differentiates different attention levels in the water area under the condition of ensuring low redundancy and low coverage holes of the node. And reduces system cost using a lower cost mobility-limited node compared to autonomous underwater vehicles. The underwater wireless sensor network has lower system cost while meeting the coverage of a monitored water area, and is more excellent in small-scale underwater wireless sensor network.
Drawings
FIG. 1 is a schematic diagram of a limited node force of the present invention;
FIG. 2(1) is a diagram of the present invention without overlapping blind areas;
FIG. 2(2) is a diagram showing the presence of overlapping and non-blind areas according to the present invention;
FIG. 3 is a flow chart of the steps executed by the method of the present invention.
Detailed Description
The present invention will be described in detail with reference to the embodiments shown in the drawings.
The principle of the method of the invention is described as follows:
the underwater sensor network covering method divides a monitored water area into two areas: an emphasis layer and a non-emphasis layer. The important layer of interest is the level at which most nodes need to be invested in the network coverage method to ensure the coverage rate, and the performance of the network is determined. The closer to the key layer of interest, the greater the density of nodes, the higher the quality of coverage. The non-important layer only needs to ensure lower coverage strength in the network system, only a small number of nodes are needed for covering the area, and the weight occupied in the network is smaller.
The monitoring area is divided into a water surface layer of key monitoring and a lower water surface layer of low priority, the monitoring requirements of the key monitoring layer are met preferentially, on the premise that the requirements of the key monitoring layer are guaranteed, the settlement nodes complete the level monitoring of the low priority, and the nodes in the detection area are not evenly distributed. The virtual force algorithm is mostly applied to a two-dimensional space ground environment, and sensor nodes are uniformly distributed in a monitoring range through multiple iterations. The two-dimensional virtual force algorithm in the underwater environment cannot meet the requirements, so that the virtual force field algorithm needs to be improved adaptively. And because the underwater environment is complex, the node cost is high, the method is not suitable for intensive deployment, and the nodes with the lowest cost and the lowest possible number are required to be deployed.
The mobile limited node in the network only moves up and down in the Y-axis direction by controlling the buoyancy of the node, and the stress condition is shown in figure 1: FIG. 1 is a schematic diagram of a limited node force;
the node can only move up and down on the Y axis, and the node should preferably complete the monitoring task in the key monitoring area. Wherein the mutual attraction of the limited nodes can not provide the optimization of the node positions in the research state, so the nodes are combinedS2Is subjected to S3Is removed and replaced by the gravity F given by the surface layer of the water surfacebThe height of the node and the key monitoring water area is adjusted.
Wherein the height h of the monitoring layer of the key water areadAnd FbThe relationship exists as follows:
wherein omega is a key attention coefficient, k is a virtual force parameter, and the adjustment is carried out according to experience. FbThe larger the node is, the more the node is collected to the key monitoring water area, the larger redundancy range can be generated while the coverage rate of the monitoring water area is improved, and conversely FbThe smaller the node coverage density decreases, and the coverage redundancy decreases at the same time. The node S can only move in the Y axis because the movement of the node is limited, so that the node S1Is applied to node S2Repulsive force FnFunction as FmAnd the force should be kept vertically downward. The coverage rate of a key monitoring area is ensured while a large amount of redundancy of the node coverage area is prevented. At this time, the gravity F given by the important monitoring layer is introducedbAnd the water area is monitored mainly on the surface of the water layer S1Is subjected to S2The repulsion of (c) cannot improve node position and in order to reduce coverage redundancy, the non-entry into the algorithm calculation should be ignored.
The sensor node can be subjected to more than one virtual force from other nodes in the network, and the virtual force F of a plurality of nodesvtCan be expressed as:
wherein the plurality of nodes generate a force F due to different coordinates in the X-axis and Z-axismAlso of different magnitude, angle theta being FmAnd FnThe included angle of (a).
And a virtual resultant force F between the nodesvrCan be expressed as:
as can be seen from the coverage in fig. 2(1), the monitoring areas of the three sensors have no overlapping portion, and the coverage area is the largest. However, a coverage hole is generated in the sensor node, and at this time, if the coverage rate needs to be improved, one node needs to be used again, which results in redundancy of the coverage area. FIG. 2(1) shows no overlapping blind areas; FIG. 2(2) shows overlapping and non-blind areas.
For the case of overlapping and non-blind area in fig. 2(2), although the three sensor nodes are partially overlapped with each other, the sensor nodes can be removed to generate the blind area, and the nodes are saved compared with the former mode.
According to the coverage method of FIG. 2(2), the distance between two nodes can be calculated as √ 3RsThus, the distance threshold d between two sensor nodes can be settIs arranged as √ 3Rs. If the distance between nodes is less than √ 3RsIt is said that the distance between nodes is too close and needs to be adjusted. The distance it needs to move is:
wherein (x)i,xj），（yi,yj），（zi,zj) Are respectively S1，S2，S3Coordinates of three points, dtIs the distance threshold between two sensor nodes. And solving the moving distance of each node according to the formula, updating the network position, increasing the distance of the mobile node and reducing the coverage redundancy.
The algorithm comprises the following steps:
step 1, determining the length, width, height, L, H, W, the number N of sensor nodes and the sensing radius R of a monitoring area rangesRadius of communication RcThreshold value dtMaximum number of iterations.
And 3, determining the position information of each node and the position information of the neighbor nodes thereof.
Step 4, calculating the virtual resultant force F borne by the nodes according to the formulas (2) and (3)vrAnd updating the node position according to equation (4).
And 5, iterating for multiple times until the maximum iteration time is reached, and returning to the step 3 if the maximum iteration time is not reached.
Step 6 ends the algorithm.
Claims (2)
1. A coverage method for differentiating areas with different attention degrees by a wireless sensor network is characterized by comprising the following steps: dividing a monitoring water area into two areas by using an underwater sensor network covering method; a key focus layer and a non-key focus layer; the key layer of concern is the level that most nodes need to be invested in the network coverage method to ensure the coverage rate of the nodes, and the performance of the network is determined; the closer to the position of the key attention layer, the higher the density of the nodes is, the higher the coverage quality is; the non-key attention layer only needs to ensure lower coverage strength in a network system, only a small number of nodes are needed for covering the area, and the weight occupied in the network is smaller; the monitoring area is divided into a key monitoring water surface layer and a low-priority lower water surface, the monitoring requirements of a key monitoring layer are met preferentially, on the premise that the requirements of the key monitoring layer are guaranteed, the settlement nodes complete low-priority level monitoring, and the nodes in the detection area are not uniformly arranged; the virtual force algorithm is mostly applied to a two-dimensional space ground environment, and sensor nodes are uniformly distributed in a monitoring range through multiple iterations; the two-dimensional virtual force algorithm in the underwater environment cannot meet the requirements, so that the virtual force field algorithm needs to be improved adaptively, namely, the node position is adjusted by utilizing the improved virtual force field method, and different attention levels in the water area are classified under the condition of ensuring low redundancy of the nodes and low coverage holes; the underwater environment is complex, the node cost is high, the method is not suitable for intensive deployment, and the nodes with the lowest cost and the lowest possible number are required to be deployed;
the sensor node can be subjected to more than one virtual force from other nodes in the network, and the virtual force F of a plurality of nodesvtIs shown as：
Wherein the plurality of nodes generate a force F due to different coordinates in the X-axis and Z-axismAlso of different magnitude, angle theta being FmAnd FnThe included angle of (A);
and a virtual resultant force F between the nodesvrExpressed as:
height h of the key water area monitoring layerdAnd FbThe relationship exists as follows:
node S2Is subjected to S3Is removed and replaced by the gravity F given by the surface layer of the water surfacebAdjusting the heights of the nodes and the key monitoring water areas, wherein omega is a key attention coefficient, k is a virtual force parameter, and the adjustment is carried out according to experience;
said FnIs a node S1Is applied to node S2Repulsive force Fn，FmIs FnFunction as FmVertically downward force;
the distance between the nodes is √ 3RsThus, the distance threshold d between two sensor nodes can be settIs arranged as √ 3Rs(ii) a If the distance between nodes is less than √ 3RsWhen the distance between the nodes is too close, the adjustment is needed; the distance it needs to move is:
wherein (x)i,xj），（yi,yj），（zi,zj) Are respectively S1，S2，S3Coordinates of three points, dtIs the distance threshold between two sensor nodes; and solving the moving distance of each node according to the formula, updating the network position, increasing the distance of the mobile node and reducing the coverage redundancy.
2. The method for covering the wireless sensor network to distinguish the areas with different attention degrees according to claim 1, wherein the algorithm is executed by the following steps:
step 1, determining the length, width, height, L, H, W, the number n of sensor nodes and the sensing radius R of a monitoring area rangesRadius of communication RcThreshold value dtMaximum number of iterations;
step 2, according to the formula (1), the water environment is subjected to priority division, and the important monitoring gravity F is determinedbInter-node virtual force parameter k;
step 3, determining the position information of each node and the position information of the neighbor nodes thereof;
step 4, calculating the virtual resultant force F borne by the nodes according to the formulas (2) and (3)vrAnd updating the node position according to the formula (4);
step 5, iteration is carried out for multiple times, the iteration is stopped when the maximum iteration time is reached, and otherwise, the step 3 is returned;
step 6 ends the algorithm.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910825734.6A CN110708679B (en) | 2019-09-03 | 2019-09-03 | Coverage method for wireless sensor network to distinguish different attention areas |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910825734.6A CN110708679B (en) | 2019-09-03 | 2019-09-03 | Coverage method for wireless sensor network to distinguish different attention areas |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110708679A CN110708679A (en) | 2020-01-17 |
| CN110708679B true CN110708679B (en) | 2022-03-04 |
Family
ID=69193288
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910825734.6A Active CN110708679B (en) | 2019-09-03 | 2019-09-03 | Coverage method for wireless sensor network to distinguish different attention areas |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110708679B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20100072953A (en) * | 2008-12-22 | 2010-07-01 | 주식회사 케이티 | System and method for congestion control in wireless sensor network |
| CN102647726A (en) * | 2012-02-17 | 2012-08-22 | 无锡英臻科技有限公司 | Balancing optimizing strategy for energy consumption of coverage of wireless sensor network |
| CN107295541A (en) * | 2016-03-31 | 2017-10-24 | 扬州大学 | A kind of radio sensing network coverage optimization method based on fictitious force and glowworm swarm algorithm |
| CN109587698A (en) * | 2018-12-10 | 2019-04-05 | 浙江工业大学 | A kind of modified directional sensor network energy conservation covering method of fictitious force |
-
2019
- 2019-09-03 CN CN201910825734.6A patent/CN110708679B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20100072953A (en) * | 2008-12-22 | 2010-07-01 | 주식회사 케이티 | System and method for congestion control in wireless sensor network |
| CN102647726A (en) * | 2012-02-17 | 2012-08-22 | 无锡英臻科技有限公司 | Balancing optimizing strategy for energy consumption of coverage of wireless sensor network |
| CN107295541A (en) * | 2016-03-31 | 2017-10-24 | 扬州大学 | A kind of radio sensing network coverage optimization method based on fictitious force and glowworm swarm algorithm |
| CN109587698A (en) * | 2018-12-10 | 2019-04-05 | 浙江工业大学 | A kind of modified directional sensor network energy conservation covering method of fictitious force |
Non-Patent Citations (4)
| Title |
|---|
| Virtual_force_based_individual_particle_optimization_for_coverage_in_wireless_sensor_networks;A. Dirafzoon et;《CCECE 2010》;20100916;全文 * |
| 一种小规模水下无线传感器网络的部署算法;罗强等;《传感技术学报》;20110731(第07期);全文 * |
| 基于网格划分和虚拟力的水下传感器网络部署策略;王军等;《电子技术应用》;20160228(第02期);全文 * |
| 基于虚拟力的异构无线传感器网络覆盖优化策略;王婷婷等;《传感技术学报》;20160815(第08期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110708679A (en) | 2020-01-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107295541B (en) | Wireless sensor network coverage optimization method based on virtual force and firefly algorithm | |
| CN103067929B (en) | Depth adjustment method used for underwater sensor network node and based on Thiessen diagram | |
| CN107396374B (en) | Covering method based on virtual force and Thiessen polygon | |
| CN104050390B (en) | Mobile robot path planning method based on variable-dimension particle swarm membrane algorithm | |
| CN106658603B (en) | Load-balanced wireless sensor network routing energy-saving method | |
| CN102752761B (en) | Particle swarm-based coverage optimization method of wireless sensor network mobile node | |
| CN104159236B (en) | Wireless sensor network node coverage optimization method based on Voronoi diagram blind area | |
| CN106792750B (en) | A kind of node deployment method based on guiding particle swarm algorithm | |
| CN111065103A (en) | Multi-objective optimization wireless sensor network node deployment method | |
| Song et al. | Nodes deployment optimization algorithm based on improved evidence theory of underwater wireless sensor networks | |
| CN103269506B (en) | A kind of mobile wireless sensor network method for routing disturbing perception | |
| Kong et al. | An improved method of WSN coverage based on enhanced PSO algorithm | |
| CN107124748B (en) | A kind of Sink node movement routine planing method of mobile sensor network | |
| CN115484612B (en) | Wireless sensor network positioning coverage positioning method and system | |
| Du | Method for the optimal sensor deployment of WSNs in 3D terrain based on the DPSOVF algorithm | |
| CN107071848A (en) | A kind of target tracking algorism based on cluster structured reduction energy consumption | |
| CN110708679B (en) | Coverage method for wireless sensor network to distinguish different attention areas | |
| CN115145315A (en) | Unmanned aerial vehicle path planning method suitable for chaotic environment and with improved A-star algorithm | |
| CN113905386B (en) | Mesh gateway deployment optimization method based on self-adaptive hybrid particle swarm algorithm | |
| Guang et al. | Dynamic data collection algorithm based on mobile edge computing in underwater internet of things | |
| CN115209425B (en) | Unmanned aerial vehicle deployment method based on wireless sensor distribution | |
| CN107820207A (en) | The node fuzzy message three-dimensional localization model of the adaptive sub-clustering of dimensionality reduction | |
| CN110442138A (en) | A kind of control of robot cluster and barrier-avoiding method | |
| Li | PSO based wireless sensor networks coverage optimization on DEMs | |
| CN113741530B (en) | Data acquisition method based on intelligent perception of multiple unmanned aerial vehicles |
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 |