CN111314927B - Area k-level coverage starting method based on Lerlo triangle wireless sensor - Google Patents
Area k-level coverage starting method based on Lerlo triangle wireless sensor Download PDFInfo
- Publication number
- CN111314927B CN111314927B CN202010185214.6A CN202010185214A CN111314927B CN 111314927 B CN111314927 B CN 111314927B CN 202010185214 A CN202010185214 A CN 202010185214A CN 111314927 B CN111314927 B CN 111314927B
- Authority
- CN
- China
- Prior art keywords
- sub
- unit
- node
- level
- sensor
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/021—Services related to particular areas, e.g. point of interest [POI] services, venue services or geofences
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
A method for starting coverage of a region of a wireless sensor based on a Lerlo triangle in a k level comprises the following steps: 1) Dividing a target area A by taking a Lerlo triangle with r/2 as a side length as a unit; 2) Will split the unit rt i Joining a set of units Sub i The method comprises the steps of carrying out a first treatment on the surface of the 3) Calculating the weight value of each unit coverage
Sub is arranged from small to large according to weight value i The method comprises the steps of carrying out a first treatment on the surface of the 4) Activating all sensors to be in monitoring state, and calculating weight value of each sensor
Adding a monitoring sensor set Sub according to the weight value s The method comprises the steps of carrying out a first treatment on the surface of the 5) Operation unit set Sub i The method comprises the steps of carrying out a first treatment on the surface of the 6) Operating a first level startup set Sub k The method comprises the steps of carrying out a first treatment on the surface of the 7) Listening sensor set Sub s All the monitoring nodes in the network are switched to a sleep state. The invention has the advantages of low starting node number, low consumption and high space utilization rate.
Description
Technical Field
The invention relates to a wireless sensor area coverage starting method, in particular to a k-level area coverage-oriented method for reducing the starting quantity of area sensor nodes and prolonging the life cycle of a system network.
Background
The wireless sensor network is widely focused in the fields of monitoring, transmission and the like due to the characteristics of convenience in deployment, high precision, high reliability and the like. In recent years, with the high-speed development of the technical level of the sensor, the application field of the sensor extends to the aspects of social life, and higher requirements are also put forward on the monitoring service standard of the wireless sensor network. Different application fields have different requirements on network coverage quality, network lifetime and other performances. The sensor can help people collect information and quickly make decisions according to information content according to the capabilities of the physical world and the digital world, so that the sensor has larger application potential in some application scenes with higher requirements on real-time performance, such as monitoring of enemy units in military battlefields, monitoring of wild animals and fire disasters in forests, and the like, and the sensor network which is required to be deployed by some applications can provide good coverage service quality, and can meet the requirements of network safety and reliability.
The area coverage problem is a basic problem in a wireless sensor network, and mainly solves the problem of how to ensure that a target area is effectively monitored by a node after the sensor node is deployed, reflects the monitoring quality of the sensor node on the target area, and is one of important evaluation indexes of network service quality. The deployment of the wireless sensor network nodes can be divided into deterministic deployment and random deployment modes. When the network is environmentally friendly and the network is not large-scale, a deterministic deployment approach is typically used to determine node locations. When the node position cannot be deployed manually in some cases, such as a natural environment bad, the sensor node needs to be deployed by means of tools like an aircraft, and such methods are called random deployment modes. Because the node position cannot be determined in advance in the deployment mode, compared with the deterministic deployment mode, the number of the sensor nodes deployed randomly is often far greater than the number of the nodes required for realizing complete coverage, so that the problem that the nodes cannot continuously execute monitoring tasks due to self energy exhaustion or external damage is avoided, and the problem that the node coverage is difficult to control is also brought.
Some important target areas often require higher monitoring quality requirements, and multiple coverage needs to be performed on the target areas, which is a k-level area coverage problem. The k-level coverage problem with random node deployment, sensors typically use an energy-limited battery supply because the sensor nodes are limited by manufacturing costs and size. When the sensor nodes are actually deployed at random, the target area is larger, the network deployment scale is larger, the node distribution range is wider, the deployment environment is complex, and therefore, the battery energy is very difficult to supplement by replacing the battery or charging means. The prior researches prove that two methods can effectively prolong the life cycle of the network: the first is to control the density of nodes and the second is node scheduling state. For the first approach, it is difficult to reduce the density of deployed sensors in the case of random deployment. For the second method, under the condition that the service performance and coverage requirements of the system are not reduced, a part of active nodes are selected, and the rest nodes are in a sleep state, so that the number of the active nodes is reduced, the efficiency of improving the energy utilization of the system can be improved, the life cycle of the system network is prolonged, and the loss is reduced. The method presented herein solves this problem.
Disclosure of Invention
In order to solve the defects of the prior art of regional random deployment, the invention provides a k-level coverage starting method of a wireless sensor region based on a Lorentz triangle, which has the advantages of low starting node quantity, low consumption and high space utilization rate, and reduces the active quantity of the sensor nodes under the condition of ensuring the coverage of the k-level region, and starts the regional nodes by using the Lorentz triangle with the radius of r/2 as a basic unit, thereby prolonging the life cycle of the wireless sensor network. According to application requirements, the sensors are set to be isomorphic sensors, the coverage radius of the sensors is r, the communication radius of the sensors is 2r, and the sensors can communicate with each other so as to sense the distance and coverage content of each other. Dividing a target area by taking a Lorentz triangle with r/2 as a side length as a unit, setting a unit weight function for the unit according to the number covered by the sensor, and setting a sensor weight function for the unit covered by the sensor. The state of the sensor is divided into three states of sleep, monitoring and starting.
In order to solve the technical problems, the invention provides the following technical scheme:
a method for starting coverage of a region of a wireless sensor based on a Lerlo triangle in a k level comprises the following steps:
1) Activation ofAll sensors put the sensors into listening state by taking the Lorentzian triangle as unit rt i Rule division RT for region A 2/r (A) The unit has a side length of r/2, and the sensor coverage radius is r and the communication radius is 2r;
2) Will split the unit rt i Joining a set of units Sub i ，rt i ∈RT 2/r (A)；
3) Number of counts covered in units by sensor integrity s As a unit weight function
Calculating the weight value of each cell coverage +.>
Ranking RT from small to large according to weight value 2/r (A)；
4) Number of complete coverage units by sensor Count i For initial weighting values of sensors
Calculating the weight value +.>
Adding a monitoring sensor set Sub according to the weight value s ；
5) Operation unit set Sub i The process is as follows:
(5.1) judging Sub i Whether empty or not, if empty, enter 6), if not, sub i Is selected from the first unit rt i ；
(5.2) determination unit rt i Whether or not to be covered, if so, covering the slave Sub i The delete-select unit rt i And returns (5.1), if not covered, into (5.3);
(5.3) by the pick unit rt i Operating a listening sensor set Sub s ；
6) Operating a first level startup set Sub k The process is as follows:
(6.1) judgmentSub k If the node is an empty set, the step 7 is entered if the node is an empty set, and if the node is not an empty set, the first node S is selected according to the sequence i ；
(6.2) judging the Start node S i Whether all units covered completely are covered by the k-1 level, if so, S will be the result of the completion of the k-1 level covering i From Sub k If all are not covered by the k-1 level or part of the units are not covered by the k-1 level (6.1) and return to (6.3);
(6.3) judging whether the complete coverage unit of the starting node is a part unit which is not covered by the k-1 level, entering the starting node if all the units are not covered by the k-1 level (6.4), and entering the starting node if the part unit is not covered by the k-1 level (6.5);
(6.4) judging the Start node S i Sensor node S in the unit k If the number Count k More than or equal to k-1, starting k-1 monitoring sensor nodes in the unit, and starting k-1 starting nodes from the monitoring sensor set Sub s Delete S i From Sub k Delete and return (6.1) if number Count k < k-1, starting all listening nodes in the unit;
(6.5) to the Start node S i Listening node S in a neighboring cell k Selecting a first adjacent monitoring node S according to the sequence from big to small of the number of the complete coverage starting nodes and the number of the unsatisfied k-1 level coverage units k Start and go S i From Sub s And back (6.2);
7) Will monitor the sensor and collect Sub s All the monitoring nodes in the network are switched to a sleep state.
Further, the process of (5.3) is as follows:
(5.3.1) according to Sub s Sequentially selecting a node S containing the cell i And starting. From Sub s Delete S in i And S is to i Adding a first-level startup set Sub k In (a) and (b);
(5.3.2) updating the sensor weight value including the unit not activated, updating Sub s And are arranged from large to small.
The technical conception of the invention is as follows: dividing the triangle with the side length of half of the sensor coverage radius into areas by taking the triangle as a basic unit, and starting the node to achieve area 1-level coverage by weighting the unit and the sensor. And performing k-1 level coverage on the node area of which the 1 level coverage is started according to the size of k level so as to achieve the effect of k level area coverage. The method can greatly reduce the starting quantity of the regional coverage nodes, thereby saving the energy consumption of the sensor and prolonging the life cycle of the wireless sensor network.
The beneficial effects of the invention are as follows: low start node number, low consumption, high space utilization.
Drawings
FIG. 1 is a schematic diagram of the Lorentzian triangle structure of the present invention;
FIG. 2 is a schematic diagram of a sensor maximum weight structure of the present invention;
FIG. 3 is a schematic diagram of a level 1 overlay start node overlay area unit architecture of the present invention;
FIG. 4 is a level 1 overlay start-up node and neighbor start-up schematic of the present invention;
fig. 5 is a flow chart of the method of the present invention.
Detailed Description
The invention is further described below with reference to the drawings.
Referring to fig. 1 to 5, a method for starting k-level coverage of a wireless sensor area based on a lux triangle comprises the following steps:
1) Dividing a target area A by taking a Lerlo triangle with r/2 as a side length as a unit;
2) Will split the unit rt i Joining a set of units Sub i ；
3) Calculating the weight value of each unit coverage
Sub is arranged from small to large according to weight value i ；
4) Activating all sensors to be in monitoring state, and calculating weight value of each sensor
Joining a listening sensor set according to the weight valueSub s ；
5) Operation unit set Sub i Selecting units according to the sequence, wherein the process is as follows;
(5.1) judging Sub i Whether empty or not, if empty, enter 6), if not, sub i Is selected from the first unit rt i ；
(5.2) determination unit rt i Whether or not to be covered, if so, covering the slave Sub i The delete-select unit rt i And returns (5.1), if not covered, into (5.3);
(5.3) by the pick unit rt i Operating a listening sensor set Sub s ；
(5.3.1) according to Sub s Sequentially selecting a node S containing the cell i Start-up from Sub s Delete S in i And S is to i Adding a first-level startup set Sub k In (a) and (b);
(5.3.2) updating the sensor weight value including the unit not activated, updating Sub s And are arranged from big to small;
(5.4) from the Unit set Sub i The delete-select unit rt i And returns (5.1);
6) Operating a first level startup set Sub k The starting nodes are selected from the set in sequence, and the process is as follows:
(6.1) judging Sub k Whether the set is an empty set or not, and if the set is the empty set, entering a step 7;
(6.2) judging the Start node S i Whether all units covered completely are covered by the k-1 level, if so, S will be the result of the completion of the k-1 level covering i From Sub k If all are not covered by the k-1 level or part of the units are not covered by the k-1 level (6.1) and return to (6.3);
(6.3) judging whether the complete coverage unit of the starting node is a part unit which is not covered by the k-1 level, entering the starting node if all the units are not covered by the k-1 level (6.4), and entering the starting node if the part unit is not covered by the k-1 level (6.5);
(6.4) judging the Start node S i Listening node S in the located unit k If the number Count k Not less than k-1, then in the starting unitk-1 listening sensor nodes, k-1 starting nodes are selected from the listening sensor set Sub s Delete S i From Sub k Delete and return (6.1) if number Count k < k-1, starting all listening nodes in the unit;
(6.5) to the Start node S i Listening node S in a neighboring cell k Selecting a first adjacent monitoring node S according to the sequence from big to small of the number of the complete coverage starting nodes and the number of the unsatisfied k-1 level coverage units k Start and go S i From Sub s And back (6.2);
7) Listening sensor set Sub s All the monitoring nodes in the network are switched to a sleep state.
The embodiments described in the present specification are merely examples of implementation forms of the inventive concept, and the scope of protection of the present invention should not be construed as being limited to the specific forms set forth in the embodiments, and the scope of protection of the present invention and equivalent technical means that can be conceived by those skilled in the art based on the inventive concept.
Claims (2)
1. A method for starting up k-level coverage of a wireless sensor area based on a lux triangle, which is characterized by comprising the following steps:
1) Activating all sensors to make them enter listening state by taking the Lorenter triangle as unit rt i Rule division RT for region A 2/r (A) The unit has a side length of r/2, and the sensor coverage radius is r and the communication radius is 2r;
2) Will split the unit rt i Joining a set of units Sub i ，rt i ∈RT 2/r (A)；
3) Number of counts covered in units by sensor integrity s As a unit weight function
Calculating the weight value of each cell coverage +.>
Ranking RT from small to large according to weight value 2/r (A)；
4) Number of complete coverage units by sensor Count i For initial weighting values of sensors
Calculating the weight value +.>
Adding a monitoring sensor set Sub according to the weight value s ；
5) Operation unit set Sub i The process is as follows:
(5.1) judging Sub i Whether empty or not, if empty, enter 6), if not, sub i Is selected from the first unit rt i ；
(5.2) determination unit rt i Whether or not to be covered, if so, covering the slave Sub i The delete-select unit rt i And returns (5.1), if not covered, into (5.3);
(5.3) by the pick unit rt i Operating a listening sensor set Sub s ；
6) Operating a first level startup set Sub k The process is as follows:
(6.1) judging Sub k If the node is an empty set, the step 7 is entered if the node is an empty set, and if the node is not an empty set, the first node S is selected according to the sequence i ；
(6.2) judging the Start node S i Whether all units covered completely are covered by the k-1 level, if so, S will be the result of the completion of the k-1 level covering i From Sub k If all are not covered by the k-1 level or part of the units are not covered by the k-1 level (6.1) and return to (6.3);
(6.3) judging whether the complete coverage unit of the starting node is a part unit which is not covered by the k-1 level, entering the starting node if all the units are not covered by the k-1 level (6.4), and entering the starting node if the part unit is not covered by the k-1 level (6.5);
(6.4) judging the Start node S i Sensor node S in the unit k If the number Count k More than or equal to k-1, starting k-1 monitoring sensor nodes in the unit, and starting k-1 starting nodes from the monitoring sensor set Sub s Delete S i From Sub k Delete and return (6.1) if number Count k < k-1, starting all listening nodes in the unit;
(6.5) to the Start node S i Listening node S in a neighboring cell k Selecting a first adjacent monitoring node S according to the sequence from big to small of the number of the complete coverage starting nodes and the number of the unsatisfied k-1 level coverage units k Start and go S i From Sub s And back (6.2);
7) Will monitor the sensor and collect Sub s All the monitoring nodes in the network are switched to a sleep state.
2. The method for starting coverage based on the k-level of the area of the lux triangle wireless sensor according to claim 1, wherein the procedure of (5.3) is as follows:
(5.3.1) according to Sub s Sequentially selecting a node S containing the cell i Start-up from Sub s Delete S in i And S is to i Adding a first-level startup set Sub k In (a) and (b);
(5.3.2) updating the sensor weight value including the unit not activated, updating Sub s And are arranged from large to small.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010185214.6A CN111314927B (en) | 2020-03-17 | 2020-03-17 | Area k-level coverage starting method based on Lerlo triangle wireless sensor |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010185214.6A CN111314927B (en) | 2020-03-17 | 2020-03-17 | Area k-level coverage starting method based on Lerlo triangle wireless sensor |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111314927A CN111314927A (en) | 2020-06-19 |
| CN111314927B true CN111314927B (en) | 2023-06-27 |
Family
ID=71147185
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010185214.6A Active CN111314927B (en) | 2020-03-17 | 2020-03-17 | Area k-level coverage starting method based on Lerlo triangle wireless sensor |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111314927B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102083085A (en) * | 2011-02-14 | 2011-06-01 | 洛阳理工学院 | Wireless sensor network optimizing method |
| WO2016082254A1 (en) * | 2014-11-27 | 2016-06-02 | 中国科学院沈阳自动化研究所 | Robust coverage method for relay nodes in double-layer structure wireless sensor network |
-
2020
- 2020-03-17 CN CN202010185214.6A patent/CN111314927B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102083085A (en) * | 2011-02-14 | 2011-06-01 | 洛阳理工学院 | Wireless sensor network optimizing method |
| WO2016082254A1 (en) * | 2014-11-27 | 2016-06-02 | 中国科学院沈阳自动化研究所 | Robust coverage method for relay nodes in double-layer structure wireless sensor network |
Non-Patent Citations (4)
| Title |
|---|
| Manjish Pal, etc..Sixsoid: A new paradigm for k-coverage in 3D wireless sensor networks.《2015 International Conference on Computing, Communication and Security(ICCCS)》.2016,全文. * |
| Yibo Jiang, etc..New Method for Weighted Coverage Optimization of Occlusion-Free Surveillance in Wireless Multimedia Sensor Network.《2010 First International Conference on Networking and Distributed Computing》.2010,第31-35页. * |
| 蒋一波等.基于不规则划分的K级区域覆盖增强算法.《计算机科学》.2019,第46卷(第5期),第67-72页. * |
| 邢萧飞等.无线传感器网络k度覆盖控制算法.《中南大学学报（自然科学版）》.2014,第45卷(第11期),第3832-3839页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111314927A (en) | 2020-06-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kumar | Performance analysis of energy efficient clustering protocols for maximising lifetime of wireless sensor networks | |
| CN107071811B (en) | WSN fault-tolerant non-uniform clustering method based on fuzzy control | |
| EP1867109B1 (en) | A sensor network | |
| Shan et al. | Research on improved LEACH protocol of wireless sensor networks | |
| Abidin et al. | A review on sensor node placement techniques in wireless sensor networks | |
| CN114980252A (en) | Low-power-consumption sleep control method and system for terminal equipment of Internet of things | |
| CN111314927B (en) | Area k-level coverage starting method based on Lerlo triangle wireless sensor | |
| Zhang et al. | Charge-aware duty cycling methods for wireless systems under energy harvesting heterogeneity | |
| Poonguzhali | Energy efficient realization of clustering patch routing protocol in wireless sensors network | |
| Kui et al. | Energy-balanced clustering protocol for data gathering in wireless sensor networks with unbalanced traffic load | |
| CN110996371A (en) | Clustering algorithm for prolonging life cycle of wireless sensor network | |
| US8849325B2 (en) | Determination of maximal independent sets of mobile devices | |
| Liao et al. | Wireless sensor network performance research for leach based on multi-agent simulation | |
| Cho et al. | An energy-efficient cluster-based routing in wireless sensor networks | |
| Mini et al. | Energy in wireless sensor networks | |
| Yen et al. | An energy efficient and coverage guaranteed wireless sensor network | |
| Cho et al. | A distributed node scheduling protocol considering sensing coverage in wireless sensor networks | |
| CN111711975A (en) | Data transmission method, system, terminal device and computer readable storage medium | |
| Tezcan et al. | TTS: a two-tiered scheduling mechanism for energy conservation in wireless sensor networks | |
| Liao et al. | An energy-efficient data storage scheme in wireless sensor networks | |
| Fathi et al. | An energy-efficient density-based clustering approach for wireless sensor networks | |
| Şimşek et al. | Application Specific Sleep-Awake Strategy for Increasing Network Lifetime in Wireless Sensor Networks | |
| Tarng et al. | Applying cluster merging and dynamic routing mechanisms to extend the lifetime of wireless sensor networks | |
| Ai-hua | Research of clustering algorithms and its improvements in wireless sensor networks | |
| Banerjee et al. | CA based sensor node management scheme: An energy efficient approach |
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 |