A New DNA Algorithm for Coverage of Wireless Sensor Networks

作者：Guo Y C^*; Zhang B L

来源：International Conference oInternational Conference on Advances in Management Engineering and Information Technology (AMEIT), 2015-06-28 to 2015-06-29.

• wireless sensor networks
• DNA algorithm
• minimum set covering

Wireless sensor networks (WSNs) which consist of many sensors are used to monitor environmental conditions in the target area. However, unreasonable deployment for WSNs may lead to redundancy and decline working life. In order to implement full coverage for the monitored area and reduce redundancy and energy wastage, this paper proposes a new DNA algorithm for coverage of WSNs. We transform WSNs coverage problem into minimum set covering problem, and according to the characteristics of minimum set covering problem, the corresponding algorithm steps are designed. Besides, a specific instance is used to verify the correctness of the proposed algorithm. The results show that the proposed algorithm can implement full coverage and reduce redundancy for WSNs. Furthermore, the proposed algorithm can be reliable and easy to be carried out.

• 出版日期2015
• 单位南京大学