Name
Abstract | ||
|---|---|---|
Barrier coverage is a hot issue in wireless sensor networks. Most literatures study barrier coverage under one-hop wireless sensor networks. In this paper, we consider more practical environment: multihop wireless sensor networks. We study the problem of how to achieve interference-free k-barrier coverage which has not been discussed before. Firstly, we analyze how k-barrier coverage suffers from interference in multi-hop networks. Then we propose an effective algorithm to solve the problem which is called computing maximal k-connected barriers without interference. In this algorithm, we construct none-crossing k-barrier coverage firstly and then we construct a communication interference graph to compute a maximal k-connected barriers without interference. Simulations show our algorithm can prolong the network lifetime of k-barrier coverage and is more effective than the existing method. © Springer International Publishing Switzerland 2014. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-12691-3 14 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Keywords | Field | DocType |
k-barrier coverage, Interference-free, Multi-hop wireless sensor networks | Interference (communication),Key distribution in wireless sensor networks,Graph,Computer science,Computer network,Interference (wave propagation),Wireless sensor network | Conference |
Volume | ISSN | Citations |
8881 | 0302-9743 | 1 |
PageRank | References | Authors |
0.35 | 9 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Du Hongwei | 1 | 343 | 41.34 |
| Luo Haiming | 2 | 7 | 1.13 |
| Jing Zhang | 3 | 373 | 101.39 |
| Zhu Rongrong | 4 | 7 | 1.81 |
| Qiang Ye | 5 | 175 | 20.49 |