Wireless Sensor Network Of Minimal Set Covering Of DNA Algorithms

Wireless Sensor Network (WSN) is an emerging network of science and technology. It is studied originally by the U.S. military. The problem of network coverage is the key basic issue to the research and application of wireless sensor networks, which directly affects the performance of network. The network coverage is challenged severely by extra-large scale wireless sensor, densely distributed nodes, limited communications, computing and storage capacity, and harsh application environment. Particularly, most nodes of sensor are supported by battery, and with conditions limited, it is difficult to replace the battery for a node in the use. Therefore, the energy limitation of sensor nodes is the bottleneck in wireless sensor network design. Therefore, on the basis of ensuring network coverage smoothly, how to extend the working hours of the network is an important aspect of the wireless sensor networks research presently.In this paper, we will transform the problem of wireless sensor coverage into a graph theory optimization problem-the minimum set covering problem. Thus, the practical problem is transformed into a mathematical model, and make mathematical model for wireless sensor networks regional coverage. Then using sticker-model algorithm of DNA computing model solves the minimum set covering problem. On the basis of this coverage problem, we propose k-layer vertical coverage, which will elevate the operation survival time of wireless sensor networks k times.The innovation of this paper is to find the wireless sensor network area coverage problem by applying biotechnology-based DNA algorithm.The new algorithm combines the biological computing with the intersected field of mathematics and wireless sensor networks. The DNA algorithm provides a new programming idea for our study. DNA parallel computing capability has a broad outlook for application.