Name
Abstract | ||
|---|---|---|
In order to fulfill the coverage requirement, Maximum Network Lifetime Problem (MLP) is to maximize the network lifetime while providing full coverage over a predefined set of targets. There is a variant of coverage problem called α-coverage, where a fraction of targets allowed to be left uncovered to provide partial coverage. This variant of coverage is presented by Maximum Network α-Lifetime Problem (α-MLP) that is the special case of classical MLP. During α-coverage, there has been no choice over targets which are going to be left uncovered, instead, a random set of targets are left uncovered. If we can wisely select the set of targets which are going to be left uncovered, then, the network lifetime can be prolonged further. In this paper, we propose an energy-efficient heuristic to solve α-MLP. Our heuristic not only supports partial coverage, but, it also put a valuable observation on the targets which are left uncovered. Our simulation outcomes show that the network lifetime achieved by our heuristic is far better than those achieved with many existing heuristics for α-coverage. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s11277-017-4589-1 | Wireless Personal Communications |
Keywords | Field | DocType |
Target coverage,α-Coverage,Upper bound,Cover set,Network lifetime,Heuristic | Heuristic,Computer science,Upper and lower bounds,Computer network,Heuristics,Wireless sensor network,Special case | Journal |
Volume | Issue | ISSN |
97 | 1 | 0929-6212 |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manju | 1 | 0 | 1.01 |
| S. Chand | 2 | 100 | 20.69 |
| Bijendra Kumar | 3 | 6 | 4.15 |