|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
RCS |
2023-10-19 16:15 |
Kagawa |
Kagawa University (Saiwai-cho Campus), and online (Primary: On-site, Secondary: Online) |
Channel assignment methods on wireless communication systems using multi-link operations Tomoyuki Yamada, Hirantha Abeysekera, Akira Kishida, Yusuke Asai, Yasushi Takatori (NTT) RCS2023-136 |
Multi-link operation (MLO) is a new feature proposed to be of the IEEE 802.11be Extremely High Throughput (EHT) amendmen... [more] |
RCS2023-136 pp.34-38 |
IA, ICSS |
2019-06-06 15:05 |
Miyagi |
Research Institute for Electrical Communication, Tohoku University |
A Design of SDN-based Control Method for D2D Network with Heterogeneous Network Devices Naoyuki Kazuta, Makoto Oide, Satoru Izumi, Toru Abe, Takuo Suganuma (Tohoku Univ.) IA2019-2 ICSS2019-2 |
Device-to-Device (D2D) network of mobile devices is
expected to be a method of offloading of Radio Access Network
such... [more] |
IA2019-2 ICSS2019-2 pp.7-12 |
IN, NV (Joint) |
2013-07-19 11:10 |
Hokkaido |
Hokkaido Univ. Faculty of Eng. Academic Lounge 3 |
Throughput Evaluation of UDP and TCP in Densely Placed APs Kenji Takahashi, Hiroyasu Obata (HIroshima City Univ.), Tutomu Murase (NEC), Kenji Ishida (HIroshima City Univ.) IN2013-52 |
Some papers investigated the channel assignment by using actual environments and the relationships between channel assig... [more] |
IN2013-52 pp.95-100 |
CAS |
2013-01-28 14:30 |
Oita |
Beppu International Convention Center |
Evaluation of edge coloring for channel assignment in wireless networks Yusuke Ashida, Hiroshi Tamura (Chuo Univ.), Shoji Shinoda (Waseda Univ.) CAS2012-75 |
Ad hoc networks consist of mobile tereminals with personal communication devices. Each terminal can receive a message fr... [more] |
CAS2012-75 pp.53-58 |
COMP |
2008-05-13 15:55 |
Fukuoka |
Kyushu Sangyo University |
An O(n^{1.75})-time Algorithm for L(2,1)-labeling of Trees Toru Hasunuma (Univ. Tokushima), Toshimasa Ishii (Otaru Univ. of Commerce), Hirotaka Ono (Kyushu Univ.), Yushi Uno (Osaka Prefecture Univ.) COMP2008-14 |
An $L(2,1)$-labeling of a graph $G$ is an assignment $f$
from the vertex set $V(G)$ to the set of nonnegative integers... [more] |
COMP2008-14 pp.43-50 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|