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.

Sandra Hoppe

dblp:358/0100 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
0000-0003-3420-0839ORCID · reported

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 · 44% Vehicular, aerial and satellite networks · 28% Internet architecture and protocols · 28%

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

TopicWeightPapersLastEvidence papers
Vehicular, aerial and satellite networks › aerial networks
flying ad-hoc networks
0.812024
A Combined Topology Formation and Rate Allocation Algorithm for Aeronautical Ad Hoc Networks · IEEE Trans. Mob. Comput. 2024
Network optimization and economics › resource allocation
rate allocation
0.812024
A Combined Topology Formation and Rate Allocation Algorithm for Aeronautical Ad Hoc Networks · IEEE Trans. Mob. Comput. 2024
Internet architecture and protocols › network topology
topology generation
0.812024
A Combined Topology Formation and Rate Allocation Algorithm for Aeronautical Ad Hoc Networks · IEEE Trans. Mob. Comput. 2024
Network optimization and economics › network flow
flow assignment
0.212024
A Combined Topology Formation and Rate Allocation Algorithm for Aeronautical Ad Hoc Networks · IEEE Trans. Mob. Comput. 2024
Network optimization and economics › network flow
multicommodity flow
0.212024
A Combined Topology Formation and Rate Allocation Algorithm for Aeronautical Ad Hoc Networks · IEEE Trans. Mob. Comput. 2024

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

mixed integer linear programming · 0.8heuristic algorithm · 0.8
YearPublicationVenuePosition
2024 A Combined Topology Formation and Rate Allocation Algorithm for Aeronautical Ad Hoc Networks
abstract
This paper addresses the problem of providing internet connectivity to aircraft flying above the ocean without using satellite connectivity given the lack of ground network infrastructure in the relevant oceanic areas. Is it possible to guarantee a minimum flow rate to each aircraft flying over an ocean by forming an aeronautical ad hoc network and connecting that network to internet via a set of limited number of ground base stations at the coast as anchor points? We formulated the problem as mixed-integer-linear programming (MILP) to maximize the number of aircraft with flow data rate above a certain threshold. Since this multi-commodity flow problem is at least NP-complete, we propose a two-phase heuristic algorithm to efficiently form topology and assign flows to each aircraft by maximizing the minimum flow. The performance of the heuristic algorithm is evaluated over the North Atlantic Corridor, heuristic performs only 8% less than the optimal result with low densities. In high network densities, the connectivity percentage changes from 70% to 40% under 75 Mbps data rate threshold. Furthermore, the connectivity percentage is investigated for different network parameters such as altitude and compared to upper and lower bounds and a baseline algorithm.
Vasileios Megas, Sandra Hoppe, Mustafa Özger, Dominic A. Schupke, Cicek Cavdar
IEEE Trans. Mob. Comput.2