Shin'Ichi Arakawa
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Shin'Ichi Arakawa has a total of 66 co-authors. Here are the top co-authors by number of shared publications:
- Masayuki Murata
Osaka University
27 shared publications - Onur Alparslan
Osaka University
3 shared publications - Hao Su
Osaka University
2 shared publications Hideyuki Koto
KDDI R&D Laboratories Inc., Fujimino-shi, Saitama, Japan
2 shared publications- Lu Chen
Department of Information and Human Science, Kyoto Institute of Technology, Kyoto, Japan
2 shared publications - Nagao Ogino
Chuo University
2 shared publications
Latest Publications
- 23 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 2149-2165
Deterministic and Probabilistic Scheduling for Latency Guarantees in B5G/6G Network Management
In the era of Beyond 5G (B5G) and 6G networks, ensuring efficient resource management and meeting stringent quality of service (QoS) requirements are crucial. This paper proposes the Deterministic and Probabilistic Scheduling for Latency Guarantees (DPSLG) algorithm, which provides Worst-Case Delay (WCD) guarantees, both deterministically and probabilistically, to support Ultra-Reliable Low-Latency Communication (URLLC) applications. Deterministic guarantees ensure strict delay bounds for mission-critical scenarios, while probabilistic guarantees offer flexibility by accommodating dynamic traffic conditions with controlled threshold violations. The proposed algorithm leverages the Lyapunov optimization framework for deterministic delay bounds in dynamic environments and integrates Extended Conformal Quantile Regression (ECQR) to enable probabilistic guarantees. This combination enhances reliability and adaptability under diverse traffic conditions. Furthermore, constraint mechanisms are incorporated to mitigate the impact of misbehaving users and improve overall system performance. This work significantly advances the management of radio resources in B5G and 6G networks by addressing key challenges related to latency and efficiency. It establishes a robust framework for optimizing scheduling mechanisms, paving the way for future innovations in managing next-generation networks to meet stringent performance and reliability demands.
- 23 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 23, 2149-2165
Deterministic and Probabilistic Scheduling for Latency Guarantees in B5G/6G Network Management
In the era of Beyond 5G (B5G) and 6G networks, ensuring efficient resource management and meeting stringent quality of service (QoS) requirements are crucial. This paper proposes the Deterministic and Probabilistic Scheduling for Latency Guarantees (DPSLG) algorithm, which provides Worst-Case Delay (WCD) guarantees, both deterministically and probabilistically, to support Ultra-Reliable Low-Latency Communication (URLLC) applications. Deterministic guarantees ensure strict delay bounds for mission-critical scenarios, while probabilistic guarantees offer flexibility by accommodating dynamic traffic conditions with controlled threshold violations. The proposed algorithm leverages the Lyapunov optimization framework for deterministic delay bounds in dynamic environments and integrates Extended Conformal Quantile Regression (ECQR) to enable probabilistic guarantees. This combination enhances reliability and adaptability under diverse traffic conditions. Furthermore, constraint mechanisms are incorporated to mitigate the impact of misbehaving users and improve overall system performance. This work significantly advances the management of radio resources in B5G and 6G networks by addressing key challenges related to latency and efficiency. It establishes a robust framework for optimizing scheduling mechanisms, paving the way for future innovations in managing next-generation networks to meet stringent performance and reliability demands.
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Intelligent Transportation Systems
- Vol. 7, 2235-2254
Refining the Invisible: Cooperative Occlusion-Aware Planning for Connected and Automated Vehicles via Reachability Analysis
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Intelligent Transportation Systems
- Vol. 7, 2235-2254
Open AccessRefining the Invisible: Cooperative Occlusion-Aware Planning for Connected and Automated Vehicles via Reachability Analysis
- 9 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (11) , 16990-17004
Cooperative 3D Multi-Object Tracking With Cross-Agent Data Association for Connected and Automated Vehicles
Achieving reliable 3D multi-object tracking (MOT) is essential for enabling autonomous driving. With the aid of communication techniques, vehicles could share complementary environmental information, ushering in an innovative break through in perception performance. Nevertheless, most tracking methods focus on single-agent scenarios, which inevitably struggle to cope with temporarily disappearing objects and incapable of leveraging multi-agent cooperation. In this study, we propose a communication-efficient cooperative 3D MOT framework. Specifically, to suppress the occurrence of temporary tracking failures and ID switching, we design a cross agent data association module, which captures the correspondence between objects tracked by multiple agents to compensate missed objects while concealing erroneous tracking for individuals. Moreover, a search area expansion mechanism is introduced to assist the tracker in handling previously missed objects. The extensive experiments on cooperative perception dataset demonstrate that the proposed method is able to reduce both misses and erroneous detections, and it performs favorably against single-agent trackers without imposing a communication burden on other perceptual tasks.
- 9 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (11) , 16990-17004
Cooperative 3D Multi-Object Tracking With Cross-Agent Data Association for Connected and Automated Vehicles
Achieving reliable 3D multi-object tracking (MOT) is essential for enabling autonomous driving. With the aid of communication techniques, vehicles could share complementary environmental information, ushering in an innovative break through in perception performance. Nevertheless, most tracking methods focus on single-agent scenarios, which inevitably struggle to cope with temporarily disappearing objects and incapable of leveraging multi-agent cooperation. In this study, we propose a communication-efficient cooperative 3D MOT framework. Specifically, to suppress the occurrence of temporary tracking failures and ID switching, we design a cross agent data association module, which captures the correspondence between objects tracked by multiple agents to compensate missed objects while concealing erroneous tracking for individuals. Moreover, a search area expansion mechanism is introduced to assist the tracker in handling previously missed objects. The extensive experiments on cooperative perception dataset demonstrate that the proposed method is able to reduce both misses and erroneous detections, and it performs favorably against single-agent trackers without imposing a communication burden on other perceptual tasks.
- Open Access
- 15 November 2024
- Published by Springer Nature
- p. 275-311
Field Experiments in the Real World
This chapter explores social-field experiments of cybernetic avatars (CAs). Previous chapters introduced the research and development initiatives necessary to achieve a society where individuals can actively participate remotely by operating CAs. To understand the feasibility of social participation through CA utilization, one approach is to conduct experiments in real-world scenarios and evaluate their effectiveness. In the Avatar Symbiotic Society Project, a variety of real-world validation experiments are being conducted across different countries, industries, sectors, teleoperators, and user demographics. This chapter outlines the essential elements for conducting social–field experiments and highlights those done in the fields of nursing care, mental health, and elderly support.
- 15 November 2024
- Published by Springer Nature
- p. 275-311
Open AccessField Experiments in the Real World
This chapter explores social-field experiments of cybernetic avatars (CAs). Previous chapters introduced the research and development initiatives necessary to achieve a society where individuals can actively participate remotely by operating CAs. To understand the feasibility of social participation through CA utilization, one approach is to conduct experiments in real-world scenarios and evaluate their effectiveness. In the Avatar Symbiotic Society Project, a variety of real-world validation experiments are being conducted across different countries, industries, sectors, teleoperators, and user demographics. This chapter outlines the essential elements for conducting social–field experiments and highlights those done in the fields of nursing care, mental health, and elderly support.
- 30 August 2023
- Published by Springer Nature
- p. 300-311
On the Service Quality of Cooperative VR Applications in 5G Cellular Networks
- 30 August 2023
- Published by Springer Nature
- p. 300-311
On the Service Quality of Cooperative VR Applications in 5G Cellular Networks
- Open Access
- 10 August 2023
- Published by Springer Nature in Computing
- Vol. 105 (12) , 2773-2792
Design, implementation and evaluation of a network-oriented service with environmental adaptability based on core/periphery structure
Many new network-oriented services have been developed in recent years, and they are expected to be virtualized in multi-access edge computing (MEC) environments, which are being standardized along with fifth generation (5 G). Because many new network-oriented services have been developed to meet various user requests, and service-oriented development, wherein service functions are divided and combined, is expected to facilitate the development of flexible services at low costs. A core/periphery structure is an information processing system in biological systems consisting of core units, that is densely connected and provide efficient process, and peripheral units that can accommodate a variety of inputs and outputs. In this paper, we introduce a core/periphery structure into the service design since the service based on this structure can adapt to various inputs and outputs with only modifying peripheral functions. We expect that development cost is reduced by designing services based on core/periphery structure, because the entire service is not modified against environmental changes. Besides, we also consider the balance between the penalty and the reduction of development costs since dividing functions and placing them in different devices creates extra communication paths and degrades service responsiveness. We designed and implemented two service scenarios for our shopping service with a remote robot based on a core/periphery structure. Using the implemented services, we show that the design using the core/periphery structure is effective in terms of implementation cost and overhead for information sharing among remote robots. Furthermore, we measured the penalty through experiments on actual devices and showed that it is tolerable.
- 10 August 2023
- Published by Springer Nature in Computing
- Vol. 105 (12) , 2773-2792
Open AccessDesign, implementation and evaluation of a network-oriented service with environmental adaptability based on core/periphery structure
Many new network-oriented services have been developed in recent years, and they are expected to be virtualized in multi-access edge computing (MEC) environments, which are being standardized along with fifth generation (5 G). Because many new network-oriented services have been developed to meet various user requests, and service-oriented development, wherein service functions are divided and combined, is expected to facilitate the development of flexible services at low costs. A core/periphery structure is an information processing system in biological systems consisting of core units, that is densely connected and provide efficient process, and peripheral units that can accommodate a variety of inputs and outputs. In this paper, we introduce a core/periphery structure into the service design since the service based on this structure can adapt to various inputs and outputs with only modifying peripheral functions. We expect that development cost is reduced by designing services based on core/periphery structure, because the entire service is not modified against environmental changes. Besides, we also consider the balance between the penalty and the reduction of development costs since dividing functions and placing them in different devices creates extra communication paths and degrades service responsiveness. We designed and implemented two service scenarios for our shopping service with a remote robot based on a core/periphery structure. Using the implemented services, we show that the design using the core/periphery structure is effective in terms of implementation cost and overhead for information sharing among remote robots. Furthermore, we measured the penalty through experiments on actual devices and showed that it is tolerable.
- 1 January 2022
- Published by Springer Nature
- p. 95-108
Low-latency Probabilistic Collision Detection Method for C-V2X Applications
- 1 January 2022
- Published by Springer Nature
- p. 95-108
Low-latency Probabilistic Collision Detection Method for C-V2X Applications
- 25 November 2020
- Published by Springer Nature
- p. 113-133
Introduction to Yuragi Learning
- Open Access
- 10 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 166294-166303
Design and Placements of Virtualized Network Functions for Dynamically Changing Service Requests Based on a Core/Periphery Structure
Network Function Virtualization (NFV) is a system that provides application services by connecting virtual network functions (VNFs), and is expected to accommodate new service requests through the development of new VNF and connection with existing ones. Because VNFs are implemented by software, their design and placement are important problems for the NFV system, which reduce the current and future system costs. In this paper, we investigate the design principles and the placement policies that reduce the cost of designing and developing VNFs for accommodating new service requests. As for the design policy, we introduce a Core/Periphery-Based Design (CPBD) that utilizes the core/periphery concept for developing VNFs. In CPBD, “core” VNFs are developed in advance and repeatedly used to accommodate future service requests. While “core” VNFs are common to current and future service requests, “periphery” VNFs are developed and customized for each service request. Next, we investigate the placement policies of VNFs for CPBD to fully utilize the nature of their core/periphery structure. In addition, we examine the Center-Located Core/Periphery placement (CLCP) policy and the Geographically-Distributed Core/Periphery placement (GDCP) policy, and evaluate the long-term cost of the NFV system under resource restrictions to run VNFs. Our results show that CPBD reduces the long-term cost of design and development of VNFs by 23% compared to the design with no core VNFs. Moreover, in the case of no resource restrictions, both CLCP and GDCP reduce the long-term costs of placing and connecting VNFs by 15% compared to the existing VNF placement algorithm. With resource constraints, GDCP reduces the long-term costs over CLCP by 11%.
- 10 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 166294-166303
Open AccessDesign and Placements of Virtualized Network Functions for Dynamically Changing Service Requests Based on a Core/Periphery Structure
Network Function Virtualization (NFV) is a system that provides application services by connecting virtual network functions (VNFs), and is expected to accommodate new service requests through the development of new VNF and connection with existing ones. Because VNFs are implemented by software, their design and placement are important problems for the NFV system, which reduce the current and future system costs. In this paper, we investigate the design principles and the placement policies that reduce the cost of designing and developing VNFs for accommodating new service requests. As for the design policy, we introduce a Core/Periphery-Based Design (CPBD) that utilizes the core/periphery concept for developing VNFs. In CPBD, “core” VNFs are developed in advance and repeatedly used to accommodate future service requests. While “core” VNFs are common to current and future service requests, “periphery” VNFs are developed and customized for each service request. Next, we investigate the placement policies of VNFs for CPBD to fully utilize the nature of their core/periphery structure. In addition, we examine the Center-Located Core/Periphery placement (CLCP) policy and the Geographically-Distributed Core/Periphery placement (GDCP) policy, and evaluate the long-term cost of the NFV system under resource restrictions to run VNFs. Our results show that CPBD reduces the long-term cost of design and development of VNFs by 23% compared to the design with no core VNFs. Moreover, in the case of no resource restrictions, both CLCP and GDCP reduce the long-term costs of placing and connecting VNFs by 15% compared to the existing VNF placement algorithm. With resource constraints, GDCP reduces the long-term costs over CLCP by 11%.
- Open Access
- 20 August 2020
- Published by MDPI AG in Applied Sciences
- Vol. 10 (17) , 5773
SDN-Based Control of IoT Network by Brain-Inspired Bayesian Attractor Model and Network Slicing
One of the models in the literature for modeling the behavior of the brain is the Bayesian attractor model, which is a kind of machine-learning algorithm. According to this model, the brain assigns stochastic variables to possible decisions (attractors) and chooses one of them when enough evidence is collected from sensory systems to achieve a confidence level high enough to make a decision. In this paper, we introduce a software defined networking (SDN) application based on a brain-inspired Bayesian attractor model for identification of the current traffic pattern for the supervision and automation of Internet of things (IoT) networks that exhibit a limited number of traffic patterns. In a real SDN testbed, we demonstrate that our SDN application can identify the traffic patterns using a limited set of fluctuating network statistics of edge link utilization. Moreover, we show that our application can improve core link utilization and the power efficiency of IoT networks by immediately applying a pre-calculated network configuration optimized by traffic engineering with network slicing for the identified pattern.
- 20 August 2020
- Published by MDPI AG in Applied Sciences
- Vol. 10 (17) , 5773
Open AccessSDN-Based Control of IoT Network by Brain-Inspired Bayesian Attractor Model and Network Slicing
One of the models in the literature for modeling the behavior of the brain is the Bayesian attractor model, which is a kind of machine-learning algorithm. According to this model, the brain assigns stochastic variables to possible decisions (attractors) and chooses one of them when enough evidence is collected from sensory systems to achieve a confidence level high enough to make a decision. In this paper, we introduce a software defined networking (SDN) application based on a brain-inspired Bayesian attractor model for identification of the current traffic pattern for the supervision and automation of Internet of things (IoT) networks that exhibit a limited number of traffic patterns. In a real SDN testbed, we demonstrate that our SDN application can identify the traffic patterns using a limited set of fluctuating network statistics of edge link utilization. Moreover, we show that our application can improve core link utilization and the power efficiency of IoT networks by immediately applying a pre-calculated network configuration optimized by traffic engineering with network slicing for the identified pattern.