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

Weiwei Chen 0007

dblp:68/925-7 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · conflict

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

Computer networks · 3 · 1 first-author · 2 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 · 89% Vehicular, aerial and satellite networks · 11%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Edge and fog computing › mobile edge computing
computation offloading
1.022022
Task Offloading for Post-Disaster Rescue in Unmanned Aerial Vehicles Networks · IEEE/ACM Trans. Netw. 2022
VFC-Based Cooperative UAV Computation Task Offloading for Post-disaster Rescue · INFOCOM 2020
Edge and fog computing › wireless edge computing
vehicular fog computing
1.022022
Task Offloading for Post-Disaster Rescue in Unmanned Aerial Vehicles Networks · IEEE/ACM Trans. Netw. 2022
VFC-Based Cooperative UAV Computation Task Offloading for Post-disaster Rescue · INFOCOM 2020
Edge and fog computing › mobile edge computing › computation offloading
cooperative offloading
0.412020
VFC-Based Cooperative UAV Computation Task Offloading for Post-disaster Rescue · INFOCOM 2020
Edge and fog computing › mobile edge computing
UAV-assisted MEC
0.412020
VFC-Based Cooperative UAV Computation Task Offloading for Post-disaster Rescue · INFOCOM 2020
Algorithmic game theory and mechanism design › matching
stable matching
0.412020
VFC-Based Cooperative UAV Computation Task Offloading for Post-disaster Rescue · INFOCOM 2020
Algorithmic game theory and mechanism design › market design › matching markets
two-sided matching
0.412020
VFC-Based Cooperative UAV Computation Task Offloading for Post-disaster Rescue · INFOCOM 2020
Vehicular, aerial and satellite networks
post-disaster rescue
0.212022
Task Offloading for Post-Disaster Rescue in Unmanned Aerial Vehicles Networks · IEEE/ACM Trans. Netw. 2022
Vehicular, aerial and satellite networks › aerial networks
UAV networks
0.212022
Task Offloading for Post-Disaster Rescue in Unmanned Aerial Vehicles Networks · IEEE/ACM Trans. Netw. 2022

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

stable matching · 1.4iterative matching algorithm · 0.9simulation · 0.6iterative algorithm · 0.6
YearPublicationVenuePosition
2022 Task Offloading for Post-Disaster Rescue in Unmanned Aerial Vehicles Networks
abstract
Natural disasters often cause huge and unpredictable losses to human lives and properties. In such an emergency post-disaster rescue situation, unmanned aerial vehicles (UAVs) are effective tools to enter the damaged areas to perform immediate disaster recovery missions, owing to their flexible mobilities and fast deployment. However, UAVs typically have very limited battery and computational capacities, which makes them harder to perform heavy computation tasks during the complicated disaster recovery process. This paper addresses the issue of the battery and computation resource limitation with a fog computing based UAV system. Specifically, we first introduce the vehicular fog computing (VFC) system in which the unmanned ground vehicles (UGVs) perform the computation tasks offloaded from UAVs. To avoid the transmission competitions yet enable cooperations among UAVs and UGVs, a stable matching algorithm is developed to transform the computation task offloading problem into a two-sided matching problem. An iterative algorithm is then developed which matches each UAV with the most suitable UGV for offloading. Finally, extensive simulations are carried out to demonstrate that the proposed scheme can effectively improve utilities of UAVs and reduce average delay through comparison with conventional schemes.
Yuntao Wang 0004, Weiwei Chen 0007, Tom H. Luan, Zhou Su 0001, Qichao Xu, Ruidong Li 0001, Nan Chen 0006
IEEE/ACM Trans. Netw.2
2021 Cooperative content offloading scheme in air-ocean integrated networks
Zhou Su 0001, Qichao Xu, Weiwei Chen 0007
Peer-to-Peer Netw. Appl.4
2020 VFC-Based Cooperative UAV Computation Task Offloading for Post-disaster Rescue
abstract
Natural disasters often cause huge and unpredictable losses to human lives and properties. In such an emergency post-disaster rescue situation, unmanned aerial vehicles (UAVs) are effective tools to enter the damaged areas to perform immediate disaster recovery missions, due to their flexible mobilities and fast deployment. However, the UAVs typically have very limited batteries and computational capacities, which make them unable to perform heavy computation tasks during the complicated disaster recovery process. This paper addresses the issue with a fog computing based UAV system. In specific, we first introduce the vehicular fog computing (VFC) system in which the unmanned ground vehicles (UGVs) perform the computation tasks offloaded from UAVs. To resolve the transmission competitions yet enable cooperations among UAVs and UGVs, a stable matching algorithm is developed to transform the computation task offloading problem into a two-sided matching problem. An iterative algorithm is then developed which matches each UAV with the most suitable UGV for offloading. Finally, extensive simulations are carried out to demonstrate that the proposed scheme can effectively improve utilities of UAVs and reduce average delay through comparison with conventional schemes.
Weiwei Chen 0007, Zhou Su 0001, Qichao Xu, Tom H. Luan, Ruidong Li 0001
INFOCOM1