VLDB 2026 Research / reviewers in the wild / expert
Daniel H. Ho
dblp:48/4111
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-author
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 |
Cellular and mobile networks · 30% Wireless networking · 30% Vehicular, aerial and satellite networks · 30% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Wireless networking › wireless network protocols
link layer design |
0.1 | 1 | 2005 | Information Raining and Optimal Link-Layer Design for Mobile Hotspots · IEEE Trans. Mob. Comput. 2005 |
Cellular and mobile networks › mobile internet access
mobile hotspot |
0.1 | 1 | 2005 | Information Raining and Optimal Link-Layer Design for Mobile Hotspots · IEEE Trans. Mob. Comput. 2005 |
Vehicular, aerial and satellite networks
vehicular networks |
0.1 | 1 | 2005 | Information Raining and Optimal Link-Layer Design for Mobile Hotspots · IEEE Trans. Mob. Comput. 2005 |
Physical-layer communications
power allocation |
0.0 | 1 | 2005 | Information Raining and Optimal Link-Layer Design for Mobile Hotspots · IEEE Trans. Mob. Comput. 2005 |
Methods — techniques the papers use, named apart from their topics
simplex algorithm · 0.1hungarian algorithm · 0.1gale-shapley algorithm · 0.1erasure coding · 0.1bipartite matching · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2005 | Information Raining and Optimal Link-Layer Design for Mobile HotspotsabstractIn this paper, we propose a link layer design for mobile hotspots. We design a novel system architecture that enables high-speed Internet access in railway systems. The proposed design uses a number of repeaters placed along the track and multiple antennas installed on the roof of a vehicle. Each packet is decomposed into smaller fragments and relayed to the vehicle via adjacent repeaters. We also use erasure coding to add parity fragments to original data. This approach is called information raining since fragments are rained upon the vehicle from adjacent repeaters. We investigate two instances of information raining. In blind information raining, all repeaters awaken when they sense the presence of the vehicle. The fragments are then blindly transmitted via awakened repeaters. A vehicle station installed inside the train is responsible for aggregating a large enough number of fragments. In the throughput-optimized information raining, the vehicle station selects a bipartite matching between repeaters and roof-top antennas and activates only a subset of the repeaters. It also dictates the amount of transmission power of each activated repeater. Both the bipartite matching and power allocations are individually shown to be NP-complete. Matching heuristics based on the Hungarian algorithm and Gale-Shapley algorithm are proposed. A simplex-type algorithm is proposed as the power allocation heuristics. Daniel H. Ho, Shahrokh Valaee |
IEEE Trans. Mob. Comput. | 1 |