Xinyuan Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Xinyuan Wu has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Jianlin Xia
Department of Mathematics, Purdue University, West Lafayette, USA
2 shared publications - Antonis Dimakis
Athens University of Economics and Business
1 shared publication - Bin Wang
School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an, China
1 shared publication - Costas Courcoubetis
The Chinese University of Hong Kong
1 shared publication - Fazhan Geng
Department of Mathematics, Changshu Institute of Technology, Changshu, People’s Republic of China
1 shared publication - Jin Xu
Ministry of Education
1 shared publication
Latest Publications
- Open Access
- 10 September 2025
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 180
The impact of autonomous vehicles on ride-hailing platforms with strategic human drivers
- 10 September 2025
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 180
Open AccessThe impact of autonomous vehicles on ride-hailing platforms with strategic human drivers
- Open Access
How should the server sleep? -- Age-energy tradeoff in sleep-wake server systems
The surging demand for fresh information from various Internet of Things (IoT) applications requires oceans of data sampled from the physical environment to be transmitted and processed timely, which would lead to huge energy consumption. We investigate the sleep-wake strategies of servers in communication systems to reduce energy consumption while guaranteeing timely delivery of fresh information to users. Specifically, we investigate a multi-source single-server queueing system and propose a novel sleep-wake strategy called the Conditional Sleep (CS) scheme. Our analysis reveals that the CS scheme outperforms the widely-used Hysteresis Time (HT) and Bernoulli Sleep (BS) schemes in terms of Age of Information (AoI), while retaining the same energy consumption rate and Peak Age of Information (PAoI). We find that increasing the sleep period length leads to a reduction in energy consumption and an increase in PAoI, but it does not always increase AoI. Moreover, we show that using PAoI as the information freshness metric in designing sleep-wake strategies would make the server sleep infinitely long due to the PAoI being determined by first-order statistics. We further numerically show that having the bufferless system can achieve a better PAoI-energy tradeoff than the infinite buffer system when having a large sampling rate.
Open AccessHow should the server sleep? -- Age-energy tradeoff in sleep-wake server systems
The surging demand for fresh information from various Internet of Things (IoT) applications requires oceans of data sampled from the physical environment to be transmitted and processed timely, which would lead to huge energy consumption. We investigate the sleep-wake strategies of servers in communication systems to reduce energy consumption while guaranteeing timely delivery of fresh information to users. Specifically, we investigate a multi-source single-server queueing system and propose a novel sleep-wake strategy called the Conditional Sleep (CS) scheme. Our analysis reveals that the CS scheme outperforms the widely-used Hysteresis Time (HT) and Bernoulli Sleep (BS) schemes in terms of Age of Information (AoI), while retaining the same energy consumption rate and Peak Age of Information (PAoI). We find that increasing the sleep period length leads to a reduction in energy consumption and an increase in PAoI, but it does not always increase AoI. Moreover, we show that using PAoI as the information freshness metric in designing sleep-wake strategies would make the server sleep infinitely long due to the PAoI being determined by first-order statistics. We further numerically show that having the bufferless system can achieve a better PAoI-energy tradeoff than the infinite buffer system when having a large sampling rate.
- 19 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Green Communications and Networking
- Vol. 7 (4) , 1620-1634
How Should the Server Sleep?—Age-Energy Tradeoff in Sleep-Wake Server Systems
The surging demand for fresh information from various Internet of Things (IoT) applications requires oceans of data sampled from the physical environment to be transmitted and processed timely, which would lead to huge energy consumption. We investigate the sleep-wake strategies of servers in communication systems to reduce energy consumption while guaranteeing timely delivery of fresh information to users. Specifically, we investigate a multi-source single-server queueing system and propose a novel sleep-wake strategy called the Conditional Sleep (CS) scheme. Our analysis reveals that the CS scheme outperforms the widely-used Hysteresis Time (HT) and Bernoulli Sleep (BS) schemes in terms of Age of Information (AoI), while retaining the same energy consumption rate and Peak Age of Information (PAoI). We find that increasing the sleep period length leads to a reduction in energy consumption and an increase in PAoI, but it does not always increase AoI. Moreover, we show that using PAoI as the information freshness metric in designing sleep-wake strategies would make the server sleep infinitely long due to the PAoI being determined by first-order statistics. We further numerically show that having the bufferless system can achieve a better PAoI-energy tradeoff than the infinite buffer system when having a large sampling rate.
- 19 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Green Communications and Networking
- Vol. 7 (4) , 1620-1634
How Should the Server Sleep?—Age-Energy Tradeoff in Sleep-Wake Server Systems
The surging demand for fresh information from various Internet of Things (IoT) applications requires oceans of data sampled from the physical environment to be transmitted and processed timely, which would lead to huge energy consumption. We investigate the sleep-wake strategies of servers in communication systems to reduce energy consumption while guaranteeing timely delivery of fresh information to users. Specifically, we investigate a multi-source single-server queueing system and propose a novel sleep-wake strategy called the Conditional Sleep (CS) scheme. Our analysis reveals that the CS scheme outperforms the widely-used Hysteresis Time (HT) and Bernoulli Sleep (BS) schemes in terms of Age of Information (AoI), while retaining the same energy consumption rate and Peak Age of Information (PAoI). We find that increasing the sleep period length leads to a reduction in energy consumption and an increase in PAoI, but it does not always increase AoI. Moreover, we show that using PAoI as the information freshness metric in designing sleep-wake strategies would make the server sleep infinitely long due to the PAoI being determined by first-order statistics. We further numerically show that having the bufferless system can achieve a better PAoI-energy tradeoff than the infinite buffer system when having a large sampling rate.
- 19 October 2020
- Published by Wiley in Numerical Methods for Partial Differential Equations
- Vol. 37 (2) , 1269-1281
Kernel functions‐based approach for distributed order diffusion equations
- 19 October 2020
- Published by Wiley in Numerical Methods for Partial Differential Equations
- Vol. 37 (2) , 1269-1281
Kernel functions‐based approach for distributed order diffusion equations
- 1 November 2019
- Published by Elsevier in Journal of Computational Physics
- Vol. 396, 867-887
Volume-preserving exponential integrators and their applications
- 1 November 2019
- Published by Elsevier in Journal of Computational Physics
- Vol. 396, 867-887
Volume-preserving exponential integrators and their applications
- 30 August 2013
- Published by Springer Nature in Numerical Algorithms
- Vol. 65 (3) , 465-483
Error analysis of explicit TSERKN methods for highly oscillatory systems
- 30 August 2013
- Published by Springer Nature in Numerical Algorithms
- Vol. 65 (3) , 465-483
Error analysis of explicit TSERKN methods for highly oscillatory systems
- 1 March 2010
- Published by Elsevier in Computer Physics Communications
- Vol. 181 (3) , 639-650
Extended RKN-type methods with minimal dispersion error for perturbed oscillators
- 1 March 2010
- Published by Elsevier in Computer Physics Communications
- Vol. 181 (3) , 639-650
Extended RKN-type methods with minimal dispersion error for perturbed oscillators
- 1 December 2007
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 84 (12) , 1795-1803
Study of general Taylor-like explicit methods in solving stiff ordinary differential equations
In this paper, we present a further study of Taylor-like explicit methods in solving stiff ordinary differential equations. We derive the general form for Taylor-like explicit methods in solving stiff differential equations. We also analyse the order of convergence and stability property for the general form. Moreover, we give its corresponding vector form via introducing a new definition of vector product and quotient in another article. The convergence and stability of the vector form are considered as well.
- 1 December 2007
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 84 (12) , 1795-1803
Study of general Taylor-like explicit methods in solving stiff ordinary differential equations
In this paper, we present a further study of Taylor-like explicit methods in solving stiff ordinary differential equations. We derive the general form for Taylor-like explicit methods in solving stiff differential equations. We also analyse the order of convergence and stability property for the general form. Moreover, we give its corresponding vector form via introducing a new definition of vector product and quotient in another article. The convergence and stability of the vector form are considered as well.
- 1 July 2001
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 42 (1-2) , 115-119
Quadratically convergent multiple roots finding method without derivatives
- 1 July 2001
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 42 (1-2) , 115-119
Quadratically convergent multiple roots finding method without derivatives