Masato UCHIDA Kei OHNISHI Kento ICHIKAWA Masato TSURU Yuji OIE
In this paper we propose a file replication scheme inspired by a thermal diffusion phenomenon for storage load balancing in unstructured peer-to-peer (P2P) file sharing networks. The proposed scheme is designed such that the storage utilization ratios of peers will be uniform, in the same way that the temperature in a field becomes uniform in a thermal diffusion phenomenon. The proposed scheme creates replicas of files in peers probabilistically, where the probability is controlled by using parameters that can be used to find the trade-off between storage load balancing and search performance in unstructured P2P file sharing networks. First, we show through theoretical analysis that the statistical behavior of the storage load balancing controlled by the proposed scheme has an analogy with the thermal diffusion phenomenon. We then show through simulation that the proposed scheme not only has superior performance with respect to balancing the storage load among peers (the primary objective of the present proposal) but also allows the performance trade-off to be widely found. Finally, we qualitatively discuss a guideline for setting the parameter values in order to widely find the performance trade-off from the simulation results.
Linglong DAI Jian FU Kewu PENG Jun WANG Arthur ALANIZ Zhixing YANG
This paper proposes a novel system called the cyclic prefix reconstructable time domain synchronous orthogonal frequency division multiplexing ( CPR-TDS-OFDM ) system, which uses a new frame structure and restores the cyclicity of the received OFDM block with low complexity. Simulation results show that the CPR-TDS-OFDM system outperforms the conventional TDS-OFDM system in high-speed fading channels.
Masashi SUGIYAMA Ichiro TAKEUCHI Taiji SUZUKI Takafumi KANAMORI Hirotaka HACHIYA Daisuke OKANOHARA
Estimating the conditional mean of an input-output relation is the goal of regression. However, regression analysis is not sufficiently informative if the conditional distribution has multi-modality, is highly asymmetric, or contains heteroscedastic noise. In such scenarios, estimating the conditional distribution itself would be more useful. In this paper, we propose a novel method of conditional density estimation that is suitable for multi-dimensional continuous variables. The basic idea of the proposed method is to express the conditional density in terms of the density ratio and the ratio is directly estimated without going through density estimation. Experiments using benchmark and robot transition datasets illustrate the usefulness of the proposed approach.
Network virtualization has become a common research topic that many researchers consider a basis for defining a new generation network architectures. In this paper, we attempt to clarify the concept of network virtualization with its brief history, to introduce the benefit of network virtualization for the future network, to posit our strong belief in that the future network should adopt a form of a meta-architecture that accommodates multiple competing multiple architectures, and to identify challenges to achieving this architecture.
To increase both the capacity and the processing speed for input-queued (IQ) switches, we proposed a fair scalable scheduling architecture (FSSA). By employing FSSA comprised of several cascaded sub-schedulers, a large-scale high performance switches or routers can be realized without the capacity limitation of monolithic device. In this paper, we present a fair scheduling algorithm named FSSA_DI based on an improved FSSA where a distributed iteration scheme is employed, the scheduler performance can be improved and the processing time can be reduced as well. Simulation results show that FSSA_DI achieves better performance on average delay and throughput under heavy loads compared to other existing algorithms. Moreover, a practical 64 64 FSSA using FSSA_DI algorithm is implemented by four Xilinx Vertex-4 FPGAs. Measurement results show that the data rates of our solution can be up to 800 Mbps and the tradeoff between performance and hardware complexity has been solved peacefully.
This paper considers the use of an antenna selection mechanism to reduce the cost of multiple analog transmit/receive chains in multiple-input multiple-output (MIMO) systems. With the optimal antenna selection scheme, radio-frequency chains can optimally connect with the best subset of transmitter and/or receiver antennas. However, the optimal antenna selection algorithm requires an exhaustive search of all possible combinations to find the optimum subset at the transmitter and/or receiver, thus resulting in high complexity. In order to reduce the computational load while still maximizing channel capacity, we introduce the simulated annealing (SA) method, an effective algorithm that solves various combinatorial optimization problems, to search the optimal subset. The simulation results show that the performance of the proposed SA method provides almost the same channel capacity as that of the optimal exhaustive search algorithm while maintaining low complexity.
Yanfei CHEN Xiaolei ZHU Hirotaka TAMURA Masaya KIBUNE Yasumoto TOMITA Takayuki HAMADA Masato YOSHIOKA Kiyoshi ISHIKAWA Takeshi TAKAYAMA Junji OGAWA Sanroku TSUKAMOTO Tadahiro KURODA
Charge redistribution based successive approximation (SA) analog-to-digital converter (ADC) has the advantage of power efficiency. Split capacitor digital-to-analog converter (CDAC) technique implements two sets of binary-weighted capacitor arrays connected by a bridge capacitor so as to reduce both input load capacitance and area. However, capacitor mismatches degrade ADC performance in terms of DNL and INL. In this work, a split CDAC mismatch calibration method is proposed. A bridge capacitor larger than conventional design is implemented so that a tunable capacitor can be added in parallel with the lower-weight capacitor array to compensate for mismatches. To guarantee correct CDAC calibration, comparator offset is cancelled using a digital timing control charge compensation technique. To further reduce the input load capacitance, an extra unit capacitor is added to the higher-weight capacitor array. Instead of the lower-weight capacitor array, the extra unit capacitor and the higher-weight capacitor array sample analog input signal. An 8-bit SA ADC with 4-bit + 4-bit split CDAC has been implemented in a 65 nm CMOS process. The ADC has an input capacitance of 180 fF and occupies an active area of 0.03 mm2. Measured results of +0.2/-0.3LSB DNL and +0.3/-0.3LSB INL have been achieved after calibration.
Wei-Bin YANG Yu-Lung LO Ting-Sheng CHAO
A proposed pseudo fractional-N clock generator with 50% duty cycle output is presented by using the pseudo fractional-N controller for SoC chips and the dynamic frequency scaling applications. The different clock frequencies can be generated with the particular phase combinations of a four-stage voltage-controlled oscillator (VCO). It has been fabricated in a 0.13 µm CMOS technology, and work with a supply voltage of 1.2 V. According to measured results, the frequency range of the proposed pseudo fractional-N clock generator is from 71.4 MHz to 1 GHz and the peak-to-peak jitter is less than 5% of the output period. Duty cycle error rates of the output clock frequencies are from 0.8% to 2% and the measured power dissipation of the pseudo fractional-N controller is 146 µW at 304 MHz.
Joon-Young CHOI Kyungmo KOO Jin Soo LEE
We consider a single-link multi-source network with FAST TCP sources. We adopt a continuous-time dynamic model for FAST TCP sources, and propose a static model to adequately describe the queuing delay dynamics at the link. The proposed model turns out to have a structure that reveals the time-varying network feedback delay, which allows us to analyze FAST TCP with due consideration of the time-varying network feedback delay. Based on the proposed model, we establish sufficient conditions for the boundedness of congestion window of each source and for the global asymptotic stability. The asymptotic stability condition shows that the stability property of each source is affected by all other sources sharing the link. Simulation results illustrate the validity of the sufficient condition for the global asymptotic stability.
Many learning machines that have hierarchical structure or hidden variables are now being used in information science, artificial intelligence, and bioinformatics. However, several learning machines used in such fields are not regular but singular statistical models, hence their generalization performance is still left unknown. To overcome these problems, in the previous papers, we proved new equations in statistical learning, by which we can estimate the Bayes generalization loss from the Bayes training loss and the functional variance, on the condition that the true distribution is a singularity contained in a learning machine. In this paper, we prove that the same equations hold even if a true distribution is not contained in a parametric model. Also we prove that, the proposed equations in a regular case are asymptotically equivalent to the Takeuchi information criterion. Therefore, the proposed equations are always applicable without any condition on the unknown true distribution.
Performance of band-limited baseband synchronous CDMA using orthogonal Independent Component Analysis (ICA) spreading sequences is investigated. The orthogonal ICA sequences have an orthogonality condition in a synchronous CDMA like the Walsh-Hadamard sequences. Furthermore, these have useful correlation properties like the Gold sequences. These sequences are obtained easily by using the ICA which is one of the brain-style signal processing algorithms. In this study, the ICA is used not as a separator for received signal but as a generator of spreading sequences. The performance of the band-limited synchronous CDMA using the orthogonal ICA sequences is compared with the one using the Walsh-Hadamard sequences. For limiting bandwidth, a Root Raised Cosine filter (RRC) is used. We investigate means and variances of correlation outputs after passing the RRC filter and the Bit Error Rates (BERs) of the system in additive white Gaussian noise channel by numerical simulations. It is found that the BER in the band-limited system using the orthogonal ICA sequences is much lower than the one using the Walsh-Hadamard sequences statistically.
Abhishek ROY Navrati SAXENA Jitae SHIN
In this letter we propose a novel resource allocation and admission control strategy for OFDMA-based emerging LTE systems. Considering users' reneging and migration between service providers, we first prove that the optimal resource allocation problem, which maximizes the service provider's gross income is, NP-complete. Subsequently, we propose two different heuristics based on dynamic programming and greedy algorithms to get a near-optimal resource allocation and admission control strategy in computationally feasible time. Simulation results point out that the solutions offer increased gross income of the service provider, while offering low latency, adequate throughput and session acceptance.
This position paper outlines the author's view on architectural directions and key technology enablers for the future mobile Internet. It is pointed out that mobile and wireless services will dominate Internet usage in the near future, and it is therefore important to design next-generation network protocols with features suitable for efficiently serving emerging wireless scenarios and applications. Several key requirements for mobile/wireless scenarios are identified - these include new capabilities such as dynamic spectrum coordination, cross-layer support, disconnection tolerant routing, content addressing, and location awareness. Specific examples of enabling technologies which address some of these requirements are given from ongoing research projects at WINLAB. Topics covered briefly include wireless network virtualization, the cache-and-forward (CNF) protocol, geographic (GEO) protocol stack, cognitive radio protocols, and open networking testbeds.
The National Institute of Information and Communications Technology (NICT) vision and five network targets of research and development (R&D) of the NeW-Generation Network (NWGN) are presented in this letter. The NWGN is based on new design concepts that look beyond the next generation network (NGN). The NWGN will maintain the sustainability of our prosperous civilization and help resolve various social issues and problems by using information and communication technologies (ICTs). NICT's vision for NWGN is also presented in this letter. Based on this vision, 19 items concerning social issues and future social outlook are analyzed, and the functional requirements of the NWGN are extracted. The requirements are refined and categorized into five network targets that must be developed for realizing the vision.
Yong-Ki KWON Man-Seop LEE Hakyong KIM
Atmospheric radio ducts can trap VHF/UHF radio waves and propagate them over long distances. 284.4625 MHz Japanese radio wave signal measurements show that the radio waves are propagated to Korea coastal regions when ground temperatures exceed 10C. This paper discusses the reasons for the existence of this critical temperature threshold.
Susumu SASAKI Supawan ANNANAB Tetsuki TANIGUCHI Yoshio KARASAWA
We provide an efficient transmission scheme which embeds a pilot signal in the data signal for channel state information (CSI) based on the configuration of a multiple-input multiple-output (MIMO) system using space-time block coding (STBC) with an adaptive array (AA). A computer simulation and analysis show that the proposed scheme, which combines the advantage of an Alamouti-like STBC scheme and the pilot-based AA, can suppress the irreducible error due to random FM noise. The proposed scheme using a pilot minimizes the decoding delay, and is highly robust against fast fading. We show that the proposed scheme can significantly increase the data transmission rate by using the transmitter diversity based on STBC, and the accuracy of the proposed technique is exemplified by a computer simulation.
Jaeyoung HONG Hanjin LEE Suho YANG Hyunsoo YOON
This letter proposes a novel mobile sensor deployment scheme for maximizing coverage. The basic idea is to force mobile sensors to move to predetermined target points that are the optimal layout in a distributed manner using Voronoi diagram data structure. A simulation shows that the result of the proposed scheme is quite close to the optimal result and outperforms previous works.
Sugang XU Weiping REN Hiroaki HARAI
In this paper, we address the on-demand end-to-end optical network construction problem for grid applications in new generation large-scale multi-domain wavelength switched optical networks (WSON). According to users' requests for high-performance distributed computing, groups of dedicated end-to-end lightpaths among geographically distributed grid resources can be established dynamically forming multiple-lightpath optical networks for grid applications, namely, optical grid network (OGN). To facilitate the automated OGN construction, we introduce an optical grid network infrastructure providing an integrated and self-contained OGN service to grid users with totally distributed control. In this infrastructure, for easy construction, especially in a large-scale multi-domain WSON environment, we propose an overlay approach to construct OGNs in a peer-to-peer fashion, which conceals the communication architecture of the underlying heterogeneous optical networks. In particular, we propose an adaptive construction mechanism that can develop the OGN flexibly by adapting to the dynamically changed optical network circumstance. To enable users to take the advantage of the end-to-end lightpaths of WSON directly, a wavelength-oriented end-host configuration scheme is proposed. Experimental results on a developed prototype and an optical-fibre test-bed network successfully validate the proposal.
Wei-Cheng PAO Yung-Fang CHEN Dah-Chung CHANG
A simple suboptimal power allocation method is proposed for SC-FDMA systems. It is known that the performance of constant power-based allocation methods is close to that of optimal solutions. In this letter, by utilizing the waterfilling condition inequality derived for SC-FDMA systems, a threshold is set to select subcarriers for loading constant power to these selected subcarriers. It offers competitive performance as confirmed by the simulation results.
Naotaka SHIBATA Koji YAMAMOTO Hidekazu MURATA Susumu YOSHIDA
A cooperative relaying system with transmission scheduling is investigated. Cooperative relaying is composed of multiple links because the source sends the data to more than one receiver, and the destination receives multiple data transmitted by more than one transmitter. Therefore, if the source can transmit the data when the channel gains of the links are high, it is not clear which channel gains should be high in order to achieve high spectral efficiency. In the present letter, the spectral efficiency of a cooperative relaying system is theoretically derived under the assumption that the source transmits the data only when the channel gains of links are above certain threshold values. Numerical results reveal that a high spectral efficiency can be achieved by assuring a high channel gain for the link with the highest average received power among links to the destination.