VLDB 2026 Research / reviewers in the wild / expert
Yunxin Lv
dblp:183/1440
· DBLP profile ↗
3ranked-venue papers
1as first author
2since 2021 · last 2023
0000-0002-0990-9398ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 3 · 1 first-author · 2 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
1 paper |
Cryptographic protocols and secure computation · 100% | |
| Computer networks
1 paper |
Optical networks · 100% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › key management
key distribution |
0.3 | 1 | 2017 | Secure Key Distribution Based on Dynamic Chaos Synchronization of Cascaded Semiconductor Laser Systems · IEEE Trans. Commun. 2017 |
Methods — techniques the papers use, named apart from their topics
phase modulation · 0.6cross-correlation analysis · 0.6chaos synchronization · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | A novel artificial intelligence based wireless local area network channel access control scheme for low latency e-health applicationsabstractAbstract To effectively support low‐latency e‐health applications, a novel artificial intelligence‐based wireless local area network (WLAN) channel access control scheme named intelligent hybrid channel access (IHCA) is proposed and studied. In the IHCA scheme, each beacon interval comprises multiple cycles, with each cycle containing a contention‐free period (CFP) and a contention period (CP). By adopting an artificial neural network (ANN) and utilizing its calculation outputs to (1) decide whether to poll a hub during the CFP and (2) determine the initial backoff count (IBC) of each hub, polling of empty hubs during CFP can be reduced, and collisions during CP can be relieved. The authors’ simulation results show that the IHCA scheme can effectively reduce latency compared to the Hybrid coordination function Controlled Channel Access (HCCA) and the Request based Polling Access (RPA) reference designs. Yunxin Lv, Meihua Bi, Yanrong Zhai |
IET Commun. | 2 |
| 2022 | Artificial neural network assisted polling scheme for central coordinated low-latency WLANs
Yunxin Lv, Meihua Bi, Hao Chi, Yanrong Zhai, Zhengfeng Qian |
Comput. Networks | 1 |
| 2017 | Secure Key Distribution Based on Dynamic Chaos Synchronization of Cascaded Semiconductor Laser SystemsabstractA new secure key distribution scheme based on the dynamic chaos synchronization of two cascaded semiconductor laser systems (CSLSs) subject to common chaotic injection and random phase-modulated optical feedback is demonstrated. In this scheme, Alice and Bob adopt two independent random sequences to control the phase modulators of CSLSs, which induces a dynamic perturbation to the chaos synchronization. We thoroughly investigate the chaos synchronization performance under different phase-shift conditions with cross-correlation function, and systematically discuss the feasibility and security of the system. The results show that, with proper injection and feedback strength, the correlation coefficient gap between phase shift match and mismatch is clear and robust to the parameter mismatches in the CSLSs and those between the two CSLSs. Based on this, high-quality key distribution can be performed by picking out the identical random bits from the two independent random sequences according to the computational correlation. Moreover, the investigations on the information theoretic security and rate of the key distribution show that the security of the key distribution scheme can be further enhanced by properly increasing the number of layers in the CSLSs or employing high-order modulation format. Chenpeng Xue, Ning Jiang 0003, Yunxin Lv |
IEEE Trans. Commun. | 3 |