Misc - YOSHIHIRO Takuya

回帰分析とランダムフォレストを組み合わせた和牛の枝肉重量の予測手法

塚本 真伍, 池上春香, 松橋 珠子, 松本 和也, 吉廣 卓哉 （Part： Last author )

2020年度情報処理学会関西支部大会     2020.09

Multiple regression combined with random forest for wagyu quality prediction

Shingo Thukamoto, Haruka Ikegami, Tamako Matsuhashi, Kazuya Matsumoto, Takuya Yoshihiro （Part： Last author )

International Workshop on Informatics (IWIN2020)     2020.09  [Refereed]

A route guidance method for vehicles to reduce traffic congestion considering increase in destination arrival time

Yusuke Matsui, Takuya Yoshihiro （Part： Last author )

International Workshop on Informatics     2020.09  [Refereed]

On improving efficiency of CSMA/CA with RSSI-based control-frame detection

Yoshito Umezawa, Takuya Yoshihiro （Part： Last author )

International Workshop on Informatics     2020.09  [Refereed]

回帰分析とランダムフォレストを組み合わせた和牛の枝肉重量の予測手法

塚本 真伍, 吉廣 卓哉, 池上 春香, 松橋 珠子, 松本 和也 （Part： Last author )

2020年度人工知能学会全国大会     2020.06

目的地到着時間の増加を抑えて渋滞を緩和する自動車の経路誘導手法

松井 雄資, 吉廣 卓哉 （Part： Last author )

マルチメディア・分散・協調とモバイルDICOMO2020シンポジウム     2020.06

BLEビーコンを用いた医療・介護支援のための移動履歴可視化に関する一検討

影島 聖也, 吉廣 卓哉

マルチメディア・分散・協調とモバイルDICOMO2020シンポジウム     2020.06

ブランド和牛肉質予測における重相関係数の差異を利用した地域間共通特徴量の効率的選択手法

東口 奈那美, 本廣 多胤, 池上 春香, 松橋 珠子, 松本 和也, 吉廣 卓哉 （Part： Last author )

2020年度人工知能学会全国大会     2020.06

RSSIを用いた制御フレーム検知によるCSMA/CAの高効率化に関する一検討

梅澤 良斗, 吉廣 卓哉 （Part： Last author )

第94回モバイルコンピューティングとパーベイシブシステム研究会     2020.03

Finding Common Features Among Multiple Groups in Sparse Feature Selections : A Case Study with Wagyu Data

東口 奈那美, 本廣 多胤, 池上 春香, 松橋 珠子, 松本 和也, 吉廣 卓哉

情報処理学会関西支部支部大会講演論文集 ( [情報処理学会関西支部] )    2019

畜産領域へのリキッドバイオプシーの展開 2:牛の枝肉成績を肥育中に予測する血清バイオマーカータンパク質の探索

松橋珠子, 池上春香, 越智浩介, 大林賢伍, 佐野文美, 森隆史, 本廣多胤, 奥野智美, 神谷拓磨, 永井宏平, 宮本圭, 吉廣卓哉, 坂口慎一, 松本和也

日本畜産学会大会講演要旨   124th   184   2018.03

情報ネットワーク管理運用要求に基づいたWSNの状態可視化手法の提案 (知的環境とセンサネットワーク)

浦田 佑貴, 吉廣 卓哉, 川橋 裕

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 ( 電子情報通信学会 )  117 ( 451 ) 121 - 128   2018.02

情報ネットワーク管理運用要求に基づいたWSNの状態可視化手法の提案 (モバイルネットワークとアプリケーション)

浦田 佑貴, 吉廣 卓哉, 川橋 裕

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 ( 電子情報通信学会 )  117 ( 450 ) 133 - 140   2018.02

スロット化CSMAを用いた無線メッシュ網CATBSにおける遅延低減のためのスケジューリング法 (モバイルネットワークとアプリケーション)

野井 貴央, 吉廣 卓哉

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 ( 電子情報通信学会 )  117 ( 71 ) 9 - 16   2017.06

A Limiter on Dynamic Metrics to Reduce Routing Loops in Wireless Mesh Networks

Takuya Yoshihiro, Kenji Kaho, Takahiro Iida

情報処理学会論文誌   58 ( 2 )   2017.02

　View Summary

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.------------------------------This is a preprint of an article intended for publication Journal ofInformation Processing(JIP). This preprint should not be cited. Thisarticle should be cited as: Journal of Information Processing Vol.25(2017) (online)DOI http://dx.doi.org/10.2197/ipsjjip.25.191------------------------------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.------------------------------This is a preprint of an article intended for publication Journal ofInformation Processing(JIP). This preprint should not be cited. Thisarticle should be cited as: Journal of Information Processing Vol.25(2017) (online)DOI http://dx.doi.org/10.2197/ipsjjip.25.191------------------------------

A Distributed Scheduling through Queue-length Exchange in CSMA-based Wireless Mesh Networks

Toshiki Takeda, Takuya Yoshihiro

情報処理学会論文誌   58 ( 2 )   2017.02

　View Summary

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. ------------------------------This is a preprint of an article intended for publication Journal ofInformation Processing(JIP). This preprint should not be cited. Thisarticle should be cited as: Journal of Information Processing Vol.25(2017) (online)DOI http://dx.doi.org/10.2197/ipsjjip.25.174------------------------------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. ------------------------------This is a preprint of an article intended for publication Journal ofInformation Processing(JIP). This preprint should not be cited. Thisarticle should be cited as: Journal of Information Processing Vol.25(2017) (online)DOI http://dx.doi.org/10.2197/ipsjjip.25.174------------------------------

A Greedy Scheduling Algorithm For CATBS

斉藤 明日香, 吉廣 卓哉

情報処理学会関西支部支部大会講演論文集 ( [情報処理学会関西支部] )    8p   2017

Designing a Low-power Communication Protocol for Wireless Sensor Networks using Wi-Fi Direct

田代 志保, 吉廣 卓哉

情報処理学会関西支部支部大会講演論文集 ( [情報処理学会関西支部] )    6p   2017

A Scheduling Algorithm Supporting High-speed Communication Based on Wireless Mesh Network CATBS

森 康弘, 吉廣 卓哉

情報処理学会関西支部支部大会講演論文集 ( [情報処理学会関西支部] )    8p   2017

リンク状態型ルーティング方式における制御負荷低減手法に関する一検討 (モバイルネットワークとアプリケーション)

大浦 優季, 吉廣 卓哉

電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 ( 電子情報通信学会 )  116 ( 66 ) 13 - 20   2016.05