Yongmei Sun

dblp:92/2153 · DBLP profile ↗
← Back
13ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 10 · 2 since 2021Artificial intelligence and machine learning · 2 · 1 first-authorSystems, architecture and hardware · 1

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.

Computer networks
3 papers
Optical networks · 84% Internet of things and sensor networks · 8% Wireless sensing and localization · 8%
Network and information security
2 papers
Cryptographic protocols and secure computation · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › key management › key distribution
quantum key distribution
1.522026
Analysis of Four-Wave Mixing Type Noises in the Quantum and Classical Coexistence Systems Over Multicore Fiber · IEEE Trans. Commun. 2026
Simultaneous Long-Distance Transmission of Discrete-Variable Quantum Key Distribution and Classical Optical Communication · IEEE Trans. Commun. 2021
Optical networks › optical fiber
multicore fiber
1.012026
Analysis of Four-Wave Mixing Type Noises in the Quantum and Classical Coexistence Systems Over Multicore Fiber · IEEE Trans. Commun. 2026
Optical networks
optical fiber communication
0.512021
Simultaneous Long-Distance Transmission of Discrete-Variable Quantum Key Distribution and Classical Optical Communication · IEEE Trans. Commun. 2021
Wireless sensing and localization
sensor network localization
0.112012
Locating sensors in the forest: A case study in GreenOrbs · INFOCOM 2012
Internet of things and sensor networks
wireless sensor network
0.112012
Locating sensors in the forest: A case study in GreenOrbs · INFOCOM 2012

Methods — techniques the papers use, named apart from their topics

discrete change model · 2.0coupled-power theory · 2.0raman noise modeling · 1.0key rate analysis · 1.0weighted ranging · 0.1reverse-localization · 0.1power scanning · 0.1
YearPublicationVenuePosition
2026 Analysis of Four-Wave Mixing Type Noises in the Quantum and Classical Coexistence Systems Over Multicore Fiber
abstract
In this paper, we study the theory of four-wave mixing type noises over multicore fiber (MCF) and analyze the impacts of the noises on quantum key distribution (QKD) in the quantum and classical coexistence system. The models about four-wave mixing type noises proposed in this paper include forward inter-core four-wave mixing (FIC-FWM), backward four-wave mixing (B-FWM) and backward inter-core four-wave mixing (BIC-FWM). a) The model of FIC-FWM based on discrete change model (FIC-FWM-DCM) is proposed to obtain the precise power of FIC-FWM. Simultaneously, we further propose the model of FIC-FWM based on extended coupled-power theory (FIC-FWM-ECPT) which can obtain similar results to FIC-FWM-DCM but with lower computational complexity. b) The generation mechanism of B-FWM is proposed, and the model is built by combining forward four-wave mixing and backward Rayleigh scattering. c) The generation mechanism of BIC-FWM is proposed, and the model is built by combining FIC-FWM and B-FWM. Based on the above three models of four-wave mixing type noises, we analyze the impacts of the noises on QKD in the quantum and classical coexistence systems over MCF. The results show that the proposed models of FIC-FWM can significantly improve the simulation accuracy in the coexistence system. B-FWM noise can generate a serious impact on QKD when the guard bandwidth between quantum and classical channels is less than 250 GHz with the launch power of 2 mW. BIC-FWM noise can generate a significant impact on QKD when the frequency spacing is less than or equal to 25 GHz and the launch power is larger than 2 mW. Finally, the experiments are carried out to measure FIC-FWM, and the results show the proposed model of FIC-FWM can obtain the consistent results with experiments.
Yaoxian Gao, Yongmei Sun, Yuefeng Ji
IEEE Trans. Commun.2
2021 Simultaneous Long-Distance Transmission of Discrete-Variable Quantum Key Distribution and Classical Optical Communication
abstract
We theoretically study the issues for long-distance transmission of quantum key distribution (QKD) coexisting with classical signals. The recently proposed phase-matching QKD protocol can drastically improve the transmission distance of QKD. However, in the coexistence system, the noise generated by classical signals, especially spontaneous Raman scattering noise, is a big challenge. Moreover, the classical optical amplifier, which is necessary for the realistic long-distance classical communication, makes the noise more serious. In view of this, we establish the unified Raman noise model for three discrete-variable QKD protocols (BB84, measurement-device-independent and phase-matching QKD protocols) in the presence of classical optical amplifiers, which can be applied to both single-core single-mode fiber and multicore fiber. Then, we derive the key rate of the three QKD protocols coexisting with classical signals using the proposed unified Raman noise model. Finally, simulation results show that multicore fiber is promising for simultaneous long-distance transmission of QKD and the dense wavelength division multiplexing system.
Chun Cai, Yongmei Sun, Yuefeng Ji
IEEE Trans. Commun.2
2018 Priority-based capacity and power allocation in co-located WBANs using Stackelberg and bargaining games
Yongmei Sun, Yuefeng Ji
J. Supercomput.2
2018 QoS-based adaptive power control scheme for co-located WBANs: a cooperative bargaining game theoretic perspective
Yongmei Sun, Yuefeng Ji
Wirel. Networks2
2017 Collision analysis of CSMA/CA based MAC protocol for duty cycled WBANs
Zhongcheng Wei, Yongmei Sun, Yuefeng Ji
Wirel. Networks2
2016 C2: Truthful incentive mechanism for multiple cooperative tasks in mobile cloud
abstract
In the practical crowdsourcing systems, there exist many cooperative tasks, each of which requires a group of users to perform together, such as finding the shortest multi-hop path or obtaining the media resources from a set of hosts. In this paper, we tackle the problem of how to truthfully and fairly schedule or allocate sufficient users who join mobile crowd-sourcing applications with their smartphones. Moreover, the cooperation among users is taken into account. Thus, we present a novel Cooperative Crowdsourcing (C2) auction mechanism for crowdsourcing multiple cooperative tasks. C2 contains two parts: user selection and payment computation. In the first part, we first prove that users selection with the minimum social cost is NP hard problem and design a greedy algorithm to achieve near-optimal solution in polynomial time. The other part is that the server determines the payments of selected users to avoid the bidder's cheating behavior through a pricing algorithm that if and only if users honestly bid their cost, they can obtain the maximum utility. Both theoretical analysis and extensive simulations demonstrate that C2 auction achieves not only truthfulness, individual rationality and high computational efficiency, but also low overpayment ratio.
Shuyun Luo, Yongmei Sun, Zhenyu Wen, Yuefeng Ji
ICC2
2016 Stackelberg Game Based Incentive Mechanisms for Multiple Collaborative Tasks in Mobile Crowdsourcing
Shuyun Luo, Yongmei Sun, Yuefeng Ji, Dong Zhao 0001
Mob. Networks Appl.2
2013 An integrating data gathering scheme for wireless sensor networks
abstract
Direct reporting, partial nodes selection and compressive sensing are three common types of data gathering in wireless sensor networks. Integrating the above three techniques together for a better performance has been paid many attentions. Hybrid-CS is an effective way to save energy for data gathering, which adopts direct reporting method instead of compressive sensing in the area near the leaf nodes. This paper presents a higher-level hybrid scheme that integrates partial nodes selection into compressive sensing by using a threshold, so as to extend the area before compressive sensing. For this idea, we give a completed theoretical analysis of the relationship between energy consumption and different parameters settings, then we present the influence of different parameters acting on network performance under three general scenarios. At last, we run extensive simulations on the real data trace of Citysee system and the results show that the proposed integrating scheme can realize the purpose of network performance optimization.
Zhongcheng Wei, Yongmei Sun, Yuefeng Ji
WCNC2
2012 Delay Minimum Data Collection in the low-duty-cycle wireless sensor networks
abstract
In low-duty-cycle wireless sensor networks, wireless nodes usually have two states: active state and dormant state. The necessary condition for a successful wireless transmission is that both the sender and the receiver are awake. In this paper, we study the problem: How fast can raw data be collected from all source nodes to a sink in low-duty-cycle WSNs? To address this, we define the Minimum Data Collection Delay (MDCD) problem, and give both the lower and upper tight bounds on the minimum delay for data collection when interfering links are eliminated. Furthermore, a novel concept, Virtual Grid Network (VGN) is introduced to successfully convert the MDCD problem into max-flow problem, and present a MDCD algorithm enlightened by the Ford-fulkerson max-flow method, which is able to find an optimal solution in polynomial time and achieves the lower bound. Extensive simulations are conducted and the results show that the proposed MDCD algorithm significantly outperforms the Shortest Path Routing algorithm (up to 32%) and achieves the lower bound.
Shuyun Luo, Xufei Mao, Yongmei Sun, Yuefeng Ji, Shaojie Tang 0001
GLOBECOM3
2012 Locating sensors in the forest: A case study in GreenOrbs
abstract
As a large scale real sensor network system, GreenOrbs reveals that locating sensor nodes in the forest still faces great challenges because of volatile and fluctuating environmental factors. In this paper, we present a novel localization scheme, EARL, which provides accurate reference nodes and good ranging quality. We exam the range quality along routing paths by taking complex environmental factors into account, such as forest density, temperature and humidity. To improve localization accuracy, we use power scanning technique to judge the accuracy reference nodes and further calibrate the bad nodes through reverse-localization. To overcome the error propagation, we assign different weights to the range measurement according to the ranging quality. We implemented our localization scheme in GreenOrbs testbed, and evaluate through extensive experiments. The results demonstrate that EARL outperforms the current localization approaches with better accuracy. The localization accuracy achieved by our method is around 20% higher than best existing methods.
Cheng Bo, Danping Ren, Shaojie Tang 0001, Xiang-Yang Li 0001, Xufei Mao, Qiuyuan Huang, Lufeng Mo, Zhiping Jiang, Yongmei Sun, Yunhao Liu 0001
INFOCOM9
2011 A Dynamic Spectrum Access Strategy Based on Real-Time Usability in Cognitive Radio Sensor Networks
abstract
Currently, Wireless Sensor Networks (WSN) mostly operate on the fixed and unlicensed Industrial, Scientific and Medical (ISM) spectrum. With the increasing spectrum shortage in WSN, the Cognitive Radio Sensor Networks (CRSN) is proposed to employ the Cognitive Radio (CR) technology to utilize the spectrum resources dynamically (i.e., Dynamic Spectrum Access, DSA). However, it's a challenge to increase the delivery rate and the throughput in the CRSN because of the power and process restrictions. In this paper, with the consideration of the spectrum idle condition and communication capability, a novel DSA strategy based on the Real-time Usability (DSARU) is presented. And the energy-saving updating algorithm of the spectrum real-time usability is proposed to sense the spectrum changes. Based on the IEEE 802.15.4, DSARU simulation model and experiment system are set up to evaluate the transmission performances. Both simulation and experiment results demonstrate that the DSARU strategy can efficiently increase the delivery rate and throughput, especially under the condition of spectrum interference.
Zemin Hu, Yongmei Sun, Yuefeng Ji
MSN2
2005 Neural Networks Preprocessing Based Adaptive Latency Change Estimation of Evoked Potentials
Yongmei Sun, Tianshuang Qiu, Wenhong Liu
ISNN (3)1
2004 A New Blind Source Separation Method Based on Fractional Lower Order Statistics and Neural Network
Daifeng Zha, Tianshuang Qiu, Hong Tang 0001, Yongmei Sun, Lixin Shen
ISNN (1)4