This paper proposes a lightweight, fast and efficient method for the detection of jamming attacks, interference, and other anomalies in electronic shelf label (ESL) systems and wireless sensor networks (WSNs) with periodic data transmission. The proposed method is based on the thresholding technique, which is applied to selected parameters of traffic and allows discrimination of random failures from anomalies and intrusions. It does not require the installation of additional hardware and does not create extra communication costs; its computational requirements are negligible, since it is based on statistical methods. Herein recommendations are provided for choosing a thresholds type. Extensive simulations, made by Castalia simulator for WSNs, show that the proposed method has superior accuracy compared to existing algorithms.
Naohide KAMITANI Hiroki KISHIKAWA Nobuo GOTO Shin-ichiro YANAGIYA
A two-dimensional filter for photonic label recognition system using time-to-space conversion and delay compensation was designed using Genetic-Algorithms (GA). For four-bit Binary Phase Shift Keying (BPSK) labels at 160 Gbit/s, contrast ratio of the output for eight different labels was improved by optimization of two-dimentional filtering. The contrast ratio of auto-correlation to cross-correlation larger than 2.16 was obtained by computer simulation. This value is 22% larger than the value of 1.77 with the previously reported system using matched filters.
Ali MOQISEH Mahdi HADAVI Mohammad M. NAYEBI
In this paper, the inherent problem of the Hough transform when applied to search radars is considered. This problem makes the detection probability of a target depend on the length of the target line in the data space in addition to the received SNR from it. It is shown that this problem results in a non-uniform distribution of noise power in the parameter space. In other words, noise power in some regions of the parameter space is greater than in others. Therefore, the detection probability of the targets covered by these regions will decrease. Our solution is to modify the Hough detector to remove the problem. This modification uses non-uniform quantization in the parameter space based on the Maximum Entropy Quantization method. The details of implementing the modified Hough detector in a search radar are presented according to this quantization method. Then, it is shown that by using this method the detection performance of the target will not depend on its length in the data space. The performance of the modified Hough detector is also compared with the standard Hough detector by considering their probability of detection and probability of false alarm. This comparison shows the performance improvement of the modified detector.
Marie Engelene J. OBIEN Satoshi OHTAKE Hideo FUJIWARA
Due to the difficulty of test pattern generation for sequential circuits, several design-for-testability (DFT) approaches have been proposed. An improvement to these current approaches is needed to cater to the requirements of today's more complicated chips. This paper introduces a new DFT method applicable to high-level description of circuits, which optimally utilizes existing functional elements and paths for test. This technique, called F-scan, effectively reduces the hardware overhead due to test without compromising fault coverage. Test application time is also kept at the minimum. The comparison of F-scan with the performance of gate-level full scan design is shown through the experimental results.
Shinichiro OHNUKI Yuya KITAOKA
A novel computational method is proposed to investigate electromagnetic scattering problems. It is error controllable and reliable simulation in time domain can be performed. We apply the proposed method to analysis of transient scattering from open-ended structures and discuss scattering mechanisms.
Jianqing WANG Kenichiro MASAMI Qiong WANG
The objective of this study is to investigate the feasibility of an ultra wideband (UWB) impulse radio system for in-body to off-body wireless communication for biomedical applications. At first, a UWB antenna is designed in the UWB low band for implant use in the chest. Then the channel model is extracted and established based on the finite difference time domain (FDTD) simulation with an anatomical human body model. The established channel model consists of a small set of parameters for generating discrete time impulse responses. The generated model shows good agreement with the FDTD-calculated result in terms of key communication metrics. For effective communication over the multipath-affected channel, the pulse position modulation is employed and a 2-finger RAKE structure with a constant temporal delay is proposed in the receiver. The bit error rate performance has shown the validity of the system in the in-body to off-body chest channel.
Leiqi ZHU Dongkai YANG Qishan ZHANG
In order to reduce the convergence time in an iterative procedure, some gradient based preliminary processes are employed to eliminate outliers. The adaptive variable block size is also introduced to balance the accuracy and computational complexity. Moreover, the use of Canberra distance instead of Euclidean distance illustrates higher performance in measuring motion similarity.
Ryota SHIOYA Daewung KIM Kazuo HORIO Masahiro GOSHIMA Shuichi SAKAI
A security-tagged architecture is one that applies tags on data to detect attack or information leakage, tracking data flow. The previous studies using security-tagged architecture mostly focused on how to utilize tags, not how the tags are implemented. A naive implementation of tags simply adds a tag field to every byte of the cache and the memory. Such a technique, however, results in a huge hardware overhead. This paper proposes a low-overhead tagged architecture. We achieve our goal by exploiting some properties of tag, the non-uniformity and the locality of reference. Our design includes the use of uniquely designed multi-level table and various cache-like structures, all contributing to exploit these properties. Under simulation, our method was able to limit the memory overhead to 0.685%, where a naive implementation suffered 12.5% overhead.
Jingyu HUA Mingchu LI Yizhi REN Kouichi SAKURAI
Those host-based intrusion detection models like VPStatic first construct a model of acceptable behaviors for each monitored program via static analysis, and then perform intrusion detection by comparing them with programs' runtime behaviors. These models usually share the highly desirable feature that they do not produce false alarms but face the conflicts between accuracy and efficiency. For instance, the high accuracy of the VPStatic model is at the cost of high space complexity. In this paper, we use a statically-constructed state transition table (STT), which records expected transitions among system calls as well as their stack states (return address lists), as a behavior model to perform context-sensitive intrusion detection. According to our analysis, our STT model improves the space efficiency of the VPStatic model without decreasing its high precision and time efficiency. Experiments show that for three test programs, memory uses of our STT models are all much less than half of the VPStatic models'. Thereby, we alleviate the conflicts between the accuracy and the efficiency.
An asymptotic expansion of the amplitude of the scattered wave by an imperfection core in a waveguide system is derived and it is shown that the scattered wave is partially canceled by the direct wave at large distance and a shadow takes place. For z→ ∞ where z is the distance along the waveguide axis the amplitudes of the direct and scattered waves decrease in proportion to z- and in the shadow region the amplitude of the sum of both waves decreases in proportion to z-. To supplement the analytical results some numerical examples are shown.
Kenta NEKADO Yasuyuki NOGAMI Hidehiro KATO Yoshitaka MORIKAWA
Recently, pairing-based cryptographic application sch-emes have attracted much attentions. In order to make the schemes more efficient, not only pairing algorithm but also arithmetic operations in extension field need to be efficient. For this purpose, the authors have proposed a series of cyclic vector multiplication algorithms (CVMAs) corresponding to the adopted bases such as type-I optimal normal basis (ONB). Note here that every basis adapted for the conventional CVMAs are just special classes of Gauss period normal bases (GNBs). In general, GNB is characterized with a certain positive integer h in addition to characteristic p and extension degree m, namely type-〈h.m〉 GNB in extension field Fpm. The parameter h needs to satisfy some conditions and such a positive integer h infinitely exists. From the viewpoint of the calculation cost of CVMA, it is preferred to be small. Thus, the minimal one denoted by hmin will be adapted. This paper focuses on two remaining problems: 1) CVMA has not been expanded for general GNBs yet and 2) the minimal hmin sometimes becomes large and it causes an inefficient case. First, this paper expands CVMA for general GNBs. It will improve some critical cases with large hmin reported in the conventional works. After that, this paper shows a theorem that, for a fixed prime number r, other prime numbers modulo r uniformly distribute between 1 to r-1. Then, based on this theorem, the existence probability of type-〈hmin,m〉 GNB in Fpm and also the expected value of hmin are explicitly given.
Kyongkuk CHO Jaeyoon LEE Dongweon YOON
In OFDM systems, in-phase and quadrature (I/Q) imbalances generated in the analog front-end introduce inter-channel interference and, consequently, error performance degradation. This letter provides an exact expression involving the two-dimensional (2-D) Gaussian Q-function for the error probability of an arbitrary 2-D modulated OFDM signal with I/Q imbalances. The effects of I/Q imbalances on the distribution of an AWGN and the error performance are analyzed.
Woojun LEE Kwangsoo KIM Woo Young CHOI
A novel one-transistor dynamic random access memory (1T DRAM) cell has been proposed for a low-voltage operation and longer data retention time. The proposed 1T DRAM cell has three features compared with a conventional 1T DRAM cell: low body doping concentration, a recessed gate structure, and a P + poly-Si gate. Simulation results show that the proposed 1T DRAM cell has < 1-ns program time and > 100-ms data retention time under the condition of sub-1-V operating voltage.
Kenji TAGUCHI Tatsuya KASHIWA Kohzoh OHSHIMA Takeshi KAWAMURA
Inter-vehicle communication (IVC) system using 700 MHz band to prevent car crashes has been proposed recently. In this paper, we first apply the FDTD method to the analyses of propagation characteristics at an intersection for IVC. We investigate the propagation characteristics considering the electrical conductivities, thickness and windows of building wall and pedestrians. As a result, it is shown that the electrical conductivities and thickness of building wall have a slight influence. In contrast, windows and pedestrians have a great influence on the propagation characteristics. Furthermore, the azimuth delay profiles are obtained by using the MUSIC algorithm.
Toru KAWANO Keiji GOTO Toyohiko ISHIHARA
In this paper, we have derived a novel integral representation for the ground wave propagation over land-to-sea mixed-paths by applying the Helmholtz-Kirchhoff integral theorem. By using the method of stationary phase applicable uniformly as the stationary phase point approaches the endpoint of the integral, we have derived the asymptotic solution for the scattered fields consisting of the first-order and the second-order diffraction terms. We show that the asymptotic solution thus derived agrees with the asymptotic solution derived by applying the aperture field method (AFM) and the method of stationary phase. We have confirmed the validity and the utility of the novel integral representation and its asymptotic solution by comparing with the widely used mixed-path theorem and the experimental measurement performed in Kanto area and Tokyo bay.
Yu QIU Zenggang DU Kiichi URAHAMA
We propose, in this letter, a new type of image denoising filter using a data analysis technique. We deal with pixels as data and extract the most dominant cluster from pixels in the filtering window. We output the centroid of the extracted cluster. We demonstrate that this graph-spectral filter can effectively reduce a mixture of Gaussian and random impulsive noise.
Chin-Long WEY Shin-Yo LIN Hsu-Sheng WANG Hung-Lieh CHEN Chun-Ming HUANG
In UWB systems, data symbols are transmitted and received continuously. The Fast Fourier Transform (FFT) processor must be able to seamlessly process input/output data. This paper presents the design and implementation of a continuous data flow parallel memory-based FFT (CF-PMBFFT) processor without the use of input buffer for pre-loading the input data. The processor realizes a memory space of two N-words and multiple processing elements (PEs) to achieve the seamless data flow and meet the design requirement. The circuit has been fabricated in TSMC 0.18 µm 1P6M CMOS process with the supply voltage of 1.8 V. Measurement results of the test chip shows that the developed CF-PMBFFT processor takes a core area of 1.97 mm2 with a power consumption of 62.12 mW for a throughput rate of 528 MS/s.
Md. Emdadul HAQUE Shoichi MURAKAMI Xiaodong LU Kinji MORI
Wireless sensor networks represent a new data collection paradigm in which expandability plays an important role. In a practical monitoring environment, for example, food factory monitoring system, sensor relocations and reorganizations are necessary with reorganization of production lines and starting of new production lines. These relocations sometime make congestion in some area of the network. In this dynamic changing environment online expansion is a challenging problem for resource constraint network. This paper proposes a two-tier autonomous decentralized community architecture for wireless sensor network to solve the problem. The first layer consists of sensors and second layer consists of routers. In the architecture routers make community (a group of nodes mutually cooperate for a common goal is a community). The goal of this paper is to introduce the concept of sharing information among routers of the community to decrease sensor connection time for the network especially for the dynamic changing environment. Results show that our proposed technologies can reduce sensor connection time to achieve online expansion.
Xiaodong LU Yefeng LIU Tatsuya TSUDA Kinji MORI
In Video-on-Demand (VoD) services, the playback continuity is one of the most crucial factors for end-user to judge service quality. It is even more significant than the actual video image quality since new generation VoD users commonly have heterogeneous requirements on service according to their context. Moreover, managing dynamic situations in VoD service is always a challenge, especially in the unpredictable user preferences and network conditions. In this paper, i) Autonomous Decentralized VoD System (ADVODS) has been proposed to satisfy different service quality demands of users and, ii) the Autonomous Node Allocation Technology (ANAT) is proposed for assuring service continuity. With the help of autonomous nodes and mobile agents, ANAT can applies different backup policies to users with different Service Level Agreements (SLA), and dynamically update the backup schema to adapt the changing situations such as various service time or congestion events. Drawing on the evaluation results this paper shows that proposed system architecture has a better performance on streaming service provision and continuity.
Sherihan ABU ELENIN Masato KITAKAMI
Recently, Trust has been recognized as an important factor for Grid computing security. In this paper, we propose a trust model in Grid system. It consists of Application Domain (AD), Client Domain (CD), Resource Domain (RD), and Trust Manager (TM). TM controls the relationship between RD and CD depending on the trust level value of each client and classification of each resource. Performance criteria are makespan and utilization. We evaluated our trust model in six scheduling algorithms in nine scenarios. The simulation results show that the proposed trust model improves the performance in all scheduling algorithms.