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

Yen-Cheng Lai

dblp:69/4052 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2011
—ORCID · none

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

Computer networks · 4 · 3 first-authorSystems, architecture and hardware · 1Security and privacy · 1Software engineering, systems software and programming languages · 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
Vehicular, aerial and satellite networks · 46% Wireless networking · 46% Internet of things and sensor networks · 7%

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

TopicWeightPapersLastEvidence papers
Wireless networking › random access
contention-based access
0.112011
A Region-Based Clustering Mechanism for Channel Access in Vehicular Ad Hoc Networks · IEEE J. Sel. Areas Commun. 2011
Wireless networking
medium access control
0.112011
A Region-Based Clustering Mechanism for Channel Access in Vehicular Ad Hoc Networks · IEEE J. Sel. Areas Commun. 2011
Vehicular, aerial and satellite networks › vehicular ad hoc networks
safety message dissemination
0.112011
A Region-Based Clustering Mechanism for Channel Access in Vehicular Ad Hoc Networks · IEEE J. Sel. Areas Commun. 2011
Vehicular, aerial and satellite networks
vehicular ad hoc networks
0.112011
A Region-Based Clustering Mechanism for Channel Access in Vehicular Ad Hoc Networks · IEEE J. Sel. Areas Commun. 2011
Internet of things and sensor networks › topology control
clustering
0.012011
A Region-Based Clustering Mechanism for Channel Access in Vehicular Ad Hoc Networks · IEEE J. Sel. Areas Commun. 2011

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

simulation · 0.1analytical modeling · 0.1
YearPublicationVenuePosition
2011 A Region-Based Clustering Mechanism for Channel Access in Vehicular Ad Hoc Networks
abstract
Several contention-based Medium Access Control (MAC) protocols have been proposed for the vehicles to gain the radio channels to distribute active safety messages timely, e.g., Safety Critical Application (SCA) information, for inter-vehicle communications in Vehicular Ad Hoc Networks (VANETs). In these MAC protocols, a contention period is introduced before the vehicle for channel access so that we may not have the timely and reliably message dissemination in VANETs. To reduce the contention period, this paper proposes a Region-based Clustering Mechanism (RCM) to be applied in these MAC protocols. We propose analytical models to investigate the performance of the RCM, which are validated by the simulation experiments.
Yen-Cheng Lai, Phone Lin, Wanjiun Liao, Chung-Min Chen
IEEE J. Sel. Areas Commun.1
2010 Optimization of FIR filter to improve eye diagram for general transmission line systems
abstract
The finite-impulse response (FIR) filter technique has been widely used for pre-emphasis of channels to mitigate the intersymbol interference (ISI) resulted from both frequency dependent losses and reflections. This paper proposes a systematic methodology, based on arbitrary step response, to determine the tap setting of multi-tap FIR filter for best eye diagram improvement. The required tap number and the optimal tap coefficients are determined according to the compensation efficiency and hence the ultimate performance of FIR filter is evaluated. Eventually, the compensation results for two specific 5 Gbps signalling systems, which include significant effects of losses and multiple reflections are demonstrated to validate the optimization method.
Yung-Shou Cheng, Yen-Cheng Lai, Ruey-Beei Wu
DATE2
2009 An LPN-Problem-Based Lightweight Authentication Protocol for Wireless Communications
abstract
Radio frequency identification (RFID) is a popular technology, but some problems still need to be overcome. Hopper and Blum proposed a light-weight authentication protocol, HB protocol, which is especially suitable for devices with low computation ability such as passive RFID tags. Later, HB protocol was proven to be insecure, and Munilla and Peinado amended it by proposing HB-MP and HB-MP protocols. However, only the tag is authenticated by the reader in these protocols. In this paper, we will present an enhancement of the HB-protocol family with mutual authentication to have only the legal reader obtain the legal reader's data. The proposed protocol is light-weight because only scalar dot product operation of binary vectors and XOR operation are adopted. Moreover, it is computational secure since its security is based on solving LPN problem, an NP-complete problem.
Ya-Fen Chang, Yen-Cheng Lai
ARES2
2008 Channel Allocation for UMTS Multimedia Broadcasting and Multicasting
abstract
3GPP 23.246 proposed the multimedia broadcast multicast service (MBMS) to deliver multicasting content in the Universal mobile telecommunications system (UMTS). In MBMS, the common logical channel is enabled to serve multiple MBMS calls at the same time. Use of the common logical channel may cause interference to the dedicated logical channels serving the traditional calls. To more efficiently utilize the radio resource to serve both traditional and MBMS calls, this paper proposes two channel allocation algorithms: Reserved Resource for Multicasting (RRM) and Unreserved Resource for Multicasting (URM). We propose analytic models and conduct simulation experiments to investigate customer Satisfaction Indication (SI) for the two algorithms. Our study indicates that URM outperforms RRM in terms of customer SI.
Yen-Cheng Lai, Phone Lin, Yuguang Fang, Wei-Hao Chen
IEEE Trans. Wirel. Commun.1
2006 Design and implementation of a wireless internet remote access platform
abstract
Abstract Recently, mobile networks and internet technologies have been widely developed for the voice communication and information retrieval services all over the world. Compared with the wire‐line internet environment, mobile networks have lower bandwidth, longer transmission latency and unreliable connection, and the capability of mobile terminals is restricted by the limited memory size, lower CPU computation capability and inconvenient I/O interface. These limitations restrict the development of the wireless internet applications. In this paper, we design and implement a ‘wireless internet remote access platform’ (WIRAP). The WIRAP platform interconnects the wireless network and internet to provide mobile users a remote centralized storage and computation environment. A mobile user can store large volume of data and execute complex computations on WIRAP instead of on the mobile terminals. WIRAP supports different network interfaces (e.g. short message service (SMS), wireless markup language (WML) and hyper text markup language (HTML) and users may use terminals (with different network capabilities) to access WIRAP. Copyright © 2006 John Wiley & Sons, Ltd.
Yen-Cheng Lai, Phone Lin, Yao-Ting Huang
Wirel. Commun. Mob. Comput.1
2004 GPRS-based WLAN authentication and auto-configuration
Phone Lin, Yi-Bing Lin, Vincent W.-S. Feng, Yen-Cheng Lai
Comput. Commun.4