{"title":"Multitarget 2-D DOA Estimation Using Wideband LFMCW Signal and Triangle Array Composed of Three Receiver Antennas","authors":"Wentao Zhang, C. Miao, Wen Wu","doi":"10.1587/transcom.2022ebp3084","DOIUrl":"https://doi.org/10.1587/transcom.2022ebp3084","url":null,"abstract":"","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"3 1","pages":"307-316"},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86528619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Belief Propagation Detection with MRC Reception and MMSE Pre-cancellation for Overloaded MIMO","authors":"Yuto SUZUKI, Yukitoshi SANADA","doi":"10.1587/transcom.2023ebp3076","DOIUrl":"https://doi.org/10.1587/transcom.2023ebp3076","url":null,"abstract":"","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134980250","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Highly Efficient Multi-Band Optical Networks with Wavelength-Selective Band Switching","authors":"M. Nakagawa, H. Kawahara, T. Seki, T. Miyamura","doi":"10.1587/transcom.2022ebp3067","DOIUrl":"https://doi.org/10.1587/transcom.2022ebp3067","url":null,"abstract":"SUMMARY Multi-band transmission technologies promise to cost-e ff ectively expand the capacity of optical networks by exploiting low-loss spectrum windows beyond the conventional band used in already-deployed fibers. While such technologies o ff er a high potential for capacity upgrades, available capacity is seriously restricted not only by the wavelength-continuity constraint but also by the signal-to-noise ratio (SNR) constraint. In fact, exploiting more bands can cause higher SNR imbalance over multiple bands, which is mainly due to stimulated Raman scattering. To relax these constraints, we propose wavelength-selective band switching-enabled networks (BSNs), where each wavelength channel can be freely switched to any band and in any direction at any optical node on the route. We also present two typical optical node configurations utilizing all-optical wavelength converters, which can realize the switching proposal. Moreover, numerical analyses clarify that our BSN can reduce the fiber resource requirements by more than 20% compared to a conventional multi-band network under realistic conditions. We also discuss the impact of physical-layer performance of band switching operations on available benefits to investigate the feasibility of BSNs. In addition, we report on a proof-of-concept demonstration of a BSN with a prototype node, where C + L-band wavelength-division-multiplexed 112-Gb / s dual-polarization quadrature phase-shift keying signals are successfully transmitted while the bands of individual channels are switched node-by-node for up to 4 cascaded nodes.","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"21 1","pages":"416-426"},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74175262","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Deep Neural Networks Based End-to-End DOA Estimation System","authors":"Daniel Akira ANDO, Yuya KASE, Toshihiko NISHIMURA, Takanori SATO, Takeo OHGANE, Yasutaka OGAWA, Junichiro HAGIWARA","doi":"10.1587/transcom.2023cep0006","DOIUrl":"https://doi.org/10.1587/transcom.2023cep0006","url":null,"abstract":"Direction of arrival (DOA) estimation is an antenna array signal processing technique used in, for instance, radar and sonar systems, source localization, and channel state information retrieval. As new applications and use cases appear with the development of next generation mobile communications systems, DOA estimation performance must be continually increased in order to support the nonstop growing demand for wireless technologies. In previous works, we verified that a deep neural network (DNN) trained offline is a strong candidate tool with the promise of achieving great on-grid DOA estimation performance, even compared to traditional algorithms. In this paper, we propose new techniques for further DOA estimation accuracy enhancement incorporating signal-to-noise ratio (SNR) prediction and an end-to-end DOA estimation system, which consists of three components: source number estimator, DOA angular spectrum grid estimator, and DOA detector. Here, we expand the performance of the DOA detector and angular spectrum estimator, and present a new solution for source number estimation based on DNN with very simple design. The proposed DNN system applied with said enhancement techniques has shown great estimation performance regarding the success rate metric for the case of two radio wave sources although not fully satisfactory results are obtained for the case of three sources.","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135357541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Adaptive Mixing Probability Scheme in Mixed Gibbs Sampling MIMO Signal Detection","authors":"Kenshiro CHUMAN, Yukitoshi SANADA","doi":"10.1587/transcom.2023ebp3018","DOIUrl":"https://doi.org/10.1587/transcom.2023ebp3018","url":null,"abstract":"This paper proposes an adaptive mixing probability scheme for mixed Gibbs sampling (MGS) or MGS with maximum ratio combining (MRC) in multi-input multi-output (MIMO) demodulation. In the conventional MGS algorithm, the mixing probability is fixed. Thus, if a search point is captured by a local minimum, it takes a larger number of samples to escape. In the proposed scheme, the mixing probability is increased when a candidate transmit symbol vector is captured by a local minimum. Using the adaptive mixing probability, the numbers of candidate transmit symbol vectors searched by demodulation algorithms increase. The proposed scheme in MGS as well as MGS with MRC reduces an error floor level as compared with the conventional scheme. Numerical results obtained through computer simulation show that the bit error rates of the MGS as well as the MGS with MRC reduces by about 1/100 when the number of iterations is 100 in a 64 × 64 MIMO system.","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135501216","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Information-Centric Function Chaining for ICN-based In-Network Computing in the Beyond 5G/6G Era","authors":"Yusaku HAYAMIZU, Masahiro JIBIKI, Miki YAMAMOTO","doi":"10.1587/transcom.2023wwp0005","DOIUrl":"https://doi.org/10.1587/transcom.2023wwp0005","url":null,"abstract":"Information-Centric Networking (ICN) originally innovated for efficient data distribution, is currently discussed to be applied to edge computing environment. In this paper, we focus on a more flexible context, in-network computing, which is enabled by ICN architecture. In ICN-based in-network computing, a function chaining (routing) method for chaining multiple functions located at different routers widely distributed in the network is required. Our proposal is a twofold approach, On-demand Routing for Responsive Route (OR3) and Route Records (RR). OR3 efficiently chains data and multiple functions compared with an existing routing method. RR reactively stores routing information to reduce communication/ computing overhead. In this paper, we conducted a mathematical analytics in order to verify the correctness of the proposed routing algorithm. Moreover, we investigate applicabilities of OR3/RR to an edge computing context in the future Beyond 5G/6G era, in which rich computing resources are provided by mobile nodes thanks to the cutting-edge mobile device technologies. In the mobile environments, the optimum from viewpoint of “routing” is largely different from the stable wired environment. We address this challenging issue and newly propose protocol enhancements for OR3 by considering node mobility. Evaluation results reveal that mobility-enhanced OR3 can discover stable paths for function chaining to enable more reliable ICN-based in-network computing under the highly-dynamic network environment.","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135953559","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Resource Allocation for Mobile Edge Computing System Considering User Mobility with Deep Reinforcement Learning","authors":"Kairi TOKUDA, Takehiro SATO, Eiji OKI","doi":"10.1587/transcom.2023ebp3043","DOIUrl":"https://doi.org/10.1587/transcom.2023ebp3043","url":null,"abstract":"Mobile edge computing (MEC) is a key technology for providing services that require low latency by migrating cloud functions to the network edge. The potential low quality of the wireless channel should be noted when mobile users with limited computing resources offload tasks to an MEC server. To improve the transmission reliability, it is necessary to perform resource allocation in an MEC server, taking into account the current channel quality and the resource contention. There are several works that take a deep reinforcement learning (DRL) approach to address such resource allocation. However, these approaches consider a fixed number of users offloading their tasks, and do not assume a situation where the number of users varies due to user mobility. This paper proposes Deep reinforcement learning model for MEC Resource Allocation with Dummy (DMRA-D), an online learning model that addresses the resource allocation in an MEC server under the situation where the number of users varies. By adopting dummy state/action, DMRA-D keeps the state/action representation. Therefore, DMRA-D can continue to learn one model regardless of variation in the number of users during the operation. Numerical results show that DMRA-D improves the success rate of task submission while continuing learning under the situation where the number of users varies.","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135953563","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Intrusion Detection Model of Internet of Things Based on LightGBM","authors":"Guo-sheng Zhao, Yang Wang, Jian Wang","doi":"10.2139/ssrn.3993056","DOIUrl":"https://doi.org/10.2139/ssrn.3993056","url":null,"abstract":"SUMMARY Internet of Things (IoT) devices are widely used in various fields. However, their limited computing resources make them extremely vulnerable and di ffi cult to be e ff ectively protected. Traditional intrusion detection systems (IDS) focus on high accuracy and low false alarm rate (FAR), making them often have too high spatiotemporal complexity to be deployed in IoT devices. In response to the above problems, this paper proposes an intrusion detection model of IoT based on the light gradient boosting machine (LightGBM). Firstly, the one-dimensional convolutional neural network (CNN) is used to extract features from network tra ffi c to reduce the feature dimensions. Then, the LightGBM is used for classi-fication to detect the type of network tra ffi c belongs. The LightGBM is more lightweight on the basis of inheriting the advantages of the gradient boosting tree. The LightGBM has a faster decision tree construction process. Experiments on the TON-IoT and BoT-IoT datasets show that the proposed model has stronger performance and more lightweight than the comparison models. The proposed model can shorten the prediction time by 90.66% and is better than the comparison models in accuracy and other performance metrics. The proposed model has strong detection capability for denial of service (DoS) and distributed denial of service (DDoS) attacks. Experimental results on the testbed built with IoT devices such as Raspberry Pi show that the proposed model can perform e ff ective and real-time intrusion detection on IoT devices.","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"16 1","pages":"622-634"},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82610810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Masaki Murakami, T. Kurimoto, S. Okamoto, N. Yamanaka, T. Muranaka
{"title":"Networking Experiment of Domain-Specific Networking Platform Based on Optically Interconnected Reconfigurable Communication Processors","authors":"Masaki Murakami, T. Kurimoto, S. Okamoto, N. Yamanaka, T. Muranaka","doi":"10.1587/transcom.2022ebp3131","DOIUrl":"https://doi.org/10.1587/transcom.2022ebp3131","url":null,"abstract":"SUMMARY A domain-specific networking platform based on optically interconnected reconfigurable communication processors is proposed. Some application examples of the reconfigurable communication processor and networking experiment results are presented.","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"5 1","pages":"660-668"},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80829901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"UE Set Selection for RR Scheduling in Distributed Antenna Transmission with Reinforcement Learning","authors":"Go Otsuru, Y. Sanada","doi":"10.1587/transcom.2022ebp3136","DOIUrl":"https://doi.org/10.1587/transcom.2022ebp3136","url":null,"abstract":"SUMMARY In this paper, user set selection in the allocation sequences of round-robin (RR) scheduling for distributed antenna transmission with block diagonalization (BD) pre-coding is proposed. In prior research, the initial phase selection of user equipment allocation sequences in RR scheduling has been investigated. The performance of the proposed RR scheduling is inferior to that of proportional fair (PF) scheduling under severe intra-cell interference. In this paper, the multi-input multi-output technology with BD pre-coding is applied. Furthermore, the user equipment(UE)setsintheallocationsequencesareeliminatedwithreinforcement learning. After the modification of a RR allocation sequence, no estimated throughput calculation for UE set selection is required. Numerical results obtained through computer simulation show that the maximum selection, one of the criteria for initial phase selection, outperforms the weighted PF scheduling in a restricted realm in terms of the computational complexity, fairness, and throughput. key words: distributed antenna transmission, round-robin scheduling,","PeriodicalId":48825,"journal":{"name":"IEICE Transactions on Communications","volume":"116 1","pages":"586-594"},"PeriodicalIF":0.7,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85475964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}