Chih-Chung Lin

Prof. Chih-Chung Lin

Department of Information Management, National Taipei University of Business, Taipei, Taiwan
orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 September 2008 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
YLYuan-Cheng Lai
Yuan-Cheng Lai
Chih-Chung LinChih-Chung Lin
Chih-Chung Lin
In radio frequency identification (RFID) systems, the reader identifies tags through communication over a shared wireless channel. When multiple tags transmit their IDs simultaneously, their signals collide, increasing the identification delay. Therefore, many previous anti-collision algorithms, including an adaptive query splitting algorithm (AQS) and an adaptive binary splitting algorithm (ABS), focused on solving this problem. This paper proposes two blocking algorithms, a single resolution blocking ABS algorithm (SRB) and a pair resolution blocking ABS algorithm (PRB), based on ABS. SRB not only inherits the essence of ABS which uses the information of recognized tags obtained from the last process of tag identification, but also adopts a blocking technique which prevents recognized tags from being collided by unrecognized tags. PRB further adopts a pair resolution technique which couples recognized tags and thus only needs half time for next identifying these recognized tags. We formally analyze the performance of SRB and PRB. Finally, the analytic and simulation results show that SRB slightly outperforms ABS and PRB significantly surpasses ABS.

13 June 2008 in IEEE Communications Letters
Verified
Journal Article
Closed access
YLYuan-Cheng Lai
Yuan-Cheng Lai
Chih-Chung LinChih-Chung Lin
Chih-Chung Lin
For RFID tag identification, this research proposes a novel anti-collision method, the Pair-Resolution Blocking algorithm (PRB). It inherits the essence of a previous algorithm, the Adaptive Binary Splitting algorithm (ABS), and thus uses the information of recognized tags obtained from the last process of tag identification. Furthermore, PRB adopts a blocking technique which prevents recognized tags from being collided by unrecognized tags and utilizes a pair resolution technique which couples recognized tags to significantly reduce the identification delay. The analytical and simulation results show that PRB significantly outperforms ABS.

21 August 2007
Verified
Book Chapter
Closed access
PDF file
Chih-Chung LinChih-Chung Lin
Chih-Chung Lin
YLYuan-Cheng Lai
Yuan-Cheng Lai
JTJ. D. Tygar
J. D. Tygar
CYChuan-Kai Yang
Chuan-Kai Yang
CCChi-Lung Chiang
Chi-Lung Chiang

1 December 2014
Verified
Conference Paper
Closed access
LHLiang-Hao Huang
Liang-Hao Huang
HHHui-Ju Hung
Hui-Ju Hung
Chih-Chung LinChih-Chung Lin
Chih-Chung Lin
DYDe-Nian Yang
De-Nian Yang
Software-Defined Networking (SDN) enables flexible network resource allocations for traffic engineering, but at the same time the scalability problem becomes more serious since traffic is more difficult to be aggregated. Those crucial issues in SDN have been studied for unicast but have not been explored for multicast traffic, and addressing those issues for multicast is more challenging since the identities and the number of members in a multicast group can be arbitrary. In this paper, therefore, we propose a new multicast tree for SDN, named Branch-aware Steiner Tree (BST). The BST problem is difficult since it needs to jointly minimize the numbers of the edges and the branch nodes in a tree, and we prove that it is NP-Hard and inapproximable within k, which denotes the number of group members. We further design an approximation algorithm, called Branch Aware Edge Reduction Algorithm (BAERA), to solve the problem. Simulation results demonstrate that the trees obtained by BAERA are more bandwidth-efficient and scalable than the shortest-path trees and traditional Steiner trees. Most importantly, BAERA is computation-efficient to be deployed in SDN since it can generate a tree on massive networks in small time.

18 August 2011 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
YLYuan-Cheng Lai
Yuan-Cheng Lai
Chih-Chung LinChih-Chung Lin
Chih-Chung Lin
How to accelerate tag identification is an important issue in Radio Frequency Identification (RFID) systems. In some cases, the RFID reader repeatedly identifies the same tags since these tags always stay in its communication range. An anticollision protocol, called the adaptive query splitting protocol (AQS), was proposed to handle these cases. This protocol reserves information obtained from the last process of tag identification so that the reader can quickly identify these staying tags again. This paper proposes two blocking protocols, a couple-resolution blocking protocol (CRB) and an enhanced couple-resolution blocking protocol (ECRB), based on AQS. CRB and ECRB not only have the above-mentioned capability as AQS but also use the blocking technique, which prohibits unrecognized tags from colliding with staying tags, to reduce the number of collisions. Moreover, CRB adopts a couple-resolution technique to couple staying tags by simultaneously transmitting two ID prefixes from the reader, while ECRB allows the reader to send only one ID prefix to interrogate a couple of staying tags. Thus, they only need half time to identify staying tags. We formally analyze the identification delay of CRB and ECRB in the worst and average cases. Our analytic and simulation results show that they obviously outperform AQS, and ECRB needs less transmitted bits than CRB.

1 November 2017 in Computer Communications
Verified
Journal Article
Closed access
RJRiyanto Jayadi
Riyanto Jayadi
YLYuan-Cheng Lai
Yuan-Cheng Lai
Chih-Chung LinChih-Chung Lin
Chih-Chung Lin