Feng LIU Qianqian WU Conggai LI Fangjiong CHEN Yanli XU
To improve the performance of underwater acoustic communications, this letter proposes a polar coding scheme with adaptive channel equalization, which can reduce the amount of feedback information. Furthermore, a hybrid automatic repeat request (HARQ) mechanism is provided to mitigate the impact of estimation errors. Simulation results show that the proposed scheme outperforms the turbo equalization in bit error rate. Computational complexity analysis is also provided for comparison.
Daiki TODA Ren ANZAI Koichi ICHIGE Ryo SAITO Daichi UEKI
A method of radar-based contactless vital-sign sensing and electrocardiogram (ECG) signal reconstruction using deep learning is proposed. A radar system is an effective tool for contactless vital-sign sensing because it can measure a small displacement of the body surface without contact. However, most of the conventional methods have limited evaluation indices and measurement conditions. A method of measuring body-surface-displacement signals by using frequency-modulated continuous-wave (FMCW) radar and reconstructing ECG signals using a convolutional neural network (CNN) is proposed. This study conducted two experiments. First, we trained a model using the data obtained from six subjects breathing in a seated condition. Second, we added sine wave noise to the data and trained the model again. The proposed model is evaluated with a correlation coefficient between the reconstructed and actual ECG signal. The results of first experiment show that their ECG signals are successfully reconstructed by using the proposed method. That of second experiment show that the proposed method can reconstruct signal waveforms even in an environment with low signal-to-noise ratio (SNR).
Xiang BI Huang HUANG Benhong ZHANG Xing WEI
It is of great significance to design a stable and reliable routing protocol for Vehicular Ad Hoc Networks (VANETs) that adopt Vehicle to Vehicle (V2V) communications in the face of frequent network topology changes. In this paper, we propose a hybrid routing algorithm, RCRIQ, based on improved Q-learning. For an established cluster structure, the cluster head is used to select the gateway vehicle according to the gateway utility function to expand the communication range of the cluster further. During the link construction stage, an improved Q-learning algorithm is adopted. The corresponding neighbor vehicle is chosen according to the maximum Q value in the neighbor list. The heuristic algorithm selects the next-hop by the maximum heuristic function value when selecting the next-hop neighbor node. The above two strategies are comprehensively evaluated to determine the next hop. This way ensures the optimal selection of the next hop in terms of reachability and other communication parameters. Simulation experiments show that the algorithm proposed in this article has better performance in terms of routing stability, throughput, and communication delay in the urban traffic scene.
Souhei YANASE Fujun HE Haruto TAKA Akio KAWABATA Eiji OKI
This paper proposes a migration model for distributed server allocation. In distributed server allocation, each user is assigned to a server to minimize the communication delay. In the conventional model, a user cannot migrate to another server to avoid instability. We develop a model where each user can migrate to another server while receiving services. We formulate the proposed model as an integer linear programming problem. We prove that the considered problem is NP-complete. We introduce a heuristic algorithm. Numerical result shows that the proposed model reduces the average communication delay by 59% compared to the conventional model at most.
Binggang ZHUO Masaki MURATA Qing MA
Paragraph segmentation is a text segmentation task. Iikura et al. achieved excellent results on paragraph segmentation by introducing focal loss to Bidirectional Encoder Representations from Transformers. In this study, we investigated paragraph segmentation on Daily News and Novel datasets. Based on the approach proposed by Iikura et al., we used auxiliary loss to train the model to improve paragraph segmentation performance. Consequently, the average F1-score obtained by the approach of Iikura et al. was 0.6704 on the Daily News dataset, whereas that of our approach was 0.6801. Our approach thus improved the performance by approximately 1%. The performance improvement was also confirmed on the Novel dataset. Furthermore, the results of two-tailed paired t-tests indicated that there was a statistical significance between the performance of the two approaches.
Constructing accurate similarity graph is an important process in graph-based clustering. However, traditional methods have three drawbacks, such as the inaccuracy of the similarity graph, the vulnerability to noise and outliers, and the need for additional discretization process. In order to eliminate these limitations, an entropy regularized unsupervised clustering based on maximum correntropy criterion and adaptive neighbors (ERMCC) is proposed. 1) Combining information entropy and adaptive neighbors to solve the trivial similarity distributions. And we introduce l0-norm and spectral embedding to construct similarity graph with sparsity and strong segmentation ability. 2) Reducing the negative impact of non-Gaussian noise by reconstructing the error using correntropy. 3) The prediction label vector is directly obtained by calculating the sparse strongly connected components of the similarity graph Z, which avoids additional discretization process. Experiments are conducted on six typical datasets and the results showed the effectiveness of the method.
Mitsuki ITO Fujun HE Kento YOKOUCHI Eiji OKI
This paper proposes a robust optimization model for probabilistic protection under uncertain capacity demands to minimize the total required capacity against multiple simultaneous failures of physical machines. The proposed model determines both primary and backup virtual machine allocations simultaneously under the probabilistic protection guarantee. To express the uncertainty of capacity demands, we introduce an uncertainty set that considers the upper bound of the total demand and the upper and lower bounds of each demand. The robust optimization technique is applied to the optimization model to deal with two uncertainties: failure event and capacity demand. With this technique, the model is formulated as a mixed integer linear programming (MILP) problem. To solve larger sized problems, a simulated annealing (SA) heuristic is introduced. In SA, we obtain the capacity demands by solving maximum flow problems. Numerical results show that our proposed model reduces the total required capacity compared with the conventional model by determining both primary and backup virtual machine allocations simultaneously. We also compare the results of MILP, SA, and a baseline greedy algorithm. For a larger sized problem, we obtain approximate solutions in a practical time by using SA and the greedy algorithm.
Xiangyu MENG Yecong LI Zhiyi YU
This paper proposes a design of high-speed interconnection between optical modules and electrical modules via bonding-wires and coplanar waveguide transmission lines on printed circuit boards for 400 Gbps 4-channel optical communication systems. In order to broaden the interconnection bandwidth, interdigitated capacitors were integrated with GSG pads on chip for the first time. Simulation results indicate the reflection coefficient is below -10 dB from DC to 53 GHz and the insertion loss is below 1 dB from DC to 45 GHz. Both indicators show that the proposed interconnection structure can effectively satisfy the communication bandwidth requirements of 100-Gbps or even higher data-rate PAM4 signals.
This letter proposes a novel intelligent dynamic channel assignment (DCA) scheme with small-cells to improve the system performance for uplink machine-type communications (MTC) based on OFDMA-FDD. Outdoor MTC devices (OMDs) have serious interference from indoor MTC devices (IMDs) served by small-cell access points (SAPs) with frequency reuse. Thus, in the proposed DCA scheme, the macro base station (MBS) first measures the received signal strength from both OMDs and IMDs after setting the transmission power. Then, the MBS dynamically assigns subchannels to each SAP with consideration of strong interference from IMDs to the MBS. Through simulation results, it is shown that the proposed DCA scheme outperforms other schemes in terms of the capacity of OMDs and IMDs.
Recently, Linux Container has been the de-facto standard for a cloud system, enabling cloud providers to create a virtual environment in a much more scaled manner. However, configuring container networks remains immature and requires automatic verification for efficient cloud management. We propose Verikube, which utilizes a novel graph structure representing policies to reduce memory consumption and accelerate verification. Moreover, unlike existing works, Verikube is compatible with the complex semantics of Cilium Policy which a cloud adopts from its advantage of performance. Our evaluation results show that Verikube performs at least seven times better for memory efficiency, at least 1.5 times faster for data structure management, and 20K times better for verification.
Xiang BI Shengzhen YANG Benhong ZHANG Xing WEI
Multi-hop V2V communication is a fundamental way to realize data transmission in Vehicular Ad-hoc Networks (VANET). It has excellent potential in intelligent transportation systems and automatic vehicle driving, and positively affects the safety, reliability, and comfort of vehicles. With advantages in speed and trajectory, distribution along the route, size, etc., the urban buses have become prospective relay nodes for urban VANETs. However, it is a considerable challenge to construct stable and reliable (meeting the requirements of bandwidth, delay, and bit error rate) multi-hop routing because of the complexity of the urban road and bus line network in the communication area, as well as many unevenly distributed buses on the road, etc. Given this above, this paper proposes a new hierarchical routing algorithm based on V2V geographic topology segmentation. Urban hierarchical routing is divided into two layers. The first layer of routing is called coarse routing, which is composed of areas; the second layer of routing is called internal routing (bus routing within the area). Q-learning is used to formulate the sequence of buses that transmit information within each area. Details are as follows: Firstly, based on a city map containing road network information, the entire city is divided into small grids by physical streets. Secondly, based on an analysis of the characteristics of the adjacent grid bus lines, the grids with the same routing attributes are integrated into the same area, reducing the algorithm's computational complexity during route discovery. Then, for the calculated area set, a coarse route composed of the selected area is established by filtering out a group of areas satisfying from the source node to the destination node. Finally, the bus sequence between anchor intersections is selected within the chosen area, and a complete multi-hop route from the source node to the destination node is finally constructed. Sufficient simulations show that the proposed routing algorithm has more stable performance in terms of packet transmission rate, average end-to-end delay, routing duration, and other indicators than similar algorithms.
Iuon-Chang LIN Chin-Chen CHANG Hsiao-Chi CHIANG
The prosperous Internet communication technologies have led to e-commerce in mobile computing and made Web of Things become popular. Electronic payment is the most important part of e-commerce, so many electronic payment schemes have been proposed. However, most of proposed schemes cannot give change. Based on proxy blind signatures, an e-cash payment system is proposed in this paper to solve this problem. This system can not only provide change divisibility through Web of Things, but also provide anonymity, verifiability, unforgeability and double-spending owner track.
The issue of copying values or references has historically been studied for managing memory objects, especially in distributed systems. In this paper, we explore a new topic on copying values v.s. references, for memory page compaction on virtualized systems. Memory page compaction moves target physical pages to a contiguous memory region at the operating system kernel level to create huge pages. Memory virtualization provides an opportunity to perform memory page compaction by copying the references of the physical pages. That is, instead of copying pages' values, we can move guest physical pages by changing the mappings of guest-physical to machine-physical pages. The goal of this paper is a quantitative comparison between value- and reference-based memory page compaction. To do so, we developed a software mechanism that achieves memory page compaction by appropriately updating the references of guest-physical pages. We prototyped the mechanism on Linux 4.19.29 and the experimental results show that the prototype's page compaction is up to 78% faster and achieves up to 17% higher performance on the memory-intensive real-world applications as compared to the default value-copy compaction scheme.
Ruihua LIU Yin LI Ling ZOU Yude NI
Testing the radio frequency compatibility between Cn-band Satellite Navigation and Microwave Landing System (MLS) has included establishing a specific interference model and reporting the effect of such interference. This paper considers two interference scenarios according to the interfered system. By calculating the Power Flux Density (PFD) values, the interference for Cn-band satellite navigation downlink signal from several visible space stations on MLS service is evaluated. Simulation analysis of the interference for MLS DPSK-data word signal and scanning signal on Cn-band satellite navigation signal is based on the Spectral Separation Coefficient (SSC) and equivalent Carrier-to-Noise Ratio methodologies. Ground tests at a particular military airfield equipped with MLS ground stations were successfully carried out, and some measured data verified the theoretical and numerical results. This study will certainly benefit the design of Cn-band satellite navigation signals and guide the interoperability and compatibility research of Cn-band satellite navigation and MLS.
Kohei WATABE Norinosuke MURAI Shintaro HIRAKAWA Kenji NAKAGAWA
End-to-end loss and delay are both fundamental metrics in network performance evaluation, and accurate measurements for these end-to-end metrics are one of the keys to keeping delay/loss-sensitive applications (e.g., audio/video conferencing, IP telephony, or telesurgery) comfortable on networks. In our previous work [1], we proposed a parallel flow monitoring method that can provide accurate active measurements of end-to-end delay. In this method, delay samples of a target flow increase by utilizing the observation results of other flows sharing the source/destination with the target flow. In this paper, to improve accuracy of loss measurements, we propose a loss measurement method by extending our delay measurement method. Additionally, we improve the loss measurement method so that it enables to fully utilize information of all flows including flows with different source and destination. We evaluate the proposed method through theoretical and simulation analyses. The evaluations show that the accuracy of the proposed method is bounded by theoretical upper/lower bounds, and it is confirmed that it reduces the error of loss rate estimations by 57.5% on average.
Tomoki SHIMIZU Kohei ITO Kensuke IIZUKA Kazuei HIRONAKA Hideharu AMANO
The multi-FPGA system known as, the Flow-in-Cloud (FiC) system, is composed of mid-range FPGAs that are directly interconnected by high-speed serial links. FiC is currently being developed as a server for multi-access edge computing (MEC), which is one of the core technologies of 5G. Because the applications of MEC are sometimes timing-critical, a static time division multiplexing (STDM) network has been used on FiC. However, the STDM network exhibits the disadvantage of decreasing link utilization, especially under light traffic. To solve this problem, we propose a hybrid router that combines packet switching for low-priority communication and STDM for high-priority communication. In our hybrid network, the packet switching uses slots that are unused by the STDM; therefore, best-effort communication by packet switching and QoS guarantee communication by the STDM can be used simultaneously. Furthermore, to improve each link utilization under a low network traffic load, we propose a dynamic communication switching algorithm. In our algorithm, each router monitors the network load metrics, and according to the metrics, timing-critical tasks select the STDM according to the metrics only when congestion occurs. This can achieve both QoS guarantee and efficient utilization of each link with a small resource overhead. In our evaluation, the dynamic algorithm was up to 24.6% faster on the execution time with a high network load compared to the packet switching on a real multi-FPGA system with 24 boards.
Yiqi CHEN Ping WEI Gaiyou LI Huaguo ZHANG Hongshu LIAO
This paper considers tracking of a non-cooperative emitter based on a single sensor. To this end, the direct target motion analysis (DTMA) approach, where the target state is straightforwardly achieved from the received signal, is exploited. In order to achieve observability, the sensor has to perform a maneuver relative to the emitter. By suitably building an approximated likelihood function, the unscented Kalman filter (UKF), which is able to work under high nonlinearity of the measurement model, is adopted to recursively estimate the target state. Besides, the posterior Cramér-Rao bound (PCRB) of DTMA, which can be used as performance benchmark, is also achieved. The effectiveness of proposed method is verified via simulation experiments.
Phuong T.K. DINH Linh T.T. DINH Tung T. TRAN Lam S. PHAM Han Le DUC Chi P. HOANG Minh D. NGUYEN
Recently, most signal processing algorithms have been developed with floating-point arithmetic, while the fixed-point arithmetic is more popular with most commercial devices and low-power real-time applications which are implemented on embedded/ASIC/FPGA systems. Therefore, the optimal Floating-point to Fixed-point Conversion (FFC) methodology is a promising solution. In this paper, we propose the FFC consisting of signal grouping technique and simulation-based word length optimization. In order to evaluate the performance of the proposed technique, simulations are carried out and hardware co-simulation on Field Programmable Gate Arrays (FPGAs) platform have been applied to complex Digital Signal Processing (DSP) algorithms: Linear Time Invariant (LTI) systems, multi-mode Fast Fourier Transform (FFT) circuit for IEEE 802.11 ax WLAN Devices and the calibration algorithm of gain and clock skew in Time-Interleaved ADC (TI-ADC) using Adaptive Noise Canceller (ANC). The results show that the proposed technique can reduce the hardware cost about 30% while being able to maintain its speed and reliability.
Various types of indices for estimating functional connectivity have been developed over the years that have introduced effective approaches to discovering complex neural networks in the brain. Two significant examples are the phase lag index (PLI) and transfer entropy (TE). Both indices have specific benefits; PLI, defined using instantaneous phase dynamics, achieves high spatiotemporal resolution, whereas transfer entropy (TE), defined using information flow, reveals directed network characteristics. However, the relationship between these indices remains unclear. In this study, we hypothesize that there exists a complementary relationship between PLI and TE to discover new aspects of functional connectivity that cannot be detected using either PLI or TE. To validate this hypothesis, we evaluated the synchronization in a coupled Rössler model using PLI and TE. Consequently, we proved the existence of non-linear relationships between PLI and TE. Both indexes exhibit a specific trend that demonstrates a linear relationship in the region of small TE values. However, above a specific TE value, PLI converges to a constant irrespective of the TE value. In addition to this relational difference in synchronization, there is another characteristic difference between these indices. Moreover, by virtue of its finer temporal resolution, PLI can capture the temporal variability of the degree of synchronization, which is called dynamical functional connectivity. TE lacks this temporal characteristic because it requires a longer evaluation period in this estimation process. Therefore, combining the advantages of both indices might contribute to revealing complex spatiotemporal functional connectivity in brain activity.
Kiyoshi KAMIMURA Yuki FUJIMAKI Haruki HOSHIKAWA Kazuki IMAIZUMI Kazuya IZAWA Ryo NAGASE
Multi-core fiber (MCF) is one of the most promising candidates for achieving ultra-wideband optical transmission in the near future. To build a network using MCF, a high-performance and reliable MCF connector is indispensable. We have developed an SC-type optical connector for MCF and confirmed its excellent optical performance, mechanical durability, and environmental reliability. To put the communication system using MCF into practical use, it is necessary to establish a procedure for measuring the initial connection characteristics. Fan-in / fan-out (FIFO) devices are indispensable for measuring the connection characteristics of MCF connectors. To measure the return loss of the MCF connector, it is necessary to remove the influence of reflection at the FIFO itself and at the connection points with the FIFO. In this paper, we compare four types of return loss measurement procedures (three usual method and a new method we proposed) and find that most stable measurement method involves using our new method, the OCWR method without FIFO. The OCWR method without FIFO is considered to be the most advantageous when used for outgoing inspection of connectors. The reason is that it eliminates the measurement uncertainty caused by the FIFO and enables speedy measurement.