Name
Title | ||
|---|---|---|
Barrier Coverage Lifetime Maximization in a Randomly Deployed Bistatic Radar Network. |
Abstract | ||
|---|---|---|
Maximizing the lifetime of barrier coverage is a critical issue in randomly deployment sensor networks. In this paper, we study the barrier coverage lifetime maximization problem in a bistatic radar network, where the radar nodes follow a uniform deployment. We first construct a coverage graph to describe the relationship among different bistatic radar pairs. We then propose a solution to maximize the barrier lifetime: An algorithm is first proposed to find all barriers based on coverage graph and then determines the operation time for each barrier by using linear programming method. We also propose two heuristic algorithms called greedy algorithm and random algorithm for large-scale networks. Simulation results validate the effectiveness of the proposed algorithms. |
Year | Venue | Field |
|---|---|---|
2017 | MSN | Radar,Randomized algorithm,Heuristic,Computer science,Algorithm,Greedy algorithm,Bistatic radar,Linear programming,Wireless sensor network,Maximization,Distributed computing |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
10 | 3 | |