Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Chuanxiu Chi

dblp:285/0697 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2026
0000-0002-7352-3000ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 4 · 2 first-author · 4 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Edge and fog computing · 61% Vehicular, aerial and satellite networks · 30% Network performance modeling · 9%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Energy-efficient computing · 100%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Edge and fog computing › satellite edge computing
satellite computing
1.012026
Temperature- and Energy-Aware Dynamic Task Scheduling and Computing Resource Allocation for Satellite Computing · IEEE Trans. Mob. Comput. 2026
Vehicular, aerial and satellite networks
satellite networks
1.012026
Enabling Efficient Transmission of Satellite-to-Ground Downlinks via Throughput Prediction · INFOCOM 2026
Edge and fog computing
task scheduling and resource allocation
1.012026
Temperature- and Energy-Aware Dynamic Task Scheduling and Computing Resource Allocation for Satellite Computing · IEEE Trans. Mob. Comput. 2026
Energy-efficient computing
energy-aware scheduling
1.012026
Temperature- and Energy-Aware Dynamic Task Scheduling and Computing Resource Allocation for Satellite Computing · IEEE Trans. Mob. Comput. 2026
Energy-efficient computing › thermal management
thermal-aware scheduling
1.012026
Temperature- and Energy-Aware Dynamic Task Scheduling and Computing Resource Allocation for Satellite Computing · IEEE Trans. Mob. Comput. 2026
Network performance modeling › performance prediction
throughput prediction
0.312026
Enabling Efficient Transmission of Satellite-to-Ground Downlinks via Throughput Prediction · INFOCOM 2026
Algorithmic game theory and mechanism design
stackelberg game
0.312026
Temperature- and Energy-Aware Dynamic Task Scheduling and Computing Resource Allocation for Satellite Computing · IEEE Trans. Mob. Comput. 2026

Methods — techniques the papers use, named apart from their topics

stackelberg game · 3.0convex optimization · 3.0interior point method · 2.0throughput prediction · 1.0interior-point method · 1.0
YearPublicationVenuePosition
2026 Enabling Efficient Transmission of Satellite-to-Ground Downlinks via Throughput Prediction
Geyang Li, Li Zhang 0133, Chuanxiu Chi, Shangguang Wang
INFOCOM4
2026 Temperature- and Energy-Aware Dynamic Task Scheduling and Computing Resource Allocation for Satellite Computing
abstract
Satellite computing, as an emerging edge computing paradigm, extends computing and networking services into space. Due to the internal design constraints of low-Earth orbit (LEO) satellites and the challenges posed by the external environment, satellite computing faces inherent limitations, including severely constrained resources, non-rechargeable batteries, poor heat dissipation, and highly dynamic operating conditions, leading to unreliable and unsustainable quality of service. To address the above challenges and fully realize the potential of satellite computing, this paper investigates temperature- and energy-aware dynamic task scheduling and computing resource allocation, aiming to optimize service latency, reduce onboard energy consumption, and enhance operational profit. Solving this problem requires coordinating task scheduling and resource allocation, balancing communication and computation latency, and addressing the challenge of a vast search space. To solve the above challenges, we first formulate this problem as a repeated Stackelberg game by developing temperature and energy models. Through theoretical analysis, we show that this game leads to a convex optimization framework that exhibits exponential complexity. To accelerate the search for the Stackelberg equilibrium solution, we propose a dynamic task scheduling algorithm based on the interior point method, which reduces the computational complexity to polynomial order. Trace-driven simulations demonstrate that the proposed algorithm reduces task scheduling latency by 28.4% and improves utility by 13% on average.
Chao Wang 0093, Xiao Ma 0009, Chuanxiu Chi, Ao Zhou 0001, Ruolin Xing, Shangguang Wang
IEEE Trans. Mob. Comput.3
2022 Game Theory in Internet of Things: A Survey
abstract
Internet of Things (IoT) devices are being used widely in the fields of smart city, smart grid, environmental monitoring, Internet of Vehicles and other fields that need large-scale sensing data. However, the research on storage and computation power for IoT is still in its early stages. The game theory converts the interaction between two IoT devices into a game where the conflict is resolved by utilizing the game’s equilibrium conditions. Our goal with the game theory is to maximize the utility for every device in the IoT network. In this article, we review the recent game-theory-based solutions proposed in IoT networks. We summarize game theory concepts and categorize the common game models for ease of understanding for the reader. Later, we focus on analyzing solutions proposed in resource allocation, task scheduling, node selection, quality of service, and network security. Finally, we summarize research challenges and propose future research directions.
Chuanxiu Chi, Yingjie Wang 0002, Xiangrong Tong, Madhuri Siddula, Zhipeng Cai 0001
IEEE Internet Things J.1
2021 Multistrategy Repeated Game-Based Mobile Crowdsourcing Incentive Mechanism for Mobile Edge Computing in Internet of Things
abstract
With the advent of the Internet of Things (IoT) era, various application requirements have put forward higher requirements for data transmission bandwidth and real‐time data processing. Mobile edge computing (MEC) can greatly alleviate the pressure on network bandwidth and improve the response speed by effectively using the device resources of mobile edge. Research on mobile crowdsourcing in edge computing has become a hot spot. Hence, we studied resource utilization issues between edge mobile devices, namely, crowdsourcing scenarios in mobile edge computing. We aimed to design an incentive mechanism to ensure the long‐term participation of users and high quality of tasks. This paper designs a long‐term incentive mechanism based on game theory. The long‐term incentive mechanism is to encourage participants to provide long‐term and continuous quality data for mobile crowdsourcing systems. The multistrategy repeated game‐based incentive mechanism (MSRG incentive mechanism) is proposed to guide participants to provide long‐term participation and high‐quality data. The proposed mechanism regards the interaction between the worker and the requester as a repeated game and obtains a long‐term incentive based on the historical information and discount factor. In addition, the evolutionary game theory and the Wright‐Fisher model in biology are used to analyze the evolution of participants’ strategies. The optimal discount factor is found within the range of discount factors based on repeated games. Finally, simulation experiments verify the existing crowdsourcing dilemma and the effectiveness of the incentive mechanism. The results show that the proposed MSRG incentive mechanism has a long‐term incentive effect for participants in mobile crowdsourcing systems.
Chuanxiu Chi, Yingjie Wang 0002, Yingshu Li 0001, Xiangrong Tong
Wirel. Commun. Mob. Comput.1