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

Il Han

dblp:77/10895 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
1since 2021 · last 2024
—ORCID · none

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

Computer networks · 2Graphics, computer vision, multimedia, augmented reality and games · 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
Physical-layer communications · 50% Wireless networking · 50%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › code-division multiple access
DS-CDMA
0.012001
Performance analysis of DS/SSMA unslotted ALOHA system with variable length data traffic · IEEE J. Sel. Areas Commun. 2001
Wireless networking
multiple access protocols
0.012001
Performance analysis of DS/SSMA unslotted ALOHA system with variable length data traffic · IEEE J. Sel. Areas Commun. 2001
Physical-layer communications
spread spectrum
0.012001
Performance analysis of DS/SSMA unslotted ALOHA system with variable length data traffic · IEEE J. Sel. Areas Commun. 2001
Wireless networking › multiple access protocols
unslotted ALOHA
0.012001
Performance analysis of DS/SSMA unslotted ALOHA system with variable length data traffic · IEEE J. Sel. Areas Commun. 2001
Coding theory
error-correcting codes
0.012001
Performance analysis of DS/SSMA unslotted ALOHA system with variable length data traffic · IEEE J. Sel. Areas Commun. 2001
Coding theory › error-correcting codes
reed-solomon codes
0.012001
Performance analysis of DS/SSMA unslotted ALOHA system with variable length data traffic · IEEE J. Sel. Areas Commun. 2001

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

markov chain analysis · 0.1
YearPublicationVenuePosition
2024 A gated recurrent unit based robust voice activity detector
Il Han, Chol-Nam Om, Un-Il Kim
Multim. Tools Appl.1
2002 Distributed group location tracking based on several RIDs and virtual VLRs for transportation systems
abstract
To efficiently support mobility of users on transportation systems, we propose a distributed group location tracking (DGLT) scheme based on several virtual visitor location registers (VVLRs) and representative identities. We analyze the DGLT scheme in view of the database (DB) access cost and the signaling cost under a one-dimensional network architecture. Compared with the IS-41 scheme, the DGLT scheme using distributed group management has a lower signaling cost as well as a lower DB access cost. As the user mobility-increases or the number of users on a TS increases, the outperformance of the DGLT scheme increases. Generally, the DGLT scheme in which a corresponding home location register selects an optimum VVLR among several VVLRs has a lower signaling cost, although a DB access cost is increased slightly compared with the GLT scheme.
Il Han, Sung-Kwan Jung, Dong-Ho Cho
VTC Spring1
2001 Resource allocation scheme for supporting high data-rate service in an integrated CDMA system
abstract
A new resource allocation scheme is proposed for data services in an integrated voice/data CDMA system. After delay-sensitive voice users are first allocated, residual resources are then allocated to data users. To allocate data users fairly, we apply WFQ (weighted fair queueing) to a CDMA system with consideration of a generalized processor sharing (GPS) fluid-flow model. In order to implement this fair resource allocation scheme, a virtual clock and a credit table method are used. The throughput and delay of the data service under burst error conditions are shown. Numerical results show that the throughput of each data user has the same characteristics under burst error conditions.
Seung Sik Choi, Il Han, Dong-Ho Cho
ICC2
2001 Group location management for transportation systems in wireless cellular systems
abstract
A location tracking scheme called as a group location tracking (GLT) is proposed to reduce the location update cost for terrestrial transportation systems (TSs) in personal communication networks. To provide user mobility in a TS, we introduce two new concepts, virtual visitor location register (VVLR) and representative identity (RID). A VVLR is used to provide current location of a TS and an RID of a TS is used to represent a TS and the group of all users on the TS. When a TS moves into a new registration area, the GLT scheme based on an RID of the TS and a VVLR updates location information by a group location update request message instead of individual location update request messages generated by each user in the TS. We analyze the performance of our proposed scheme in view of the signaling load and call delivery failure. Compared with the IS-41 location tracking scheme, the GLT scheme significantly reduces frequent location updates caused by the high mobility of a TS and a large number of users in a TS.
Il Han, Dong-Ho Cho
VTC Fall1
2001 Performance analysis of DS/SSMA unslotted ALOHA system with variable length data traffic
abstract
We analyze the throughput of a direct-sequence spread spectrum multiple access (DS/SSMA) unslotted ALOHA system with variable length data traffic. The system is analyzed for two cases: (1) systems without a channel load sensing protocol (CLSP) and (2) systems with a CLSP. The bit-error probability and the throughput are obtained as a function of the signal-to-noise ratio (SNR) during message transmission, considering the number of overlapped messages and the amount of time overlap. We assume that the generation of data messages is Poisson distributed and that the messages are divided into packets before transmission. The system is modeled as a Markov chain under the assumption that the number of packets in a message is geometrically distributed with a constant packet length. The throughput variance of the DS/SSMA unslotted ALOHA system with variable length data traffic is obtained as the Reed-Solomon code rate varies. Results show that a significant throughput improvement can be obtained by using an error-correcting code.
Jae-Woo So, Il Han, Byung-Cheol Shin, Dong-Ho Cho
IEEE J. Sel. Areas Commun.2