Hideki Tode
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hideki Tode has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Yosuke Tanigawa
Osaka Prefecture University
4 shared publications Akihiro Fujimoto
Wakayama University
2 shared publicationsYusuke Hirota
Y. Hirota is with the Department of Information Networking, Osaka University, Suita, Osaka 565-0871, Japan
2 shared publicationsAnh-Huy Nguyen
Department of Computer Science and Intelligent Systems, Graduate School of Engineering, Osaka Prefecture University
1 shared publicationJong-Ok Kim
School of Electrical Engineering, Korea University
1 shared publicationKoso Murakami
1 shared publication
Latest Publications
- 1 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E105.B (2) , 205-214
Query Transfer Method Using Different Two Skip Graphs for Searching Spatially-Autocorrelated Data
With the increase of IoT devices, P2P-based IoT platforms have been attracting attention because of their capabilities of building and maintaining their networks autonomously in a decentralized way. In particular, Skip Graph, which has a low network rebuilding cost and allows range search, is suitable for the platform. However, when data observed at geographically close points have similar values (i.e. when data have strong spatial autocorrelation), existing types of Skip Graph degrade their search performances. In this paper, we propose a query transfer method that enables efficient search even for spatially autocorrelated data by adaptively using two-types of Skip Graph depending on the key-distance to the target key. Simulation results demonstrate that the proposed method can reduce the query transfer distance compared to the existing method even for spatially autocorrelated data.
- 1 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E105.B (2) , 205-214
Query Transfer Method Using Different Two Skip Graphs for Searching Spatially-Autocorrelated Data
With the increase of IoT devices, P2P-based IoT platforms have been attracting attention because of their capabilities of building and maintaining their networks autonomously in a decentralized way. In particular, Skip Graph, which has a low network rebuilding cost and allows range search, is suitable for the platform. However, when data observed at geographically close points have similar values (i.e. when data have strong spatial autocorrelation), existing types of Skip Graph degrade their search performances. In this paper, we propose a query transfer method that enables efficient search even for spatially autocorrelated data by adaptively using two-types of Skip Graph depending on the key-distance to the target key. Simulation results demonstrate that the proposed method can reduce the query transfer distance compared to the existing method even for spatially autocorrelated data.
- 1 January 2021
- Published by Optica Publishing Group
- p. M3C.4
Spectrum Allocation Exploiting Different Core Selection Patterns for Graceful Degradation of Inter-Core Crosstalk in Space-Division Multiplexing Elastic Optical Networks
We propose a spectrum allocation for graceful degradation of inter- core crosstalk in space-division multiplexed elastic optical networks, which utilizes pre-calculated thresholds based on coupled power theory with multiple core selection patterns.
- 1 January 2021
- Published by Optica Publishing Group
- p. M3C.4
Spectrum Allocation Exploiting Different Core Selection Patterns for Graceful Degradation of Inter-Core Crosstalk in Space-Division Multiplexing Elastic Optical Networks
We propose a spectrum allocation for graceful degradation of inter- core crosstalk in space-division multiplexed elastic optical networks, which utilizes pre-calculated thresholds based on coupled power theory with multiple core selection patterns.
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E102.B (11) , 2113-2125
Adaptive Channel Access Control Solving Compound Problem of Hidden Nodes and Continuous Collisions among Periodic Data Flows
With the rapid increase in IoT (Internet of Things) applications, more sensor devices, generating periodic data flows whose packets are transmitted at regular intervals, are being incorporated into WSNs (Wireless Sensor Networks). However, packet collision caused by the hidden node problem is becoming serious, particularly in large-scale multi-hop WSNs. Moreover, focusing on periodic data flows, continuous packet collisions among periodic data flows occur if the periodic packet transmission phases become synchronized. In this paper, we tackle the compounded negative effect of the hidden node problem and the continuous collision problem among periodic data flows. As this is a complex variant of the hidden node problem, there is no simple and well-studied solution. To solve this problem, we propose a new MAC layer mechanism. The proposed method predicts a future risky duration during which a collision can be caused by hidden nodes by taking into account the periodic characteristics of data packet generation. In the risky duration, each sensor node stops transmitting data packets in order to avoid collisions. To the best of our knowledge, this is the first paper that considers the compounded effect of hidden nodes and continuous collisions among periodic data flows. Other advantages of the proposed method include eliminating the need for any new control packets and it can be implemented in widely-diffused IEEE 802.11 and IEEE 802.15.4 devices.
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E102.B (11) , 2113-2125
Adaptive Channel Access Control Solving Compound Problem of Hidden Nodes and Continuous Collisions among Periodic Data Flows
With the rapid increase in IoT (Internet of Things) applications, more sensor devices, generating periodic data flows whose packets are transmitted at regular intervals, are being incorporated into WSNs (Wireless Sensor Networks). However, packet collision caused by the hidden node problem is becoming serious, particularly in large-scale multi-hop WSNs. Moreover, focusing on periodic data flows, continuous packet collisions among periodic data flows occur if the periodic packet transmission phases become synchronized. In this paper, we tackle the compounded negative effect of the hidden node problem and the continuous collision problem among periodic data flows. As this is a complex variant of the hidden node problem, there is no simple and well-studied solution. To solve this problem, we propose a new MAC layer mechanism. The proposed method predicts a future risky duration during which a collision can be caused by hidden nodes by taking into account the periodic characteristics of data packet generation. In the risky duration, each sensor node stops transmitting data packets in order to avoid collisions. To the best of our knowledge, this is the first paper that considers the compounded effect of hidden nodes and continuous collisions among periodic data flows. Other advantages of the proposed method include eliminating the need for any new control packets and it can be implemented in widely-diffused IEEE 802.11 and IEEE 802.15.4 devices.
- Open Access
- 1 May 2019
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E102.D (5) , 963-973
Distributed Search for Exchangeable Service Chain Based on In-Network Guidance
Network function virtualization (NFV) flexibly provides servoces by virtualizing network functions on a general-purpose server, and attracted research interest in recent years. In NFV environment, providing service chaining, which dynamically connects each network function (virtual network function: VNF), is critical issue. However, as it is challenging to select the optimal sequence of VNF services in the service chain in a decentralized manner, the distances between the VNFs tend to increase, leading to longer communication and processing delays. Furthermore, it has never considered that certain VNFs that can be exchange the order of services with one another. To address this problem, in this paper, we propose a distributed search method for ordered VNFs to reduce delays while considering the load on control server, by exploiting an in-network guidance technology, called Breadcrrmubs, for query messages.
- 1 May 2019
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E102.D (5) , 963-973
Open AccessDistributed Search for Exchangeable Service Chain Based on In-Network Guidance
Network function virtualization (NFV) flexibly provides servoces by virtualizing network functions on a general-purpose server, and attracted research interest in recent years. In NFV environment, providing service chaining, which dynamically connects each network function (virtual network function: VNF), is critical issue. However, as it is challenging to select the optimal sequence of VNF services in the service chain in a decentralized manner, the distances between the VNFs tend to increase, leading to longer communication and processing delays. Furthermore, it has never considered that certain VNFs that can be exchange the order of services with one another. To address this problem, in this paper, we propose a distributed search method for ordered VNFs to reduce delays while considering the load on control server, by exploiting an in-network guidance technology, called Breadcrrmubs, for query messages.
- Top Cited Papers
- 11 November 2016
- Published by Optica Publishing Group in Journal of Optical Communications and Networking
- Vol. 9 (1) , A99-A113
Routing, Spectrum, and Core and/or Mode Assignment on Space-Division Multiplexing Optical Networks [Invited]
Elastic optical networks (EONs) are considered to be one of the promising future networks for spectrum flexibility. In conventional wavelength-division multiplexing networks, routing and wavelength assignment is one of the key issues, whereas the routing and spectrum assignment (RSA) problem considerably affects the network performance in EONs. In addition, the data-center traffic and mobile back-haul traffic keeps increasing. To deal with such increasing capacity of applications, space-division multiplexing (SDM) technologies such as multi-core fiber (MCF) and multi-mode fiber (MMF) have been intensively researched. From the network perspective, this paper focuses on the routing, spectrum, and core and/or mode assignment (RSCMA) problem for future SDM-EONs. Introducing MCF or MMF further complicates the RSA problem because the fiber core or mode dimension is newly expanded. In addition, physical impairment caused by MCF or MMF must be considered. In this paper, the target RSCMA problem is first divided into routing and SCMA problems, and a pre-computation method based on the K-shortest path is introduced as the routing solution. Next, we propose SCMA methods with efficiency and flexibility awareness, exploiting prioritized area concept and crosstalk awareness depending on whether MCF or MMF supports intercore/intermode crosstalk. Finally, the paper evaluates and compares the effectiveness of the proposed algorithms with that of representative algorithms.
- 11 November 2016
- Published by Optica Publishing Group in Journal of Optical Communications and Networking
- Vol. 9 (1) , A99-A113
Top Cited PapersRouting, Spectrum, and Core and/or Mode Assignment on Space-Division Multiplexing Optical Networks [Invited]
Elastic optical networks (EONs) are considered to be one of the promising future networks for spectrum flexibility. In conventional wavelength-division multiplexing networks, routing and wavelength assignment is one of the key issues, whereas the routing and spectrum assignment (RSA) problem considerably affects the network performance in EONs. In addition, the data-center traffic and mobile back-haul traffic keeps increasing. To deal with such increasing capacity of applications, space-division multiplexing (SDM) technologies such as multi-core fiber (MCF) and multi-mode fiber (MMF) have been intensively researched. From the network perspective, this paper focuses on the routing, spectrum, and core and/or mode assignment (RSCMA) problem for future SDM-EONs. Introducing MCF or MMF further complicates the RSA problem because the fiber core or mode dimension is newly expanded. In addition, physical impairment caused by MCF or MMF must be considered. In this paper, the target RSCMA problem is first divided into routing and SCMA problems, and a pre-computation method based on the K-shortest path is introduced as the routing solution. Next, we propose SCMA methods with efficiency and flexibility awareness, exploiting prioritized area concept and crosstalk awareness depending on whether MCF or MMF supports intercore/intermode crosstalk. Finally, the paper evaluates and compares the effectiveness of the proposed algorithms with that of representative algorithms.
- 1 January 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E98.B (12) , 2496-2507
Smart Packet Transmission Scheduling Combined with Rate Adaptation for Enhancing Total Throughput against Channel Fading in Wireless LAN
- 1 January 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E98.B (12) , 2496-2507
Smart Packet Transmission Scheduling Combined with Rate Adaptation for Enhancing Total Throughput against Channel Fading in Wireless LAN
- 4 November 2014
- Published by Optica Publishing Group in Journal of Optical Communications and Networking
- Vol. 6 (12) , 1059-1071
On-Demand Spectrum and Core Allocation for Reducing Crosstalk in Multicore Fibers in Elastic Optical Networks
Optics InfoBase is the Optical Society's online library for flagship journals, partnered and copublished journals, and recent proceedings from OSA conferences.
- 4 November 2014
- Published by Optica Publishing Group in Journal of Optical Communications and Networking
- Vol. 6 (12) , 1059-1071
On-Demand Spectrum and Core Allocation for Reducing Crosstalk in Multicore Fibers in Elastic Optical Networks
Optics InfoBase is the Optical Society's online library for flagship journals, partnered and copublished journals, and recent proceedings from OSA conferences.
- 1 January 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E96.B (11) , 2865-2874
A Resilient Video Streaming System Based on Location-Aware Overlapped Cluster Trees
- 1 January 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E96.B (11) , 2865-2874
A Resilient Video Streaming System Based on Location-Aware Overlapped Cluster Trees
- 1 January 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E93-B (12) , 3345-3353
Delay-Sensitive Retransmission Method Based on Network Coding in Wireless LANs
- 1 January 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEICE Transactions on Communications
- Vol. E93-B (12) , 3345-3353
Delay-Sensitive Retransmission Method Based on Network Coding in Wireless LANs