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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shouming Sun

dblp:299/4977 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2022
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Computer networks · 1 · 1 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.

Network and information security
2 papers
Blockchain and cryptocurrency security · 100%
Computer networks
1 paper
Edge and fog computing · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Blockchain and cryptocurrency security › blockchain-based crowdsourcing
blockchain-based crowdsensing
0.612022
Blockchain-Enabled Intelligent Transportation Systems: A Distributed Crowdsensing Framework · IEEE Trans. Mob. Comput. 2022
Edge and fog computing › mobile edge computing
computation offloading
0.212022
Blockchain-Enabled Intelligent Transportation Systems: A Distributed Crowdsensing Framework · IEEE Trans. Mob. Comput. 2022
Edge and fog computing › mobile edge computing
vehicular edge computing
0.212022
Blockchain-Enabled Intelligent Transportation Systems: A Distributed Crowdsensing Framework · IEEE Trans. Mob. Comput. 2022

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

deep reinforcement learning · 1.6alternating direction method of multipliers · 1.1
YearPublicationVenuePosition
2022 Online Scheduling and Route Planning for Shared Buses in Urban Traffic Networks
abstract
It is critical to reduce the operating cost of shared buses for bus companies and improve the user experience of passengers. However, existing studies focus on either bus scheduling or route planning, which cannot accomplish the above mentioned goals concurrently. In this paper, we construct a joint bus scheduling and route planning framework to maximize the number of passengers, minimize the total length of routes and the number of required buses, as well as guarantee good user experience of passengers. First, we establish a system model based on a real-world scenario and formulate a multi-objective combinational optimization problem. Then, based on the extracted traffic topology of urban traffic networks and the generated candidate line set, we propose an offline algorithm to cope with the similar passenger flow distributions, e.g., morning or evening peak of every day. In order to cope with dynamic real-time passenger flows, an online algorithm is designed. Experiments are carried out based on real-word scenarios. The results show that the proposed algorithms can greatly reduce the operating cost of bus companies and guarantee good user experience based on real-world scheduling data in comparison with several existing methods.
Zhaolong Ning, Shouming Sun, MengChu Zhou, Xiping Hu, Xiaojie Wang 0001, Lei Guo 0005, Bin Hu 0001, Yu-Kwong Kwok
IEEE Trans. Intell. Transp. Syst.2
2022 Blockchain-Enabled Intelligent Transportation Systems: A Distributed Crowdsensing Framework
abstract
Intelligent Transportation System (ITS) is critical to cope with traffic events, e.g., traffic jams and accidents, and provide services for personal traveling. However, existing researches have not jointly considered the user data safety, utility and system latency comprehensively, to the best of our knowledge. Since both safe and efficient transmissions are significant for ITS, we construct a blockchain-enabled crowdsensing framework for distributed traffic management. First, we illustrate the system model and formulate a multi-objective optimization problem. Due to its complexity, we decompose it into two subproblems, and propose the corresponding schemes, i.e., a Deep Reinforcement Learning (DRL)-based algorithm and a DIstributed Alternating Direction mEthod of Multipliers (DIADEM) algorithm. Extensive experiments are carried out to evaluate the performance of our solutions, and experimental results demonstrate that the DRL-based algorithm can legitimately select active miners and transactions to make a satisfied trade-off between the blockchain safety and latency, and the DIADEM algorithm can effectively select task computation modes for vehicles in a distributed way to maximize their social welfare.
Zhaolong Ning, Shouming Sun, Xiaojie Wang 0001, Lei Guo 0005, Song Guo 0001, Xiping Hu, Bin Hu 0001, Yu-Kwong Kwok
IEEE Trans. Mob. Comput.2
2021 Intelligent resource allocation in mobile blockchain for privacy and security transactions: a deep reinforcement learning based approach
Zhaolong Ning, Shouming Sun, Xiaojie Wang 0001, Lei Guo 0005, Guoyin Wang 0001, Xinbo Gao 0001, Yu-Kwong Kwok
Sci. China Inf. Sci.2