摘要

The covering problem and node deployment is a fundamental problem in the research of wireless sensor network. The number of nodes and the coverage of a network can directly affect performance and operating costs. For this reason, we propose an EMAC algorithm (Energy Efficient Multi-target Associate Coverage Algorithm). The algorithm uses the correlation between the nodes and dynamic grouping to adjust coverage area. Within the coverage area, we use the greedy algorithm to optimize the coverage area. So, the target node is uniformly covered by other sensor nodes and the network resources is optimized. To ensure the energy balance in wireless sensor network and extend the lifetime of it, we only wake partial nodes to work in a cycle, so that, they can work in turn. Experiments show that the algorithm can effectively reduce energy consumption, with better adaptability and effectiveness.

  • 出版日期2015