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

Heyu Luan

dblp:273/2001 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · unresolved

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

Computer 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.

Computer networks
1 paper
Network optimization and economics · 50% Vehicular, aerial and satellite networks · 25% Network management and operations · 25%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › combinatorial optimization
matching theory
0.612022
Task-Based Network Reconfiguration in Distributed UAV Swarms: A Bilateral Matching Approach · IEEE/ACM Trans. Netw. 2022
Network management and operations › network configuration
network reconfiguration
0.612022
Task-Based Network Reconfiguration in Distributed UAV Swarms: A Bilateral Matching Approach · IEEE/ACM Trans. Netw. 2022
Network optimization and economics
resource allocation
0.612022
Task-Based Network Reconfiguration in Distributed UAV Swarms: A Bilateral Matching Approach · IEEE/ACM Trans. Netw. 2022
Vehicular, aerial and satellite networks › aerial networks
UAV networks
0.612022
Task-Based Network Reconfiguration in Distributed UAV Swarms: A Bilateral Matching Approach · IEEE/ACM Trans. Netw. 2022

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

distributed matching algorithm · 0.6bilateral matching · 0.6
YearPublicationVenuePosition
2022 Task-Based Network Reconfiguration in Distributed UAV Swarms: A Bilateral Matching Approach
abstract
In this paper, we study the problem of network reconfiguration when unmanned aerial vehicle (UAV) swarms suffer damage. Multiple UAVs are divided into several groups to perform various tasks. Each master UAV is connected to the ground control station and provides network services for small UAVs that perform various tasks, ensuring that the information of small UAVs can be transmitted back in a timely manner. When master UAVs are destroyed due to factors such as jamming or attacks, the associated small UAVs must select new master UAVs for network service and cooperate with other small UAVs to execute tasks. Based on the heterogeneity and relevance of tasks, we model and analyze the task relationship among different UAVs. Since both master UAVs and small UAVs have respective optimization objectives in the network reconfiguration process, we construct a many-to-one bilateral matching market to model the interaction between master UAVs and small UAVs. To realize an efficient solution for UAV network reconfiguration in complex environments, we propose a distributed matching algorithm and prove that the algorithm can converge to two-sided stable matching. Simulation results indicate that the proposed algorithm can significantly improve the task completion degree of the network compared with three other algorithms.
Dianxiong Liu, Zhiyong Du, Xiaodu Liu, Heyu Luan, Yitao Xu 0001, Yifan Xu 0003
IEEE/ACM Trans. Netw.4