研究者詳細 - 吉廣　卓哉

論文 - 吉廣　卓哉

分割表示85 件中 21 - 40 件目／全件表示 >>

Finding common features among multiple groups in sparse feature selections: A case study with Wagyu data

Nanami Higashiguchi, Masatsugu Motohiro, Haruka Ikegami, Tamako Matsuhashi, Kazuya Matsumoto, Takuya Yoshihiro (担当区分：最終著者 )

International Workshop on Informatics (IWIN2019) 2019年09月 [査読有り]

A Traffic-Demand-Aware Routing and Scheduling for CSMA-based Wireless Mesh Networks

Tian Yi, Takuya Yoshihiro (担当区分：最終著者 )

IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops) MUSICAL'19 658 - 663 2019年03月 [査読有り]

A Scheduling for Slotted-CSMA-based Wireless Mesh Networks to Reduce Delivery Delay

Takahiro Noi, Takuya Yoshihiro (担当区分：最終著者 )

Journal of Information Processing (JIP) 27 ( 2 ) 117 - 124 2019年02月 [査読有り]

A Distance-vector-based Multi-path Routing Scheme for Static-node-assisted Vehicular Networks

Daichi Araki, Takuya Yoshihiro (担当区分：最終著者 )

Sensors 19 ( 12 ) 1 - 21 2019年 [査読有り]

受信ノード主導型MACプロトコルのビーコン削減に基づいた長寿命センサネットワーク

横谷晟人, 吉廣卓哉

情報処理学会論文誌 59 ( 2 ) 473 - 485 2018年02月

バッテリ駆動の小型センサ端末を設置し，無線マルチホップ通信により測定データを集める無線センサネットワークにおいて，従来手法と比較して大幅にネットワーク寿命を延ばすMACおよび経路制御プロトコルを提案する．受信ノード主導型MACプロトコルは，消費電力を抑えセンサノードの寿命を延ばすMACプロトコルとして知られている．本論文では，これを拡張し，データ配送木における葉ノードでビーコン送信を省き，経路制御プロトコルと連携させることにより，さらに消費電力を削減する．葉ノードでビーコン送信を省くことで，トポロジ変化時に葉ノードへ制御メッセージが送信できず，配送木の修復効率が悪化するという問題が起こる．これに対しては，葉ノードとの連絡経路を維持する仕組みを導入し，トポロジ変化時にも効率的に配送木を修復する．また，電力残量が低下したノードを避けるように定期的に配送木を再構築する仕組みにより，ネットワークが機能する時間を延ばす．最新のセンサ端末の性能を考慮したシミュレーション評価により，センサネットワークの寿命が大幅に増大できることを示す．

Providing Reliable Communications over Static-node-assisted Vehicular Networks Using Distance-vector Routing

Takuya Yoshihiro, Daichi Araki, Hiroki Sakaguchi, Naoki Shibata

Mobile Networks and Applications ( Springer New York LLC ) 23 ( 5 ) 1 - 18 2018年02月 [査読有り]

To support various practical applications that are expected to work over vehicular networks, it is important to develop a network infrastructure that provides quality communications on which applications can rely. However, since a vehicular network is essentially a delay tolerant network (DTN) in which connected paths to the destinations do not always exist, providing reliable communications on such a network is a challenging research goal. In this paper, we propose a new table-driven distance-vector routing protocol called RDV (Reliable Distance-Vector routing) for static-node-assisted vehicular networks. RDV provides the guarantee that the expected packet delivery ratio exceeds the preconfigured value by creating the necessary number of packet copies sent on the shortest path. Evaluation results show that RDV provides a stably high packet delivery ratio and outperforms other conventional routing schemes in both packet delivery ratio and overhead of packet copies.

DOI

Building detour paths to avoid local congestion in MANETs

Kiyotaka Kaji, Takuya Yoshihiro

Journal of Information Processing ( Information Processing Society of Japan ) 26 116 - 123 2018年01月 [査読有り]

MANETs (Mobile Ad-hoc NETworks) have been studied for a long time to provide multi-hop wireless communications among temporarily gathered mobile devices. However, due to the nature of wireless communications, the communication performance of a flow is easily degraded by even a single local congestion on the path. A simple solution for this problem is to utilize detour paths that avoid the congested area. However, to provide detour paths that avoid the area whenever a packet faces congestion is in fact a challenging task because the detour paths must avoid relatively large region in which harmful radio waves interfere. In this paper, we propose a routing scheme that proactively computes detour paths to avoid the congested area ahead of packets. Specifically, when a packet meets congestion, we assume that the next-next-hop node along the shortest path to the destination is the center of the congestion, and forward the packet to its destination without visiting the node neighboring the congestion central node. We designed an algorithm that builds the secondary routing tables that works to provide the detour paths on top of the distributed link-state routing scheme.

DOI

Scheduling Beacon Transmission to Improve Delay for Receiver-initiated-MAC Based Wireless Sensor Networks.

Akihiro Fujimoto, Yukari Masui, Takuya Yoshihiro

JIP 26 140 - 147 2018年 [査読有り]

DOI

A Multi-path Extension to RDV Routing Scheme for Static-node-Assisted Vehicular Networks.

Daichi Araki, Takuya Yoshihiro

32nd IEEE International Conference on Advanced Information Networking and Applications, AINA 2018, Krakow, Poland, May 16-18, 2018 ( IEEE Computer Society ) 47 - 54 2018年 [査読有り]

DOI

A new hybrid approach for scalable table-driven routing in MANETs.

Takuya Yoshihiro, Yuji Kitamura, Anup Kumar Paul, Atsuo Tachibana, Teruyuki Hasegawa

2018 IEEE Wireless Communications and Networking Conference, WCNC 2018, Barcelona, Spain, April 15-18, 2018 ( IEEE ) 1 - 6 2018年 [査読有り]

DOI

Visualizing Wireless Sensor Networks for Practical Network Management

URATA Yuki, YOSHIHIRO Takuya, KAWAHASHI Yutaka

International Journal of Informatics Society 9 ( 2 ) 53 - 61 2017年06月 [査読有り]

GPU Acceleration of EDA-based Algorithms to Learn Bayesian Networks

MORI Takashi, YAMANAKA Yuma, FUJIKI Takatoshi, YOSHIHIRO Takuya

International Journal of Informatics Society 9 ( 1 ) 21 - 29 2017年06月 [査読有り]

A distributed scheduling through queue-length exchange in CSMA-based wireless mesh networks

Toshiki Takeda, Takuya Yoshihiro

Journal of Information Processing ( Information Processing Society of Japan ) 25 174 - 181 2017年02月 [査読有り]

Wireless Mesh Networks (WMNs) over CSMA MAC (especially IEEE 802.11) are an attractive solution to widen the coverage area of the Internet in unlicensed frequency bands. Although such CSMA-based WMNs have been deeply investigated for a long time, they still suffer from heavy interference due to hidden terminals. In this paper, we accelerate the performance of CSMA-based WMNs by introducing a distributed scheduling scheme that exchanges the transmission-queue length information in real-time among neighbor nodes. In our scheduling scheme, we exchange the information of transmission queue-lengths among neighbor nodes in real-time, and allow transmitting frames to the node that has the longest queue length among its 2-hop distance. The proposed scheduling scheme can be regarded as a distributed design of so called ‘Max-weight’ scheduling. By combining CSMA with the queue-length based scheduling, we significantly reduce collisions due to hidden terminals and improve the performance with a small overhead of queue-length fields in MAC frames.

DOI

A limiter on dynamic metrics to reduce routing loops in wireless mesh networks

Takuya Yoshihiro, Kenji Kaho, Takahiro Iida

Journal of Information Processing ( Information Processing Society of Japan ) 25 191 - 198 2017年02月 [査読有り]

To improve the communication performance in IEEE802.11-based wireless mesh networks (WMNs), several dynamic metrics have been proposed. However, all of them have a severe risk of generating temporary routing loops which may cause severe congestion and disruption of communications. Although the routing loop is an essential problem that degrades network performance, no essential solution is provided so far for wireless multihop networks. In this paper, we propose a mechanism called Loop-free Metric Range (LMR) to make existing dynamic metrics loop-free by restricting the range of metric values to change. LMR is applicable to a major part of existing metrics including ETX, ETT, MIC, etc. without any message overhead. We first provide theoretical results that shows LMR guarantees loop-freedom if no message loss takes place. We next show that LMR is also practically effective in practical scenarios where message loss may take place
we show through simulation and actual evaluations that LMR works effectively as a limiter on dynamic metrics to reduce routing loops and to improve network performance through similation and real evaluation.

DOI

Beacon Scheduling in Receiver-initiated MAC Protocols for Low-delay and Energy-efficient WSNs

Akihiro Fujimoto, Yukari Masui, Takuya Yoshihiro, Fumitaka Uchio

2017 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC) ( IEEE ) 1 - 6 2017年 [査読有り]

Wireless Sensor Networks (WSNs) should collect sensing data quickly without increasing the energy consumption in order to deal with various applications, particularly delaysensitive applications. This paper proposes a method to schedule beacon transmissions for receiver-initiated MAC protocols, which are promising energy efficient protocols, to improve data collection delay. The key idea of the proposed method is scheduling beacon timings in the sequence of distance from leaf node to the root (i. e., sink) node so that data frames are forwarded to the sink node with small duration staying at each node. Each sensor node selects a time slot to send beacon in distributed manner based on their distances (i. e. hop counts) from the sink node. In addition, each node autonomously adjusts its beacon timing to avoid frame collisions. Computer simulations show that the proposed method can collect data in a shorter time with less energy consumption than conventional beacon scheduling methods for receiver-initiated MAC protocols.

DOI

Collision-free Channel Assignment is Possible in IEEE802.11-based Wireless Mesh Networks

Takuya Yoshihiro, Takahiro Noi

2017 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC) ( IEEE ) 1 - 6 2017年 [査読有り]

IEEE802.11-based Wireless Mesh Networks (WMNs) has been deeply studied as a low-cost wireless mesh networks. However, they still suffer from severe interference due to hidden terminals, which significantly degrades the performance to an impractical level. Several studies tried to use multiple frequency channels to avoid collisions among wireless links. However, static channel assignment requires so many orthogonal channels to achieve collision-freedom, resulting in that we still suffer from severe collisions as long as we use the well-populated IEEE802.11 standards. In this paper, we propose a new static channel assignment scheme CASCA CSMA-aware Static Channel Assignment) that achieves collision-free channel assignment under 3-4 available channels by incorporating a CSMA-aware interference model as well as partially a routing functionality in it. CASCA enables us to realize collision-free WMNs using the license-free IEEE802.11 devices.

DOI

Adaptive Rerouting to Avoid Local Congestion in MANETs

Kiyotaka Kaji, Takuya Yoshihiro

2017 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC) ( IEEE ) 1 - 6 2017年 [査読有り]

MANET (Mobile Ad-hoc NETworks) is useful in many practical scenarios since it provides multi-hop communication without wired infrastructure. However, there is a problem that the communication performance of a flow may be easily degraded by even a single local congestion on the whole path. A solution for the problem is to use a detour path that avoids the local congestion. However, to this end, the detour paths should not use the nodes in the congested area, which is in fact relatively large due to the nature of radio waves. In the current state of the art, we do not have such alternative-path computation algorithms. In this paper, we propose an algorithm and a routing scheme to compute and utilize detour paths adaptively according to the network traffic conditions. Through evaluation, we show that the proposed scheme improve the communication performance by using the detour paths in practical network scenarios.

DOI

Reliable distance-vector routing for static-node-assisted vehicular networks

Takuya Yoshihiro, Daichi Araki, Hiroki Sakaguchi, Naoki Shibata

ACM International Conference Proceeding Series ( Association for Computing Machinery ) 28- 237 - 245 2016年11月 [査読有り]

We propose a new static-node-assisted routing scheme RDV (Reliable Distance Vector routing) for vehicular networks. In RDV, static nodes located at intersections behave as distance-vector routers to assist packet forwarding, i.e., they exchange messages, compute paths, and help packets travel along the computed forwarding paths to their destinations. To support various practical applications over vehicular networks, RDV provides reliable communications such that the average packet delivery ratio exceeds the preconfigured delivery ratio by creating the necessary number of packet copies sent on the shortest path. Evaluation results show that the proposed scheme provides stably high packet delivery ratio, and outperforms other existing routing schemes in both packet delivery ratio and the number of generated packet copies.

DOI

PBIL-RS: Effective Repeated Search in PBIL-based Bayesian Network Learning

YAMANAKA Yuma, FUKUDA Sho, FUJIKI Takatoshi, YOSHIHIRO Takuya

International Journal of Informatics Society 8 ( 1 ) 15 - 23 2016年06月 [査読有り]

A Queue-length Based Distributed Scheduling for CSMA-driven Wireless Mesh Networks

Toshiki Takeda, Takuya Yoshihiro

2016 INTERNATIONAL CONFERENCE ON COMPUTING, NETWORKING AND COMMUNICATIONS (ICNC) ( IEEE ) 1 - 6 2016年 [査読有り]

Although Wireless Mesh Networks using CSMA MAC protocol (CSMA-driven WMNs) have been extensively studied, severe collisions mainly due to hidden terminals prevent us from realizing practical networks. In this paper, we propose a new distributed scheduling scheme for CSMA-driven WMNs that significantly reduce collision caused by hidden terminals. In our scheduling, we propagate queue-length information within two-hop neighborhood via data and Ack frames, and avoid collision by allowing transmission to only the node that has the longest queue length among its two-hop neighbors. Our scheduling scheme is fully distributed and requires low overhead so that it works within the framework of CSMA. Through evaluation, we found that the proposed scheduling mechanism significantly reduces the number of collisions, resulting in significant improvement of communication quality of CSMA-driven WMNs.

DOI

　前のページ - 次のページ　

<吉廣 卓哉>

論文 - 吉廣 卓哉

<吉廣　卓哉>

論文 - 吉廣　卓哉