CN111314927A - K-level coverage starting method based on Lelo triangle wireless sensor area - Google Patents

Abstract

A k-level coverage starting method based on a Lelo triangle wireless sensor area comprises the following steps: 1) dividing a target area A by taking a Reuluo triangle with r/2 as side length as a unit; 2) rt is divided into units_iJoin Unit set Sub_i(ii) a 3) Calculating a weight value for each cell coverage

Sub is arranged from small to large according to weight value_i(ii) a 4) Activating all sensors to be in a monitoring state, and calculating the weight value of each sensor

Adding a monitoring sensor set Sub according to the weight value_s(ii) a 5) Operation unit set Sub_i(ii) a 6) Operating a Primary Start set Sub_k(ii) a 7) Set of sniffers Sub_sAll 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

K-level coverage starting method based on Lelo triangle wireless sensor area

Technical Field

The invention relates to a method for starting coverage of a wireless sensor area, in particular to a method for reducing the starting number of area sensor nodes so as to prolong the life cycle of a system network facing k-level area coverage.

Background

The wireless sensor network has the characteristics of convenience in deployment, high precision, high reliability and the like, and is widely concerned in the fields of monitoring, transmission and the like. In recent years, with the rapid development of the sensor technology level, the application field of the sensor technology level is extended to the aspects of social life, and higher requirements are also put forward on the wireless sensor network monitoring service standard. Different application fields have different requirements on network coverage quality, network lifetime and other performances. The sensor can help people to collect information and make a decision quickly according to information content mainly according to the capacity of the physical world and the digital world, so that the sensor has greater application potential in application scenes with higher real-time requirements, such as monitoring of military battlefields on enemy units, monitoring of wild animals and fire disasters in forests and the like.

The problem of area coverage is a basic problem in a wireless sensor network, and the problem mainly solved is how to ensure that a target area is effectively monitored by nodes after the sensor nodes are deployed, which reflects the monitoring quality of the target area by the sensor nodes and is also one of important evaluation indexes of network service quality. The deployment of the wireless sensor network nodes can be divided into two deployment modes of determinacy and randomness. Deterministic deployment approaches are often used to determine node locations when the network is environmentally friendly and the size of the network is not large. When the node positions cannot be deployed manually in some cases, for example, the natural environment is bad, the sensor nodes are deployed by means of tools such as an aircraft, and the method is called a random deployment mode. Because the node position under the deployment mode can not be determined in advance, compared with the deterministic deployment mode, the number of the sensor nodes deployed randomly is often far greater than that 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 force damage is solved, and the problem of difficult control of the node coverage is also brought.

Some important target areas often need higher monitoring quality requirements, and multiple coverage needs to be performed on the target areas, which is a problem of coverage of k-level area. The k-level coverage problem of random node deployment, sensors typically use a limited-energy battery supply, as sensor nodes are limited by manufacturing cost and volume size. When sensor nodes are actually deployed randomly, due to the fact that a target area is large, the scale of network deployment is large, the distribution range of the nodes is wide, and the deployment environment is complex, it is very difficult to supplement battery energy through battery replacement or charging means. The existing research proves that two methods can effectively prolong the life cycle of the network: the first is the density of the control nodes and the second is the node scheduling status. With the first method, it is difficult to reduce the density of deployed sensors in the case of random deployment. For the second method, under the condition of not reducing the service performance and the coverage requirement of the system, a part of nodes are selected as active nodes, and the rest nodes are in a sleep state, so that the number of the active nodes is reduced, the efficiency of utilizing the system energy can be improved, and the life cycle of a system network is prolonged, so that the loss is reduced. The methods presented herein may address this issue.

Disclosure of Invention

In order to solve the defects of the prior art of area random deployment, the invention provides a k-level coverage starting method based on a Lelo triangle wireless sensor area, which has the advantages of low starting node number, low consumption and high space utilization rate, reduces the active number of sensor nodes under the condition of ensuring the coverage of the k-level area, and starts the area nodes by using a Lelo triangle with radius of r/2 as a basic unit, thereby prolonging the life cycle of a wireless sensor network. According to application requirements, the radius of the coverage range of the sensor is set to be r, the radius of the communication of the sensor is set to be 2r, and the sensors can communicate with each other to sense the distance and the coverage content of each other. Dividing the target area by taking a Lelo triangle with r/2 as the 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 states of the sensor are divided into three states of sleeping, monitoring and starting.

In order to solve the technical problems, the invention provides the following technical scheme:

a k-level coverage starting method based on a Lelo triangle wireless sensor area comprises the following steps:

1) activating all sensors brings the sensors into a listening state by taking the reuleaux triangle as the unit rt_iRegularly partitioning RT for region A^2/r(A) The side length of the unit is r/2, the covering radius of the sensor is r, and the communication radius is 2 r;

2) rt is divided into units_iJoin Unit set Sub_i，rt_i∈RT^2/r(A)；

3) Count the number of units covered by the sensor_sAs a function of the cell weight

Calculating a weight value for each cell coverage

Arranging RTs from small to large according to weight values^2/r(A)；

4) Count by number of complete covered units of the sensor_iAs initial weight of sensor

Calculating a weight value for each sensor

Adding a monitoring sensor set Sub according to the weight value_s；

5) Operation unit set Sub_iThe process is as follows:

(5.1) judgment of Sub_iWhether it is an empty set, if it is an empty set, enter 6), if not, from Sub_iIn which the first unit rt is selected_i；

(5.2) determination Unit rt_iWhether it is covered or not, if it is covered, the slave Sub_iMiddle deletion selection unit rt_iAnd returning to (5.1) and entering (5.3) if not covered;

(5.3) by the selection unit rt_iOperation listening sensor set Sub_s；

6) Operating a Primary Start set Sub_kThe process is as follows:

(6.1) judgment of Sub_kIf the node is not an empty set, the step 7 is carried out, 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_iWhether all cells of the complete coverage are covered by k-1 level, if so, S_iSlave Sub_kIf all the cells are not covered by the k-1 level or part of the cells are not covered by the k-1 level, deleting the cells and returning the cells (6.1) (6.3);

(6.3) judging whether the complete coverage unit of the starting node is a partial unit which is not covered by the k-1 level, if not, entering (6.4) by the k-1 level coverage, and if not, entering (6.5) by the k-1 level coverage;

(6.4) judging the Start node S_iSensor node S in the unit_kIf the number Count_kIf the number of the monitoring sensor nodes is more than or equal to k-1, starting k-1 monitoring sensor nodes in the unit, and collecting the k-1 starting nodes from the monitoring sensor set Sub_sDeleting S_iSlave Sub_kIf the quantity Count is equal to (6.1) is deleted and returned_kIf k-1 is less, all monitoring nodes in the unit are started;

(6.5) to the initiating node S_iListening node S in a neighboring cell_kSelecting a first adjacent monitoring node S according to the sequence from large to small of the number of the covering units which completely cover the starting node and do not meet the k-1 level_kStart and mix S_iSlave Sub_sDeleted and returned (6.2);

7) will monitor the sensor set Sub_sAll 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_sSequentially selecting a node S containing the cell_iThe start-up is performed. Slave Sub_sDeletion of S_iAnd mixing S_iJoining a Primary Start set Sub_kPerforming the following steps;

(5.3.2) update the sensor weight value containing the unit not activated, update Sub_sAnd arranged from large to small.

The technical conception of the invention is as follows: and taking a Leluo triangle with the side length being half of the coverage radius of the sensor as a basic unit partition area, and starting a node to achieve the coverage of the area level 1 by weighting the unit and the sensor. And performing k-1 level coverage on the node area with the 1 level coverage started according to the size of k level to achieve the effect of k level area coverage. The method can greatly reduce the starting number of the area coverage nodes, thereby saving the energy consumption of the sensor and prolonging the life cycle of the wireless sensor network.

The invention has the beneficial effects that: low starting node number, low consumption and high space utilization rate.

Drawings

FIG. 1 is a schematic diagram of the structure of the Reuleaux triangle of the present invention;

FIG. 2 is a schematic diagram of the sensor maximum weight structure of the present invention;

FIG. 3 is a schematic diagram of a cell structure of a coverage area of a level 1 coverage initiation node according to the present invention;

FIG. 4 is a schematic diagram of the level 1 overlay initiator node and neighboring node initiation in accordance with the present invention;

fig. 5 is a flow chart of a method of the present invention.

Detailed Description

The invention is further described below with reference to the accompanying drawings.

Referring to fig. 1 to 5, a k-level coverage starting method based on a reuleaux triangle wireless sensor area includes the following steps:

1) dividing a target area A by taking a Reuluo triangle with r/2 as side length as a unit;

2) rt is divided into units_iJoin Unit set Sub_i；

3) Calculating a weight value for each cell coverage

According to the weighted valueArrange Sub from small to large_i；

4) Activating all sensors to be in a monitoring state, and calculating the weight value of each sensor

Adding a monitoring sensor set Sub according to the weight value_s；

5) Operation unit set Sub_iSelecting units according to the sequence, wherein the process is as follows;

(5.1) judgment of Sub_iWhether it is an empty set, if it is an empty set, enter 6), if not, from Sub_iIn which the first unit rt is selected_i；

(5.2) determination Unit rt_iWhether it is covered or not, if it is covered, the slave Sub_iMiddle deletion selection unit rt_iAnd returning to (5.1) and entering (5.3) if not covered;

(5.3) by the selection unit rt_iOperation listening sensor set Sub_s；

(5.3.1) according to Sub_sSequentially selecting a node S containing the cell_iStarting up, from Sub_sDeletion of S_iAnd mixing S_iJoining a Primary Start set Sub_kPerforming the following steps;

(5.3.2) update the sensor weight value containing the unit not activated, update Sub_sAnd arranged from large to small;

(5.4) slave Unit set Sub_iMiddle deletion selection unit rt_iAnd returning to (5.1);

6) operating a Primary Start set Sub_kAnd sequentially selecting starting nodes from the set, wherein the process is as follows:

(6.1) judgment of Sub_kIf the set is an empty set, entering a step 7 if the set is the empty set;

(6.2) judging the Start node S_iWhether all cells of the complete coverage are covered by k-1 level, if so, S_iSlave Sub_kIf all the cells are not covered by the k-1 level or part of the cells are not covered by the k-1 level, deleting the cells and returning the cells (6.1) (6.3);

(6.3) judging whether the complete coverage unit of the starting node is a partial unit which is not covered by the k-1 level, if not, entering (6.4) by the k-1 level coverage, and if not, entering (6.5) by the k-1 level coverage;

(6.4) judging the Start node S_iMonitoring node S in the unit_kIf the number Count_kIf the number of the monitoring sensor nodes is more than or equal to k-1, starting k-1 monitoring sensor nodes in the unit, and collecting the k-1 starting nodes from the monitoring sensor set Sub_sDeleting S_iSlave Sub_kIf the quantity Count is equal to (6.1) is deleted and returned_kIf k-1 is less, all monitoring nodes in the unit are started;

(6.5) to the initiating node S_iListening node S in a neighboring cell_kSelecting a first adjacent monitoring node S according to the sequence from large to small of the number of the covering units which completely cover the starting node and do not meet the k-1 level_kStart and mix S_iSlave Sub_sDeleted and returned (6.2);

7) set of sniffers Sub_sAll the monitoring nodes in the network are switched to a sleep state.

The embodiments described in this specification are merely illustrative of implementations of the inventive concept and the scope of the present invention should not be considered limited to the specific forms set forth in the embodiments but rather by the equivalents thereof as may occur to those skilled in the art upon consideration of the present inventive concept.

Claims (2)

1. A k-level coverage starting method based on a Lelo triangle wireless sensor area is characterized by comprising the following steps:

1) activating all sensors brings the sensors into a listening state by taking the reuleaux triangle as the unit rt_iRegularly partitioning RT for region A^2/r(A) The side length of the unit is r/2, the covering radius of the sensor is r, and the communication radius is 2 r;

2) rt is divided into units_iJoin Unit set Sub_i，rt_i∈RT^2/r(A)；

3) Count the number of units covered by the sensor_sAs a function of the cell weight

Calculating a weight value for each cell coverage

Arranging RTs from small to large according to weight values^2/r(A)；

4) Count by number of complete covered units of the sensor_iAs initial weight of sensor

Calculating a weight value for each sensor

Adding a monitoring sensor set Sub according to the weight value_s；

5) Operation unit set Sub_iThe process is as follows:

(5.1) judgment of Sub_iWhether it is an empty set, if it is an empty set, enter 6), if not, from Sub_iIn which the first unit rt is selected_i；

(5.2) determination Unit rt_iWhether it is covered or not, if it is covered, the slave Sub_iMiddle deletion selection unit rt_iAnd returning to (5.1) and entering (5.3) if not covered;

(5.3) by the selection unit rt_iOperation listening sensor set Sub_s；

6) Operating a Primary Start set Sub_kThe process is as follows:

(6.1) judgment of Sub_kIf the node is not an empty set, the step 7 is carried out, 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_iWhether all cells of the complete coverage are covered by k-1 level, if so, S_iSlave Sub_kIf all the cells are not covered by the k-1 level or part of the cells are not covered by the k-1 level, deleting the cells and returning the cells (6.1) (6.3);

(6.3) judging whether the complete coverage unit of the starting node is a partial unit which is not covered by the k-1 level, if not, entering (6.4) by the k-1 level coverage, and if not, entering (6.5) by the k-1 level coverage;

(6.4) judging the Start node S_iSensor node S in the unit_kIf the number Count_kIf the number of the monitoring sensor nodes is more than or equal to k-1, starting k-1 monitoring sensor nodes in the unit, and collecting the k-1 starting nodes from the monitoring sensor set Sub_sDeleting S_iSlave Sub_kIf the quantity Count is equal to (6.1) is deleted and returned_kIf k-1 is less, all monitoring nodes in the unit are started;

(6.5) to the initiating node S_iListening node S in a neighboring cell_kSelecting a first adjacent monitoring node S according to the sequence from large to small of the number of the covering units which completely cover the starting node and do not meet the k-1 level_kStart and mix S_iSlave Sub_sDeleted and returned (6.2);

7) will monitor the sensor set Sub_sAll the monitoring nodes in the network are switched to a sleep state.

2. The method for starting k-level coverage in a Lulo-triangular-based wireless sensor area as claimed in claim 1, wherein the process of (5.3) is as follows:

(5.3.1) according to Sub_sSequentially selecting a node S containing the cell_iStarting up, from Sub_sDeletion of S_iAnd mixing S_iJoining a Primary Start set Sub_kPerforming the following steps;

(5.3.2) update the sensor weight value containing the unit not activated, update Sub_sAnd arranged from large to small.

Images