Anzeige
Erschienen in:
2007 | OriginalPaper | Buchkapitel
Algorithms for the m-Coverage Problem and k-Connected m-Coverage Problem in Wireless Sensor Networks
verfasst von : Deying Li, Jiannong Cao, Dongsheng Liu, Ying Yu, Hui Sun
Erschienen in: Network and Parallel Computing
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
An important issue in deploying a wireless sensor network (WSN) is to provide target coverage with high energy efficiency and fault-tolerance. In this paper, we study the problem of constructing energy-efficient and fault-tolerant target coverage with the minimal number of active nodes which form an
m
-coverage for targets and a
k
-connected communication subgraph. We propose two heuristic algorithms for
m
-coverage problem, and get the performance ratio of one heuristic. Then two heuristic algorithms are further proposed to solve the
k
-connected
m
-coverage problem. The simulation results demonstrate the desired efficiency of the proposed algorithms.