### Abstract

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.

Original language | English (US) |
---|---|

Title of host publication | IEEE INFOCOM 2009 - The 28th Conference on Computer Communications |

Pages | 2168-2176 |

Number of pages | 9 |

DOIs | |

State | Published - Oct 12 2009 |

Event | 28th Conference on Computer Communications, IEEE INFOCOM 2009 - Rio de Janeiro, Brazil Duration: Apr 19 2009 → Apr 25 2009 |

### Publication series

Name | Proceedings - IEEE INFOCOM |
---|---|

ISSN (Print) | 0743-166X |

### Other

Other | 28th Conference on Computer Communications, IEEE INFOCOM 2009 |
---|---|

Country | Brazil |

City | Rio de Janeiro |

Period | 4/19/09 → 4/25/09 |

### All Science Journal Classification (ASJC) codes

- Computer Science(all)
- Electrical and Electronic Engineering

## Fingerprint Dive into the research topics of 'Minimizing the cost of mine selection via sensor networks'. Together they form a unique fingerprint.

## Cite this

*IEEE INFOCOM 2009 - The 28th Conference on Computer Communications*(pp. 2168-2176). [5062141] (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFCOM.2009.5062141