Liaoruo HUANG Qingguo SHEN Zhangkai LUO
Bandwidth reservation is an important way to guarantee deterministic end-to-end service quality. However, with the traditional bandwidth reservation mechanism, the allocated bandwidth at each link is by default the same without considering the available resource of each link, which may lead to unbalanced resource utilization and limit the number of user connections that network can accommodate. In this paper, we propose a non-uniform bandwidth reservation method, which can further balance the resource utilization of network by optimizing the reserved bandwidth at each link according to its link load. Furthermore, to implement the proposed method, we devise a flexible and automatic bandwidth reservation mechanism based on meter table of Openflow. Through simulations, it is showed that our method can achieve better load balancing performance and make network accommodate more user connections comparing with the traditional methods in most application scenarios.
Dongdong GUAN Xiaoan TANG Li WANG Junda ZHANG
Synthetic aperture radar (SAR) image classification is a popular yet challenging research topic in the field of SAR image interpretation. This paper presents a new classification method based on extreme learning machine (ELM) and the superpixel-guided composite kernels (SGCK). By introducing the generalized likelihood ratio (GLR) similarity, a modified simple linear iterative clustering (SLIC) algorithm is firstly developed to generate superpixel for SAR image. Instead of using a fixed-size region, the shape-adaptive superpixel is used to exploit the spatial information, which is effective to classify the pixels in the detailed and near-edge regions. Following the framework of composite kernels, the SGCK is constructed base on the spatial information and backscatter intensity information. Finally, the SGCK is incorporated an ELM classifier. Experimental results on both simulated SAR image and real SAR image demonstrate that the proposed framework is superior to some traditional classification methods.
Megumi TAKEZAWA Hirofumi SANADA Takahiro OGAWA Miki HASEYAMA
In this paper, we propose a highly accurate method for estimating the quality of images compressed using fractal image compression. Using an iterated function system, fractal image compression compresses images by exploiting their self-similarity, thereby achieving high levels of performance; however, we cannot always use fractal image compression as a standard compression technique because some compressed images are of low quality. Generally, sufficient time is required for encoding and decoding an image before it can be determined whether the compressed image is of low quality or not. Therefore, in our previous study, we proposed a method to estimate the quality of images compressed using fractal image compression. Our previous method estimated the quality using image features of a given image without actually encoding and decoding the image, thereby providing an estimate rather quickly; however, estimation accuracy was not entirely sufficient. Therefore, in this paper, we extend our previously proposed method for improving estimation accuracy. Our improved method adopts a new image feature, namely lacunarity. Results of simulation showed that the proposed method achieves higher levels of accuracy than those of our previous method.
Sinh-Ngoc NGUYEN Van-Quyet NGUYEN Giang-Truong NGUYEN JeongNyeo KIM Kyungbaek KIM
Distributed Reflective Denial of Services (DRDoS) attacks have gained huge popularity and become a major factor in a number of massive cyber-attacks. Usually, the attackers launch this kind of attack with small volume of requests to generate a large volume of attack traffic aiming at the victim by using IP spoofing from legitimate hosts. There have been several approaches, such as static threshold based approach and confirmation-based approach, focusing on DRDoS attack detection at victim's side. However, these approaches have significant disadvantages: (1) they are only passive defences after the attack and (2) it is hard to trace back the attackers. To address this problem, considerable attention has been paid to the study of detecting DRDoS attack at source side. Because the existing proposals following this direction are supposed to be ineffective to deal with small volume of attack traffic, there is still a room for improvement. In this paper, we propose a novel method to detect DRDoS attack request traffic on SDN(Software Defined Network)-enabled gateways in the source side of attack traffic. Our method adjusts the sampling rate and provides a traffic-aware adaptive threshold along with the margin based on analysing observed traffic behind gateways. Experimental results show that the proposed method is a promising solution to detect DRDoS attack request in the source side.
Jie PENG Chik How TAN Qichun WANG Jianhua GAO Haibin KAN
Research on permutation polynomials over the finite field F22k with significant cryptographical properties such as possibly low differential uniformity, possibly high nonlinearity and algebraic degree has attracted a lot of attention and made considerable progress in recent years. Once used as the substitution boxes (S-boxes) in the block ciphers with Substitution Permutation Network (SPN) structure, this kind of polynomials can have a good performance against the classical cryptographic analysis such as linear attacks, differential attacks and the higher order differential attacks. In this paper we put forward a new construction of differentially 4-uniformity permutations over F22k by modifying the inverse function on some specific subsets of the finite field. Compared with the previous similar works, there are several advantages of our new construction. One is that it can provide a very large number of Carlet-Charpin-Zinoviev equivalent classes of functions (increasing exponentially). Another advantage is that all the functions are explicitly constructed, and the polynomial forms are obtained for three subclasses. The third advantage is that the chosen subsets are very large, hence all the new functions are not close to the inverse function. Therefore, our construction may provide more choices for designing of S-boxes. Moreover, it has been checked by a software programm for k=3 that except for one special function, all the other functions in our construction are Carlet-Charpin-Zinoviev equivalent to the existing ones.
Regarding IEEE 802.11 wireless local area networks (WLANs), many researchers are focusing on signal-to-noise ratio (SNR)-based rate adaptation schemes, because these schemes have the advantage of accurately selecting transmission rates that suit the channel. However, even SNR-based rate adaptation schemes work poorly in a rapidly varying channel environment. If a transmitter cannot receive accurate rate information due to fast channel fading, it encounters continuous channel errors, because the cycle of rate adaptation and rate information feedback breaks. A well-designed request-to-send/clear-to-send (RTS/CTS) frame exchange policy that accurately reflects the network situation is an indispensable element for enhancing the performance of SNR-based rate adaptation schemes. In this paper, a novel rate adaptation scheme called adaptive RTS/CTS-exchange and rate prediction (ARRP) is proposed, which adapts the transmission rate efficiently for variable network situations, including rapidly varying channels. ARRP selects a transmission rate by predicting the SNR of the data frame to transmit when the channel condition becomes worse. Accordingly, ARRP prevents continuous channel errors through a pre-emptive transmission rate adjustment. Moreover, ARRP utilizes an efficient RTS/CTS frame exchange algorithm that considers the number of contending stations and the current transmission rate of data frames, which drastically reduces both frame collisions and RTS/CTS-exchange overhead simultaneously. Simulation results show that ARRP achieves better performance than other rate adaptation schemes.
Takahiro KODAMA Gabriella CINCOTTI
A novel adaptive code division multiplexing system with hybrid electrical and optical codes is proposed for flexible and dynamic resource allocation in next generation asynchronous optical access networks. We analyze the performance of a 10Gbps × 12 optical node unit, using hierarchical 8-level optical and 4-level electrical phase shift keying codes.
Takashi MAEHATA Suguru KAMEDA Noriharu SUEMATSU
The 1-bit band-pass delta-sigma modulator (BP-DSM) achieves high resolution if it uses an oversampling technique. This method can generate concurrent dual-band RF signals from a digitally modulated signal using a 1-bit digital pulse train. It was previously reported that the adjacent channel leakage ratio (ACLR) deteriorates owing to the asymmetrical waveform created by the pulse transition mismatch error of the rising and falling waveforms in the time domain and that the ACLR can be improved by distortion compensation. However, the reported distortion compensation method can only be performed for single-band transmission, and it fails to support multi-band transmission because the asymmetrical waveform compensated signal extends over a wide frequency range and is itself a harmful distortion outside the target band. Unfortunately, the increase of out-of-band power causes the BP-DSM unstable. We therefore propose a distortion compensator for a concurrent dual-band 1-bit BP-DSM that consists of a noise transfer function with a quasi-elliptic filter that can control the out-of-band gain frequency response against out-of-band oscillation. We demonstrate that dual-band LTE signals, each with 40MHz (2×20MHz) bandwidth, at 1.5 and 3.0GHz, can be compensated concurrently for spurious distortion under various combinations of rising and falling times and ACLR of up to 48dB, each with 120MHz bandwidth, including the double sided adjacent channels and next adjacent channels, is achieved.
A problem of global stabilization of a class of approximately feedback linearized systems is considered. A new system structural feature is the presence of non-trivial diagonal terms along with nonlinearity, which has not been addressed by the previous control results. The stability analysis reveals a new relationship between the time-varying rates of system parameters and system nonlinearity along with our controller. Two examples are given for illustration.
Kazuki YONEYAMA Reo YOSHIDA Yuto KAWAHARA Tetsutaro KOBAYASHI Hitoshi FUJI Tomohide YAMAMOTO
In this paper, we propose the first identity-based dynamic multi-cast key distribution (ID-DMKD) protocol which is secure against maximum exposure of secret information (e.g., secret keys and session-specific randomness). In DMKD protocols, users share a common session key without revealing any information of the session key to the semi-honest server, and can join/leave to/from the group at any time even after establishing the session key. Most of the known DMKD protocols are insecure if some secret information is exposed. Recently, an exposure resilient DMKD protocol was introduced, however, each user must manage his/her certificate by using the public-key infrastructure. We solve this problem by constructing the DMKD protocol authenticated by user's ID (i.e., without certificate). We introduce a formal security definition for ID-DMKD by extending the previous definition for DMKD. We must carefully consider exposure of the server's static secret key in the ID-DMKD setting because exposure of the server's static secret key causes exposure of all users' static secret keys. We prove that our protocol is secure in our security model in the standard model. Another advantage of our protocol is scalability: communication and computation costs of each user are independent from the number of users. Furthermore, we show how to extend our protocol to achieve non-interactive join by using certificateless encryption. Such an extension is useful in applications that the group members frequently change like group chat services.
Several new memories are being studied as candidates of future DRAM that seems difficult to be scaled. However, the read signal in these new memories needs to be amplified in a single-end manner with reference signal supplied if they are aimed for being applied to the high-density main memory. This scheme, which is fortunately not necessary in DRAM's 1/2Vdd pre-charge sense amp, can become a serious bottleneck in the new memory development, because the device electrical parameters in these new memory cells are prone to large cell-to-cell variations without exception. Furthermore, the extent to which the parameter fluctuates in data “1” is generally not the same as in data “0”. In these situations, a new sensing scheme is proposed that can minimize the sensing error rate for high-density single-end emerging memories like STT-MRAM, ReRAM and PCRAM. The scheme is based on averaging multiple dummy cell pairs that are written “1” and “0” in a weighted manner according to the fluctuation unbalance between “1” and “0”. A detailed analysis shows that this scheme is effective in designing 128Mb 1T1MTJ STT-MRAM with the results that the required TMR ratio of an MTJ can be relaxed from 130% to 90% for the fluctuation of 6% sigma-to-average ratio of MTJ resistance in a 16 pair-dummy cell averaging case by using this technology when compared with the arithmetic averaging method.
Kuo CAO Yueming CAI Yongpeng WU Weiwei YANG
This letter studies secure transmission design with finite alphabet input for cooperative jamming network under individual power constraint. By adopting the zero-force scheme, where the jamming signal is fully laid in the null space of the relay-destination channel, the problem of enhancing the achievable secrecy rate is decomposed into two independent subproblems: relay weights design and power control. We reveal that the problem of relay weights design is identical to the problem of minimizing the maximal equivalent source-eavesdropper channel gain, which can be transformed into a semi-definite programming (SDP) problem and thus is tackled using interior point method. Besides, the problem of power control is solved with the fundamental relation between mutual information and minimum mean square error (MMSE). Numerical results show that the proposed scheme achieves significant performance gains compared to the conventional Gaussian design.
Shunsuke YAMAKI Masahide ABE Masayuki KAWAMATA
This letter proposes performance evaluation of phase-only correlation (POC) functions using signal-to-noise ratio (SNR) and peak-to-correlation energy (PCE). We derive the general expressions of SNR and PCE of the POC functions as correlation performance measures. SNR is expressed by simple fractional function of circular variance. PCE is simply given by squared peak value of the POC functions, and its expectation can be expressed in terms of circular variance.
Mitsuyoshi KISHIHARA Masaya TAKEUCHI Akinobu YAMAGUCHI Yuichi UTSUMI Isao OHTA
The microfabrication technique based on SR (Synchrotron Radiation) direct etching process has recently been applied to construct PTFE microstructures. This paper attempts to fabricate an integrated PTFE-filled waveguide Butler matrix for short millimeter-wave by SR direct etching. First, a cruciform 3-dB directional coupler and an intersection circuit (0-dB coupler) are designed at 180 GHz. Then, a 4×4 Butler matrix with horn antennas is designed and fabricated. Finally, the measured radiation patterns of the Butler matrix are shown.
This paper proposes an image denoising method using singular value decomposition (SVD) with block-rotation-based operations in wavelet domain. First, we decompose a noisy image to some sub-blocks, and use the single-level discrete 2-D wavelet transform to decompose each sub-block into the low-frequency image part and the high-frequency parts. Then, we use SVD and rotation-based SVD with the rank-1 approximation to filter the noise of the different high-frequency parts, and get the denoised sub-blocks. Finally, we reconstruct the sub-block from the low-frequency part and the filtered the high-frequency parts by the inverse wavelet transform, and reorganize each denoised sub-blocks to obtain the final denoised image. Experiments show the effectiveness of this method, compared with relevant methods.
Ngochao TRAN Tetsuro IMAI Koshiro KITAO Yukihiko OKUMURA Takehiro NAKAMURA Hiroshi TOKUDA Takao MIYAKE Robin WANG Zhu WEN Hajime KITANO Roger NICHOLS
The fifth generation (5G) system using millimeter waves is considered for application to high traffic areas with a dense population of pedestrians. In such an environment, the effects of shadowing and scattering of radio waves by human bodies (HBs) on propagation channels cannot be ignored. In this paper, we clarify based on measurement the characteristics of waves scattered by the HB for typical non-line-of-sight scenarios in street canyon environments. In these scenarios, there are street intersections with pedestrians, and the angles that are formed by the transmission point, HB, and reception point are nearly equal to 90 degrees. We use a wide-band channel sounder for the 67-GHz band with a 1-GHz bandwidth and horn antennas in the measurements. The distance parameter between antennas and the HB is changed in the measurements. Moreover, the direction of the HB is changed from 0 to 360 degrees. The evaluation results show that the radar cross section (RCS) of the HB fluctuates randomly over the range of approximately 20dB. Moreover, the distribution of the RCS of the HB is a Gaussian distribution with a mean value of -9.4dBsm and the standard deviation of 4.2dBsm.
Li QUAN Zhi-liang WANG Xin LIU
Reinforcement learning has been used to adaptive service composition. However, traditional algorithms are not suitable for large-scale service composition. Based on Q-Learning algorithm, a multi-task oriented algorithm named multi-Q learning is proposed to realize subtask-assistance strategy for large-scale and adaptive service composition. Differ from previous studies that focus on one task, we take the relationship between multiple service composition tasks into account. We decompose complex service composition task into multiple subtasks according to the graph theory. Different tasks with the same subtasks can assist each other to improve their learning speed. The results of experiments show that our algorithm could obtain faster learning speed obviously than traditional Q-learning algorithm. Compared with multi-agent Q-learning, our algorithm also has faster convergence speed. Moreover, for all involved service composition tasks that have the same subtasks between each other, our algorithm can improve their speed of learning optimal policy simultaneously in real-time.
Motoko TACHIBANA Kohei YAMAMOTO Kurato MAENO
Radar is expected in advanced driver-assistance systems for environmentally robust measurements. In this paper, we propose a novel radar signal segmentation method by using a complex-valued fully convolutional network (CvFCN) that comprises complex-valued layers, real-valued layers, and a bidirectional conversion layer between them. We also propose an efficient automatic annotation system for dataset generation. We apply the CvFCN to two-dimensional (2D) complex-valued radar signal maps (r-maps) that comprise angle and distance axes. An r-maps is a 2D complex-valued matrix that is generated from raw radar signals by 2D Fourier transformation. We annotate the r-maps automatically using LiDAR measurements. In our experiment, we semantically segment r-map signals into pedestrian and background regions, achieving accuracy of 99.7% for the background and 96.2% for pedestrians.