Xiaoyong Yan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xiaoyong Yan has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Jian Zhou
Nanjing University of Posts and Telecommunications
2 shared publications - Lijuan Sun
College of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210023, China
2 shared publications - Juan Wang
School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing 210023, China
1 shared publication Qian Bo
College of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210023, China
1 shared publicationXiang Feng
YuanTong Express Co. LTD
1 shared publicationXiaotian Gong
College of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210023, China
1 shared publication
Latest Publications
- Open Access
- 21 April 2021
- Published by Wiley in Security and Communication Networks
- Vol. 2021, 1-11
Adaptive Routing Strategy Based on Improved Double Q-Learning for Satellite Internet of Things
Satellite Internet of Things (S-IoT), which integrates satellite networks with IoT, is a new mobile Internet to provide services for social networks. However, affected by the dynamic changes of topology structure and node status, the efficient and secure forwarding of data packets in S-IoT is challenging. In view of the abovementioned problem, this paper proposes an adaptive routing strategy based on improved double Q-learning for S-IoT. First, the whole S-IoT is regarded as a reinforcement learning environment, and satellite nodes and ground nodes in S-IoT are both regarded as intelligent agents. Each node in the S-IoT maintains two Q tables, which are used for selecting the forwarding node and for evaluating the forwarding value, respectively. In addition, the next hop node of data packets is determined depending on the mixed Q value. Second, in order to optimize the Q value, this paper makes improvements on the mixed Q value, the reward value, and the discount factor, respectively, based on the congestion degree, the hop count, and the node status. Finally, we perform extensive simulations to evaluate the performance of this adaptive routing strategy in terms of delivery rate, average delay, and overhead ratio. Evaluation results demonstrate that the proposed strategy can achieve more efficient and secure routing in the highly dynamic environment compared with the state-of-the-art strategies.
- 21 April 2021
- Published by Wiley in Security and Communication Networks
- Vol. 2021, 1-11
Open AccessAdaptive Routing Strategy Based on Improved Double Q-Learning for Satellite Internet of Things
Satellite Internet of Things (S-IoT), which integrates satellite networks with IoT, is a new mobile Internet to provide services for social networks. However, affected by the dynamic changes of topology structure and node status, the efficient and secure forwarding of data packets in S-IoT is challenging. In view of the abovementioned problem, this paper proposes an adaptive routing strategy based on improved double Q-learning for S-IoT. First, the whole S-IoT is regarded as a reinforcement learning environment, and satellite nodes and ground nodes in S-IoT are both regarded as intelligent agents. Each node in the S-IoT maintains two Q tables, which are used for selecting the forwarding node and for evaluating the forwarding value, respectively. In addition, the next hop node of data packets is determined depending on the mixed Q value. Second, in order to optimize the Q value, this paper makes improvements on the mixed Q value, the reward value, and the discount factor, respectively, based on the congestion degree, the hop count, and the node status. Finally, we perform extensive simulations to evaluate the performance of this adaptive routing strategy in terms of delivery rate, average delay, and overhead ratio. Evaluation results demonstrate that the proposed strategy can achieve more efficient and secure routing in the highly dynamic environment compared with the state-of-the-art strategies.
- Open Access
- 16 October 2020
- Published by Wiley in Security and Communication Networks
- Vol. 2020, 1-9
Routing Strategy for LEO Satellite Networks Based on Membership Degree Functions
The deployment of Mobile Edge Computing (MEC) servers on Low Earth Orbit (LEO) satellites to form MEC satellites is of increasing concern. A routing strategy is the key technology in MEC satellites. To solve the uncertainty problem of LEO satellite link information caused by complex space environments, a routing strategy for LEO satellite networks based on membership degree functions is proposed. First, a routing model based on uncertain link information is established. In particular, the membership function is designed to describe the uncertain link information. Based on this, the comprehensive evaluation of the path is calculated, and the routing model considering uncertainty is established with the comprehensive evaluation of the path as the optimization objective. Second, in order to quickly calculate the path, a grey wolf optimization algorithm is designed to solve the routing model. Finally, simulation results show that the proposed strategy can achieve efficient and secure routing in complex space environments and improve the overall performance compared with the performances of traditional routing strategies.
- 16 October 2020
- Published by Wiley in Security and Communication Networks
- Vol. 2020, 1-9
Open AccessRouting Strategy for LEO Satellite Networks Based on Membership Degree Functions
The deployment of Mobile Edge Computing (MEC) servers on Low Earth Orbit (LEO) satellites to form MEC satellites is of increasing concern. A routing strategy is the key technology in MEC satellites. To solve the uncertainty problem of LEO satellite link information caused by complex space environments, a routing strategy for LEO satellite networks based on membership degree functions is proposed. First, a routing model based on uncertain link information is established. In particular, the membership function is designed to describe the uncertain link information. Based on this, the comprehensive evaluation of the path is calculated, and the routing model considering uncertainty is established with the comprehensive evaluation of the path as the optimization objective. Second, in order to quickly calculate the path, a grey wolf optimization algorithm is designed to solve the routing model. Finally, simulation results show that the proposed strategy can achieve efficient and secure routing in complex space environments and improve the overall performance compared with the performances of traditional routing strategies.
- 11 July 2019
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 329-340
Accurate and Fast DV-Hop Localization Algorithm in Irregular Networks
- 11 July 2019
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 329-340
Accurate and Fast DV-Hop Localization Algorithm in Irregular Networks