Xiao XU Weizhe ZHANG Hongli ZHANG Binxing FANG
The basic requirements of the distributed Web crawling systems are: short download time, low communication overhead and balanced load which largely depends on the systems' Web partition strategies. In this paper, we propose a DHT-based distributed Web crawling system and several DHT-based Web partition methods. First, a new system model based on a DHT method called the Content Addressable Network (CAN) is proposed. Second, based on this model, a network-distance-based Web partition is implemented to reduce the crawler-crawlee network distance in a fully distributed manner. Third, by utilizing the locality on the link space, we propose the concept of link-based Web partition to reduce the communication overhead of the system. This method not only reduces the number of inter-links to be exchanged among the crawlers but also reduces the cost of routing on the DHT overlay. In order to combine the benefits of the above two Web partition methods, we then propose 2 distributed multi-objective Web partition methods. Finally, all the methods we propose in this paper are compared with existing system models in the simulated experiments under different datasets and different system scales. In most cases, the new methods show their superiority.
Recently wireless sensor networks (WSN) has risen as one of the advanced candidate technologies in order to provide more efficient structure health monitoring (SHM) solution in construction sites. In this paper, we proposed WSN monitoring framework in building sites based on 3D visualization and Augmented Reality (AR) in mobile devices. The proposed system applies 3D visualization and AR technology to camera-enabled mobile devices in WSN environment in order to gather much more information than before. Based on the proposed system, we made an experiment to validate the effectiveness of 3D and AR mode using collected data in IEEE 802.15.4-based WSN.
Youngbae KONG Younggoo KWON Gwitae PARK
In wireless sensor networks (WSNs), geographic routing algorithms can enhance the network capacity. However, in real WSNs, it is difficult for each node to know its physical location accurately. Geographic routing with location errors may produce serious problems such as disconnected links and data transmission delays. In this letter, we present an efficient location error compensation algorithm for the geographic routing. The proposed algorithm efficiently detects and corrects the location errors and significantly enhances the network performance of geographic routing in the presence of location errors.
Ju Hyun PARK Young-Chul KIM Hong-Sung HOON
In this paper, we propose a new motion vector smoothing algorithm using weighted vector median filtering based on edge direction for frame interpolation. The proposed WVM (Weighted Vector Median) system adjusts the weighting values based on edge direction, which is derived from spatial coherence between the edge direction continuity of a moving object and motion vector (MV) reliability. The edge based weighting scheme removes the effect of outliers and irregular MVs from the MV smoothing process. Simulation results show that the proposed algorithm can correct wrong motion vectors and thus improve both the subjective and objective visual quality compared with conventional methods.
This paper describes a nonlinear filter that can extract the image feature from noise corrupted image labeled self-quotient ε-filter (SQEF). SQEF is an improved self-quotient filter (SQF) to extract the image feature from noise corrupted image. Although SQF is a simple approach for feature extraction from the images, it is difficult to extract the feature when the image includes noise. On the other hand, SQEF can extract the image feature not only from clear images but also from noise corrupted images with uniform noise, Gaussian noise and impulse noise. We show the algorithm of SQEF and describe its feature when it is applied to uniform noise corrupted image, Gaussian noise corrupted image and impulse noise corrupted image. Experimental results are also shown to confirm the effectiveness of the proposed method.
Binary maximal-length sequences (or m-sequences) are sequences of period 2m-1 generated by a linear recursion of degree m. Decimating an m-sequence {st} by an integer d relatively prime to 2m-1 leads to another m-sequence {sdt} of the same period. The crosscorrelation of m-sequences has many applications in communication systems and has been an important and well studied problem during more than 40 years. This paper presents an updated survey on the crosscorrelation between binary m-sequences with at most five-valued crosscorrelation and shows some of the many recent connections of this problem to several areas of mathematics such as exponential sums and Dickson polynomials.
Recently, novel full-diversity full-rate quasi-orthogonal space-time block codes (QSTBCs) with power scaling and double-symbol maximum likelihood (ML) decoding was proposed. Specifically, the codes can achieve full-diversity through linearly combining two adequately power scaled orthogonal space-time block codes (OSTBCs). In this letter, we derive expressions for mutual information and post-processing signal-to-noise ratio (SNR) for a system with four transmit antennas. By exploiting these formulas, we propose three transmit antenna grouping (TAG) methods for a closed-loop system with low-rate feedback information. The TAG methods make it possible to provide an excellent error-rate performance even with a low-complexity zero-forcing (ZF) detection, especially in spatially correlated fading channels.
Hamid EBRAHIMZAD Abbas MOHAMMADI
In this paper, a new framework to characterize the tradeoff between diversity and multiplexing gains of Multi Input Multi Output (MIMO) wireless systems at finite Signal to Noise Ratios (SNRs) is presented. By suitable definitions of non-asymptotic diversity and multiplexing gains, we extract a useful tool to investigate the performance of space-time schemes at finite SNRs. Exact results on the diversity-multiplexing tradeoff (DMT) are derived for Multi Input Single Output (MISO), Single Input Multi Output (SIMO), and 22 MIMO channels. We show that our outcomes coincide with the Zheng and Tse's results at high SNRs. When the new definitions of non-asymptotic diversity and multiplexing gains are used, the resulted DMT converges to its asymptotic value at realistic SNRs. Furthermore, using these definitions enables the diversity gain to represent the outage probability with reasonable accuracy.
Jinsoo BAE Seong Ill PARK Yun Hee KIM Seokho YOON Jongho OH Iickho SONG Seong-Jun OH
Based on the characteristics of the thresholds of two detection schemes employing locally optimum test statistics, a sequential detection design procedure is proposed and analyzed. The proposed sequential test, called the sequential locally optimum test (SLOT), inherently provides finite stopping time (terminates with probability one within the finite horizon), and thereby avoids undesirable forced termination. The performance of the SLOT is compared with that of the fixed sample-size test, sequential probability ratio test (SPRT), truncated SPRT, and 2-SPRT. It is observed that the SLOT requires smaller average sample numbers than other schemes at most values of the normalized signal amplitude while maintaining the error performance close to the SPRT.
SeongHan SHIN Kazukuni KOBARA Hideki IMAI
An augmented PAKE (Password-Authenticated Key Exchange) protocol is said to be secure against server-compromise impersonation attacks if an attacker who obtained password verification data from a server cannot impersonate a client without performing off-line dictionary attacks on the password verification data. There are two augmented PAKE protocols where the first one [12] was proposed in the IEEE Communications Letters and the second one [15] was submitted to the IEEE P1363.2 standard working group [9]. In this paper, we show that these two augmented PAKE protocols [12], [15] (claimed to be secure) are actually insecure against server-compromise impersonation attacks. More specifically, we present generic server-compromise impersonation attacks on these augmented PAKE protocols [12],[15].
Shota YAMADA Yutaka KAWAI Goichiro HANAOKA Noboru KUNIHIRO
In this paper, we propose two new chosen-ciphertext (CCA) secure schemes from the computational Diffie-Hellman (CDH) and bilinear computational Diffie-Hellman (BCDH) assumptions. Our first scheme from the CDH assumption is constructed by extending Cash-Kiltz-Shoup scheme. This scheme yields the same ciphertext as that of Hanaoka-Kurosawa scheme (and thus Cramer-Shoup scheme) with cheaper computational cost for encryption. However, key size is still the same as that of Hanaoka-Kurosawa scheme. Our second scheme from the BCDH assumption is constructed by extending Boyen-Mei-Waters scheme. Though this scheme requires a stronger underlying assumption than the CDH assumption, it yields significantly shorter key size for both public and secret keys. Furthermore, ciphertext length of our second scheme is the same as that of the original Boyen-Mei-Waters scheme.
In 1997, the author considered the separate coding system for two correlated memoryless Gaussian sources and squared distortion measures and determined the rate distortion region in a case where one source plays a role of the partial side information at the decoder. The above source coding system can be extended to a certain class of source network with several decoders, where each decoder has at most one full or partial side information. This class of source network is called the one-helps-one system. In this paper we consider a source network belonging to this class for correlated memoryless Gaussian sources and squared distortion measures. This source network was posed and investigated by Korner and Marton and was called the zig-zag source network. They studied the zig-zag source network in the case of discrete memoryless multiple sources. In this paper we study the zig-zag source network in the case of correlated memoryless Gaussian sources and square distortion. We determine the rate distortion region in a case where sources have a certain correlation property.
Hiroyuki YOSHIDA Kosuke KAWAMOTO Yuma TANAKA Hitoshi KUBO Akihiko FUJII Masanori OZAKI
The authors describe a method to produce gold nanoparticle-dispersed liquid crystals by means of sputtering, and discuss how the presence of gold nanoparticles affect the electro-optic response of the host liquid crystal. The method exploits the fact that liquid crystals possess low vapor pressures which allow them to undergo the sputtering process, and the target material is sputtered directly on the liquid crystal in a reduced air pressure environment. The sample attained a red-brownish color after sputtering, but no aggregations were observed in the samples kept in the liquid crystal phase. Polarization optical microscopy of the sample placed in a conventional sandwich cell revealed that the phase transition behaviour is affected by the presence of the nanoparticles and that the onset of the nematic phase is observed in the form of bubble-like domains whereas in the pure sample the nematic phase appears after the passing of a phase transition front. Transmission electron microscopy confirmed the presence of single nano-sized particles that were dispersed without forming aggregates in the material. The electro-optic properties of the nanoparticle-dispersed liquid crystal was investigated by measuring the threshold voltage for a twisted-nematic cell. The threshold voltage was found to depend on the frequency of the applied rectangular voltage, and at frequencies higher than 200 Hz, the threshold became lower than the pure samples.
Kohsuke HARADA Haruka OBATA Hironori UCHIKAWA Kenji YOSHIDA Yuji SAKAI
In this paper, we consider the behavior of an autoregressive (AR) detector for partial-response (PR) signaling against offtrack interference (OTI) environment in perpendicular magnetic recording. Based on the behavior, we derive the optimum branch metric to construct the detector by the Viterbi algorithm. We propose an optimum AR detector for OTI that considers an optimum branch metric calculation and an estimation of noise power due to OTI in order to calculate an accurate branch metric. To evaluate the reliability of soft-output likelihood values calculated by our proposed AR detector, we demonstrate a bit error rate performance (BER) of low-density parity-check (LDPC) codes under OTI existing channel by computer simulation. Our simulation results show the proposed AR detector can achieve a better LDPC-coded BER performance than the conventional AR detector. We also show the BER performance of our proposal can keep within 0.5 dB of the case that perfect channel state information regarding OTI is used in the detector. In addition, we show that the partial-response maximum-likelihood (PRML) detector is robust against OTI even if OTI is not handled by the detector.
For decoding non-binary low-density parity-check (LDPC) codes, logarithm-domain sum-product (Log-SP) algorithms were proposed for reducing quantization effects of SP algorithm in conjunction with FFT. Since FFT is not applicable in the logarithm domain, the computations required at check nodes in the Log-SP algorithms are computationally intensive. What is worth, check nodes usually have higher degree than variable nodes. As a result, most of the time for decoding is used for check node computations, which leads to a bottleneck effect. In this paper, we propose a Log-SP algorithm in the Fourier domain. With this algorithm, the role of variable nodes and check nodes are switched. The intensive computations are spread over lower-degree variable nodes, which can be efficiently calculated in parallel. Furthermore, we develop a fast calculation method for the estimated bits and syndromes in the Fourier domain.
Jegyun NA Seonggeun RYU Kyunghye LEE Youngsong MUN
In PMIPv6, all packets sent by mobile nodes or correspondent nodes are transferred through the local mobility anchor. This unnecessary detour results in high delivery latency and significant processing cost. Several PMIPv6 route optimization schemes have been proposed to solve this issue. However, they also suffer from the high signaling costs when determining the optimized path. The proposed scheme which adopts the prediction algorithm in PFMIPv6 can reduce the signaling costs of the previous schemes. Analytical performance evaluation is performed to show the effectiveness of the proposed scheme.
Processing structures required in sensing are designed to convert real-world information into useful information, and there are various restrictions and performance goals depending on physical restrictions and the target applications. On the other hand, network technologies are mainly designed for data exchange in the information world, as is seen in packet communications, and do not go well with sensing structures from the viewpoints of real-time properties, spatial continuity, etc. This indicates the need for understanding the architectures and restrictions of sensor technologies and network technologies when aiming to fuse these technologies. This paper clarifies the differences between these processing structures, proposes some issues to be addressed in order to achieve real fusion of them, and presents future directions toward real fusion of sensor technologies and network technologies.
Hye-Kwang KIM Jung-Hoon KIM Eugene RHEE Sung-Il YANG
This paper presents a method of expanding the operating frequency band of a Reverberating TEM Cell (RTC) for electromagnetic compatibility (EMC) testing. To expand the operating frequency band of an RTC, this paper places a wire septum inside the cell instead of a solid septum. The maximum usable frequency (MUF) for TEM cell operation and the lowest usable frequency (LUF) for reverberating chamber operation with the wire septum are studied and compared with a conventional solid septum. The E field strengths inside the RTC are measured and evaluated. The measurement results show that the RTC with the wire septum have similar MUF to the RTC with a solid septum at TEM mode, but have much lower LUF at a reverberating mode, which proves that the operating frequency band of the RTC can be expanded by using the wire septum.
Masato ASAHARA Kenji KONO Toshinori KOJIMA Ai HAYAKAWA
Many services rely on the Internet to provide their customers with immediate access to information. To provide a stable service to a large number of customers, a service provider needs to monitor demand fluctuations and adjust the number and the location of replica servers around the world. Unfortunately, Flash crowds make it quite difficult to determine good number and locations of replica servers because they must be repositioned very quickly to respond to rapidly changing demands. We are developing ExaPeer, an infrastructure for dynamically repositioning replica servers on the Internet on the basis of demand fluctuations. In this paper we introduce ExaPeer Server Reposition (EPSR), a mechanism that quickly finds appropriate number and locations of replica servers. EPSR is designed to be lightweight and responsive to Flash crowds. EPSR enables us to position replica servers so that no server becomes overloaded. Even though no dedicated server collects global information such as the distribution of clients or the load of all servers over the Internet, the peer-to-peer approach enables EPSR to find number and locations of replica servers quickly enough to respond to flash crowds. Simulation results demonstrate that EPSR locates high-demand areas, estimates their scale correctly and determines appropriate number and locations of replica servers even if the demand for a service increases/decreases rapidly.
In this paper, we proposed the compact construction of a matched filter for integrand code, which do not require the high-rate clock pulse in two-valued PWM (pulse width modulation) code, using a real-valued shift-orthogonal finite-length sequence, which has a sharp aperiodic autocorrelation function with zero sidelobes except at left and right shift-ends. This matched filters are implemented on a field programmable gate array (FPGA) corresponding to 400,000 logic gates. A proposed matched filter for the sequence of length 129 can be constructed by the circuit scale of about 47% compared with conventional filter.