Target Coverage Algorithms with Multiple Sensing Ranges in Wireless Sensor Networks Conference Paper uri icon

abstract

  • Coverage is a broad research area in wireless sensor networks. In order to maximize network lifetime for target coverage, we study the target coverage problem with multiple sensing ranges, which has been proved NP-complete. For CGH algorithm [13] that introduces many redundant sensors in each round, we propose an Energy-efficient Centralized Greedy and Heuristic algorithm (ECGH), which introduces a concept of "remote target", and adopts a scheme, where sensors that can cover the "remote target" are selected with a high priority. ECGH algorithm depends on global information, so we propose an Energy-efficient Distributed and Localized Greedy Heuristic algorithm (EDLGH). Different from DLGH algorithm [13], EDLGH algorithm schedules sensors in a more energy-efficient way. Besides, an efficient schema for eliminating redundant sensors is also proposed in the EDLGH algorithm. Finally, we study the performance of ECGH and EDLGH by comparing them with existing CGH and DLGH algorithms. Simulation results show that network lifetime of ECGH and EDLGH outperform 7.9%-10.2% and almost 100% than those of CGH and DLGH, respectively. 2010 IEEE.

name of conference

  • 2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE

published proceedings

  • MILITARY COMMUNICATIONS CONFERENCE, 2010 (MILCOM 2010)

author list (cited authors)

  • Wang, J., Liu, M., Lu, M., & Zhang, X. i.

citation count

  • 4

complete list of authors

  • Wang, Jianxin||Liu, Ming||Lu, Mingming||Zhang, Xi

publication date

  • January 2010