Chen Li
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
Chen Li has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
Houwei Cao
2 shared publicationsTongyu Zong
2 shared publications- Tongyu Zong
Department of Electrical and Computer Engineering, New York University, Brooklyn, NY, USA
2 shared publications - Yao Wang
New York University Tandon School of Engineering, Electrical and Computer Engineering Department, Brooklyn, NY, USA
2 shared publications Yong Liu
2 shared publications- Yong Liu
Department of Electrical and Computer Engineering, New York University, Brooklyn, NY, USA
2 shared publications
Latest Publications
- 18 June 2025
- Published by Elsevier in Computer Networks
- Vol. 269
Coffee: Cost-effective edge caching for live 360 degree video streaming
- 18 June 2025
- Published by Elsevier in Computer Networks
- Vol. 269
Coffee: Cost-effective edge caching for live 360 degree video streaming
- 19 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 27 (15209210) , 6154-6167
Progressive Frame Patching for FoV-Based Point Cloud Video Streaming
Many XR applications require the delivery of volumetric video to users. Point Cloud has become a popular volumetric video format. A dense point cloud consumes much higher bandwidth than a 2D/360 $^{\circ }$ video frame. User Field of View (FoV) is more dynamic with 6-DoF movement than 3-DoF movement. To save bandwidth, FoV-adaptive streaming predicts a user's FoV and only downloads point cloud data falling in the predicted FoV. However, it is vulnerable to FoV prediction errors, which can be significant when a long buffer is utilized for smoothed streaming. In this work, we propose a multi-round progressive refinement framework for point cloud video streaming. Instead of sequentially downloading point cloud frames, our solution simultaneously downloads/patches multiple frames falling into a sliding time-window, leveraging the inherent scalability of octree-based point-cloud coding. The optimal rate allocation among all tiles of active frames are solved numerically using the heterogeneous tile rate-quality functions calibrated by the predicted user FoV. Multi-frame downloading/patching simultaneously takes advantage of the streaming smoothness resulting from long buffer and the FoV prediction accuracy at short buffer length. We evaluate our streaming solution using simulations driven by real point cloud videos, real bandwidth traces, and 6-DoF FoV traces of real users. Our solution is robust against the bandwidth/FoV prediction errors, and can deliver high and smooth view quality in the face of bandwidth variations and dynamic user and point cloud movements.
- 19 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 27 (15209210) , 6154-6167
Progressive Frame Patching for FoV-Based Point Cloud Video Streaming
Many XR applications require the delivery of volumetric video to users. Point Cloud has become a popular volumetric video format. A dense point cloud consumes much higher bandwidth than a 2D/360 $^{\circ }$ video frame. User Field of View (FoV) is more dynamic with 6-DoF movement than 3-DoF movement. To save bandwidth, FoV-adaptive streaming predicts a user's FoV and only downloads point cloud data falling in the predicted FoV. However, it is vulnerable to FoV prediction errors, which can be significant when a long buffer is utilized for smoothed streaming. In this work, we propose a multi-round progressive refinement framework for point cloud video streaming. Instead of sequentially downloading point cloud frames, our solution simultaneously downloads/patches multiple frames falling into a sliding time-window, leveraging the inherent scalability of octree-based point-cloud coding. The optimal rate allocation among all tiles of active frames are solved numerically using the heterogeneous tile rate-quality functions calibrated by the predicted user FoV. Multi-frame downloading/patching simultaneously takes advantage of the streaming smoothness resulting from long buffer and the FoV prediction accuracy at short buffer length. We evaluate our streaming solution using simulations driven by real point cloud videos, real bandwidth traces, and 6-DoF FoV traces of real users. Our solution is robust against the bandwidth/FoV prediction errors, and can deliver high and smooth view quality in the face of bandwidth variations and dynamic user and point cloud movements.
- Open Access
- 31 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 24-34
Spatial Visibility and Temporal Dynamics: Rethinking Field of View Prediction in Adaptive Point Cloud Video Streaming
- 31 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 24-34
Open AccessSpatial Visibility and Temporal Dynamics: Rethinking Field of View Prediction in Adaptive Point Cloud Video Streaming
- 27 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 236-240
Observer-Based Fixed-Time Leader-Following Consensus Control for MASs Subject to DoS attack
In this article, we study the fixed-time (FT) leader-following consensus (LFC) control problem on multi-agent systems (MASs) subject to denial-of-service (DoS) attacks and disturbances. Firstly, considering the unknown velocity and disturbance, a prescribed-time extended state observer (ESO) is proposed for estimating velocity and disturbance. Sufficient conditions on the error dynamics of the prescribed-time ESO to converge in prescribed time are given in the form of a linear matrix inequality. Moreover, by utilizing data transmitted from neighboring agents, a cooperative FT sliding mode control scheme is proposed. To assure that the MASs can achieve the LFC in front of DoS attacks, the relevant sufficient conditions are given. Independent of the starting state value, the upper bound of convergence time is deduced. Finally, an example is presented as an illustration of the effectiveness of the proposed approach.
- 27 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 236-240
Observer-Based Fixed-Time Leader-Following Consensus Control for MASs Subject to DoS attack
In this article, we study the fixed-time (FT) leader-following consensus (LFC) control problem on multi-agent systems (MASs) subject to denial-of-service (DoS) attacks and disturbances. Firstly, considering the unknown velocity and disturbance, a prescribed-time extended state observer (ESO) is proposed for estimating velocity and disturbance. Sufficient conditions on the error dynamics of the prescribed-time ESO to converge in prescribed time are given in the form of a linear matrix inequality. Moreover, by utilizing data transmitted from neighboring agents, a cooperative FT sliding mode control scheme is proposed. To assure that the MASs can achieve the LFC in front of DoS attacks, the relevant sufficient conditions are given. Independent of the starting state value, the upper bound of convergence time is deduced. Finally, an example is presented as an illustration of the effectiveness of the proposed approach.
- 21 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 204-208
On A Deep Reinforcement Learning-Based Content Caching Strategy in 6G Space-Air-Ground Integrated Networks
Space-Air-Ground Integrated Networks (SAGINs) have been widely recognized as an important 6G hierarchical architecture for satisfying content caching and delivering demands of users. However, the complicated communication conditions and dynamic network topology pose great challenges for SAGINs to meet the diversified Quality of Service (QoS) requirements of users. Caching popular contents on Unmanned Aerial Vehicles (UAVs), which are closer to the ground end users, can efficiently improve the QoS and decrease the communication pressure of satellites. In this paper, targeting at the spatial-temporal popularity of the contents, we propose a Deep Reinforcement Learning (DRL)-based content selection approach to optimize the Cache Hit Ratio (CHR) using a Deep Q-network (DQN) algorithm. The simulation results demonstrate that the proposed approach can significantly improve the long-term CHR under various conditions compared with conventional caching strategies.
- 21 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 204-208
On A Deep Reinforcement Learning-Based Content Caching Strategy in 6G Space-Air-Ground Integrated Networks
Space-Air-Ground Integrated Networks (SAGINs) have been widely recognized as an important 6G hierarchical architecture for satisfying content caching and delivering demands of users. However, the complicated communication conditions and dynamic network topology pose great challenges for SAGINs to meet the diversified Quality of Service (QoS) requirements of users. Caching popular contents on Unmanned Aerial Vehicles (UAVs), which are closer to the ground end users, can efficiently improve the QoS and decrease the communication pressure of satellites. In this paper, targeting at the spatial-temporal popularity of the contents, we propose a Deep Reinforcement Learning (DRL)-based content selection approach to optimize the Cache Hit Ratio (CHR) using a Deep Q-network (DQN) algorithm. The simulation results demonstrate that the proposed approach can significantly improve the long-term CHR under various conditions compared with conventional caching strategies.
- 10 June 2023
- Published by Elsevier in Computer Networks
- Vol. 233
Predictive edge caching through deep mining of sequential patterns in user content retrievals
- 10 June 2023
- Published by Elsevier in Computer Networks
- Vol. 233
Predictive edge caching through deep mining of sequential patterns in user content retrievals