Coverage Optimization In Wireless Sensor Network Based On Boundary Interval Algorithm

This paper focuses on the static wireless sensor network (WSN) coverage optimization. The deployment of the nodes determines the hardware architecture of the network which should guarantee the Basic Requirements (coverage, connectivity, etc.) of the network. Furthermore, an efficient architecture is supposed to consume less hardware resource as well. This leads to less power consumption and fewer redundancy data which means to prolong the lifetime while increase the efficiency.The existing optimization algorithms can be divided into search algorithm and image analysis algorithm. These two types of algorithms are centralized algorithm which requires the complete information of all nodes. The implementation of centralized algorithm requires the repeated calculation of coverage which leading to high degree of algorithm complexity and low efficiency. Moreover, in the data centralizing process, the nodes which are closed to the cluster node will take on more tasks of data packet transmission, resulting in more energy consumption, thereby affecting the life of the network.By researching the coverage model of the nodes, this paper presents the boundary interval algorithm to solve optimization problems. Boundary interval algorithm is a kind of deterministic and distributed algorithm. Compared with the centralized algorithm, it avoids a lot of data packet transmission which causes waste of WSN resources, this point is especially in line with the actual wireless sensor network applications. The Boundary interval algorithm has the characteristics of less computation and high accuracy. It can obtain the reliable solutions while saving a large amount of calculations. As a distributed algorithm, the task of boundary interval algorithm is shared by all the nodes in the network, so the network can avoid the problem of uneven energy consumption.In real network applications, in addition to saving calculation and reducing transmissions, the algorithm can also save the time required to set up the network. Relative to the centralized algorithm, the boundary interval algorithm does not require data centralization and data return transmissions, so the network processing time is reduced significantly.The main research work of this paper is listed as follows:(1) The proving of the best coverage pattern. By proving the best coverage pattern under different coverage requirements, we achieve the optimal coverage curve;(2) The mathematical description for coverage optimization problem. Through the study of nodes coverage pattern, we propose the mathematical form of the coverage problem which is the theoretical basis of boundary interval algorithm;(3) The presentation of Boundary interval method. According to border relations between nodes, this paper presents the boundary interval algorithm to solve the coverage problem. And we analyze some important features of the algorithm, such as computation.Through the above mathematical analysis, this paper presents the boundary interval algorithm. In order to prove the accuracy and usefulness of the algorithm, we design the algorithm simulation and network simulation. The results of algorithm simulation prove the accuracy and superiority of boundary interval algorithm; the results of network simulation demonstrate the capabilities of boundary interval algorithm in the actual application.