Shigeru Kashihara

Shigeru Kashihara

Auto-generated profile, based on publicly available information

Shigeru Kashihara

Graduate School of Information Science, Nara Institute of Science and Technology, 8916-5 Takayama, Ikoma, Nara 630-0192, Japan

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
8 July 2020 in IEEE Access
Verified
Journal Article
Open access
CBCheikh Saliou Mbacke Babou
Cheikh Saliou Mbacke Babou
DFDoudou Fall
Doudou Fall
SKShigeru Kashihara
Shigeru Kashihara
YTYuzo Taenaka
Yuzo Taenaka
MBMonowar H. Bhuyan
Monowar H. Bhuyan
YKYouki Kadobayashi
Youki Kadobayashi
The edge computing system attracts much more attention and is expected to satisfy ultra-low response time required by emerging IoT applications. Nevertheless, as there were problems on latency such as the emerging traffic requiring very sensitive delay, a new Edge Computing system architecture, namely Home Edge Computing (HEC) supporting these real-time applications has been proposed. HEC is a three-layer architecture made up of HEC servers, which are very close to users, Multi-access Edge Computing (MEC) servers and the central cloud. This paper proposes a solution to solve the problems of latency on HEC servers caused by their limited resources. The increase in the traffic rate creates a long queue on these servers, i.e., a raise in the processing time (delay) for requests. By leveraging, based on clustering and load balancing techniques, we propose a new technique called HEC-Clustering Balance. It allows us to distribute the requests hierarchically on the HEC clusters and another focus of the architecture to avoid congestion on a HEC server to reduce the latency. The results show that HEC-Clustering Balance is more efficient than baseline clustering and load balancing techniques. Thus, compared to the HEC architecture, we reduce the processing time on the HEC servers to 19% and 73% respectively on two experimental scenarios.

25 May 2004
Verified
Conference Paper
Closed access
SKS. Kashihara
S. Kashihara
TNT. Nishiyama
T. Nishiyama
KIK. Iida
K. Iida
HKH. Koga
H. Koga
YKY. Kadobayashi
Y. Kadobayashi
SYS. Yamaguchi
S. Yamaguchi
The mobile Internet is built upon a number of different wireless access networks with widely varying features in terms of coverage area, bandwidth, packet loss, and delay. To move across these different networks smoothly, issues associated with the changing features need to be addressed. In this paper, a path selection method for the coverage overlap area is proposed in which the mobile host actively measures the round trip time (RTT) and bottleneck bandwidth for each path and a path is selected based on four rules.

15 May 2007 in IEEE Wireless Communications
Verified
Journal Article
Closed access
SKShigeru Kashihara
Shigeru Kashihara
KTKazuya Tsukamoto
Kazuya Tsukamoto
YOYuji Oie
Yuji Oie
In ubiquitous wireless LANs, a mobile node is likely to move between many access points while using certain applications. However, in the conventional Internet architecture, an MN can never inherently avoid the degradation in communication quality during handover. To achieve seamless handover, we propose a service-oriented mobility management scheme to address application quality. In this article, we first clarify three requirements for achieving seamless handover. We then describe our concept of the service-oriented mobility management scheme, which satisfies all three requirements. Our main contribution is the proposal of a scheme of how to properly use the number of frame retransmissions as a new handover-decision criterion to accomplish seamless handover. Performance evaluations show that our proposed scheme can maintain application quality during handover

1 December 2007 in IEICE Transactions on Communications
Verified
Journal Article
Closed access
PDF file
KTKazuya Tsukamoto
Kazuya Tsukamoto
TYTakeshi Yamaguchi
Takeshi Yamaguchi
SKShigeru Kashihara
Shigeru Kashihara
YOYuji Oie
Yuji Oie

1 September 2012
Verified
Conference Paper
Closed access
NSNoriyuki Suzuki
Noriyuki Suzuki
JZJane Louie Fresco Zamora
Jane Louie Fresco Zamora
SKShigeru Kashihara
Shigeru Kashihara
SYSuguru Yamaguchi
Suguru Yamaguchi
This paper proposes the design of SOS Cast, an application that will assist the search for immobilized persons in a disaster area. When a catastrophic disaster such as an earthquake or tsunami occurs, people may be injured and trapped in damaged buildings and debris. Note that a prompt rescue operation during the first 72 hours is critical in saving many lives. However, it is difficult for immobilized persons to ask for help because conventional communication services such as cellular phone networks are quite likely to be severely damaged. In a particular affected area, the SOS Cast propagates SOS messages from immobilized persons through a direct communication between smart phones. By collecting these SOS messages, rescuers can estimate the locations of the immobilized persons and view it on their smart phones. We have shown in our preliminary experiment within a residential area that SOS Cast is capable of estimating the location of an immobilized person based on the collected SOS messages.

29 January 2022
Verified
Conference Paper
Closed access
RBRunal Rezkiawan Baharuddin
Runal Rezkiawan Baharuddin
MNMuhammad Niswar
Muhammad Niswar
AIAmil Ahmad Ilham
Amil Ahmad Ilham
SKShigeru Kashihara
Shigeru Kashihara
Soft-shell crab is an export product in which foreign demand is much higher than production. The production of soft-shell crabs done by selecting the crabs just prior to molting and placing them in a box until the molting occurs. Molting is a natural process of shedding the shell when crabs respond to the lack of growth space within its shell. Shortly after molting, the new crab shells are still very soft and will be hardened in a few hours after the crabs absorb calcium from water. Farmer must harvest the crab while the crabs’ shell is soft. This study investigates the initial identification of crab molting using machine learning classifier. We collected 1060 image datasets of crab molting and we divide data into 1000 training data and 60 testing data. We use three machine learning classifiers, namely K-Nearest Neighbors (k-NN), Support Vector Machine (SVM), and the Random Forest Classifier (RFC). This study aims to compare and determine the best classification algorithm to be used for crab’s molting identification. The experimental results show that, KNN is the best classification algorithm for initial identification of crab’s molting.