| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| ICTSSL, CAS | 2024-01-25 09:30 |
Kanagawa | (Primary: On-site, Secondary: Online) |
Base stations with optimal 5% cluster head ratio of LEACH protocol in wireless sensor networks Yoshihiro Kaneko, Keitaro Hirano (Gifu Univ.)  CAS2023-82 ICTSSL2023-35 |
A wireless sensor network WSN is widely used in various applications. Usually, a sensor node SN is so tiny and limited i... [more] | CAS2023-82 ICTSSL2023-35 pp.1-4 |
| NLP, CAS | 2023-10-07 09:20 |
Gifu | Work plaza Gifu | The optimal cluster ratio based on base station of LEACH in wireless sensor networks Keitaro Hirano, Yoshihiro Kaneko (Gifu Univ.) CAS2023-47 NLP2023-46 |
A wireless sensor network WSN is widely used in various applications. Usually, a sensor node SN is so tiny and limited ... [more] | CAS2023-47 NLP2023-46 pp.74-77 |
| PN, NS, OCS (Joint) |
2021-06-25 11:35 |
Online | Online | Optimal scheduling of virtual network function for minimizing a duration of QoS degradaton Msayoshi Iwamoto, Akito Suzuki, Masahiro Kobayashi (NTT) NS2021-31 |
Network services provisioning with Service Function Chaining(SFC) consists of various controls such as Virtual Network F... [more] | NS2021-31 pp.33-38 |
| CS | 2020-11-06 10:00 |
Online | Online + Central Community Center, Nonoichi Community Center (Primary: Online, Secondary: On-site) |
ACO-based shortest hop routing algorithm Guan Xin, Hidenori Nakazato (Waseda Univ) CS2020-56 |
ACO (Ant Colony Optimization) routing algorithm is an effective routing algorithm. However, this algorithm has some shor... [more] | CS2020-56 pp.48-53 |
| RCS, NS (Joint) |
2018-12-20 11:45 |
Hiroshima | Onomichi City Hall | [Encouragement Talk]
Traffic Information Distribution Scheme of Road Networks to Achieve Social Optimum Routing even under Users’ Selfish Behavior Takanori Hara, Masahiro Sasabe, Shoji Kasahara (NAIST) NS2018-160 |
Traffic congestion is a social problem causing both economic and time loss. Such traffic congestion mainly comes from se... [more] | NS2018-160 pp.23-28 |
| IE, CS, IPSJ-AVM, ITE-BCT [detail] | 2016-12-08 13:25 |
Ishikawa | An Evaluation of System Latency for Multimedia Data Processing utilizing Edge Computing Kentaro Imagane, Tatsuya Nagashima, Kenji Kanai, Jiro Katto, Toshitaka Tsuda (Waseda Univ.) CS2016-50 IE2016-86 |
In this paper, we propose a latency analysis model of cloud and edge computing platforms and analyze the latency of mult... [more] | CS2016-50 IE2016-86 pp.27-32 |
|
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2013-11-28 10:00 |
Kagoshima | ILP-Based Placement and Routing Method for PLDs for Minimizing Critical Path Length Hiroki Nishiyama, Masato Inagi, Shinobu Nagayama, Shin'ichi Wakabayashi (Hiroshima City Univ.) RECONF2013-49 |
In this paper, we propose an ILP-based method for simultaneous optimal technology mapping, placement and routing for pro... [more] | RECONF2013-49 pp.57-62 |
|
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2012-11-27 09:50 |
Fukuoka | Centennial Hall Kyushu University School of Medicine | An ILP Formulation of Placement and Routing for PLDs Hiroki Nishiyama, Masato Inagi, Shin'ichi Wakabayashi, Shinobu Nagayama (Hiroshima City Univ) VLD2012-75 DC2012-41 |
In this paper, we formulate the simultaneous technology mapping, placement and routing problem for programmable gate a... [more] |
VLD2012-75 DC2012-41 pp.93-98 |
| IN, NS (Joint) |
2011-03-04 11:40 |
Okinawa | Okinawa Convention Center | Performance Evalation of Store-Carry-Forward Routing Schemes in Layered 3D Underwater Sensor Networks Daisuke Nishiuchi, Takahiro Matsuda, Tetsuya Takine (Osaka Univ.) NS2010-216 |
In 3D underwater sensor networks (USNs), data collected by sensor nodes at the bottom of water is forwarded by intermedi... [more] | NS2010-216 pp.305-310 |
| MSS, CAS | 2010-11-19 16:10 |
Osaka | Kansai Univ. | Braess's Paradox in Graph B^k with Two Sources Shimpei Hamaguchi, Takafumi Kanazawa, Toshimitsu Ushio (Osaka Univ.) CAS2010-82 CST2010-55 |
Selfish routing is a selfish route selection of players in computer networks. Players are assumed to select paths so as ... [more] | CAS2010-82 CST2010-55 pp.95-99 |
| CAS, MSS, VLD, SIP | 2010-06-21 13:30 |
Hokkaido | Kitami Institute of Technology | Braess's Paradox in a Two-source Network Shimpei Hamaguchi, Takafumi Kanazawa, Toshimitsu Ushio (Osaka Univ.) CAS2010-9 VLD2010-19 SIP2010-30 CST2010-9 |
Selfish routing is a selfish route selection of players in computer networks. Players are assumed to select paths so as ... [more] | CAS2010-9 VLD2010-19 SIP2010-30 CST2010-9 pp.47-52 |
| MSS | 2006-01-27 13:40 |
Kanagawa | Toshiba Kagaku-Kan | Muitl-objective optimization for tour route planning and a G-XML based tour information system Azusa Tamashiro, , Shingo Tamaki, Morikazu Nakamura (Univ. of the Ryukyus) |
In this paper, we define first multi-objective optimal routing problems for sightseeing by extending the optimal routing... [more] | CST2005-48 pp.53-56 |
| CS, IN, NS (Joint) |
2005-09-15 10:15 |
Miyagi | Tohoku Univ. | Proposal and evaluation of routing methods in power-law networks Ryota Fukumoto, Shin'ichi Arakawa, Masayuki Murata (Osaka Univ.) |
Recent studies of measurement studies on the Internet topology show that connectivity of nodes exhibit power-law attribu... [more] | IN2005-68 pp.43-48 |
[Return to Top Page]