TY - GEN

T1 - Minimizing the cost of mine selection via sensor networks

AU - Liu, Changlei

AU - Cao, Guohong

PY - 2009

Y1 - 2009

N2 - In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the objective is to destroy the intruding targets using the minimum-cost pre-deployed mines. Due to the problem complexity, we first transform it using a novel bucket-tub model, and then propose several approximation algorithms. Among them, it is shown that the layering algorithm can achieve an approximation ratio of α · f, where α ≥ 1 is the tunable relaxation factor and f is the maximum number of mines that a target is associated with, and that the greedy algorithm has an approximation ratio of Σ j Rj, where R j is the coefficient in the related integer program. We also present a localized greedy algorithm which is shown to produce the same solution set as the global greedy algorithm. Theoretical analysis and extensive simulations demonstrate the effectiveness of the proposed algorithms.

AB - In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the objective is to destroy the intruding targets using the minimum-cost pre-deployed mines. Due to the problem complexity, we first transform it using a novel bucket-tub model, and then propose several approximation algorithms. Among them, it is shown that the layering algorithm can achieve an approximation ratio of α · f, where α ≥ 1 is the tunable relaxation factor and f is the maximum number of mines that a target is associated with, and that the greedy algorithm has an approximation ratio of Σ j Rj, where R j is the coefficient in the related integer program. We also present a localized greedy algorithm which is shown to produce the same solution set as the global greedy algorithm. Theoretical analysis and extensive simulations demonstrate the effectiveness of the proposed algorithms.

UR - http://www.scopus.com/inward/record.url?scp=70349658411&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349658411&partnerID=8YFLogxK

U2 - 10.1109/INFCOM.2009.5062141

DO - 10.1109/INFCOM.2009.5062141

M3 - Conference contribution

AN - SCOPUS:70349658411

SN - 9781424435135

T3 - Proceedings - IEEE INFOCOM

SP - 2168

EP - 2176

BT - IEEE INFOCOM 2009 - The 28th Conference on Computer Communications

T2 - 28th Conference on Computer Communications, IEEE INFOCOM 2009

Y2 - 19 April 2009 through 25 April 2009

ER -