Demo Data from EDBT 2026 / reviewers in the wild / expert
Wen-Hung Teng
dblp:141/0697
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1
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 |
Wireless networking · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Wireless networking › cognitive radio
channel hopping |
0.2 | 1 | 2014 | Novel Channel-Hopping Schemes for Cognitive Radio Networks · IEEE Trans. Mob. Comput. 2014 |
Wireless networking
cognitive radio |
0.2 | 1 | 2014 | Novel Channel-Hopping Schemes for Cognitive Radio Networks · IEEE Trans. Mob. Comput. 2014 |
Wireless networking › cognitive radio
spectrum access |
0.2 | 1 | 2014 | Novel Channel-Hopping Schemes for Cognitive Radio Networks · IEEE Trans. Mob. Comput. 2014 |
Wireless networking › cognitive radio
rendezvous |
0.1 | 1 | 2014 | Novel Channel-Hopping Schemes for Cognitive Radio Networks · IEEE Trans. Mob. Comput. 2014 |
Methods — techniques the papers use, named apart from their topics
synchronous and asynchronous channel-hopping schemes · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Novel Channel-Hopping Schemes for Cognitive Radio NetworksabstractRecently, cognitive radio (CR) has become a key technology for addressing spectrum scarcity. In CR networks, spectrum access should not interfere the colocate incumbent networks. Due to the requirement above, common control channel approaches, which are widely used in traditional multichannel environments, may face serious CR long-time blocking problem and control channel saturation problem. Although channel-hopping-based approaches can avoid these two problems, existing works still have significant drawbacks including long time-to-rendezvous, unbalance channel loading, and low channel utilization. In this paper, we introduce three channel-hopping approaches, RCCH, ARCH, and SARCH for synchronous and asynchronous environments, respectively. Compared with previous works, our schemes outperform the state of the art in terms of these metrics. Guey-Yun Chang, Wen-Hung Teng, Jang-Ping Sheu |
IEEE Trans. Mob. Comput. | 2 |