An Optimized Strategy Coverage Control Algorithm for WSN

Abstract

The problem of using lesser wireless sensor network nodes to achieve coverage and connection of certain areas under given coverage conditions is a priority and hotspot issue of WSN. For this reason, in this paper, an optimized strategy coverage control (OSCC) algorithm is proposed. First of all, a relation mapping model of sensor nodes and target nodes is established by OSCC which is based on geometric figure and related theories, probability theory, converge property, and so forth to complete effective reasoning and calculate certain network models. Secondly, OSCC makes efficient analysis of the calculating results figure out the least number of sensor nodes to cover specific monitoring area. Thirdly, OSCC picks out the optimal routing solution while conducting combinatorial optimization of routing path using ant colony optimization (ACO) algorithm, thus reducing the energy spending of whole network. In the end, this paper verifies OSCC algorithm by simulation experiment and proves it can use least sensor nodes to effectively cover target area. Also, OSCC helps greatly reduce network energy consuming, minimize network resources layout costs, and enhance network life cycle, simultaneously.

1. Introduction

Wireless sensor network (WSN) is a wireless self-organization network which consists of large number of cheap sensor nodes. It is a system having the capabilities of calculating, perceiving, and communicating which can be widely applied in national defense monitoring, environment detecting, mine wrecking, medicine, traffic realms, and so forth. The coverage problem, the connectivity problem among nodes or between nodes and station, and the energy consuming problem of nodes are all hotspot issues of WSN [1–4]. The coverage and connectivity problem not only directly affects the working of network, but also determines network energy consuming, network life cycle length, and network quality of service.

The coverage problem and the connectivity problem are fundamental questions in WSN. There are two ways of deploying sensor nodes: definite deployment and random deployment. Definite deployment concentrates on optimal deployment strategies of 2-dimensional and 3-dimensional space which satisfies different coverage demand and connectivity demand by handwork. However, while deploying large numbers of sensor nodes or deployment area is not appropriate for handwork, random deployment is adopted. By the way, most applications do not ask for full cover of sensor network. Instead, keeping sensor nodes cover certain rate of detected area to complete specific work is enough. The coverage problem and connectivity problem are important issues for WSN for they reflect the network state of detected area. The coverage control of WSN for specific application helps master node energy consuming improve quality of service in perceiving and extend overall life cycle. However, it will also bring problems such as increase in the cost of network transmission, management, storage, and computing. Also, network life cycle holds a critical part when coverage rate and connectivity rate are satisfied. Thus, how to meet certain coverage condition using least sensor nodes to complete coverage and connectivity of specific area while holding nodes energy consuming is a challenging project. Above all, this paper is organized as follows.

• (1)

Related literatures are studied and different algorithms are concluded to find their advantages and disadvantages in applications. This paper puts forward an improved algorithm to make up the insufficiency of algorithms studied.

(2)

A probabilistic model of WSN is established, giving out the function between nodes and their detected area and the relation of different parameters by geometrical theory. Though effectively reasoning and verifying of solved function with mathematics method, details of reasoning and verifying process are given to make sure the least nodes and most coverage of specific area.

(3)

While making sure of the coverage of detected area, this paper adopts ant colony optimization of artificial intelligence and virtual force between nodes. Though vector theory to calculate node moving path and direction, and finally making sensor nodes to optimal location.

(4)

The proof of routing path convergence speed under ant colony optimization is given which enhances the coverage of WSN. Simulation result shows that OSCC fulfill high-speed and effective and stable coverage of sensor network.

2. Related Works

In recent years, theories and solutions about the coverage problem and the connectivity problem in WSN have been proposed. Tamboli and Younis [5] suggested a method about the sensor coverage and connectivity restoration in removable sensor networks where the main idea is integrating the coverage problem and the connectivity problem. The Coverage C³R (conscious connectivity restoration) algorithm is used to recover one or more invalid nodes from neighbors', each neighbor node is relocated and invalid nodes are replaced to its initial position; thus the connectivity is recovered and the target nodes are detected at the initial position within the coverage region. Sheu and Lin [6] developed a CPP algorithm which made an improvement of the CCAP algorithm. The CPP algorithm employs working nodes as less as possible while keeping the coverage area. The centrally controlled approach adopted by CPP algorithm results in restricted scale of WSN. What is more, little work is done on three-dimensional sensor networks introducing probability coverage model. However, most applied WSN are located in 3-dimensional sensor networks, thus making it more precise for simulation. De Mello et al. [7] introduced an algorithm focusing on the issues of coverage and redundancy, which is based on the GA (genetic algorithm) to optimize the coverage and reduce energy consuming without losing coverage. Habib and Safar [8] established a model that lattices the coverage area where each lattice has a sensor located in the position of the lattices. According to the row and column position in the matrix, an optimal model on the consumption and the coverage rate of WSN is given. Finally, genetic algorithm (GA) is used to figure out the best solution. A virtual power algorithm put forward by [9] is frequently used in dynamic deployment of sensor nodes. The receiving information strength of nodes is regarded as a virtual power within sensor nodes. The process of dynamic deployment will not be finished until the balance of the virtual power each node finished. An algorithm based on the virtual power in combination with particle swarm optimization (PSO) [10] is applied in controlling coverage regions while ignoring the minimum consumption of nodes' energy. The maximum coverage, the minimum communication costs, and the energy depleted in nodes' moving were all considered by Wang et al. [11]. However, the searching space of a PSO would be in exponential growth with the increase of dimensions of optimize vectors, thus making computing time complexity be a bottleneck in the process of networks' optimization. All the algorithms mentioned above are able to solve the problem of coverage and connectivity to a large extent, but the process is complicated. Moreover, with the increase of nodes and change of coverage regions, the complexity of algorithms will be increased and the computing efficiently will be decreased. Tian et al. [12] introduced an algorithm based on simulate anneal arithmetic (SAA) to minimize the distance mistake. Each lattice has a sensor in initial. If node configuration cost does not reach the threshold given before, then loop the procedure as follows. First of all, delete a sensor node randomly, and make an evaluation of replacement cost. If replacement cost fails, move this node to another random position and then reevaluate. A coverage and connectivity method to cluster topology (CCC) in WSN algorithm was put forward by Wang et al. [13] that an optimal cluster should have 15 nodes and if the clusters make an equilateral triangle, the efficiency of coverage and connectivity is the best. According to the ideas mentioned, this paper puts forward a coverage algorithm using the linear relationship on topology control to establish a probabilistic model of WSN. Function relation about perception radius and monitoring regions is given though the path and direction of a moving node can be figured out by vector theory and compute an optimal solution by ACO. OSCC supports data's transmission after many-hop route. Finally, simulation results show that OSCC not only reduces sensor nodes energy consuming, but also improves the coverage with less nodes. What is more, interference is reduced effectively, the quality of WSN service is improved, and the life cycle of the network is increased.

3. Definition of the Problem and the Network Model

3.1. Definition of the Problem

Coverage control is a key topic in the research of wireless sensor network which directly affects the quality of the WSN coverage services. In this paper, the main idea is to build a WSN model through functions vector relationship with sensors movement and nodes final location. In the model, all pheromone on the path of nodes movements will be updated using ACO which will make dynamic balance within all sensor nodes.

The research on coverage and the connectivity discussed in this paper is based on regional local positioning algorithm and equipped with the following basic assumptions.

Hypothesis 1.

Both coverage radius and communication radius of each node are disc-shaped.

Hypothesis 2.

The sensor nodes can get its own location information through localization algorithms, such as RSSI locating algorithm and Euclidean locating algorithm.

Hypothesis 3.

Identification of each sensor node is unique.

Hypothesis 4.

The perception range of each sensor node is far less than the entire network coverage area, and all nodes are heterogeneous and independent and have the same initial energy.

Hypothesis 5.

While moving, the sensor has enough energy to complete the required distance.

Definition 1.

Given target set $T=\{t_1,t_2,t_3,\dots ,t_k\}$ and sensor node set $V=\{v_1,v_2,v_3,\dots ,v_n\}$ , in certain time slot, if all nodes in T are covered by at least one node in V, then it is called full coverage of target set T.

Definition 2.

Suppose there are nodes $s_i$ and $s_j$ , whose target monitoring regions are $C_i$ and $C_j$ . If $C_i\cap C_j\ne \varnothing$ , then nodes $s_i$ and $s_j$ are coverage related. Let T be the set of m nodes which are randomly distributed in the target area; E is the edge set of network graph, which represents set of position relationship of $e_{ij}=\mathrm{1}$ , where $e_{ij}$ indicates position relationship of node $S_i$ and target node $t_j$ , when and only when the Euler distance between target node $t_j$ and sensor node $S_i$ is less than or equal to the sensing radius r, $e_i=1$ ; otherwise $e_i=0$ . $W=\{w_1,w_2,\dots ,w_n\}$ is the initial energy set of the sensor nodes, and w follows $W~N(u,{\sigma }^{\mathrm{2}})$ normal distribution, $w_i$ represents the initial energy of sensor nodes $s_i$ , and $w_i$ is also the maximum energy during its working.

Definition 3.

In the monitoring area, each node is at least covered by K sensor nodes at the same time; then we called it the K-degree coverage, namely, $A_k\in {\bigcap }_{i=c}^{c+k}A{s}_i\pi$ , where $\mathrm{1}\le c\le n$ .

3.2. The Establishment of the Network Model

In a square monitoring area, N sensor nodes are randomly deployed. Eight were chosen as center nodes arbitrarily at the initial time. Then, divide the square into eight different areas whose intersection point is the center of the square based on the eight center nodes. Suppose there is a sensor named S and a hexagon whose center is S. Now arbitrarily choose four points from the hexagon's vertexes randomly and assume they are cluster head nodes; thus the associated attributes formed between each central node and cluster head node is $f=\{(i,j)\hspace{0.17em}|\hspace{0.17em}fi:(Sj),i\in [\mathrm{1,8}],j\in [\mathrm{1,4}]\}$ . Considering central node 1 in area $f\mathrm{1}$ , we know that node 1 is in the lower half area of midperpendiculars between $S\mathrm{3}$ and $S\mathrm{4}$ through the perception radius of $Sj$ , so the central node 1 is closer to $S\mathrm{4}$ , with $S\mathrm{3}$ following. As each cluster head node has the same energy from initial state, its perception radius and communication radius are the same. Similarly, node 1 is on the right of the midperpendiculars between $S\mathrm{1}$ and $S\mathrm{2}$ and closer to $S\mathrm{2}$ . Then it can be proved that perception capacity of $S\mathrm{2}$ is greater than $S\mathrm{1}$ from geometrical knowledge. With the same reason, we know that the perception of $S\mathrm{3}$ is stronger than $S\mathrm{2}$ ; that is, the associated attribute of node 1 is as follows: $f\mathrm{1}:(S\mathrm{4},S\mathrm{3},S\mathrm{2},S\mathrm{1})$ . Similar considerations apply to all other nodes' associated attributes shown in Figure 1.

Figure 1

Schematic for associated attribute between cluster head nodes and center node.

3.3. Determination of the Relationship Vector

Definition 4.

The mobile node i in the position $x_i$ , another node j in the other position $x_j$ , the repulsive force from node j to node i are defined as follows:

$$\begin{array}{cc}& F_{\text{exc}}=\{\begin{array}{cc}k\left(\frac{\mathrm{1}}{r}-\frac{\mathrm{1}}{d\left(i,j\right)}\right)\left(\frac{x_i-x_j}{d{\left(i,j\right)}^{\mathrm{2}}}\right)\hfill & d\left(i,j\right)\le r\hfill \\ \mathrm{0}\hfill & d\left(i,j\right)>r,\hfill \end{array}\end{array}$$

(1)

where $d(i,j)$ is the Euclidean distance between sensor node i and sensor node j; $F_{\text{exc}}$ is the repulsive force between sensor node i and sensor node j, also known as the exclusive power; r is the perception radius of any sensor node.

Similarly, the attraction between node i and node j is defined as

$$\begin{array}{cc}& F_{\text{att}}=\{\begin{array}{cc}k\frac{\mathrm{1}}{d{\left(i,j\right)}^{\mathrm{2}}}\left(\frac{x_i-x_j}{d\left(i,j\right)}\right)\hfill & d\left(i,j\right)>\mathrm{2}r\hfill \\ \mathrm{0}\hfill & d\left(i,j\right)\le \mathrm{2}r.\hfill \end{array}\end{array}$$

(2)

In order to make repulsion and attraction not too big or not too small, we introduced the proportionality constant coefficients k, and its purpose is to adjust the range of repulsive force and attractive force. The repulsive force and attractive force, respectively, are

$$\begin{array}{cc}& F=\{\begin{array}{cc}{F}_{\text{exc}}={\displaystyle \sum }_{j\in \Omega }{F}_{c\mathrm{1}}\left(i,j\right)\hfill & \hfill \\ F_{\text{att}}={\displaystyle \sum }_{j\in \Omega }{F}_{c\mathrm{2}}\left(i,j\right),\hfill & \hfill \end{array}\end{array}$$

(3)

where $F_{c\mathrm{1}}$ is the repulsive force acting on the node $S_i$ , and $F_{c\mathrm{2}}$ is the attraction acting $S_i$ . For the boundedness of coverage area, repulsive and attractive forces can also be applied to other models for mobile nodes on the boundary of target area. The position $x_i$ is located in the vertical projection of the point i to its nearest distance from the boundary line of the target region. Considering the random disturbance force between nodes, the resultant force in a node is available:

$$\begin{array}{cc}& F_i={\displaystyle \sum }\left({\xi }_{\mathrm{1}}{F}_{\text{exc}}+{\xi }_{\mathrm{2}}{F}_{\text{att}}+{\xi }_{\mathrm{3}}{F}_{\text{bor}}+{\xi }_{\mathrm{4}}{F}_{\text{wan}}\right),\end{array}$$

(4)

wherein $F_{\text{bor}}$ is repulsive force from the boundary of the target area on nodes, $F_{\text{wan}}$ is a random disturbance force between nodes, and ξ is the force control parameters. The motion equation of the mobile node i at time t can be defined as $v^{\mathrm{\prime \prime }}(x)=(F_i-\mu x_i^{\prime }/m)$ , where μ is proportional damping factor and m is the node's virtual mass.

Mobile node is defined by the virtual force and vector relationship. Take Figure 1 for example, at the initial moment, the deployment of a sensor node is a random shape and its location is random. Virtual force exists between any two nodes, and each sensor node is looking for a stable state of equilibrium as for the regular hexagon which is the vertex positions of hexagon. At the initial moment, the direction of virtual force formed by six vertices of the hexagon centered on node S is transferred out in the form of news broadcast to look for its six neighboring nodes. Assuming that sensor node $S_i$ is a point within the regular hexagon, receiving S message to lower right direction and receiving the message $S\mathrm{3}$ to lower left, as shown in Figure 1, Euclidean distance can be obtained between S and $S_i$ by the Euler's formula (2), where the direction is $\stackrel{⃑}{D_{s{s}_i}}$ and the angle θ is the inner product of $\stackrel{⃑}{D_{ss\mathrm{3}}}$ and $\stackrel{⃑}{D_{s{s}_i}}$ , namely,

$$\begin{array}{cc}& \theta =\text{arccos}\frac{\left|\stackrel{⃑}{D_{ss\mathrm{3}}}·\stackrel{⃑}{D_{s{s}_i}}\right|}{\left|\stackrel{⃑}{D_{ss\mathrm{3}}}\right|\left|\stackrel{⃑}{D_{s{s}_i}}\right|},\\ d_{s\mathrm{3}{s}_i}={\left(d_{s{s}_i}^{\mathrm{2}}+r^{\mathrm{2}}-\mathrm{2}{d}_{s{s}_i}r\cos \theta \right)}^{\mathrm{1}/\mathrm{2}}.\end{array}$$

(5)

β can be obtained in the same way; substituting formula (5) into formulas (1) and (3), repulsive force size and direction of sensor node $S_i$ can be obtained, that is, the $S_i$ vector relation

$$\begin{array}{l}{F}_{\text{exc}}=k^{\mathrm{2}}\left(\frac{\mathrm{1}}{r}-\frac{\mathrm{1}}{d_{s{s}_i}}\right)\left(\frac{x_{s\mathrm{3}}-x_{si}}{d_{s{s}_i}^{\mathrm{2}}}\right)\\ \hspace{1em}\hspace{1em}·\left(\frac{\mathrm{1}}{r}-\frac{\mathrm{1}}{d_{s\mathrm{3}{s}_i}}\right)\left(\frac{x_{s\mathrm{3}}}{d_{s\mathrm{3}{s}_i}^{\mathrm{2}}}\right)·\cos \left(\theta +\beta \right).\end{array}$$

(6)

The actual process is that six sensors chosen by sensor node S in sleep state turn into active state following indicator of censor node S. If six neighbor nodes are independent, then they, respectively, move to the vertices of a regular hexagon, forming relatively stable position information. And the message is transmitted to S, when all message from six entry points is received by S, by (5) and (6); if Euclidean distance of sensor node $S_i$ within the regular hexagon is smaller than sensing radius, it will be removed outside the hexagon. Meanwhile the sensor node S is turned off to reduce energy consumption to improve overall network life cycle.

Theorem 5.

In the monitoring region, the maximum overlapped area of three arbitrary sensor nodes is $EA=\mathrm{82.73}\%$ .

Proof.

In the monitoring region, the basic pattern of overlapped area of three arbitrary sensor nodes is that one in two others' coverage region, as show in Figure 2(a).

Situation 1. If three circles are circumscribed with each other, inanition will exist but without coverage which contradicts with the condition of full coverage, so the situation is abolished.

Situation 2. Figure 2(b) shows the model of WSN’ multiple coverage; the shadow is $k=\mathrm{3}$ , that is, 3-coverage. If the overlapping portion is maximum, meaning ${\lim }_{s\to \mathrm{0}}{S}_{\text{sh}}=\mathrm{0}$ , when $S_{\text{sh}}=\mathrm{0}$ , three circles are circumscribed with each other at point A, so the Euler distance of any two circles are equal. Connect point A and point O2, and then point O1 and O2, the line intersects with circle O2 at point B, draw the midperpendicular of line point O1 and point O2 and the midperpendicular intersects with line O1O2 at point p, $\angle \theta =\pi /\mathrm{6}$ . Supposing the bow’ area is $S_{\text{APB}}$ , which equals the difference between sector area $S_{\text{AO}\mathrm{2}\text{B}}$ and triangle area $S_{\text{AO}\mathrm{2}\text{P}}$ , there are 12 bows in Figure 2(b), and the sum of the areas can be calculated as

$$\begin{array}{l}\mathrm{12}{S}_{\text{APB}}=\mathrm{12}\left(S_{\text{AO}\mathrm{2}\text{B}}-S_{\text{AO}\mathrm{2}\text{P}}\right)\\ \hspace{1em}\hspace{1em}\hspace{1em}=\mathrm{12}\left(\frac{\pi r^{\mathrm{2}}}{\mathrm{12}}-\frac{\sqrt{\mathrm{3}}}{\mathrm{8}}{r}^{\mathrm{2}}\right)=\frac{\mathrm{2}\pi -\mathrm{3}\sqrt{\mathrm{3}}}{\mathrm{2}}{r}^{\mathrm{2}}.\end{array}$$

(7)

For the whole coverage region, the maximum area is

$$\begin{array}{l}S=\mathrm{3}\pi r^{\mathrm{2}}-\mathrm{12}{S}_{\text{APB}}\\ \hspace{1em}=\mathrm{3}\pi r^{\mathrm{2}}-\pi r^{\mathrm{2}}+\frac{\mathrm{3}\sqrt{\mathrm{3}}}{\mathrm{2}}{r}^{\mathrm{2}}=\mathrm{2}\pi r^{\mathrm{2}}+\frac{\mathrm{3}\sqrt{\mathrm{3}}}{\mathrm{2}}{r}^{\mathrm{2}}.\end{array}$$

(8)

The expectation $EA$ of the whole networks is

$$\begin{array}{l}EA=\frac{S_{\Delta \text{APO}\mathrm{2}}}{S_{\text{ABO}\mathrm{2}}}=\frac{S_{\text{ABO}\mathrm{2}}-S_{\text{ABP}}}{S_{\text{ABO}\mathrm{2}}}\\ \hspace{0.17em}\hspace{1em}=\mathrm{1}-\frac{S_{\text{ABP}}}{S_{\text{ABO}\mathrm{2}}}=\mathrm{1}-\left(\mathrm{1}-\frac{\mathrm{3}\sqrt{\mathrm{3}}}{\mathrm{2}\pi }\right)\\ \hspace{0.17em}\hspace{1em}=\frac{\mathrm{3}\sqrt{\mathrm{3}}}{\mathrm{2}\pi }=\mathrm{82.73}\%.\end{array}$$

(9)

The proof is over.

Figure 2

(a) Three circles intersection. (b) Three circles intersect into a point.

Theorem 6.

Suppose the probability of an event happened among the sensors coverage region is p, the target nodes are multioverlapped. Let $K=\mathrm{2}$ , for the two loops, the number of moving nodes is m and n, the probability of the event is $p^{\mathrm{2}}{q}^{n-\mathrm{2}}$ , and the conditional probability is $p{q}^{n-m-\mathrm{1}}$ , where $q=\mathrm{1}-p$ .

Proof.

Suppose X is the number of moving nodes in the first loop, Y is the number of moving nodes in the second loop. From the Theorem 6, we know that the target node is covered by sensor at the m time for the first loop. For the second loop, the target node is covered twice at the n time; $n-\mathrm{2}$ times are not covered, so the probability of sensor nodes is

$$\begin{array}{cc}& P\left(X=m,Y=n\right)=p^{\mathrm{2}}{q}^{n-\mathrm{2}}.\end{array}$$

(10)

The joint probability of two loops is

$$\begin{array}{l}P\left(X=m\right)={\displaystyle \sum }_{n=m+\mathrm{1}}^{\infty }P\left(X=m,Y=n\right)\\ \hspace{1em}\hspace{1em}\hspace{1em}\hspace{0.17em}\hspace{1em}={\displaystyle \sum }_{n=m+\mathrm{1}}^{\infty }{p}^{\mathrm{2}}{q}^{n-\mathrm{2}}=p{q}^{m-\mathrm{1}},\end{array}$$

(11)

$$\begin{array}{l}P\left(X=n\right)={\displaystyle \sum }_{m=\mathrm{1}}^{n-\mathrm{1}}P\left(X=m,Y=n\right)\\ \hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}={\displaystyle \sum }_{m=\mathrm{1}}^{n-\mathrm{1}}{p}^{\mathrm{2}}{q}^{n-\mathrm{2}}=\left(n-\mathrm{1}\right)p^{\mathrm{2}}{q}^{n-\mathrm{2}}.\end{array}$$

(12)

According to the multiplication formula of probability theory, the result is

$$\begin{array}{l}P\left(Y=n\hspace{0.17em}|\hspace{0.17em}X=m\right)=\frac{P\left(X=m,Y=n\right)}{P\left(X=m\right)}\\ \hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{0.17em}\hspace{1em}=\frac{p^{\mathrm{2}}{q}^{n-\mathrm{2}}}{p{q}^{m-\mathrm{1}}}=p{q}^{n-m-\mathrm{1}}.\end{array}$$

(13)

4. Optimized Scheduling Strategy

4.1. Ant Colony Optimization and Evolution of Probability

Coverage control plays a vital role in coverage efficiency of wireless sensor network. How to effectively deploy the sensor nodes to cover the monitoring area completely and how to reduce the energy consumption of sensors in the process of deploying in order to extend the lifecycle of the whole network are all hot spots including focusing on how to reduce redundant code during the transmission of data and increase the transmission ratio of communication channel. For this reason, this section introduces the ant colony algorithm (ACO) to optimize the deployment of sensor nodes, mainly because ACO is an intelligent algorithm for group pattern whose workspace is a continuous search space with which all the sensor nodes can be moved to the desired area by adapting function. Combining the own characteristics of wireless sensor network and the characteristics of local convergence and global search of the ant colony optimization, which make it more flexible to deploy the sensor nodes, thus, reduces the cost of network energy and prolongs the lifecycle.

Definition 7.

In the process of traversal search, ant calculates the state transition probability according to the amount of information and the heuristic information on each path. Assume the transition probability between any two points is p, that is,

$$\begin{array}{cc}& p=\{\begin{array}{cc}\frac{{\left[{\tau }_{ij}\left(t\right)\right]}^{\alpha }\left[{\eta }_{ij}{\left(t\right)}^{\beta }\right]}{\left({\sum }_{s\hspace{0.17em}\subset \hspace{0.17em}\text{allowed}}{\left[{\tau }_{ij}\left(t\right)\right]}^{\alpha }\left[{\eta }_{ij}{\left(t\right)}^{\beta }\right]\right)}\hfill & s\in \text{allowed}\hfill \\ \mathrm{0}\hfill & s\notin \text{allowed},\hfill \end{array}\end{array}$$

(14)

where α is the informational heuristic factor which indicates the relative importance of track and shows the role played by the accumulated information during the movement of ant. The larger it is, the greater the possibility that other ants tend to choose the path is, and the stronger the ants collaborate. β is the expected heuristic factor, which indicates the relative importance of visibility and shows the degree of attention, paid by ant to heuristic information during the path selection. The value increases, when the state transition probability is close to 1; it becomes the greedy algorithm. ${\tau }_{ij}(t)$ and ${\eta }_{ij}(t)$ represent the pheromone residual function and the heuristic function, respectively. In order to avoid the excessive residual pheromone affecting the operation of heuristic information, after the end of each traversal, the amount of information on the path should be updated, and the update function is

$$\begin{array}{cc}& {\tau }_{ij}\left(t+\mathrm{1}\right)=\left(\mathrm{1}-\rho \right){\tau }_{ij}\left(t\right)+\rho {\displaystyle \sum }_{k=\mathrm{1}}^m\Delta {\tau }_{ij}^k\left(t\right),\end{array}$$

(15)

where ρ is the pheromone evaporation coefficient, and its value range is $\rho \subset [\mathrm{0,1}]$ , $\mathrm{1}-\rho$ is the number of residual pheromone factors on the path, and ${\sum }_{k=\mathrm{1}}^m\Delta {\tau }_{ij}^k(t)$ represents the increment of residual pheromone produced by the former k ants on the road.

Theorem 8.

In the coverage area, any sensor node moves between the path $(i,j)$ and the iteration rule satisfies (15); the limit of the sum of incremental coverage of adjacent iterations tends to 1.

Proof.

In order to illustrate the problem better, using the incremental pheromone of the ACO to represent the incremental coverage of adjacent iterations, equations (14) and (15) show that, the value of $\Delta {\tau }_{ij}^k(t)$ depends on the solution function corresponding to the ants within the current search cycle. Consider $\Delta {\tau }_{ij}^k(t)=\phi (f_x)$ ; suppose that the target value of the solution function is $f_s$ ; the function of $\Delta {\tau }_{ij}^k(t)$ can be obtained by using $f_s$ as a variable of the corresponding path. Consider $\Delta {\tau }_{ij}^k(t)=\phi (f_x)$ , and $f_s$ is nonnegative; since it is the target value, to some extent it depends on the traversal paths of all the ants within the former $m-\mathrm{1}$ search cycles. That is, $C={\sum }_{k=\mathrm{1}}^m\Delta {\tau }_{ij}^k(t)$ , $C\subset [\mathrm{0,1}]$ . When $C=\mathrm{0}$ , as the initial time, the informational increment does not change between t and $t+\mathrm{1}$ ; that is, the increment of pheromone does not change within the segment of $t+\mathrm{1}$ ; that is, ${\tau }_{ij}(t+\mathrm{1})={\tau }_{ij}(t)$ . When $C\ne \mathrm{0}$ , the increment of pheromone depends on the incremental pheromone of the former $m-\mathrm{1}$ search paths; that is, $\Delta {\tau }_{ij}=C^{-\mathrm{1}}{\sum }_{k=\mathrm{1}}^m\Delta {\tau }_{ij}^k$ . Applying the equations described above to formula (15) and getting the limit:

$$\begin{array}{cc}& \underset{c\to \mathrm{1}}{\lim }{\displaystyle \sum }_{k=\mathrm{1}}^m\Delta {\tau }_{ij}^k=\frac{\mathrm{1}}{C}=\mathrm{1}.\end{array}$$

(16)

The proof is over.

Theorem 8 shows, in the cowering area, that the limit of incremental coverage of mobile nodes within a limited number of iterations is 1, so as to achieve the purpose of complete coverage of the area.

Theorem 9.

Assume in the coverage area that the coverage rate of sensor nodes is p, the maximum upper bound of iteration is N, and the expected number of sensor nodes is $E(X)=[\mathrm{1}-{(\mathrm{1}-p)}^N]p^{-\mathrm{1}}$ until the target node is covered.

Proof.

Assume X is the number of transfers at the first time to cover the target node; the possible values of $X:X\in [\mathrm{0,1},2,\dots ,N]$ , when $X=k$ and $\mathrm{1}\le k\le N-\mathrm{1}$ , which means the target node has not been covered within the former $N-\mathrm{1}$ times. So, the distribution density functions of X are

$$\begin{array}{cc}& P\left(X=k\right)=\{\begin{array}{cc}p{\left(\mathrm{1}-p\right)}^{k-\mathrm{1}}\hfill & k=\mathrm{1,2},\mathrm{3},\dots ,N-\mathrm{1}\hfill \\ {\left(\mathrm{1}-p\right)}^{N-\mathrm{1}}\hfill & k=N.\hfill \end{array}\end{array}$$

(17)

Then

$$\begin{array}{cc}& E\left(X\right)={\displaystyle \sum }_{k=\mathrm{1}}^{N-\mathrm{1}}kp{\left(\mathrm{1}-p\right)}^{k-\mathrm{1}}+N{\left(\mathrm{1}-p\right)}^{N-\mathrm{1}}.\end{array}$$

(18)

Let $q=\mathrm{1}-p$ , $S={\sum }_{k=\mathrm{1}}^{N-\mathrm{1}}k{(\mathrm{1}-p)}^{k-\mathrm{1}}$ ; then, $S={\sum }_{k=\mathrm{1}}^{N-\mathrm{1}}k{q}^{k-\mathrm{1}}$ ; multiplying both sides of the equation with q, we get $qS={\sum }_{k=\mathrm{1}}^{N-\mathrm{1}}k{q}^k$ ; that is,

$$\begin{array}{l}\left(\mathrm{1}-p\right)S={\displaystyle \sum }_{k=\mathrm{1}}^{N-\mathrm{2}}{q}^k-\left(N-\mathrm{1}\right)q^{N-\mathrm{1}}\\ \hspace{1em}\hspace{1em}\hspace{0.17em}\hspace{1em}=\frac{\mathrm{1}-q^{N-\mathrm{1}}}{\mathrm{1}-q}-\left(N-\mathrm{1}\right)q^{N-\mathrm{1}},\\ \hspace{1em}\hspace{1em}\hspace{0.17em}S=\frac{\mathrm{1}-q^{N-\mathrm{1}}}{{\left(\mathrm{1}-q\right)}^{\mathrm{2}}}-\frac{\left(N-\mathrm{1}\right)q^{N-\mathrm{1}}}{\mathrm{1}-q}\\ \hspace{1em}\hspace{1em}\hspace{0.17em}\hspace{1em}=\frac{\mathrm{1}-{\left(\mathrm{1}-p\right)}^{N-\mathrm{1}}}{p^{\mathrm{2}}}-\frac{\left(N-\mathrm{1}\right){\left(\mathrm{1}-p\right)}^{N-\mathrm{1}}}{p}.\end{array}$$

(19)

Substituting into (18) we have:

$$\begin{array}{l}E\left(X\right)=p\left(\frac{\mathrm{1}-{\left(\mathrm{1}-p\right)}^{N-\mathrm{1}}}{p^{\mathrm{2}}}-\frac{\left(N-\mathrm{1}\right){\left(\mathrm{1}-p\right)}^{N-\mathrm{1}}}{p}\right)\\ \phantom{E\left(X\right)\hspace{0.17em}\hspace{0.17em}\hspace{1em}}+N{\left(\mathrm{1}-p\right)}^{N-\mathrm{1}}\\ \phantom{E\left(X\right)\hspace{0.17em}}=\frac{\mathrm{1}-{\left(\mathrm{1}-p\right)}^{N-\mathrm{1}}}{p}-\left(N-\mathrm{1}\right){\left(\mathrm{1}-p\right)}^{N-\mathrm{1}}+N{\left(\mathrm{1}-p\right)}^{N-\mathrm{1}}\\ \phantom{E\left(X\right)\hspace{0.17em}}=\frac{\mathrm{1}-{\left(\mathrm{1}-p\right)}^{N-\mathrm{1}}+p{\left(\mathrm{1}-p\right)}^{N-\mathrm{1}}}{p}=\left[\mathrm{1}-{\left(\mathrm{1}-p\right)}^N\right]p^{-\mathrm{1}}.\end{array}$$

(20)

The proof is over.

Corollary 10.

Assume, in the coverage area, the coverage rate of sensor nodes is $P(A)$ ; then the coverage rate of node i in the area is $P(A)=\mathrm{1}-{\prod }_{\mathrm{1}\le i\le k}$ ( $\mathrm{1}-P(A)$ ).

Proof.

Using mathematical induction to prove it, in the area of coverage, each sensor node is not independent of each other when the sensor node works. Therefore, the probability that two sensor nodes work is

$$\begin{array}{l}P\left(A+A\right)=P\left(A\right)+P\left(A\right)-P\left(A\right)P\left(A\right)\\ \hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}=\mathrm{2}p-p^{\mathrm{2}}=\mathrm{1}-{\left(\mathrm{1}-p\right)}^{\mathrm{2}}.\end{array}$$

(21)

The probability of three nodes is

$$\begin{array}{cc}& P\left(A+A+A\right)=P\left(A+A\right)+P\left(A\right)-P\left(A+A\right)P\left(A\right).\end{array}$$

(22)

Applying formula (21) to the formula above

$$\begin{array}{cc}& P\left(A+A+A\right)=\mathrm{1}-{\left(\mathrm{1}-p\right)}^{\mathrm{3}}.\end{array}$$

(23)

When $i=n$ , then

$$\begin{array}{cc}& P\left(nA\right)=P\left[\left(n-\mathrm{1}\right)A\right]+P\left(A\right)-P\left[\left(n-\mathrm{1}\right)A\right]P\left(A\right).\end{array}$$

(24)

When $i=n+\mathrm{1}$ , applying it to the formula left,

$$\begin{array}{cc}& P\left(A\right)=\mathrm{1}-{\displaystyle \prod }_{\mathrm{1}\le i\le k}\left(\mathrm{1}-P\left(A\right)\right).\end{array}$$

(25)

The proof is over.

Corollary 11.

Generally, assume when sensor node covers some area, the minimum probability of making the whole network work normally is $P_{\mathrm{2}}$ ; the coverage rate of working node is $P_{\mathrm{1}}$ ( $P_{\mathrm{1}}\ge P_{\mathrm{2}}$ ), so when coverage rate of the whole network is not less than $P_{\mathrm{3}}$ ( $P_{\mathrm{3}}\ge P_{\mathrm{2}}$ ), N, the minimum number of sensor nodes is

$$\begin{array}{cc}& N=k^{\mathrm{2}}{p}_{\mathrm{1}}\left(\mathrm{1}-p_{\mathrm{1}}\right){\left(p_{\mathrm{1}}-p_{\mathrm{2}}\right)}^{-\mathrm{2}},\hspace{1em}where,\hspace{0.17em}\hspace{0.17em}k={\phi }^{-\mathrm{1}}\left(p_{\mathrm{3}}\right).\end{array}$$

(26)

Proof.

According to Di Morpho Laplace central limit theorem

$$\begin{array}{l}P\left(X\ge P_{\mathrm{2}}N\right)=\mathrm{1}-P\left(X<P_{\mathrm{2}}N\right)\\ \hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}=\mathrm{1}-P\left(\frac{X-P_{\mathrm{1}}N}{\sqrt{N{P}_{\mathrm{1}}\left(\mathrm{1}-P_{\mathrm{1}}\right)}}<\frac{P_{\mathrm{2}}N-P_{\mathrm{1}}N}{\sqrt{N{P}_{\mathrm{1}}\left(\mathrm{1}-P_{\mathrm{1}}\right)}}\right)\\ \hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\approx \mathrm{1}-\phi \left(-\frac{P_{\mathrm{1}}N-P_{\mathrm{2}}N}{\sqrt{N{P}_{\mathrm{1}}\left(\mathrm{1}-P_{\mathrm{1}}\right)}}\right)\\ \hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}\hspace{1em}=\phi \left(\frac{P_{\mathrm{1}}N-P_{\mathrm{2}}N}{\sqrt{N{P}_{\mathrm{1}}\left(\mathrm{1}-P_{\mathrm{1}}\right)}}\right)\ge P_{\mathrm{3}}.\end{array}$$

(27)

Let $k={\phi }^{-\mathrm{1}}(p_{\mathrm{3}})$ , the formula above could be simplified to $((P_{\mathrm{1}}N-P_{\mathrm{2}}N)/\sqrt{N{P}_{\mathrm{1}}(\mathrm{1}-P_{\mathrm{1}})})\ge k$ , so

$$\begin{array}{cc}& N=k^{\mathrm{2}}{p}_{\mathrm{1}}\left(\mathrm{1}-p_{\mathrm{1}}\right){\left(p_{\mathrm{1}}-p_{\mathrm{2}}\right)}^{-\mathrm{2}}.\end{array}$$

(28)

The proof is over.

4.2. Dynamic Parameter Settings and Update Policies

In the process of wireless sensor network optimization coverage, the process of moving of mobile node could be quickly completed after the introduction of the ACO, thus reaching the determined final position. There are a number of parameters of the ACO; each parameter has its own practical significance. Reasonable parameter settings can improve the convergence speed, Enhance the global search capability, effective inhibition appears premature stagnation. When α is too large, it will cause a positive feedback enhancement in the local optimal path. Consider

$$\begin{array}{cc}& \alpha =\{\begin{array}{cc}\kappa \alpha \hfill & {\tau }_{ij}\left(t+\mathrm{1}\right)\le {\tau }_{ij}\left(t\right)\hfill \\ \alpha \hfill & \text{otherwise},\hfill \end{array}\\ \beta =\{\begin{array}{cc}\kappa \beta \hfill & {\tau }_{ij}\left(t+\mathrm{1}\right)\ge {\tau }_{ij}\left(t\right)\hfill \\ \beta \hfill & \text{otherwise},\hfill \end{array}\end{array}$$

(29)

where k is the scale factor. Consider $k={\tau }_{ij}(t)/{\tau }_{ij}(t+\mathrm{1})$ . α and β can be adjusted dynamically by k, ensuring the effectiveness of the algorithm. When the optimal value obtained by the algorithm did not change significantly within the largest circulation $N_{c\max }$ , it is needed to make dynamic adjustments to ρ; the adjusted ρ should not be less than ${\rho }_{\min }$ . Consider

$$\begin{array}{cc}& \rho \left(t\right)=\{\begin{array}{cc}\mathrm{0.95}\rho \left(t-\mathrm{1}\right)\hfill & \mathrm{0.95}\rho \left(t-\mathrm{1}\right)\ge {\rho }_{\min }\hfill \\ {\rho }_{\min }\hfill & \text{otherwise}.\hfill \end{array}\end{array}$$

(30)

For ACO, when the ants move to the next position in a unit of time, the pheromone of path will increase substantially, making the most of the ants choose the same path. When the number of ants that choose the same path reaches a certain quantity, stopping traversal due to the current distance exceeds the length of previous optimal path, thus making the chance of other ants to choose the other paths increase, and the solution obtained by search tends to be diverse. The update policies of pheromone update according to (15).

4.3. OSCC Algorithm Description

Through geometric theory, the sensor nodes are deployed in key target node range and ensure that the concerned target nodes are covered by at least one sensor node; we find out the associated properties relationship of the working sensor nodes in a sensor node collection. Through the ACO iterative relations and event probability function, we find the optimal subset of iterative optimization after applying the iterative optimization to divided subregions. Thus making the entire network nodes have been optimized, obtaining the minimum number of coverage nodes. Computational cost and complexity of OSCC algorithm is low, which can save energy effectively, extend the life cycle of the network, and improve the performance. (See Algorithm 1 and Procedure 1).

Procedure 1

Begin

IF (When   N  is empty)

 S = emptyset ( $N=0$ )

End IF

While (N)

 {Do

   $S=S+S_i$

   $N=N+1$

 Do

  {switch (n)

     $n=1$ IF ( $t<=t_{\max }$ )

    Set each ant colony transition probability;

    Update the ant probability formula;

       { $S_i\leftarrow S_i$ ;

        Dynamic parameter Settings}

      IF ( $S_i==0$ );

      continue;

       end IF

     $n=2$   For   $k=1$ to   N   do

     transfer (Update probability formula)

     IF (flag)

      flag = 1

    else

      flag = 0

   end IF

  end For

$\}\}$   while(S)

Algorithm 1

Initialization: The sensor nodes are initialized to 0.

Input: sensor node set $S=\{s_1,s_2,\dots ,s_n\}$ ; Target monitoring area A; maximum target set  T;

Output: the minimum node set achieving cover the monitoring area S;

Step  1. Initialize the target monitoring area, generate the initial velocity and the initial position of each node, and set the

size of the network N.

Step  2. Assess the effective coverage performance; give the probability of each node by formula (14), then update the local

optimum of each node particle and the global optimum of entire particle swarm by the comparison of formula (15).

Step  3. According to the formula (29) and formula (30), update the dynamic parameters respectively in order to

find suitable comparison relationships.

Step  4. After some effective iteration for Step  2, if the change of optimal value obtained by OSCC algorithm is not obvious,

go to Step  2, otherwise, continue.

Step  5. When the distance between the sensor nodes to the minimum is the minimum or the coverage rate is the maximum,

the algorithm terminates.

Compared with the traditional single coverage or coverage under other controlled forms, the OSCC algorithm has stronger search capabilities and faster convergence in the process of node optimization and deployment. However, the ability to identify the precise direction for sensor nodes is needed and more energy consumption during the node deployment.

4.4. OSCC Algorithm Complexity Analysis

In order to verify the complexity of the algorithm in this paper, we will describe some parameters:

•  

α: information heuristic factor;

 

β: expectation heuristic factor;

 

ρ: pheromone volatilization coefficient;

 

n: number of sensor nodes;

 

m: collection of connected edges of nodes;

 

τ: values of pheromone;

 

$\Delta \tau$ : increment of pheromone;

 

t: iteration time;

 

p: transition probability;

 

$b,c$ : constant.

Assuming the number of sensor nodes is n, the number of edges between any two sensor nodes m, ${\tau }_{\mathrm{0}}$ , and ${\tau }_{\mathrm{1}}$ is the minimum and maximum of pheromone, respectively; $\Delta \tau$ is the incremental pheromone after iteration and ρ is the amount of residual information on the path. Let ${\tau }_{\mathrm{0}}=c$ , ${\tau }_{\mathrm{1}}=bn$ , where c and b are constant factors, t represents the number of iterations, and pheromone on the path at initial time is $\tau (\mathrm{0})=b/n$ ; according to the probability transfer (14), at time t, the transfer probability of a sensor node is greater than $c/\mathrm{2}bn$ , that the minimum probability of sensor nodes transfer is $p_{\min }=c/\mathrm{2}bn$ . Pheromone update function (15) shows that the updated pheromone at time t is $\tau (t)=\rho {\tau }_{\mathrm{0}}+(\mathrm{1}-\rho )\tau (t-\mathrm{1})$ , let $R=(\mathrm{1}-\rho )\tau (t-\mathrm{1})$ , that is, $\tau (t)=\rho c+R$ . At time $t+\mathrm{1}$ , transition probabilities of sensor nodes are

$$\begin{array}{l}p\left(t+\mathrm{1}\right)=\frac{{\tau }_{t+\mathrm{1}}\left(t+\mathrm{1}\right)}{{\tau }_{t+\mathrm{1}}\left(t+\mathrm{1}\right)+{\tau }_t\left(t+\mathrm{1}\right)}\le \frac{{\tau }_{t+\mathrm{1}}\left(t+\mathrm{1}\right)}{c+{\tau }_t\left(t+\mathrm{1}\right)}\\ \hspace{1em}\hspace{1em}\hspace{1em}\hspace{0.17em}\le \frac{b}{\left(\mathrm{1}-\rho \right)\left(c+c\rho +R\right)}.\end{array}$$

(31)

Let $L=b/(\mathrm{1}-\rho )(c+c\rho +R)$ ; the time complexity of the OSCC algorithm is

$$\begin{array}{l}E\left(T\right)={\displaystyle \sum }_{m=\mathrm{1}}^{n-\mathrm{1}}\left(\frac{\mathrm{2}bn}{c\left(n-m\right)}·{\left[\mathrm{1}-\frac{L}{n}\right]}^{\mathrm{1}-n}\right)\\ \hspace{1em}\hspace{0.17em}\hspace{1em}=\frac{\mathrm{2}bn}{c}{\left[\mathrm{1}-\frac{L}{n}\right]}^{\mathrm{1}-n}{\displaystyle \sum }_{m=\mathrm{1}}^{n-\mathrm{1}}\frac{\mathrm{1}}{m}\le \frac{\mathrm{2}bn}{c}{e}^L{H}_{n-\mathrm{1}}.\end{array}$$

(32)

Because ${\sum }_{m=\mathrm{1}}^{n-\mathrm{1}}(\mathrm{1}/m)$ is the sum of the first n items of harmonic series, let $H_{n-\mathrm{1}}={\sum }_{m=\mathrm{1}}^{n-\mathrm{1}}(\mathrm{1}/m)$ ; thus, ${\sum }_{x=\mathrm{1}}^{n-\mathrm{1}}(\mathrm{1}/x)-\mathrm{1}<{\int }_{\mathrm{1}}^{n-\mathrm{1}}(\mathrm{1}/x)dx<{\sum }_{x=\mathrm{1}}^{n-\mathrm{1}}(\mathrm{1}/x)$ ; that is,

$$\begin{array}{cc}& H_{n-\mathrm{1}}={\displaystyle \sum }_{m=\mathrm{1}}^{n-\mathrm{1}}\frac{\mathrm{1}}{x}={{\displaystyle \int }}_{\mathrm{1}}^{n-\mathrm{1}}\frac{\mathrm{1}}{x}\hspace{0.17em}dx=O\left(\ln n\right).\end{array}$$

(33)

5. Algorithm Evaluations

To better evaluate the validity and stability of OSCC, MATLAB7 is used to be experimental platform and parameter settings are shown in Table 1.

Table 1

Data parameter list.

Parameter	Parameter values
Area I	100 * 100 m2
Area II	200 * 200 m2
Area III	400 * 400 m2
Sensor numbers	0–400
Radius	5 m
Sensor energy	2 J
α	1
β	4
ρ	0.5
Times	100

According to the parameters setting in the previous section, sensor nodes are randomly scattered in a square area of $100*100$  m², $200*200$  m², and $400*400$  m². Figures 3, 4, 5, 6, 7, and 8 are all network layout figures after randomly deploying nodes in the above three target areas and node deployment with OSCC.

Figure 3

$100*100$  m², the deployment of nodes in random form.

Figure 4

The deployment of nodes after executing OSCC algorithm.

Figure 5

$200*200$  m², the deployment of nodes in random form.

Figure 6

The deployment of nodes after executing OSCC algorithm.

Figure 7

$400*400$  m², the deployment of nodes in random form.

Figure 8

The deployment of nodes after executing OSCC algorithm.

Comparing the deployment of network nodes with Figures 3, 4, 5, 6, 7, and 8 where can be seen that network coverage with OSCC is significantly higher than that of random deployment, and the distribution of nodes is more evenly deployed. When a target area is $100*100$  m² and the number of nodes $N=95$ , its coverage rate is 71.53% under usual condition, but it can reach 80.37% only with 83 sensor nodes after with OSCC; when a target area is $200*200$  m² and the number of nodes $N=135$ , its coverage rate is 72.36%, but it can reach 85.08% only with 125 sensor nodes with OSCC; when a target area is $400*400$  m² and the number of nodes $N=270$ , its coverage rate is 74.92%, but it can reach 91.15% only with 249 sensor nodes with OSCC.

To better evaluate validity of OSCC algorithm, simulation is done in MATLAB7 under Windows XP operating system while selecting three different coverage areas to do a comparative experiment about coverage rates. The curve between coverage rates and sensor nodes is shown in Figure 9.

Figure 9

The number of nodes and coverage rate graph.

Figure 9 reflects the relation between the number of nodes and coverage. Three curves, respectively, represent the degree of coverage rates with different sensor nodes. With the expansion of network size, the nodes needed to be deployed increase to meet the needs of network coverage, and the higher the network coverage rates are, the faster the nodes increase, meaning that full coverage is choosing different coverage areas to complete coverage with different sensor nodes. It is true that coverage of different target areas needs a different number of sensor nodes, when different areas have different coverage rate. Under certain coverage rate with the same nodes base, $100\times 100$  m² needs minimum and maximum in $400\times 400$  m².

This is a comparative experiment among OSCC algorithm, SCCP algorithm mentioned in [14], and PHOA algorithm mentioned in [15]. When the coverage rate is 99%, it is considered to be full coverage. The coverage area is $400\times 400$  m² and data are based on the average of the 200 times simulations, as shown in Figure 10.

Figure 10

Three algorithms coverage variation curve under different node number.

In Figure 10, with the increasing of sensor nodes, the coverage rate increases. When $N=\mathrm{320}$ , the coverage rate is close to 100% with OSCC, while the other two have not yet reached 100%. This shows a coverage rate in OSCC algorithm is much higher than the other two algorithms which prove the validity of the algorithm. In Figure 11, the coverage rates of the three algorithms are the same at initial moment, but the two other algorithms' coverage rates have decreased with time going on. The main reason is that SCCP algorithm uses uninterrupted coverage about nodes in the coverage control which means that SCCP algorithm is the continuing coverage to monitoring region's target node, until the energy of the nodes is completely consumed. During the coverage process of the PHOA algorithm, after the first time's coverage, the energy consumption of the leader node is almost the same with that of other nodes, which means each node's energy is consumed in the networks, thus the coverage is decreased rapidly with time going by. However, at $t=150$ , the OSCC declines obviously compared with two other target algorithms, the coverage of these three algorithms are 94.25%, 70.19%, and 20.13%. During the whole period of the time, the average coverage of OSCC is higher than that of other two algorithms, so OSCC would keep a higher coverage. It comes to conclusion that OSCC mentioned in this paper is the best of the three; the simulation proves its effectiveness.

Figure 11

Three algorithms coverage variation curve under different times.

6. Conclusions

Firstly, this paper gives a brief introduction of WSN applications. Secondly, literatures on coverage of WSN are studied and their algorithms are analyzed to introduce what this paper is concerned about. Thirdly, a network model is built in which the relation between sensor node and target node is given, including vector relations of different parameters. Also, the proof and derivation of maximum coverage rate and expectation in a full coverage WSN model is given. Then, the proof and derivation of coverage condition and coverage rate of multi-overage model is studied. Fourthly, this paper introduces a local fast research of ant colony optimization to improve its research performance which accelerate coverage speed of detected area and improve its coverage. What is more, the proof and derivation of coverage rate increment and expectation of target coverage is given, thus getting the coverage rate of specific detected point. Fifthly, to avoid the influence of some dynamically changed parameters on global research, this paper makes adjustments on some parameters to give out a better algorithm description. Sixthly, Simulations on different coverage areas and comparison simulations with other algorithms verify the effectiveness of OSCC. There is still some work on scheduling of multicoverage nodes and minimum set of covering surface and so on.