Christian Henry Wijaya OEY Sangman MOH
One of the most important requirements for a routing protocol in wireless body area networks (WBANs) is to lower the network's temperature increase. The temperature of a node is closely related to its activities. The proactive routing approach, which is used by existing routing protocols for WBANs, tends to produce a higher temperature increase due to more frequent activities, compared to the on-demand reactive routing approach. In this paper, therefore, we propose a reactive routing protocol for WBANs called priority-based temperature-aware routing (PTR). In addition to lowering the temperature increase, the protocol also recognizes vital nodes and prioritizes them so they are able to achieve higher throughput. Simulation results show that the PTR protocol achieves a 50% lower temperature increase compared to the conventional temperature-aware routing protocol and is able to improve throughput of vital nodes by 35% when the priority mode is enabled.
For battery based real-time embedded systems, high performance to meet their real-time constraints and energy efficiency to extend battery life are both essential. Real-Time Dynamic Voltage Scaling (RT-DVS) has been a key technique to satisfy both requirements. This paper presents EccEDF (Enhanced ccEDF), an efficient algorithm based on ccEDF. ccEDF is one of the most simple but efficient RT-DVS algorithms. Its simple structure enables it to be easily and intuitively coupled with a real-time operating system without incurring any significant cost. ccEDF, however, overlooks an important factor in calculating the available slacks for reducing the operating frequency. It calculates the saved utilization simply by dividing the slack by the period without considering the time needed to run the task. If the elapsed time is considered, the maximum utilization saved by the slack on completion of the task can be found. The proposed EccEDF can precisely calculate the maximum unused utilization with consideration of the elapsed time while keeping the structural simplicity of ccEDF. Further, we analytically establish the feasibility of EccEDF using the fluid scheduling model. Our simulation results show that the proposed algorithm outperforms ccEDF in all simulations. A simulation shows that EccEDF consumes 27% less energy than ccEDF.
Hiroshi YAMADA Shuntaro TONOSAKI Kenji KONO
Infrastructure as a Service (IaaS), a form of cloud computing, is gaining attention for its ability to enable efficient server administration in dynamic workload environments. In such environments, however, updating the software stack or content files of virtual machines (VMs) is a time-consuming task, discouraging administrators from frequently enhancing their services and fixing security holes. This is because the administrator has to upload the whole new disk image to the cloud platform via the Internet, which is not yet fast enough that large amounts of data can be transferred smoothly. Although the administrator can apply incremental updates directly to the running VMs, he or she has to carefully consider the type of update and perform operations on all running VMs, such as application restarts. This is a tedious and error-prone task. This paper presents a technique for synchronizing VMs with less time and lower administrative burden. We introduce the Virtual Disk Image Repository, which runs on the cloud platform and automatically updates the virtual disk image and the running VMs with only the incremental update information. We also show a mechanism that performs necessary operations on the running VM such as restarting server processes, based on the types of files that are updated. We implement a prototype on Linux 2.6.31.14 and Amazon Elastic Compute Cloud. An experiment shows that our technique can synchronize VMs in an order-of-magnitude shorter time than the conventional disk-image-based VM method. Also, we discuss limitations of our technique and some directions for more efficient VM updates.
Masato TAJIMA Koji OKINO Tatsuto MURAYAMA
In this paper, we clarify the relationship between an initial (final) state in a tail-biting error-trellis and the obtained syndromes. We show that a final state is dependent on the first M syndromes as well, where M is the memory length of the parity-check matrix. Next, we calculate the probability of an initial (final) state conditioned by the syndromes. We also apply this method to concrete examples. It is shown that the initial (final) state in a tail-biting error-trellis is well estimated using these conditional probabilities.
We propose an improved design of a neuron circuit, using coupled SQUIDs gates, for a superconducting neural network. An activation function with step-like input vs. output characteristics is desirable for a neuron circuit to solve a combinatorial optimization problem. The proposed neuron circuit is composed of two coupled SQUIDs gates with a cascade connection, in order to obtain such characteristics. The designed neuron circuit is fabricated by a 2.5kA/cm2 Nb/AlOx/Nb process. The operation of a fabricated neuron circuit is experimentally demonstrated. Network performance of a neural network using proposed neuron circuits is also estimated by numerical dynamic simulations.
Akira FUJIMAKI Masamitsu TANAKA Ryo KASAGI Katsumi TAKAGI Masakazu OKADA Yuhi HAYAKAWA Kensuke TAKATA Hiroyuki AKAIKE Nobuyuki YOSHIKAWA Shuichi NAGASAWA Kazuyoshi TAKAGI Naofumi TAKAGI
We describe a large-scale integrated circuit (LSI) design of rapid single-flux-quantum (RSFQ) circuits and demonstrate several reconfigurable data-path (RDP) processor prototypes based on the ISTEC Advanced Process (ADP2). The ADP2 LSIs are made up of nine Nb layers and Nb/AlOx/Nb Josephson junctions with a critical current density of 10kA/cm2, allowing higher operating frequencies and integration. To realize truly large-scale RSFQ circuits, careful design is necessary, with several compromises in the device structure, logic gates, and interconnects, balancing the competing demands of integration density, design flexibility, and fabrication yield. We summarize numerical and experimental results related to the development of a cell-based design in the ADP2, which features a unit cell size reduced to 30-µm square and up to four strip line tracks in the unit cell underneath the logic gates. The ADP LSIs can achieve ∼10 times the device density and double the operating frequency with the same power consumption per junction as conventional LSIs fabricated using the Nb four-layer process. We report the design and test results of RDP processor prototypes using the ADP2 cell library. The RDP processors are composed of many arrays of floating-point units (FPUs) and switch networks, and serve as accelerators in a high-performance computing system. The prototypes are composed of two-dimensional arrays of several arithmetic logic units instead of FPUs. The experimental results include a successful demonstration of full operation and reconfiguration in a 2×2 RDP prototype made up of 11.5k junctions at 45GHz after precise timing design. Partial operation of a 4×4 RDP prototype made up of 28.5k-junctions is also demonstrated, indicating the scalability of our timing design.
Shuichi NAGASAWA Kenji HINODE Tetsuro SATOH Mutsuo HIDAKA Hiroyuki AKAIKE Akira FUJIMAKI Nobuyuki YOSHIKAWA Kazuyoshi TAKAGI Naofumi TAKAGI
We describe the recent progress on a Nb nine-layer fabrication process for large-scale single flux quantum (SFQ) circuits. A device fabricated in this process is composed of an active layer including Josephson junctions (JJ) at the top, passive transmission line (PTL) layers in the middle, and a DC power layer at the bottom. We describe the process conditions and the fabrication equipment. We use both diagnostic chips and shift register (SR) chips to improve the fabrication process. The diagnostic chip was designed to evaluate the characteristics of basic elements such as junctions, contacts, resisters, and wiring, in addition to their defect evaluations. The SR chip was designed to evaluate defects depending on the size of the SFQ circuits. The results of a long-term evaluation of the diagnostic and SR chips showed that there was fairly good correlation between the defects of the diagnostic chips and yields of the SRs. We could obtain a yield of 100% for SRs including 70,000JJs. These results show that considerable progress has been made in reducing the number of defects and improving reliability.
A data-driven controller has been proposed for nonlinear systems, and its effectiveness has been also shown. However, according to this control scheme, considerable large computation burden is required in on-line learning to update the database. The on-line limit its implementation in industrial processes. In this paper, a controller design scheme is proposed, which enables us to update the database in an off-line manner.
Miao ZHANG Jiro HIROKAWA Makoto ANDO
As a promising lamination-loss-free fabrication technique, diffusion bonding of etched thin metal plates is used to realize double-layer waveguide slot antennas. Alternating-phase feed is adopted in this paper to reduce the number of laminated plates to simplify fabrication as well as to reduce cost. A 20 × 20-element double-layer waveguide slot antenna with a bottom partially-corporate feed circuit is designed for 39GHz band operation as an example. The adjacent radiating waveguides as well as the 2 × 2 sub-arrays fed in an alternating-phase manner eliminate the need for complete electrical contact in the top layer. However, the feed circuit in the bottom layer has to be completely diffusion-bonded. These two layers are simply assembled by screws. An antenna laminated by only diffusion bonding is also fabricated and evaluated for comparison. The comparison proved that the simply fabricated antenna is comparable in performance to the fully diffusion-bonded one.
Junya NAKAMURA Tadashi ARARAGI Shigeru MASUYAMA Toshimitsu MASUZAWA
We propose a fast and resource-efficient agreement protocol on a request set, which is used to realize Byzantine fault tolerant server replication. Although most existing randomized protocols for Byzantine agreement exploit a modular approach, that is, a combination of agreement on a bit value and a reduction of request set values to the bit values, our protocol directly solves the multi-valued agreement problem for request sets. We introduce a novel coin tossing scheme to select a candidate of an agreed request set randomly. This coin toss allows our protocol to reduce resource consumption and to attain faster response time than the existing representative protocols.
Ryunosuke SOUMA Shouhei KIDERA Tetsuo KIRIMOTO
Ultra-wideband pulse radar exhibits high range resolution, and excellent capability in penetrating dielectric media. With that, it has great potential as an innovative non-destructive inspection technique for objects such as human body or concrete walls. For suitability in such applications, we have already proposed an accurate permittivity estimation method for a 2-dimensional dielectric object of arbitrarily shape and clear boundary. In this method, the propagation path estimation inside the dielectric object is calculated, based on the geometrical optics (GO) approximation, where the dielectric boundary points and its normal vectors are directly reproduced by the range point migration (RPM) method. In addition, to compensate for the estimation error incurred using the GO approximation, a waveform compensation scheme employing the finite-difference time domain (FDTD) method was incorporated, where an initial guess of the relative permittivity and dielectric boundary are employed for data regeneration. This study introduces the 3-dimensional extension of the above permittivity estimation method, aimed at practical uses, where only the transmissive data are effectively extracted, based on quantitative criteria that considers the spatial relationship between antenna locations and the dielectric object position. Results from a numerical simulation verify that our proposed method accomplishes accurate permittivity estimations even for 3-dimensional dielectric medium of wavelength size.
Hyun-Ho CHOI Hyun-Gyu LEE Jung-Ryun LEE
In this letter, we propose an energy-aware source routing protocol for maximizing the network lifetime in mobile ad hoc networks. We define a new routing cost by considering both transmit and receive power consumption and remaining battery level in each node simultaneously and present an efficient route discovery procedure to investigate the proposed routing cost. Intensive simulation verifies that the proposed routing protocol has similar performance to the conventional routing protocols in terms of the number of transmission hops, transmission rate, and energy consumption while significantly improving the performance with respect to network lifetime.
Youwen ZHU Tsuyoshi TAKAGI Rong HU
Recently, Yuan et al. (IEEE Infocom'13, pp.2652-2660) proposed an efficient secure nearest neighbor (SNN) search scheme on encrypted cloud database. Their scheme is claimed to be secure against the collusion attack of query clients and cloud server, because the colluding attackers cannot infer the encryption/decryption key. In this letter, we observe that the encrypted dataset in Yuan's scheme can be broken by the collusion attack without deducing the key, and present a simple but powerful attack to their scheme. Experiment results validate the high efficiency of our attacking approach. Additionally, we also indicate an upper bound of collusion-resistant ability of any accurate SNN query scheme.
Shenchuan LIU Wannida SAE-TANG Masaaki FUJIYOSHI Hitoshi KIYA
This letter proposes an efficient compression scheme for the copyright- and privacy-protected image trading system. The proposed scheme multiplies pseudo random signs to amplitude components of discrete cosine transformed coefficients before the inverse transformation is applied. The proposed scheme efficiently compresses amplitude-only image which is the inversely transformed amplitude components, and the scheme simultaneously improves the compression efficiency of phase-only image which is the inversely transformed phase components, in comparison with the conventional systems.
Outsourcing to a cloud storage brings forth new challenges for the efficient utilization of computing resources as well as simultaneously maintaining privacy and security for the outsourced data. Data deduplication refers to a technique that eliminates redundant data on the storage and the network, and is considered to be one of the most-promising technologies that offers efficient resource utilization in the cloud computing. In terms of data security, however, deduplication obstructs applying encryption on the outsourced data and even causes a side channel through which information can be leaked. Achieving both efficient resource utilization and data security still remains open. This paper addresses this challenging issue and proposes a novel solution that enables data deduplication while also providing the required data security and privacy. We achieve this goal by constructing and utilizing equality predicate encryption schemes which allow to know only equivalence relations between encrypted data. We also utilize a hybrid approach for data deduplication to prevent information leakage due to the side channel. The performance and security analyses indicate that the proposed scheme is efficient to securely manage the outsourced data in the cloud computing.
Yu TIAN Linhua MA Bo SONG Hong TANG Song ZHANG Xing HU
Much work in cooperative communication has been done from the perspective of the physical and network layers. However, the exact impact of signal error rate performance on cooperative routing discovery still remains unclear in multihop ad hoc networks. In this paper, we show the symbol error rate (SER) performance improvement obtained from cooperative commutation, and examine how to incorporate the factor of SER into the distributed routing discovery scheme called DGCR (Dynamic Geographic Cooperative Routing). For a single cooperative communication hop, we present two types of metric to specify the degree that one node is suitable for becoming the relay node. One metric is the potential of a node to relay with optimal SER performance. The other metric is the distance of a node to the straight line that passes through the last forwarding node and the destination. Based on location knowledge and contention scheme, we combine the two metrics into a composite metric to choose the relay node. The forwarding node is chosen dynamically according to the positions of the actual relay node and the destination. Simulation results show that our approach outperforms non-cooperative geographic routing significantly in terms of symbol error rate, and that DGCR's SER performance is better than traditional geographic cooperative routing with slight path length increase.
A method for efficiently estimating the time-varying spectra of nonstationary autoregressive (AR) signals is derived using an indefinite matrix-based sliding window fast linear prediction (ISWFLP). In the linear prediction, the indefinite matrix plays a very important role in sliding an exponentially weighted finite-length window over the prediction error samples. The resulting ISWFLP algorithm successively estimates the time-varying AR parameters of order N at a computational complexity of O(N) per sample. The performance of the AR parameter estimation is superior to the performances of the conventional techniques, including the Yule-Walker, covariance, and Burg methods. Consequently, the ISWFLP-based AR spectral estimation method is able to rapidly track variations in the frequency components with a high resolution and at a low computational cost. The effectiveness of the proposed method is demonstrated by the spectral analysis results of a sinusoidal signal and a speech signal.
We analyze the effect of the propagation of route request packets in ad hoc network routing protocols such as DSR and AODV. So far it has not been clear how the number density of route request packets depends on propagation and hop counts. By stochastic analysis, it is found that the collisions of route request packets can be avoided efficiently by adjusting the number of the relevant nodes in the early stages of propagation.
This paper proposes a new optimization problem and several implementation algorithms for energy-efficient clouds where energy efficiency is measured by the number of physical machines that can be removed from operation and turned off. The optimization problem is formulated is such a way that solutions are considered favorable not only when the number of migrations is minimized but also when the resulting layout has more free physical machines which can therefore be turned off to save electricity.
Shaojing FU Dongsheng WANG Ming XU Jiangchun REN
Remote data possession checking for cloud storage is very important, since data owners can check the integrity of outsourced data without downloading a copy to their local computers. In a previous work, Chen proposed a remote data possession checking protocol using algebraic signature and showed that it can resist against various known attacks. In this paper, we find serious security flaws in Chen's protocol, and shows that it is vulnerable to replay attack by a malicious cloud server. Finally, we propose an improved version of the protocol to guarantee secure data storage for data owners.