Kazuya Sakai

Dr. Kazuya Sakai


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
2 June 2020 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
PTPei-Ya Ting
Pei-Ya Ting
TWTomotaka Wada
Tomotaka Wada
YCYi-Lun Chiu
Yi-Lun Chiu
Min-Te SunMin-Te Sun
Min-Te Sun
KSKazuya Sakai
Kazuya Sakai
JHJing-Shyang Hwu
Jing-Shyang Hwu
As the population keeps growing, traffic congestion happens more and more often. Consequently, travel time has become an important indicator of driving experience. Accurate travel time information helps drivers plan their route more wisely and thus effectively alleviate traffic congestion. In this research, we propose a vehicle travel time prediction model for freeway traffic. The data used in this research are derived from the traffic dataset of the Taiwan Freeway Bureau, and the travel time prediction is made for the Sun Yat-sen Freeway between Taipei and Hsinchu. First, the missing value of the raw data is imputed by Autoencoder. The data are then segmented according to time series and are used to build the prediction model. To effectively capture the hidden features required to predict the travel time for the vehicle traveling on the freeway, a deep learning architecture is adopted in our system, which includes the GRU neural network model, the XGBoost model, and the Hybrid model that combines the GRU and XGBoost through linear regression. To increase computational efficiency, the travel time predictions for consecutive toll gates every 5 minutes apart are pre-computed offline, so that the online travel time prediction of the whole trip can be obtained by simply summing up a few numbers.Experimental results based on actual traffic data show that the proposed system can achieve good performance in terms of prediction accuracy and execution time.

22 July 2019 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
KSKazuya Sakai
Kazuya Sakai
Min-Te SunMin-Te Sun
Min-Te Sun
WKWei-Shinn Ku
Wei-Shinn Ku
JWJie Wu
Jie Wu
TLTen H. Lai
Ten H. Lai
Due to software implementation failure and misuse of cryptography, data encryption can no longer be considered a safeguard from security attacks. As a result, adversaries with eavesdropping capability along a routing path can compromise data privacy. In addition, should an adversary be one of the intermediate relay nodes in a path, she can deny data forwarding to disconnect the end-to-end communications. One solution is to avoid message routing through certain insecure areas, such as malicious countries or likely-compromised nodes. To this end, an avoidance routing based on the single path has been proposed. However, this single-path-based protocol relies on the availability of a safe path, i.e., no adversary is in the proximity of the whole path, which is difficult to achieve and therefore limits the routing opportunity. To tackle this issue, we propose an avoidance routing framework, namely timer-based multi-path avoidance routing (TMPAR). In our approach, a source node first encodes a message into k different pieces, and each piece is sent via a different path. During its path discovery phase, a timer is used to efficiently discover a better set of paths. The destination can assemble the original message easily. Under the condition that no adversary obtains all the k pieces of the message, the proposed TMPAR can securely deliver a message to its destination in spite of eavesdropping. The extensive ns-2 simulation results demonstrate that our TMPAR achieves its design goals.

28 September 2021 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
SJSeiya Jumonji
Seiya Jumonji
KSKazuya Sakai
Kazuya Sakai
Min-Te SunMin-Te Sun
Min-Te Sun
WKWei-Shinn Ku
Wei-Shinn Ku
Protecting the privacy of users is one of the most important issues in recommender systems, where new items, e.g., books, movies, and friends in online social networking service/sites, are recommended to target users. To identify recommended items, encryption-based privacy-preserving collaborative filtering is widely used to generate recommendations. However, existing solutions are either slow or not scalable. To tackle this issue, in this paper, we first propose a privacy-preserving user-based CF protocol using the BGV fully homomorphic encryption scheme, which is named BGV-CF. By reducing interactions and the amount of communication traffic among users and recommendation servers, the proposed BGV-CF protocol significantly facilitates the recommendation process. Then, we propose an optimized BGV-CF (OBGV-CF) protocol where some computations are offloaded to users during the recommendation process. The security of the proposed schemes is qualitatively analyzed and quantitative analyses of the computation and communication costs are performed. In addition, provable security analysis using random oracles is provided. The BGV-CF and OBGV-CF protocols are implemented using C++, and testbeds using the MovieLens dataset are conducted. Experimental results demonstrate that the proposed BGV-CF and OBGV-CF successfully achieve their design goals.

1 December 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
KKKotcharat Kitchat
Kotcharat Kitchat
MLMeng-Hong Lin
Meng-Hong Lin
HCHao-Sheng Chen
Hao-Sheng Chen
Min-Te SunMin-Te Sun
Min-Te Sun
KSKazuya Sakai
Kazuya Sakai
TSThattapon Surasak
Thattapon Surasak

12 December 2018 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
KSKazuya Sakai
Kazuya Sakai
Min-Te SunMin-Te Sun
Min-Te Sun
WKWei-Shinn Ku
Wei-Shinn Ku
JWJie Wu
Jie Wu
Due to instability of links in the network, the model of delay tolerant networks (DTNs) is often adopted in many emerging mobile applications. To organizations and individuals using these mobile applications, security and privacy are considered to be two of the most significant concerns. This research seeks to address anonymous communications in DTNs. While many different anonymous routing protocols have been proposed for ad hoc networks, to the best of our knowledge, only variants of onion-based routing have been tailored for DTNs. In this paper, we first design a set of anonymous routing protocols for DTNs, called anonymous Epidemic and zone-based anonymous routing, based on the original anonymous routing protocols for ad hoc networks. Then, we propose a framework of anonymous routing (FAR) for DTNs, which subsumes all the aforementioned protocols. By tuning its parameters, the proposed FAR is able to outperform onion-based, anonymous Epidemic, and zone-based routing. In addition, numerical analyses for the traceable rate, node anonymity, and path anonymity models are built. Extensive simulations using randomly generated graphs as well as real traces demonstrate that the proposed framework for DTNs successfully achieves its design goal.

30 November 2023 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
KSKazuya Sakai
Kazuya Sakai
KTKatsuyuki Takenaka
Katsuyuki Takenaka
Min-Te SunMin-Te Sun
Min-Te Sun
WKWei-Shinn Ku
Wei-Shinn Ku
Mobile crowdsourcing technology is a special type of crowdsourcing that outsources location-based human tasks to workers with mobile devices. The user recruitment and task assignment strategies are critically important for successful mobile crowdsourcing. A number of task assignment algorithms for opportunistic network-based mobile crowdsourcing have been proposed for different design goals. However, none of them considers the priority of tasks. In this article, we introduce the priority-aware task assignment that maximizes the successful task rate of prioritized tasks by keeping with the overall makespan of the tasks as short as possible. To this end, the priority-aware offline task assignment (PFTA) and online task assignment (PNTA) are proposed. Since the task assignment problem is NP-hard, the proposed PFTA and PNTA rely on the greedy strategy based on the priority of tasks and/or the workload of tasks. In addition, the approximation ratio of PFTA and the competitive ratio of PNTA are analyzed. The performance of the proposed schemes are evaluated using real mobility traces, and the simulation results demonstrate that PFTA and PNTA achieve their design goals.