Kate Ching-Ju Lin

Kate Ching-Ju Lin

Auto-generated profile, based on publicly available information

Kate Ching-Ju Lin

Department of Computer Science, National Yang-Ming Chiao Tung University, HsinChu, Taiwan

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
20 June 2018 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
TKTung-Wei Kuo
Tung-Wei Kuo
BLBang-Heng Liou
Bang-Heng Liou
KLKate Ching-Ju Lin
Kate Ching-Ju Lin
MTMing-Jer Tsai
Ming-Jer Tsai
Recently, network function virtualization has been proposed to transform from network hardware appliances to software middleboxes. Normally, a demand needs to invoke several virtual network functions (VNFs) following the order determined by the service chain along a routing path. In this paper, we study the joint problem of the VNF placement and path selection to better utilize the network. We discover that the relation between the link and server usage plays a crucial role in the problem. Inspired by stress testing, we first propose a systematic way to elastically tune the link and server usage of each demand based on the network status and properties of demands. In particular, we compute a proper routing path length, and decide, for each VNF in the service chain, whether to use additional server resources or to reuse resources provided by existing servers. We then propose a chain deployment algorithm that follows the guidance of this link and server usage. Via simulations, we show that our design effectively adapts resource allocation to network dynamics and, hence, serves more demands than other heuristics.

1 April 2009
Verified
Conference Paper
Closed access
CHC.-C. Hsu
C.-C. Hsu
KLK.-F. Lai
K.-F. Lai
CCC.-F. Chou
C.-F. Chou
KLK. C.-J. Lin
K. C.-J. Lin
Underwater sensor networks (UWSNs) have attracted a lot of attention recently. Since data in UWSNs are transmitted by acoustic signals, the characteristics of a UWSN are different from those of a terrestrial sensor network. In other words, the high propagation delay of acoustic signals in UWSNs causes spatial-temporal uncertainty, and makes transmission scheduling in UWSNs a challenging problem. Hence, in this paper, we propose a spatial-temporal MAC scheduling protocol, called ST-MAC, which is designed to overcome spatial-temporal uncertainty based on TDMA-based MAC scheduling for energy saving and throughput improvement. We construct the spatial-temporal conflict graph (ST-CG) to describe the conflict delays among transmission links explicitly, and model ST-MAC as a new vertex coloring problem of ST-CG. We then propose a novel heuristic, called the traffic-based one-step trial approach (TOTA), to solve the coloring problem. In order to obtain the optimal solution of the scheduling problem, we also derive a mixed integer linear programming (MILP) model. Finally, we present a comprehensive performance study via simulations. The results show that ST-MAC can perform better than existing MAC schemes (such as S-MAC, ECDiG, and T-Lohi) in terms of the network throughput and energy cost.

25 May 2018 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
TCTung-Chun Chang
Tung-Chun Chang
CLChi-Han Lin
Chi-Han Lin
KLKate Ching-Ju Lin
Kate Ching-Ju Lin
WCWen-Tsuen Chen
Wen-Tsuen Chen
Traditional IEEE 802.11 network is designed for the use of small scale local wireless networks. However, the emergence of the Internet of Things (IoT) has changed the scene of wireless communications. Thus, recently, the IEEE task group ah (TGah) has been dedicated to the standardization of a new protocol, called IEEE 802.11ah, which is customized for this type of large-scale networks. IEEE 802.11ah adopts a grouping- based MAC protocol to reduce the contention overhead for each group of devices. However, most existing designs simply randomly partition devices into groups, and less attention has been paid to the problem of forming efficient groups. Therefore, in this paper, we argue that the performance of grouping is closely related to heterogeneity in traffic demands of devices, and propose a traffic- aware grouping algorithm to improve channel utilization. Since channel utilization of a group closely depends on the collision probability, we further derive a regression-based analytical model to estimate the contention success probability with consideration of sensors' heterogeneous traffic demands. The evaluation via NS-3 simulations shows that the proposed regression-based model is quite accurate even when clients have diverse traffic demands, and our traffic-aware grouping outperforms other baseline approaches, especially when the network is nearly saturated.

28 December 2015 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
TKTung-Wei Kuo
Tung-Wei Kuo
KLKate Ching-Ju Lin
Kate Ching-Ju Lin
MTMing-Jer Tsai
Ming-Jer Tsai
In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, it is important to collect these data efficiently, that is, to reduce the energy cost of data transmission. Under such applications, a tree is usually adopted as the routing structure to save the computation costs for maintaining the routing tables of sensors. In this paper, we work on the problem of constructing a data aggregation tree that minimizes the total energy cost of data transmission in a wireless sensor network. In addition, we also address such a problem in the wireless sensor network where relay nodes exist and consider the cases where the link quality is not perfect. We show that these problems are NP-complete and propose $O(1)$ -approximation algorithms for each of them. Simulations show that the proposed algorithms have good performance in terms of energy cost.

15 August 2011 in ACM SIGCOMM Computer Communication Review
Verified
Journal Article
Open access
KLKate Ching-Ju Lin
Kate Ching-Ju Lin
SGShyamnath Gollakota
Shyamnath Gollakota
DKDina Katabi
Dina Katabi
This paper presents the design and implementation of 802.11n+, a fully distributed random access protocol for MIMO networks. 802.11n+ allows nodes that differ in the number of antennas to contend not just for time, but also for the degrees of freedom provided by multiple antennas. We show that even when the medium is already occupied by some nodes, nodes with more antennas can transmit concurrently without harming the ongoing transmissions. Furthermore, such nodes can contend for the medium in a fully distributed way. Our testbed evaluation shows that even for a small network with three competing node pairs, the resulting system about doubles the average network throughput. It also maintains the random access nature of today's 802.11n networks.

12 June 2019
Verified
Conference Paper
Open access
PDF file
TTTzu-Chun Tai
Tzu-Chun Tai
KLKate Ching-Ju Lin
Kate Ching-Ju Lin
YTYu-Chee Tseng
Yu-Chee Tseng