Name
Abstract | ||
|---|---|---|
Duty-cycle scheduling is an effective way to balance energy consumptions and prolong network lifetime of wireless sensor networks (WSNs), which usually requires a connected dominating set (CDS) to guarantee network connectivity and coverage. Therefore, the problem of finding the largest number of CDSs is important for WSNs. The previous works always assume all the nodes are non-rechargeable. Howev... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TNET.2017.2657688 | IEEE/ACM Transactions on Networking |
Keywords | Field | DocType |
Wireless sensor networks,Approximation algorithms,Energy harvesting,Distributed algorithms,Energy consumption,Algorithm design and analysis,IEEE transactions | Approximation algorithm,Key distribution in wireless sensor networks,Algorithm design,Scheduling (computing),Computer science,Computer network,Distributed algorithm,Connected dominating set,Energy consumption,Wireless sensor network,Distributed computing | Journal |
Volume | Issue | ISSN |
25 | 3 | 1063-6692 |
Citations | PageRank | References |
14 | 0.65 | 16 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tuo Shi | 1 | 41 | 4.55 |
| Siyao Cheng | 2 | 438 | 22.59 |
| Zhipeng Cai | 3 | 1928 | 132.81 |
| Yingshu Li | 4 | 671 | 53.71 |
| Jianzhong Li | 5 | 63 | 24.23 |