Rao Ying
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Rao Ying has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Xuemin Zhang
School of Computer and Information Science, Hubei Engineering University, Xiaogan, China
4 shared publications - Zenggang Xiong
School of Computer and Information Science, Hubei Engineering University, Xiaogan, China
4 shared publications - Deng Haitao
School of Computer and Information Science, Hubei Engineering Univerisity, Xiaogan, China
3 shared publications - Li Yuan
School of Computer and Information Science, Hubei Engineering Univerisity, Xiaogan, China
3 shared publications - Delin Hou
School of Computer and Information Science, Hubei Engineering Univerisity, Xiaogan, China
2 shared publications - Yanchao Liu
Communication University of China, Beijing, China
2 shared publications
Latest Publications
- Open Access
- 25 September 2024
- Published by MDPI AG in Electronics
- Vol. 13 (19) , 3797
Social Trust Confirmation-Based Selfish Node Detection Algorithm in Socially Aware Networks
Nodes in socially aware networks (SANs) may act selfishly on individual bases due to resource constraints and socially selfish behavior arising from the social preferences of nodes. In response to such selfish behaviors exhibited by nodes, this paper proposes a social trust confirmation-based selfish node detection algorithm (STCDA). This algorithm first utilizes a subjective forwarding willingness detection mechanism to discern selfishness. If a node’s energy is insufficient or its message rejection rate is too high—that is, the node cannot or is unwilling to forward messages—it indicates that the node is selfish. Otherwise, it is evaluated more thoroughly through the node’s social trust detection mechanisms. It calculates the social trust level of nodes based on the benefits of forwarding messages, thereby distinguishing between individually selfish nodes and socially selfish nodes in the network. If further evaluation is needed, the final judgment will be made using the message confirmation feedback detection mechanism. This checks the message information forwarded by nodes in the network. If nodes fail to forward messages after receiving them—excluding reasons such as message expiration or temporary insufficient cache space—it indicates that the nodes are selfish. Results from experimental simulations show that this algorithm performs better than traditional algorithms. Under conditions of 80% selfish nodes, a message TTL of 300 min, and 10 MB of cache space, it improves the message delivery rate by 5.87% and reduces the average delay by 6.2% compared to the existing comprehensive confirmation-based selfish node detection algorithm.
- 25 September 2024
- Published by MDPI AG in Electronics
- Vol. 13 (19) , 3797
Open AccessSocial Trust Confirmation-Based Selfish Node Detection Algorithm in Socially Aware Networks
Nodes in socially aware networks (SANs) may act selfishly on individual bases due to resource constraints and socially selfish behavior arising from the social preferences of nodes. In response to such selfish behaviors exhibited by nodes, this paper proposes a social trust confirmation-based selfish node detection algorithm (STCDA). This algorithm first utilizes a subjective forwarding willingness detection mechanism to discern selfishness. If a node’s energy is insufficient or its message rejection rate is too high—that is, the node cannot or is unwilling to forward messages—it indicates that the node is selfish. Otherwise, it is evaluated more thoroughly through the node’s social trust detection mechanisms. It calculates the social trust level of nodes based on the benefits of forwarding messages, thereby distinguishing between individually selfish nodes and socially selfish nodes in the network. If further evaluation is needed, the final judgment will be made using the message confirmation feedback detection mechanism. This checks the message information forwarded by nodes in the network. If nodes fail to forward messages after receiving them—excluding reasons such as message expiration or temporary insufficient cache space—it indicates that the nodes are selfish. Results from experimental simulations show that this algorithm performs better than traditional algorithms. Under conditions of 80% selfish nodes, a message TTL of 300 min, and 10 MB of cache space, it improves the message delivery rate by 5.87% and reduces the average delay by 6.2% compared to the existing comprehensive confirmation-based selfish node detection algorithm.
- 27 May 2024
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 96 (6-7) , 369-383
Self-Organizing Key Security Management Algorithm in Socially Aware Networking
- 27 May 2024
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 96 (6-7) , 369-383
Self-Organizing Key Security Management Algorithm in Socially Aware Networking
- 17 February 2024
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 96 (2) , 153-168
Secure Routing Strategy Based on Attribute-Based Trust Access Control in Social-Aware Networks
- 17 February 2024
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 96 (2) , 153-168
Secure Routing Strategy Based on Attribute-Based Trust Access Control in Social-Aware Networks
- 7 November 2023
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 95 (12) , 1439-1453
Resource-Constrained and Socially Selfish-Based Incentive Algorithm for Socially Aware Networks
- 7 November 2023
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 95 (12) , 1439-1453
Resource-Constrained and Socially Selfish-Based Incentive Algorithm for Socially Aware Networks