Yuan Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Yuan Li has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Delin Hou
School of Computer and Information Science, Hubei Engineering Univerisity, Xiaogan 432000, China
1 shared publication - Shihui Wang
School of Computer Science and Information Engineering, Hubei University, Wuhan 430062, China
1 shared publication - Xuemin Zhang
School of Computer and Information Science, Hubei Engineering University, Xiaogan, China
1 shared publication - Yanchao Liu
Communication University of China, Beijing, China
1 shared publication - Zenggang Xiong
School of Computer and Information Science, Hubei Engineering University, Xiaogan, China
1 shared publication
Latest Publications
- Open Access
- 1 August 2024
- Published by MDPI AG in Electronics
- Vol. 13 (15) , 3044
A Resource-Based Dynamic Pricing and Forced Forwarding Incentive Algorithm in Socially Aware Networking
In socially aware networking, nodes typically behave selfishly due to resource constraints and social correlations, resulting in low network performance. To incentivize selfish nodes to actively participate in message forwarding, this paper proposes a resource-based dynamic pricing and forced forwarding incentive algorithm (DFIA). Firstly, the algorithm introduces virtual currency as a transaction medium and then designs a pricing function based on factors such as the node’s resource status, participation contribution, location relevance, and social connectivity. It ensures that the forwarding service is transacted at a reasonable price through bargaining rules. Secondly, a forced forwarding strategy is implemented to compel selfish nodes, which are unwilling to participate in other nodes’ message forwarding, to forward a certain number of non-local messages. Meanwhile, in order to prevent nodes from discarding messages and to ensure successful forwarding to the destination, specific rules are used to allocate contribution values to nodes that successfully participate in message forwarding. Lastly, to avoid false quotation behavior, blockchain technology is employed. Transaction information is packaged into blocks and added to the blockchain after consensus validation by other nodes in the network, ensuring the transparency and immutability of transaction data. Simulation results indicate that compared with the existing incentive algorithms, this algorithm not only enhances message delivery probability but also effectively reduces average latency.
- 1 August 2024
- Published by MDPI AG in Electronics
- Vol. 13 (15) , 3044
Open AccessA Resource-Based Dynamic Pricing and Forced Forwarding Incentive Algorithm in Socially Aware Networking
In socially aware networking, nodes typically behave selfishly due to resource constraints and social correlations, resulting in low network performance. To incentivize selfish nodes to actively participate in message forwarding, this paper proposes a resource-based dynamic pricing and forced forwarding incentive algorithm (DFIA). Firstly, the algorithm introduces virtual currency as a transaction medium and then designs a pricing function based on factors such as the node’s resource status, participation contribution, location relevance, and social connectivity. It ensures that the forwarding service is transacted at a reasonable price through bargaining rules. Secondly, a forced forwarding strategy is implemented to compel selfish nodes, which are unwilling to participate in other nodes’ message forwarding, to forward a certain number of non-local messages. Meanwhile, in order to prevent nodes from discarding messages and to ensure successful forwarding to the destination, specific rules are used to allocate contribution values to nodes that successfully participate in message forwarding. Lastly, to avoid false quotation behavior, blockchain technology is employed. Transaction information is packaged into blocks and added to the blockchain after consensus validation by other nodes in the network, ensuring the transparency and immutability of transaction data. Simulation results indicate that compared with the existing incentive algorithms, this algorithm not only enhances message delivery probability but also effectively reduces average latency.