Name
Abstract | ||
|---|---|---|
Battery-Free Wireless Sensor Network (BF-WSN) is a newly proposed network architecture to address the limitation of traditional Wireless Sensor Networks (WSNs). The special features of BF-WSNs make the coverage problem quite different and even more challenging from and than that in traditional WSNs. This paper defines a new coverage problem in BF-WSNs which aims at maximizing coverage quality rather than prolonging network lifetime. The newly defined coverage problem is proved to be at least NP-Hard. Two sufficient conditions, under which the optimal solution of the problem can he derived in polynomial time, are given in this paper. Furthermore, two approximate algorithms are proposed to derive nearly optimal coverage when the sufficient conditions are unsatisfied. The time complexity and approximate ratio of the two algorithms are analyzed. Extensive simulations are carried out to examine the performance of the proposed algorithms. The simulation results show that these algorithms are efficient and effective. |
Year | Venue | Field |
|---|---|---|
2018 | IEEE INFOCOM | Approximation algorithm,Computer science,Network architecture,Battery (electricity),Time complexity,Energy resources,Wireless sensor network,Distributed computing |
DocType | ISSN | Citations |
Conference | 0743-166X | 1 |
PageRank | References | Authors |
0.35 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tuo Shi | 1 | 41 | 4.55 |
| Jianzhong Li | 2 | 63 | 24.23 |
| Hong Gao | 3 | 1086 | 120.07 |
| Zhipeng Cai | 4 | 1928 | 132.81 |