Takafumi KANAZAWA Takurou MISAKA Toshimitsu USHIO
A selfish routing game is a simple model of selfish behaviors in networks. It is called that Braess's paradox occurs in the selfish routing game if an equilibrium flow achieved by players' selfish behaviors is not the optimal minimum latency flow. In order to make the minimum latency flow a Nash equilibrium, a marginal cost tax has been proposed. Braess graphs have also been proposed to discuss Braess's paradox. In a large population of selfish players, conflicts between purposes of each player and the population causes social dilemmas. In game theory, to resolve the social dilemmas, a capitation tax and/or a subsidy has been introduced, and players' dynamical behaviors have been formulated by replicator dynamics. In this paper, we formulate replicator dynamics in the Braess graphs and investigate stability of the minimum latency flow with and without the marginal cost tax. An additional latency caused by the marginal cost tax is also shown. To resolve the problem of the additional latency, we extend the capitation tax and the subsidy to a state-dependent tax and apply it to the stabilization problem of the minimum latency flow.
Dongjin KIM Jiro HIROKAWA Kimio SAKURAI Makoto ANDO Takuma TAKADA Tadao NAGATSUMA Jun TAKEUCHI Akihiko HIRATA
We design and fabricate a double-layer hollow-waveguide slot array antenna with wide bandwidth and high antenna efficiency for the 120 GHz band. The antenna is fabricated by diffusion bonding of laminated thin metal plates for high precision and perfect electrical contact. The 1616-element antenna shows more than 70% antenna efficiency over a 13 GHz bandwidth. Furthermore, it realizes error-free data transmission in 2.5 m distance at up to 10 Gbit/s. To our knowledge, this is the first report of the design and fabrication of a high-efficiency wideband planar antenna for the 120 GHz band.
Joji WATANABE Tadaaki HOSAKA Takayuki HAMAMOTO
For source camera identification, we propose a method to reconstruct the sensor pattern noise map from a size-reduced query image by minimizing an objective function derived from the observation model. Our method can be applied to multiple queries, and can thus be further improved. Experiments demonstrate the superiority of the proposed method over conventional interpolation-based magnification algorithms.
Yoshiya KOMATSU Masanori HARIYAMA Michitaka KAMEYAMA
This paper presents a novel architecture of an asynchronous FPGA for handshake-component-based design. The handshake-component-based design is suitable for large-scale, complex asynchronous circuit because of its understandability. This paper proposes an area-efficient architecture of an FPGA that is suitable for handshake-component-based asynchronous circuit. Moreover, the Four-Phase Dual-Rail encoding is employed to construct circuits robust to delay variation because the data paths are programmable in FPGA. The FPGA based on the proposed architecture is implemented in a 65 nm process. Its evaluation results show that the proposed FPGA can implement handshake components efficiently.
Zhangjun FAN Daoxing GUO Bangning ZHANG Youyun XU
This letter investigates the outage performance of a joint transmit and receive antenna selection scheme in an amplify-and-forward two-way relaying system with channel estimation error. A closed-form approximate outage probability expression is derived, based on which the asymptotic outage probability expression is derived to get an insight on system's outage performance at high signal-to-noise (SNR) region. Monte Carlo simulation results are presented to verify the analytical results.
Xin WANG Filippos BALASIS Sugang XU Yoshiaki TANAKA
It is believed that the wavelength switched optical network (WSON) technology is moving towards being adopted by large-scale networks. Wavelength conversion and signal regeneration through reamplifying, reshaping, and retiming (3R) are beneficial to support the expansion of WSON. In many cases, these two functions can be technically integrated into a single shared physical component, namely the wavelength convertible 3R regenerator (WC3R). However, fully deploying such devices is infeasible due to their excessive cost. Thus, this topic serves as a motivation behind the investigation of the sparse placement issue of WC3Rs presented in this paper. A series of strategies are proposed based on knowledge of the network. Moreover, a novel adaptive routing and joint resource assignment algorithm is presented to provision the lightpaths in WSON with sparsely placed WC3Rs. Extensive simulation trials are conducted under even and uneven distribution of WC3R resource. Each strategic feature is examined for its efficiency in lowering the blocking probability. The results reveal that carefully designed sparse placement of WC3Rs can achieve performance comparable to that of full WC3R placement scenario. Furthermore, the expenditure of WC3R deployment also depends on the type of used WC3Rs characterized by the wavelength convertibility, i.e., fixed WC3R or tunable WC3R. This paper also investigates WSON from the perspective of cost and benefit by employing different types of WC3Rs in order to find the possibility of more efficient WC3R investment.
Weiqiang LIU Xiaohui CHEN Weidong WANG
This work investigates the cell range expansion (CRE) possible with time-domain multiplexing inter-cell interference coordination (TDM ICIC) in heterogeneous cellular networks (HCN). CRE is proposed to enable a user to connect to a picocell even when it is not the cell with the strongest received power. However, the users in the expanded region suffer severe interference from the macrocells. To alleviate the cross-tier interference, TDM ICIC is proposed to improve the SIR of pico users. In contrast to previous studies on CRE with TDM ICIC, which rely mostly on simulations, we give theoretical analysis results for different types of users in HCN with CRE and TDM ICIC under the Poisson Point Process (PPP) model, especially for the users in the expanded region of picocells. We analyze the outage probability and average ergodic rate based on the connect probability and statistical distance we obtain in advance. Furthermore, we analyze the optimal ratio of almost blank subframes (ABS) and bias factor of picocells in terms of the network fairness, which is useful in the parameter design of a two-tier HCN.
Kotaro NEGISHI Hiroyuki UENOHARA
We have investigated the operational performance of an optical serial-to-parallel conversion scheme using a phase-shifted preamble handling optical packets formatted by differential phase shift keying (DPSK) for integrated optical serial-to-parallel converter (OSPC). The same architecture for on-off keyed signals, based on a transmitter-side preamble at the top of the packet and phase-shifted by π/2, which is then -π/2 phase-biased with a Mach-Zehnder delay interferometer (MZDI), is available for binary and differential PSK signals. The delay length of these signals is determined by the relative timing positions of the gated bit and a balanced receiver-side photodetector. We simulated the operational performance of this scheme and its tolerance against the degree of modulation and optical chirp, with our results showing that a phase shift of more than 0.94π is required in order to attain a suppression ratio in the OSPC output consistent with a bit error rate of less than 10-9 (based on the ratio of intensity of the extracted bit to the maximum peak intensity of the cancelled bits using a single-arm phase modulator). However, by using a Mach-Zehnder phase modulator, the modulation angle can be relaxed to about 0.36π. Experimental investigation of the OSPC showed that its functional tolerance with respect to the modulation angle agreed well with the simulated values. Finally, we performed optical label processing using the OSPC in conjunction with an address table, and our results confirmed the potential of the OSPC for use in label recognition.
Fang YANG Keqian YAN Changyong PAN Jian SONG
Square root-raised-cosine (SRRC) filters are used in many systems for spectrum shaping, which leads to a high peak-to-average power ratio (PAPR). Nevertheless, some applications demand a low PAPR in terms of both the error performance and the strict restriction of the spectrum mask. In this letter, we propose a PAPR reduction method based on the modified active constellation extension for systems using SRRC filters. Results show that the proposed method substantially reduces the PAPR, and therefore it is applicable to satellite communications to improve the power efficiency at the transmitter.
Hua FAN Quanyuan WU Jianfeng ZHANG
Despite the improvement of the accuracy of RFID readers, there are still erroneous readings such as missed reads and ghost reads. In this letter, we propose two effective models, a Bayesian inference-based decision model and a path-based detection model, to increase the accuracy of RFID data cleaning in RFID based supply chain management. In addition, the maximum entropy model is introduced for determining the value of sliding window size. Experiment results validate the performance of the proposed method and show that it is able to clean raw RFID data with a higher accuracy.
Yong-Jin PARK Woo-Chan PARK Jun-Hyun BAE Jinhong PARK Tack-Don HAN
In this paper, we proposed that an area- and speed-effective fixed-point pipelined divider be used for reducing the bit-width of a division unit to fit a mobile rendering processor. To decide the bit-width of a division unit, error analysis has been carried out in various ways. As a result, when the original bit-width was 31-bit, the proposed method reduced the bit-width to 24-bit and reduced the area by 42% with a maximum error of 0.00001%.
Ryohei NAKADA Yutaka HASEGAWA Shigeki HIROBAYASHI Toshio YOSHIZAWA Tadanobu MISAWA Junya SUZUKI
We propose a sound field control system to control the sound over a wide area within a room by reducing the influence of the reproduction space using power envelope inverse filtering (PEIF). Envelopes of the impulse response within the room have approximately the same shape at all observation points. Therefore, the proposed sound field control system can control with a small number of loudspeakers a wider area by reducing reverberation in the room through envelope processing. We present experimental data demonstrating that the proposed PEIF system can provide better control than a system that uses minimum phase inverse filtering (MPIF), which is conventionally used for reducing reverberation. Improvement was observed across the frequency band, especially above 1 kHz. Additionally, our PEIF system is more effective over the high-frequency range.
Motoharu SASAKI Wataru YAMADA Naoki KITA Takatoshi SUGIYAMA
A new path loss model of interference between mobile terminals in a residential area is proposed. The model uses invertible formulas and considers the effects on path loss characteristics produced by paths having many corners or corners with various angles. Angular profile and height pattern measurements clarify three paths that are dominant in terms of their effect on the accurate modeling of path loss characteristics in residential areas: paths along a road, paths between houses, and over-roof propagation paths. Measurements taken in a residential area to verify the model's validity show that the model is able to predict path loss with greater accuracy than conventional models.
Proxy Mobile IPv6 (PMIPv6) is a network-based localized mobility management protocol that is independent of global mobility management protocols. In a single local mobility domain, the mobile node (MN) is not involved in any IP mobility-related signaling, but when the MN moves into another local mobility domain, the MN must change its PMIPv6 home address. In this case, host-based mobility signaling is activated, and PMIPv6's network-based mobility cannot be retained. Additionally, if the MN does not support global mobility, it cannot maintain its communication sessions with its correspondent node. In this paper, we propose a solution for network-based global mobility support in PMIPv6 networks, which allows the MN to maintain active communication sessions without mobility protocol stacks when the MN moves into another local mobility domain. In the proposed mechanism, the MN remains unaware of its movement when it moves to another local mobility domain, and it is forced to use only its MIPv6 home address for all its communication. Thus, the MN is not involved in any IP mobility-related signaling, despite its movement. The proposed protocol provides for global mobility while retaining the advantages of the network-based localized mobility in the Proxy Mobile IPv6 protocol. In this paper, we propose a solution for global mobility support in PMIPv6 networks by which the MAG (Mobile Access Gateway) can maintain the MN's communication sessions during inter-domain handover. In the proposed mechanism, the MN remains unaware of its movement when it moves to another local mobility domain, and it is forced to use only its MIPv6 home address for all its communication. Thus, the MN is not involved in any IP mobility-related signaling, despite its movement. We evaluate and compare network performance between our proposed solution and PMIPv6 and the main host-based mobility protocol. We evaluate and compare handover delays, and packet loss cost of the two protocols.
Wittawat JITKRITTUM Hirotaka HACHIYA Masashi SUGIYAMA
Feature selection is a technique to screen out less important features. Many existing supervised feature selection algorithms use redundancy and relevancy as the main criteria to select features. However, feature interaction, potentially a key characteristic in real-world problems, has not received much attention. As an attempt to take feature interaction into account, we propose
Nowadays, many interface devices or training systems have been developed with recent developments in IT technology, but only a few training systems for developmentally disabled people have been introduced. In this paper, we present a real-time, interactional and situational training system based on augmented reality in order to improve cognitive capability and adaptive ability in the daily lives of developmentally disabled people. Our system is specifically based on serving food in restaurants. It allows disabled people wearing the HMD attached with camera to conduct the training to cope with a series of situations safely while serving customers food and drinks and take the training session as much as they want. After experimenting on our presented system for 3 months, we found that they actively participated in the training and their cognitive abilities increasingly went faster through repeated training, resulting in the improvement in their cognitive ability and their ability to deal with situations.
In this letter, we present a fast image/video super resolution framework using edge and nonlocal constraint. The proposed method has three steps. First, we improve the initial estimation using content-adaptive bilateral filtering to strengthen edge. Second, the high resolution image is estimated by using classical back projection method. Third, we use joint content-adaptive nonlocal means filtering to get the final result, and self-similarity structures are obtained by the low resolution image. Furthermore, content-adaptive filtering and fast self-similarity search strategy can effectively reduce computation complexity. The experimental results show the proposed method has good performance with low complexity and can be used for real-time environment.
Biling ZHANG Kai CHEN Jung-lang YU Shiduan CHENG
In cognitive radio networks, the primary user (PU) can lease a fraction of its licensed spectrum to the secondary users (SUs) in exchange for their cooperative transmission if it has a minimum transmission rate requirement and is experiencing a bad channel condition. However, due to the selfish nature of the SUs, they may not cooperate to meet the PU's Quality of Service (QoS) requirement. On the other hand, the SUs may not exploit efficiently the benefit from cooperation if they compete with each other and collaborate with the PU independently. Therefore, when SUs belong to the same organization and can work as a group, how to stimulate them to cooperate with the PU and thus guarantee the PU's QoS requirement, and how to coordinate the usage of rewarded spectrum among these SUs after cooperation are critical challenges. In this paper, we propose a two-level bargaining framework to address the aforementioned problems. In the proposed framework, the interactions between the PU and the SUs are modeled as the upper level bargaining game while the lower level bargaining game is used to formulate the SUs' decision making process on spectrum sharing. We analyze the optimal actions of the users and derive the theoretic results for the one-PU one-SU scenario. To find the solutions for the one-PU multi-SU scenario, we put forward a revised numerical searching algorithm and prove its convergence. Finally, we demonstrate the effectiveness and efficiency of the proposed scheme through simulations.
Yinqiang ZHENG Shigeki SUGIMOTO Masatoshi OKUTOMI
We propose an accurate and scalable solution to the perspective-n-point problem, referred to as ASPnP. Our main idea is to estimate the orientation and position parameters by directly minimizing a properly defined algebraic error. By using a novel quaternion representation of the rotation, our solution is immune to any parametrization degeneracy. To obtain the global optimum, we use the Grobner basis technique to solve the polynomial system derived from the first-order optimality condition. The main advantages of our proposed solution lie in accuracy and scalability. Extensive experiment results, with both synthetic and real data, demonstrate that our proposed solution has better accuracy than the state-of-the-art noniterative solutions. More importantly, by exploiting vectorization operations, the computational cost of our ASPnP solution is almost constant, independent of the number of point correspondences n in the wide range from 4 to 1000. In our experiment settings, the ASPnP solution takes about 4 milliseconds, thus best suited for real-time applications with a drastically varying number of 3D-to-2D point correspondences.
Yuan CAO Wei XU Hideo NAKAMURA
This paper investigates a preprocessing technique for a multiuser MIMO downlink system. An efficient joint precoder design with adaptive power allocation is proposed by adopting the channel-diagonalization technique and the minimum mean square error (MMSE) criterion. By exploiting an MMSE-based decoder, we propose an iterative algorithm to design the precoder with further derived closed-form solutions for implementing adaptive power allocation. Simulation results verify the effectiveness of our proposed approach. Compared with conventional benchmark schemes, they show that our proposal matches the performance but with reduced computational complexity.