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

Dong-Hoon Kim 0002

dblp:19/4767-2 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0003-1431-8776ORCID · conflict

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

Computer networks · 2 · 1 first-author · 2 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
Wireless networking · 50% Internet of things and sensor networks · 25% Physical-layer communications · 25%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
backscatter communication
0.912025
CodeScatter: Distortion-Aware Collision Resolution for Concurrent Multiple Access in Backscatter Networks · ICNP 2025
Wireless networking
collision resolution
0.912025
CodeScatter: Distortion-Aware Collision Resolution for Concurrent Multiple Access in Backscatter Networks · ICNP 2025
Wireless networking › medium access control
concurrent transmission
0.912025
CodeScatter: Distortion-Aware Collision Resolution for Concurrent Multiple Access in Backscatter Networks · ICNP 2025
Physical-layer communications › multiple access › CDMA systems
near-far problem
0.912025
CodeScatter: Distortion-Aware Collision Resolution for Concurrent Multiple Access in Backscatter Networks · ICNP 2025

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

successive decoding · 0.9orthogonal codes · 0.9
YearPublicationVenuePosition
2025 CodeScatter: Distortion-Aware Collision Resolution for Concurrent Multiple Access in Backscatter Networks
abstract
Concurrent transmission with collision resolution has been considered as the multiple access solution in backscatter networks. However, designing practical collision resolution mechanisms in backscatter networks is challenging for the following reasons. First, interference from multiple tags accumulates, resulting in strong and complicated inter-tag interference. Second, transmitted signals are distorted by various factors (e.g., imperfect digital filter), which have not been considered in previous collision resolution schemes. Due to these distortions, tag-side mechanism like orthogonal codes, which assume undistorted conditions, are not effective for resolving collision at the receiver. Third, variation in received signal levels across tags often degrades performance in concurrent transmissions (i.e., near-far problem). Although transmit power control was proposed as a solution, it increases tag complexity and energy consumption. To address the challenges, we propose CodeScatter, a distortion-aware design for collision resolution that is robust to near-far problem in backscatter networks. The innovative features of CodeScatter are 1) distortion-aware design and 2) robustness to near-far problem without transmit power control. CodeScatter achieves these features by employing two mechanisms: 1) Distortion-aware Successive Decoding (DSD), which iteratively isolates individual tag signals while accounting for distortions and 2) Distortion-aware Orthogonal Codes (DOC), which ensures orthogonality even in the presence of distortions. To our knowledge, CodeScatter is the first distortion-aware design for collision resolution in backscatter networks. We implement a prototype using COTs RF switch and USRPN210. Experimental results demonstrate that CodeScatter outperforms previous proposals in terms of BER and throughput.
Dong-Hoon Kim 0002, Jae-Han Lim
ICNP1
2023 Wi-Fi frame detection via spiking neural networks with memristive synapses
Dong-Hoon Kim 0002, Jae-Han Lim
Comput. Commun.2