This paper proposes a concept for a new technical field called wireless distributed network (WDN) as a strategic technical field to enable flexible networking and radio resource management (RRM) to cope with dynamic variation of spatially distributed traffic demands. As the core technical subject areas for the WDN, this paper identifies distributed networking for flexible network creation, cooperative transmission and reception for flexible link creation, and dynamic spectrum access for flexible radio resource management, and explains their technical features and challenges for constructing the WDN. This paper also discusses some already being studied application fields as well as potential future directions of the WDN applications.

This paper proposes an energy efficient processor which can be used as a design alternative for the dynamic voltage scaling (DVS) processors in embedded system design. The processor consists of multiple PE (processing element) cores and a selective set-associative cache memory. The PE-cores have the same instruction set architecture but differ in their clock speeds and energy consumptions. Only a single PE-core is activated at a time and the other PE-cores are deactivated using clock gating and signal gating techniques. The major advantage over the DVS processors is a small overhead for changing its performance. The gate-level simulation demonstrates that our processor can change its performance within 1.5 microsecond and dissipates about 10 nano-joule while conventional DVS processors need hundreds of microseconds and dissipate a few micro-joule for the performance transition. This makes it possible to apply our multi-performance processor to many real-time systems and to perform finer grained and more sophisticated dynamic voltage control.

Heterogeneous multi-core processors are attracted by the media processing applications due to their capability of drawing strengths of different cores to improve the overall performance. However, the data transfer bottlenecks and limitations in the task allocation due to the accelerator-incompatible operations prevents us from gaining full potential of the heterogeneous multi-core processors. This paper presents a task allocation method based on algorithm transformation to increase the freedom of task allocation. We use approximation methods such as CORDIC algorithms to map the accelerator-incompatible operations to accelerator cores. According to the experimental results using HOG descriptor computation, the proposed task allocation method reduces the data transfer time by more than 82% and the total processing time by more than 79% compared to the conventional task allocation method.

A hardware description languages (HDLs) based modeling technique for asynchronous circuits is presented in this paper. A HDLs handshake package has been developed for expressing handshake-style digital systems in both VHDL and Verilog. Burst-mode and extended burst-mode (BM/XBM) circuits were used to demonstrate the usefulness of this work. This research successfully prototyped comparators, adders, RSA encoder/decoder, and several self-timed circuits for the full-custom IC and FPGAs designs. Furthermore, the HDLs handshake package implemented by this research can be utilized to develop behavioral test benches for studying and analyzing asynchronous designs. Extracting detailed timing information from asynchronous finite state machines (AFSMs), detecting delay faults for synthesized self-timed functional modules, and locating fundamental mode violation within realized AFSMs are proven applications. The anticipated HDL modeling technique and the transformation procedure are detailed in the rest of this paper.

This paper proposes two algorithms to balance energy consumption among sensor nodes by distributing the workload of image compression tasks within a cluster on wireless sensor networks. The main point of the proposed algorithms is to adopt the energy threshold, which is used when we implement the exchange and/or assignment of tasks among sensor nodes. The threshold is well adaptive to the residual energy of sensor nodes, input image, compressed output, and network parameters. We apply the lapped transform technique, an extended version of the discrete cosine transform, and run length encoding before Lempel-Ziv-Welch coding to the proposed algorithms to improve both quality and compression rate in image compression scheme. We extensively conduct computational experiments to verify the our methods and find that the proposed algorithms achieve not only balancing the total energy consumption among sensor nodes and, thus, increasing the overall network lifetime, but also reducing block noise in image compression.

Multi-pattern matching is a key technique for implementing network security applications such as Network Intrusion Detection/Protection Systems (NIDS/NIPSes) where every packet is inspected against tens of thousands of predefined attack signatures written in regular expressions (regexes). To this end, Deterministic Finite Automaton (DFA) is widely used for multi-regex matching, but existing DFA-based researches have claimed high throughput at an expense of extremely high memory cost, so fail to be employed in devices such as high-speed routers and embedded systems where the available memory is quite limited. In this paper, we propose a parallel architecture of DFA called Parallel DFA (PDFA) taking advantage of the large amount of concurrent flows to increase the throughput with nearly no extra memory cost. The basic idea is to selectively store the underlying DFA in memory modules that can be accessed in parallel. To explore its potential parallelism we intensively study DFA-split schemes from both state and transition points in this paper. The performance of our approach in both the average cases and the worst cases is analyzed, optimized and evaluated by numerical results. The evaluation shows that we obtain an average speedup of 100 times compared with traditional DFA-based matching approach.

In this paper, we investigate a multi-packet transmitting and receiving wireless mesh network that uses a multi-antenna set on each node in the network. In wireless mesh networks for accessing the Internet, the target of all traffic generated from distributed nodes is a gateway (GW). Therefore, many packets are concentrated around the GW and the communication channel around the GW is crowded. To prevent packet congestion around the GW, we propose setting an adaptive array antenna on the GW and the relay nodes. We also calculate an appropriate number of antenna elements considering the fair traffic over the whole region, to prevent packet congestion at each node.

Inspired from natural self-managing behavior of the human body, autonomic systems promise to inject self-managing behavior in software systems. Such behavior enables self-configuration, self-healing, self-optimization and self-protection capabilities in software systems. Self-configuration is required in systems where efficiency is the key issue, such as real time execution environments. To solve self-configuration problems in autonomic systems, the use of various problem-solving techniques has been reported in the literature including case-based reasoning. The case-based reasoning approach exploits past experience that can be helpful in achieving autonomic capabilities. The learning process improves as more experience is added in the case-base in the form of cases. This results in a larger case-base. A larger case-base reduces the efficiency in terms of computational cost. To overcome this efficiency problem, this paper suggests to cluster the case-base, subsequent to find the solution of the reported problem. This approach reduces the search complexity by confining a new case to a relevant cluster in the case-base. Clustering the case-base is a one-time process and does not need to be repeated regularly. The proposed approach presented in this paper has been outlined in the form of a new clustered CBR framework. The proposed framework has been evaluated on a simulation of Autonomic Forest Fire Application (AFFA). This paper presents an outline of the simulated AFFA and results on three different clustering algorithms for clustering the case-base in the proposed framework. The comparison of performance of the conventional CBR approach and clustered CBR approach has been presented in terms of their Accuracy, Recall and Precision (ARP) and computational efficiency.

Recent studies investigating the Internet topology reported that inter Autonomous System (AS) topology exhibits a power-law degree distribution which is known as the scale-free property. Although there are many models to generate scale-free topologies, no game theoretic approaches have been proposed yet. In this paper, we propose the new dynamic game theoretic model for the AS level Internet topology formation. Through numerical simulations, we show our process tends to give emergence of the topologies which have the scale-free property especially in the case of large decay parameters and large random link costs. The significance of our study is summarized as following three topics. Firstly, we show that scale-free topologies can also emerge from the game theoretic model. Secondly, we propose the new dynamic process of the network formation game for modeling a process of AS topology formation, and show that our model is appropriate in the micro and macro senses. In the micro sense, our topology formation process is appropriate because this represents competitive and distributed situation observed in the real AS level Internet topology formation process. In the macro sense, some of statistical properties of emergent topologies from our process are similar to those of which also observed in the real AS level Internet topology. Finally, we demonstrate the numerical simulations of our process which is deterministic variation of dynamic process of network formation game with transfers. This is also the new result in the field of the game theory.

In this letter, the cumulative distribution function (CDF) for the maxima of the OSTBC-MIMO channel capacity in a temporal interval is estimated using the first-order Rice series approximation. As the estimation of the maxima distribution using the Rice series is applicable only to Gaussian random processes, the Gaussian-approximated probability density function (PDF) for the OSTBC-MIMO channel capacity is derived from existing exact PDF (non-Gaussian). The resulting CDF for the maxima capacity is useful to design OSTBC-MIMO systems.

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.

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.

Vision sensors provide rich sources of information, but sensing images and processing them in real time would be a challenging task. This paper introduces a vision system using SoCBase platform and presents heuristic designs of SAD correlation algorithm as a component of the vision system. Simulation results show that the vision system is suitable for real-time applications and that the heuristic designs of SAD algorithm are worth utilizing since they save a considerable amount of space with little sacrificing in quality.

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 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.

A stacked rectangular microstrip antenna with a shorting plate and a helical pin is proposed as a car antenna for triple band operation in ITS. The proposed antenna operates as a conventional stacked microstrip antenna at the highest frequency band. At the middle and the lowest frequency bands, the antenna radiates at low elevation angles from the helical pin and the shorting plate. In this paper, as an example of triple band antennas in the ITS, an antenna is designed that supports PHS, VICS and ETC. The proposed antennas have the proper radiation pattern for each application and are small in size.

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.

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.

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].