Name
Abstract | ||
|---|---|---|
Optimizing deployment of charging base stations in wireless rechargeable sensor networks can considerably reduce the cost. Previously, the charging base stations are simply installed at some fixed special points (e.g., the grid points) after partitioning the area distributed by sensor nodes. In this paper, a new algorithm of planning the charging base stations is proposed based on the greedy algorithm and the location relationship of the sensor nodes. The proposed algorithm exploits the local search ability and avoids falling into an exponential increase of the number of the charging base stations (i.e., combinatorial explosion). The simulated results show that the proposed algorithm can result in less number and flexible deployed locations of the charging base stations. In addition, this algorithm provides a novel solution for the point coverage problems. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1186/s13638-019-1393-5 | EURASIP Journal on Wireless Communications and Networking |
Keywords | Field | DocType |
Wireless rechargeable sensor network, Greedy algorithm, Charging base station | Base station,Wireless,Software deployment,Computer science,Algorithm,Real-time computing,Greedy algorithm,Local search (optimization),Combinatorial explosion,Wireless sensor network,Grid | Journal |
Volume | Issue | ISSN |
2019 | 1 | 1687-1499 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peng Wan | 1 | 53 | 10.02 |
| Yu-Hua Cheng | 2 | 2 | 5.85 |
| Baoyu Wu | 3 | 0 | 0.34 |
| Gaofeng Wang | 4 | 24 | 10.09 |