1 |
朱晓娟, 何勇男. 能量有效的无线传感器网络动态任务调度算法. 计算机工程与设计, 2020, 41 (2): 313- 318.
doi: 10.16208/j.issn1000-7024.2020.02.003
|
|
ZHU X J, HE Y N. Energy-efficiency dynamic task scheduling in wireless sensor networks. Computer Engineering and Design, 2020, 41 (2): 313- 318.
doi: 10.16208/j.issn1000-7024.2020.02.003
|
2 |
张清国, 张勇, 张伟, 等. 基于蜂窝结构的改进混合无线传感器网络覆盖优化算法. 计算机工程, 2022, 48 (12): 172- 179.
URL
|
|
ZHANG Q G, ZHANG Y, ZHANG W, et al. Improved coverage optimization algorithm for hybrid wireless sensor networks based on cellular structure. Computer Engineering, 2022, 48 (12): 172- 179.
URL
|
3 |
GOPE P, DAS A K, KUMAR N, et al. Lightweight and physically secure anonymous mutual authentication protocol for real-time data access in industrial wireless sensor networks. IEEE Transactions on Industrial Informatics, 2019, 15 (9): 4957- 4968.
doi: 10.1109/TII.2019.2895030
|
4 |
COHEN A, COHEN A, GUREWITZ O. Efficient data collection over multiple access wireless sensors network. IEEE/ACM Transactions on Networking, 2020, 28 (2): 491- 504.
doi: 10.1109/TNET.2020.2964764
|
5 |
EPHREMIDES A, WIESELTHIER J E, BAKER D J. A design concept for reliable mobile radio networks with frequency hopping signaling. Proceedings of the IEEE, 1987, 75 (1): 56- 73.
doi: 10.1109/PROC.1987.13705
|
6 |
WANG B W, SUN Y J, DO-DUY T, et al. Adaptive d-hop connected dominating set in highly dynamic flying ad-hoc networks. IEEE Transactions on Network Science and Engineering, 2021, 8 (3): 2651- 2664.
doi: 10.1109/TNSE.2021.3103873
|
7 |
DU Y L, DU H W. A new bound on maximum independent set and minimum connected dominating set in unit disk graphs. Journal of Combinatorial Optimization, 2015, 30 (4): 1173- 1179.
doi: 10.1007/s10878-013-9690-0
|
8 |
YANG Z S, SHI M J, WANG W. Greedy approximation for the minimum connected dominating set with labeling. Optimization Letters, 2021, 15 (2): 685- 700.
doi: 10.1007/s11590-020-01628-6
|
9 |
FUKUNAGA T. Approximation algorithms for highly connected multi-dominating sets in unit disk graphs. Algorithmica, 2018, 80 (11): 3270- 3292.
doi: 10.1007/s00453-017-0385-2
|
10 |
FUKUNAGA T. Adaptive algorithm for finding connected dominating sets in uncertain graphs. IEEE/ACM Transactions on Networking, 2020, 28 (1): 387- 398.
doi: 10.1109/TNET.2019.2963361
|
11 |
GAO X F, ZHU X D, LI J, et al. A novel approximation for multi-hop connected clustering problem in wireless networks. IEEE/ACM Transactions on Networking, 2017, 25 (4): 2223- 2234.
doi: 10.1109/TNET.2017.2690359
|
12 |
HONG Y, LI D Y, CHEN Z B. Constructing virtual backbone with guaranteed routing cost in wireless sensor networks. Ad Hoc Networks, 2021, 116, 102500.
doi: 10.1016/j.adhoc.2021.102500
|
13 |
THAI M T, WANG F, LIU D, et al. Connected dominating sets in wireless networks with different transmission ranges. IEEE Transactions on Mobile Computing, 2007, 6 (7): 721- 730.
doi: 10.1109/TMC.2007.1034
|
14 |
BAI S, CHE X J, BAI X, et al. Maximal independent sets in heterogeneous wireless ad hoc networks. IEEE Transactions on Mobile Computing, 2016, 15 (8): 2023- 2033.
doi: 10.1109/TMC.2015.2508805
|
15 |
ZHANG Z, ZHOU J, MO Y C, et al. Performance-guaranteed approximation algorithm for fault-tolerant connected dominating set in wireless networks[C]//Proceedings of the 35th Annual IEEE International Conference on Computer Communications. Washington D. C., USA: IEEE Press, 2016: 1-8.
|
16 |
WANG W, LIU B, KIM D, et al. A new constant factor approximation to construct highly fault-tolerant connected dominating set in unit disk graph. IEEE/ACM Transactions on Networking, 2017, 25 (1): 18- 28.
doi: 10.1109/TNET.2016.2561901
|
17 |
LIU B, WANG W, KIM D, et al. On practical construction of quality fault-tolerant virtual backbone in homogeneous wireless networks. IEEE/ACM Transactions on Networking, 2018, 26 (1): 412- 421.
doi: 10.1109/TNET.2017.2780262
|
18 |
ZHOU J, ZHANG Z, TANG S J, et al. Fault-tolerant virtual backbone in heterogeneous wireless sensor network. IEEE/ACM Transactions on Networking, 2017, 25 (6): 3487- 3499.
doi: 10.1109/TNET.2017.2740328
|
19 |
ZHANG Z, ZHOU J A, TANG S J, et al. Computing minimum k-connected m-fold dominating set in general graphs. INFORMS Journal on Computing, 2018, 30 (2): 217- 224.
doi: 10.1287/ijoc.2017.0776
|
20 |
DASH D. Restoring virtual backbone of Wireless Sensor Network on sensor failure[C]//Proceedings of the 3rd International Conference on Recent Advances in Information Technology. Washington D. C., USA: IEEE Press, 2016: 29-34.
|
21 |
DAS A, AASAWAT M, MANDAL C, et al. An improved greedy construction of minimum connected dominating sets in wireless networks[C]//Proceedings of IEEE Wireless Communications and Networking Conference. Washington D. C., USA: IEEE Press, 2011: 790-795.
|
22 |
KIM D, WANG W, LI X Y, et al. A new constant factor approximation for computing 3-connected m-dominating sets in homogeneous wireless networks[C]//Proceedings IEEE INFOCOM. Washington D. C., USA: IEEE Press, 2010: 1-9.
|
23 |
WANG F, THAI M T, DU D Z. On the construction of 2-connected virtual backbone in wireless networks. IEEE Transactions on Wireless Communications, 2009, 8 (3): 1230- 1237.
doi: 10.1109/TWC.2009.051053
|
24 |
SHI Y, ZHANG Y, ZHANG Z, et al. A greedy algorithm for the minimum 2-connected m-fold dominating set problem. Journal of Combinatorial Optimization, 2016, 31 (1): 136- 151.
doi: 10.1007/s10878-014-9720-6
|
25 |
SHANG W P, YAO F, WAN P J, et al. On minimum m-connected k-dominating set problem in unit disc graphs. Journal of Combinatorial Optimization, 2008, 16 (2): 99- 106.
doi: 10.1007/s10878-007-9124-y
|