Xiao Peng YANG Qiang CHEN Kunio SAWAYA
Effects of wall material on the channel capacity of an indoor multiple input multiple output (MIMO) system are investigated using a hybrid technique of the method of moments (MoM) and the finite difference time domain (FDTD) method with consideration of the Ricean K factor and the effective degrees of freedom (EDOF) of multiple paths.
This paper deals with the Optimum Communication Spanning Tree Problem (OCST) which is well known as an NP-hard problem. For solving the problem, we uses an evolutionary approach. This paper presents a new effective tree encoding and proposes a tree construction routine (TCR) to generate a tree from the encoding. The basic principle is to break a cycle. We also propose a new crossover operator that focuses on the inheritance of parental information and the use of network information. Consequently, we confirm that the proposed algorithm is superior to other algorithms applied to the OCST problem or other tree problems. Moreover, our method can find a better solution than the solution which was previously known as the best solution. In addition, we analyzed the locality and diversity property of encoding and observed that the proposed method has high locality and at the same time it preserves population diversity for many generations. Finally, we conclude that these properties are the main reasons why the proposed method outperforms the other encodings.
Yasoji SUZUKI Kazuhide ISHIKAWA
In this paper, a high-speed logic circuitry using bootstrapped and low-temperature polysilicon (LTPS) technologies for TFT-LCD panels is proposed. The new circuitry realizes high-speed operation owing to the application of a logic-swing voltage that is wider than the power-supply voltage using bootstrapped technology. As a result, the new logic circuitry can be operated at an operational frequency around 3-10 times higher than that of the conventional circuitry under the conditions of a 0.5 pF load capacitor at the output of a noninverting buffer and +10 V power-supply voltages. The new circuit is named "BST-TFT logic circuitry."
Ki-Hong KIM Jae-Kwon YOO Hong Kee KIM Wookho SON Soo-Young LEE
An alternative human interface enabling the handicapped with severe motor disabilities to control an assistive system is presented. Since this interface relies on the biosignals originating from the contraction of muscles on the face during particular movements, even individuals with a paralyzed limb can use it with ease. For real-world application, a dedicated hardware module employing a general-purpose DSP was implemented and its validity tested on an electrically powered wheelchair. Furthermore, an additional attempt to reduce error rates to a minimum for stable operation was also made based on the entropy information inherent in the signals during the classification phase. In the experiments in which 11 subjects participated, it was found most of them could control the target system at their own will, and thus the proposed interface could be considered a potential alternative for the interaction of the severely handicapped with electronic systems.
Yoshihito MORISHIGE Masahiro FUJII Makoto ITAMI Kohji ITOH
In this paper, we propose a new multiuser detection scheme using Maximum Likelihood (ML) criterion and the M algorithm for Multi Carrier (MC)-Code Division Multiple Access (CDMA) systems in the down-link channel. We first describe an implementation of ML detection separating In- and Quadrature-phase components and using well-known linear filters. In the proposed algorithm, we produce hypothesis symbol vectors in a tree structure by partly changing the sub-optimum hard decisions based on the linear filter output. At each stage, we adopt the best M likely paths with respect to the true log likelihood or distance function as survivors. We determine the symbol vector which minimizes the distance function at the final stage. Although the complexity of ML detector is exponentially increasing as a function of the number of users, the proposed scheme requires by far less complexity. We demonstrate that the proposed scheme achieves equivalent Bit Error Rate (BER) performance with lower complexity in comparison with ML detector by computer simulations. Moreover we compare the proposed detection scheme with QRD-M algorithm which is based on QR decomposition combined with M algorithm.
Shinji MIKAMI Takafumi AONISHI Hironori YOSHINO Chikara OHTA Hiroshi KAWAGUCHI Masahiko YOSHIMOTO
In most research work for sensor network routings, perfect aggregation has been assumed. Such an assumption might limit the application of the wireless sensor networks. We address the impact of aggregation efficiency on energy consumption in the context of GIT routing. Our questions are how the most efficient aggregation point changes according to aggregation efficiency and the extent to which energy consumption can decrease compared to the original GIT routing and opportunistic routing. To answer these questions, we analyze a two-source model, which yields results that lend insight into the impact of aggregation efficiency. Based on analytical results, we propose an improved GIT: "aggregation efficiency-aware GIT," or AGIT. We also consider a suppression scheme for exploratory messages: "hop exploratory." Our simulation results show that the AGIT routing saves the energy consumption of the data transmission compared to the original GIT routing and opportunistic routing.
Jaehwang YU Kwyro LEE Dongwoo KIM
Receiver enhancement at mobile terminals such as using receiver diversity is a way of achieving greater downlink capacity. The enhancement, however, is achieved not instantaneously by a network operator but gradually by the individual users that choose and purchase their own mobile terminals. We investigate in this letter the effect of gradually introducing enhanced receivers at mobiles in different locations. With greedy scheduling, capacity, fairness and coverage are quantified and numerically compared according to locations of enhanced mobiles. The results show that the enhancement made at mobiles nearer to the base provides the greater capacity but this capacity-driving introduction of the enhancement makes the fairness and the coverage poorer.
Hideaki KURATA Shunichi SAEKI Takashi KOBAYASHI Yoshitaka SASAGO Tsuyoshi ARIGANE Keiichi YOSHIDA Yoshinori TAKASE Takayuki YOSHITAKE Osamu TSUCHIYA Yoshinori IKEDA Shunichi NARUMI Michitaro KANAMITSU Kazuto IZAWA Kazunori FURUSAWA
A 1-Gb AG-AND flash memory has been fabricated using 0.13-µm CMOS technology, resulting in a cell area of 0.104 µm2 and a chip area of 95.2 mm2. By applying constant-charge-injection programming and source-line-select programming, a fast page programming time of 600 µs is achieved. The four-bank operation attains a fast programming throughput of 10 MB/s in multilevel flash memories. The compact SRAM write buffers reduce the chip area penalty. A rewrite throughput of 8.3 MB/s is achieved by means of the RAM-write operation during the erase mode.
Naoto KOBAYASHI Daiki KOIZUMI Toshiyasu MATSUSHIMA Shigeichi HIRASAWA
We propose a new fixed-rate error correction system with a feedback channel. In our system, the receiver transmits a list of positions of unreliable information bits based on the log a-posteriori probability ratios by outputs of a soft-output decoder to the transmitter. This method is just like that of the reliability-based hybrid ARQ scheme. To dynamically select an appropriate interleaving function with feedback information is a key feature of our system. By computer simulations, we show that the performance of a system with a feedback channel is improved by dynamically selecting an appropriate interleaving function.
This study presents an N-gram adaptation technique when additional text data for the adaptation do not exist. We use a language modeling approach to the information retrieval (IR) technique to collect the appropriate adaptation corpus from baseline text data. We propose to use a dynamic interpolation coefficient to merge the N-gram, where the interpolation coefficient is estimated from the word hypotheses obtained by segmenting the input speech. Experimental results show that the proposed adapted N-gram always has better performance than the background N-gram.
Yusuke HIWASAKI Hitoshi OHMURO Takeshi MORI Sachiko KURIHARA Akitoshi KATAOKA
This paper proposes a wideband speech coder in which a G.711 bitstream is embedded. This coder has an advantage over conventional coders in that it has a high interoperability with existing terminals so costly transcoding involving decoding and re-encoding can be avoided. We also propose a partial mixing method that effectively reduces the mixing complexity in multiple-point remote conferences. To reduce the complexity, we take advantage of the scalable structure of the bitstream and mix only the lower band of the signal. For the higher band, the main speaker location is selected among remote locations and is redistributed with the mixed lower-band signal. By subjective evaluations, we show that the speech quality can be maintained even when the speech signals are partially mixed.
Hongye FU Naoki WAKAMIYA Masayuki MURATA
Overlay networks, such as P2P, Grid, and CDN, have been widely deployed over physical IP networks. Since simultaneous overlay networks compete for network resources, their selfish behaviors to improve their application-oriented QoS disrupt each other. To enhance the collective performance and improve the QoS at the application level, we consider so-called the overlay network symbiosis where overlay networks cooperate with each other. In this paper, we proposed a cooperative mechanism for hybrid P2P file-sharing networks, where peers can find more files and exchange files with more peers. Through simulation experiments, we verified the effectiveness of cooperation from view points of application and system.
With today's advances in peer-to-peer (P2P) techniques, a lot of non-document content has become searchable and usable. In the near future, since a huge amount of content will be distributed over the networks, not only index server searching but also P2P searching will become important because of its scalability and robustness. Typical P2P content searching services have some problems, such as low search precision ratio, significant increase in traffic and inundations of malicious content such as viruses. We propose a P2P content searching method in which a query is effectively forwarded only to peers that have indices of content semantically similar to the wanted content but not forwarded to the same peer repeatedly. It is based on the ideas of content addressable network (CAN) topology and a vector space method where vectors have a variable length. It maps non-document content to a vector space based on users' evaluations and manages the vector space or routes queries using the CAN topology control. The effectiveness of our method is shown by both analytical estimations and simulation experiments. The simulations clarified that our method is effective at improving the precision and recall ratios while reducing the amount of traffic compared with Gnutella flooding, the vector space method in which vector lengths are fixed (similar to the pSearch method), and Chord. In particular, when there was a lot of malicious content, our method exhibited a higher precision ratio than other methods.
Norihito FUJITA Joseph D. TOUCH Venkata PINGALI Yu-Shun WANG
This paper describes an architecture for deploying virtual IP networks with P2P-like dynamic topology and routing management. Existing virtual IP network deployment mechanisms do not allow for dynamic topology adaptation and fault-tolerance because provisioning of IP tunnels is performed only once--when a virtual network is deployed. We propose a P2P-XBone, in which a P2P protocol such as DHT drives the topology and the routing table of a virtual IP network consistent with its neighbor node state. We describe how to extend both the existing X-Bone system and P2P mechanisms to achieve interworking between them. The P2P-XBone not only provides P2P's characteristics such as self-organization, fault-tolerance and content-based routing to virtual IP networks but also provides higher forwarding performance and simpler implementation to P2P systems due to the support for the use of existing network services. We also show several results on the evaluation of overhead of P2P-driven provisioning and on forwarding performance.
Quoc Tuan TRAN Shinsuke HARA Yuuta NAKAYA Ichirou IDA Yasuyuki OISHI
Adaptive array antennas, which control their own patterns by means of feed-back or feed-forward control, are effective tools for gain enhancement and interference suppression. However, when applying them to mobile terminals, the problems of hardware complexity and power consumption need to be taken into consideration. One solution is the use of analog device-based adaptive array antennas, such as Reactively Steered Adaptive Array (RESAA) antennas and phased array antennas, which have the attractive characteristics of low cost and power consumption. In this paper, we propose an adaptive beamforming method based on a one-dimension search algorithm for phased array antennas with Micro Electro Mechanical Systems (MEMS) phase shifters, taking into consideration their slow operating speed due to mechanical structure of the devices. Furthermore, a smoothing processing is introduced to prevent the effect of noise and a multi-resolution alogrithm is proposed to help the system form beams more quickly and stably. Numerical results based on the IEEE 802.11a Wireless Local Area Network (WLAN) standard show that the proposed method has good interference suppression and gain enhancement capabilities in multipath fading channels.
Combined input and output queuing (CIOQ) switches are being considered as high-performance switch architectures due to their ability to achieve 100% throughput and perfectly emulate output queuing (OQ) switch performance with a small speedup factor S. To realize a speedup factor S, a conventional CIOQ switch requires the switching fabric and memories to operate S times faster than the line rate. In this paper, we propose to use a CIOQ switch with space-division multiplexing expansion and grouped input/output ports (SDMG CIOQ switch for short) to realize speedup while only requiring the switching fabric and memories to operate at the line rate. The cell scheduling problem for the SDMG CIOQ switch is abstracted as a bipartite k-matching problem. Using fluid model techniques, we prove that any maximal size k-matching algorithm on an SDMG CIOQ switch with an expansion factor 2 can achieve 100% throughput assuming input line arrivals satisfy the strong law of large numbers (SLLN) and no input/output line is oversubscribed. We further propose an efficient and starvation-free maximal size k-matching scheduling algorithm, kFRR, for the SDMG CIOQ switch. Simulation results show that kFRR achieves 100% throughput for SDMG CIOQ switches with an expansion factor 2 under two SLLN traffic models, uniform traffic and polarized traffic, confirming our analysis.
Kai-Hsiang YANG Chi-Jen WU Jan-Ming HO
The most prevalent peer-to-peer (P2P) application till today is file sharing, and unstructured P2P networks can support inherent heterogeneity of peers, are highly resilient to peers' failures, and incur low overhead at peer arrivals and departures. Dynamic querying (DQ) is a new flooding technique which could estimate a proper time-to-live (TTL) value for a query flooding by estimating the popularity of the searched files, and retrieve sufficient results under controlled flooding range for reducing network traffic. Recent researches show that a large amount of peers in the P2P file sharing system are the free-riders, and queries are seldom hit by those peers. The free-riding problem causes a large amount of redundant messages in the DQ-like search algorithm. In this paper, we proposed a new search algorithm, called "AntSearch," to solve the problem. In AntSearch, each peer maintains its hit rate of previous queries, and records a list of pheromone values of its immediate neighbors. Based on the pheromone values, a query is only flooded to those peers which are not likely to be the free-riders. Our simulation results show that, compared with DQ and its enhanced algorithm DQ+, the AntSearch algorithm averagely reduces 50% network traffic at almost the same search latency as DQ+, while retrieving sufficient results for a query with a given required number of results.
Atsushi ITO Tomoyuki OHTA Kouichi MITSUKAWA Yoshiaki KAKUDA
File-sharing Peer-to-Peer systems are effective for autonomous data retrieval and provision over the networks. However, the early data retrieval schemes such as Gnutella and Local Indices have low performance and large overhead. In order to solve weakness of early schemes, this paper proposes a dynamic scheme for data retrieval and provision, in which indices are adaptively allocated in appropriate nodes to variation of traffic patterns caused by query messages. The simulation experimental results show that the proposed scheme has good performance with reasonable overhead even when the traffic patterns vary as time proceeds.
Moonseong KIM Young-Cheol BANG Hyung-Jin LIM Hyunseung CHOO
With the proliferation of multimedia group applications, the construction of multicast trees satisfying the Quality of Service (QoS) requirements is becoming a problem of the prime importance. An essential factor of these real-time application is to optimize the Delay- and delay Variation-Bounded Multicast Tree (DVBMT) problem. This problem is to satisfy the minimum delay variation and the end-to-end delay within an upper bound. The DVBMT problem is known as NP-complete problem. The representative algorithms for the problem are DVMA, DDVCA, and so on. In this paper, we show that the proposed algorithm outperforms any other algorithm. The efficiency of our algorithm is verified through the performance evaluation and the enhancement is up to about 13.5% in terms of the multicast delay variation. The time complexity of our algorithm is O(mn2) which is comparable to well known DDVCA.
Yu-Liang LIU Yeali Sunny SUN Meng Chang CHEN
Virtual Private Networks (VPNs) are overlay networks established on top of a public network backbone with the goal of providing a service comparable to Private Networks (PNs). The recently proposed VPN hose-model provides customers with flexible and convenient ways to specify their bandwidth requirements. To meet the specified bandwidth requirements, the Network Service Provider (NSP) must reserve sufficient bandwidth on the data transmission paths between each pair of endpoints in a VPN. In addition, the reliability of a VPN depends on the reliability of the data transmission paths. Italiano et al. proposed an algorithm that finds a set of backup paths for a given VPN (VPN tree) under the single-link failure model [1]. When a link failure is detected on a VPN tree, a backup path corresponding to the failed link can be activated to restore the disconnected VPN tree into a new one, thereby ensuring the reliability of the VPN. However, Italiano's algorithm cannot guarantee that the specified bandwidth requirement of the given VPN under the single-link failure model will be met. To address this issue, we propose a new backup path set selection algorithm called BANGUAD in this paper. In addition, the problem of establishing multiple bandwidth-guaranteed hose-model VPNs under the single-link failure model has not been investigated previously. However in this problem, bandwidth-sharing algorithms have the potential to improve the performance of a provisioning algorithm significantly. Therefore, we also propose a bandwidth sharing algorithm and three provisioning algorithms for establishing multiple bandwidth-guaranteed hose-model VPNs under the single-link failure model. Simulations that compare the performance of the proposed algorithms are reported.