Demo Data from EDBT 2026 / reviewers in the wild / expert
Eerdemotai Ao
dblp:372/8953
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2024
0000-0001-5144-5569ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-author · 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 |
Internet of things and sensor networks · 87% Cellular and mobile networks · 13% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet of things and sensor networks
network coverage |
0.8 | 1 | 2024 | Efficient Capacity Constrained Assignment for Dynamic Network Coverage · IEEE Trans. Mob. Comput. 2024 |
Cellular and mobile networks
5g |
0.2 | 1 | 2024 | Efficient Capacity Constrained Assignment for Dynamic Network Coverage · IEEE Trans. Mob. Comput. 2024 |
Methods — techniques the papers use, named apart from their topics
rician fading model · 0.8combinatorial optimization · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Efficient Capacity Constrained Assignment for Dynamic Network CoverageabstractWith the fast development of the 5G wireless communications, the Internet of Things (IoT) becomes a hot research topic. Unmanned aerial vehicles (UAVs), due to the high mobility and low labor cost, have a big potential to be applied in the future IoT communication networks, e.g., data collection in remote areas. In this paper, we take a UAV as a monitor and an IoT device as an agent, and study how to utilize UAVs to establish network coverage and enhance the overall performance. Given ground agents and aerial monitors, each agent needs to be supervised by one monitor that can at most take charge of certain amount, while such assignment should guarantee the required service quality. This is much different from the conventional assumption that each monitor owns exactly a fixed number of agents without considering sensing quality under limited transmit power. Suppose that a monitor supervises an agent with a cost as the negative value of transmission rate in Rician fading, we then maximize the sum of transmission induced by every monitor-agent connection constrained with workload capacity for each monitor. To achieve the above goals, we first present a fast algorithm to report the least-cost assignment plan. Then, we seek for the minimum number of monitors to maintain the required service quality. Last, we discuss the assignment problem in the scenario of dynamic agents and dynamic monitors. We also give a set of strategies on how to initialize assignment, optimize monitor locations and manage power consumption. Extensive experimental results on both simulated datasets and real-life traffic data demonstrate our effectiveness and high performance. Eerdemotai Ao, Shi-Qing Xin, Feng Li 0002, Changhe Tu, Wenping Wang 0001 |
IEEE Trans. Mob. Comput. | 1 |