The search functionality is under construction.
The search functionality is under construction.

IEICE TRANSACTIONS on Communications

  • Impact Factor

    0.73

  • Eigenfactor

    0.002

  • article influence

    0.1

  • Cite Score

    1.6

Advance publication (published online immediately after acceptance)

Volume E96-B No.9  (Publication Date:2013/09/01)

    Regular Section
  • Location-Based Key Management Structure for Secure Group Communication in Wireless Sensor Networks

    Jin Myoung KIM  Tae Ho CHO  

     
    PAPER-Fundamental Theories for Communications

      Page(s):
    2183-2189

    Many applications of wireless sensor networks (WSNs) require secure communication. The tree-based key management scheme, which is a symmetric key scheme, provides backward and forward secrecy. The sensor nodes in the communication group share a secret key for encrypting messages. When the sensor nodes are added to or evicted from the group, the group key has to be updated by sending rekeying messages. In this paper, we propose a method of key tree structure (KTS) generation by considering the addition and eviction ratio of sensor nodes to reduce the number of rekeying messages, which is influenced by the structure of the tree. For this, we define an extension of an existing tree structure such as a binary or ternary tree and generate KTS using an A* algorithm. To reduce the energy consumed by the message transmission, we also exploit genetic algorithm (GA) to build a secure communication group by considering the KTS. In the paper, we show the effectiveness of the proposed method compared with the existing structure via the simulation in terms of memory usage, the number of rekeying messages and energy consumption.

  • On the Cross-Correlation of a p-Ary m-Sequence and Its Decimated Sequences by d=(pn+1)/(pk+1)+(pn-1)/2

    Sung-Tai CHOI  Ji-Youp KIM  Jong-Seon NO  

     
    PAPER-Fundamental Theories for Communications

      Page(s):
    2190-2197

    In this paper, for an odd prime p such that p≡3 mod 4, odd n, and d=(pn+1)/(pk+1)+(pn-1)/2 with k|n, the value distribution of the exponential sum S(a,b) is calculated as a and b run through $mathbb{F}_{p^n}$. The sequence family $mathcal{G}$ in which each sequence has the period of N=pn-1 is also constructed. The family size of $mathcal{G}$ is pn and the correlation magnitude is roughly upper bounded by $(p^k+1)sqrt{N}/2$. The weight distribution of the relevant cyclic code C over $mathbb{F}_p$ with the length N and the dimension ${ m dim}_{mathbb{F}_p}mathcal{C}=2n$ is also derived.

  • Design Equations for Off-Nominal Operation of Class E Amplifier with Nonlinear Shunt Capacitance at D=0.5

    Tadashi SUETSUGU  Xiuqin WEI  Marian K. KAZIMIERCZUK  

     
    PAPER-Energy in Electronics Communications

      Page(s):
    2198-2205

    Design equations for satisfying off-nominal operating conditions of the class E amplifier with a nonlinear shunt capacitance for a grading coefficient of 0.5 and the duty cycle D=0.5 are derived. By exploiting the off-nominal class E operation, various amplifier parameters such as input voltage, operating frequency, output power, and load resistance can be set as design specifications. As a result of the analysis in this paper, the following extension of the usability of the class E amplifier was achieved. With rising up the dc supply voltage, the shunt capacitance which achieves the off-nominal operation can be increased. This means that a transistor with higher output capacitance can be used for ZVS operation. This also means that maximum operating frequency which achieves ZVS can be increased. An example of a design procedure of the class E amplifier is given. The theoretical results were verified with an experiment.

  • Analyzing Deterioration in Optical Performance of Fiber Connections with Refractive Index Matching Material Using Incorrectly Cleaved Fiber Ends

    Mitsuru KIHARA  Yuichi YAJIMA  Hiroshi WATANABE  

     
    PAPER-Optical Fiber for Communications

      Page(s):
    2206-2212

    We experimentally investigate and analyze faults in optical fiber connections with refractive index matching material that have incorrectly cleaved fiber ends. We explain that incorrectly cleaved fiber ends, which are not ideal because they are uneven and not perpendicular to the fiber axis, are caused by defective optical fiber cleavers. We discover that the optical performance of field installable connections using incorrectly cleaved fiber ends might change greatly. We also infer that the significant change in insertion and return losses might be attributed to partially air-filled gaps by using scatter diagrams of measured insertion and return losses. Our experiment results reveal that the optical performance might deteriorate to more than 40dB in terms of insertion loss and less than 30dB in terms of return loss.

  • Time-Delayed Collaborative Routing and MAC Protocol for Maximizing the Network Lifetime in MANETs

    Woncheol CHO  Daeyoung KIM  

     
    PAPER-Network

      Page(s):
    2213-2223

    This paper proposes T-CROM (Time-delayed Collaborative ROuting and MAC) protocol, that allows collaboration between network and MAC layers in order to extend the lifetime of MANETs in a resources-limited environment. T-CROM increases the probability of preventing energy-poor nodes from joining routes by using a time delay function that is inversely proportional to the residual battery capacity of intermediate nodes, making a delay in the route request (RREQ) packets transmission. The route along which the first-arrived RREQ packet traveled has the smallest time delay, and thus the destination node identifies the route with the maximum residual battery capacity. This protocol leads to a high probability of avoiding energy-poor nodes and promotes energy-rich nodes to join routes in the route establishment phase. In addition, T-CROM controls the congestion between neighbors and reduces the energy dissipation by providing an energy-efficient backoff time by considering both the residual battery capacity of the host itself and the total number of neighbor nodes. The energy-rich node with few neighbors has a short backoff time, and the energy-poor node with many neighbors gets assigned a large backoff time. Thus, T-CROM controls the channel access priority of each node in order to prohibit the energy-poor nodes from contending with the energy-rich nodes. T-CROM fairly distributes the energy consumption of each node, and thus extends the network lifetime collaboratively. Simulation results show that T-CROM reduces the number of total collisions, extends the network lifetime, decreases the energy consumption, and increases the packet delivery ratio, compared with AOMDV with IEEE 802.11 DCF and BLAM, a battery-aware energy efficient MAC protocol.

  • Simplification of Service Functions Resulting from Growth in Scale of Networks

    Nagao OGINO  Hideyuki KOTO  Hajime NAKAMURA  Shigehiro ANO  

     
    PAPER-Network

      Page(s):
    2224-2234

    As a network evolves following initial deployment, its service functions remain diversified through the openness of the network functions. This indicates that appropriate simplification of the service functions is essential if the evolving network is to achieve the required scalability of service processing and service management. While the screening of service functions is basically performed by network users and the market, several service functions will be automatically simplified based on the growth of the evolving network. This paper verifies the simplification of service functions resulting from the evolution of the network itself. First, the principles that serve as the basis for simplifying the service functions are explained using several practical examples. Next, a simulation model is proposed to verify the simplification of service functions in terms of the priority control function for path routing and load balancing among multiple paths. From the results of the simulation, this study clarifies that the anticipated simplification of service functions is actually realizable and the service performance requirements can be reduced as the network evolves after deployment. When the simplification of service functions can improve network quality, it accelerates the evolution of the network and increases the operator's revenue.

  • Detection of the Number of Signals with Fewer Sensors than Sources

    Masashi TSUJI  Kenta UMEBAYASHI  Yasuo SUZUKI  

     
    PAPER-Antennas and Propagation

      Page(s):
    2235-2243

    In this paper, a method is introduced that can detect the number of incident signals (NIS) even there are fewer antennas than NIS. Previous works on NIS detection methods assumed that the number of antennas always exceeded NIS. In the DOA estimation field, the DOA estimation is possible, even if NIS exceeds the number of antennas, by extending the degrees of freedom of array (DOFA) using a modified array configuration, such as a nested array (NA). The information of NIS is required in advance to accurately estimate DOA, however, it has not been investigated deeply when NIS is larger than the number of antennas. In this paper, a NIS detection method based on the DOFA extending process using NA is proposed. One of the important issues in NIS detection is the detection metric. As one of the simple metrics, the ratio of adjacent eigenvalues (RAE) has been used. However, the direct application of RAE may not achieve adequate NIS detection performance. Therefore, we propose a metric based on the modified ratio of adjacent eigenvalues (MRAE) avoids the issue of RAE. Numerical results show that the metric based on MRAE can achieve proper NIS detection performance even if NIS is larger than the number of antennas.

  • Development of RFID Antenna for Detection of Urination

    Hiromasa NAKAJIMA  Masaharu TAKAHASHI  Kazuyuki SAITO  Koichi ITO  

     
    PAPER-Antennas and Propagation

      Page(s):
    2244-2250

    This paper introduces a radio frequency identification (RFID) tag for urination detection. The proposed tag is embedded into paper diapers in order to detect the patient's urination immediately. For this tag, we designed an RFID tag antenna at 950MHz, which matches the impedance of the associated integrated circuit (IC) chip. In addition, we calculate the antenna characteristics and measure the reflection coefficient (S11) and radiation pattern of the antenna. The results show that this system can be used to detect urination.

  • Techniques of Electromagnetic Compatibility Model Synthesis Based on On-Site Measurement Data

    Gaosheng LI  Peiguo LIU  Yan LI  Zhonghao LU  Dongming ZHOU  Yujian QIN  

     
    PAPER-Electromagnetic Compatibility(EMC)

      Page(s):
    2251-2260

    Regular on-site testing is an elementary means to obtain real-time data and state of Electromagnetic Compatibility (EMC) of electronics systems. Nowadays, there is a lot of measured EMC data while the application of the data is insufficient. So we put forward the concept of EMC model synthesis. To carry out EMC data mining with measured electromagnetic data, we can build or modify models and synthesize variation rules of electromagnetic parameters of equipment and EMC performance of systems and platforms, then realize the information synthesis and state prediction. The concept of EMC reliability is brought forward together with the definition and description of parameters such as invalidation rate and EMC lifetime. We studied the application of statistical algorithms and Artificial Neural Network (ANN) in model synthesis. Operating flows and simulation results as well as measured data are presented. Relative research can support special measurement, active management and predictive maintenance and replenishment in the area of EMC.

  • Nested Transmit Diversity Based on a Joint Network-Channel Coding

    Koji ISHII  Koji ISHIBASHI  

     
    PAPER-Wireless Communication Technologies

      Page(s):
    2261-2269

    In order to obtain higher diversity gain, the use of additional resources such as time, frequency, and/or antennas are necessary. The aim of this study is to achieve adequate temporal diversity gain without needing additional resources beyond decoding delay and decoding complexity. If the channel state information (CSI) is not available at the transmitter side, the transmitter sends information at a given constant transmission rate while the channel capacity varies according to the channel state. If the instantaneous channel capacity is greater than the given transmission rate, the system can successfully transmit information but it does not exploit the entire available channel capacity. We focus on this extra channel capacity to transmit other information based on a joint network-channel coding in order to obtain higher diversity and coding gains. This paper provides the basic concept of the transmit diversity with the joint network-channel coding and investigates its performances in terms of outage probability, additional decoding delay and complexity, and frame-error rate (FER).

  • Clipping and Filtering-Based Adaptive PAPR Reduction Method for Precoded OFDM-MIMO Signals

    Yoshinari SATO  Masao IWASAKI  Shoki INOUE  Kenichi HIGUCHI  

     
    PAPER-Wireless Communication Technologies

      Page(s):
    2270-2280

    This paper presents a new adaptive peak-to-average power ratio (PAPR) reduction method based on clipping and filtering (CF) for precoded orthogonal frequency division multiplexing (OFDM)-multiple-input multiple-output (MIMO) transmission. While the conventional CF method adds roughly the same interference power to each of the transmission streams, the proposed method suppresses the addition of interference power to the streams with good channel conditions. Since the sum capacity is dominated by the capacity of the streams under good channel conditions and the interference caused by the PAPR reduction process severely degrades the achievable capacity for these streams, the proposed method significantly improves the achievable sum capacity compared to the conventional CF method for a given PAPR. Simulation results show the capacity gain by using the proposed method compared to the conventional method.

  • Degrees of Freedom of the MIMO K-way Relay Channel with Fractional Signal Space Alignment

    Bofeng YUAN  Xuewen LIAO  Xinmin LUO  

     
    PAPER-Wireless Communication Technologies

      Page(s):
    2281-2292

    The multiple-input-multiple-output (MIMO) Gaussian wireless network with K users and an intermediate relay is investigated. In this network, each user with available local channel state information (CSI) intends to convey a multicast message to all other users while receiving all messages from other users via the relay. This model is termed the MIMO K-way relay channel with distributed CSI. For this channel, the sum capacity is shown as MK/(K-1)log(SNR)+o(SNR) where each user and the relay is equipped with M antennas. Achievability is based on the signal space alignment strategy with a K-1 time slot extension. A most general case is then considered, in which each user intends to recover all messages required within T time slots. We provide an improved scheme called fractional signal space alignment which achieves MK/(K-1) degrees of freedom in the general case and the feasibility condition is also explored.

  • Throughput/ACLR Performance of CF-Based Adaptive PAPR Reduction Method for Eigenmode MIMO-OFDM Signals with AMC

    Shoki INOUE  Teruo KAWAMURA  Kenichi HIGUCHI  

     
    PAPER-Wireless Communication Technologies

      Page(s):
    2293-2300

    This paper proposes an enhancement to a previously reported adaptive peak-to-average power ratio (PAPR) reduction method based on clipping and filtering (CF) for eigenmode multiple-input multiple-output (MIMO) — orthogonal frequency division multiplexing (OFDM) signals. We enhance the method to accommodate the case with adaptive modulation and channel coding (AMC). Since the PAPR reduction process degrades the signal-to-interference and noise power ratio (SINR), the AMC should take into account this degradation before PAPR reduction to select accurately the modulation scheme and coding rate (MCS) for each spatial stream. We use the lookup table-based prediction of SINR after PAPR reduction, in which the interference caused by the PAPR reduction is obtained as a function of the stream index, frequency block index, clipping threshold for PAPR reduction, and input backoff (IBO) of the power amplifier. Simulation results show that the proposed PAPR reduction method increases the average throughput compared to the conventional CF method for a given adjacent channel leakage power ratio (ACLR) when we assume practical AMC.

  • Novel DCF-Based Multi-User MAC Protocol for Centralized Radio Resource Management in OFDMA WLAN Systems

    Shinichi MIYAMOTO  Seiichi SAMPEI  Wenjie JIANG  

     
    PAPER-Terrestrial Wireless Communication/Broadcasting Technologies

      Page(s):
    2301-2312

    To enhance the throughput while satisfying the quality of service (QoS) requirements of wireless local area networks (WLANs), this paper proposes a distributed coordination function-based (DCF-based) medium access control (MAC) protocol that realizes centralized radio resource management (RRM) for a basic service set. In the proposed protocol, an access point (AP) acts as a master to organize the associated stations and attempts to reserve the radio resource in a conventional DCF-manner. Once the radio resource is successfully reserved, the AP controls the access of each station by an orthogonal frequency division multiple access (OFDMA) scheme. Because the AP assigns radio resources to the stations through the opportunistic two-dimensional scheduling based on the QoS requirements and the channel condition of each station, the transmission opportunities can be granted to the appropriate stations. In order to reduce the signaling overhead caused by centralized RRM, the proposed protocol introduces a station-grouping scheme which groups the associated stations into clusters. Moreover, this paper proposes a heuristic resource allocation algorithm designed for the DCF-based MAC protocol. Numerical results confirm that the proposed protocol enhances the throughput of WLANs while satisfying the QoS requirements with high probability.

  • Advanced Millimeter-Wave Radar System to Detect Pedestrians and Vehicles by Using Coded Pulse Compression and Adaptive Array

    Takaaki KISHIGAMI  Tadashi MORITA  Hirohito MUKAI  Maiko OTANI  Yoichi NAKAGAWA  

     
    PAPER-Sensing

      Page(s):
    2313-2322

    This paper reports an advanced millimeter-wave radar system to enable detection of vehicles and pedestrians in wide areas around the radar site such as an intersection. We focus on a pulse coding scheme using complementary codes to reduce range sidelobe for discriminating vehicles from pedestrians with high accuracy. In order to suppress sidelobe increase created by RF circuit imperfections, a π/2 shift pulse modulation method with a complementary code pair cycle is presented. Moreover, in order to improve the angular resolution, a high-resolution direction of arrival estimation involving Tx beam scanning is presented. Experiments on a prototype confirm its range sidelobe suppression exceeds 40dB and its angular resolution is 5° for two human's separation at the distance of about 10m in an anechoic chamber. In a trial intersection experiment, a pedestrian detection rate of 95% was achieved at the false alarm rate of 10% in the range from 5m to 40m. The results prove the system's feasibility for future automotive safety application.

  • Layer-Aware FEC Based Scalable Multiple Description Coding for Robust Video Transmission over Path Diversity Networks

    Dinh Trieu DUONG  Deepak Kumar SINGH  Seok Ho WON  Doug Young SUH  

     
    PAPER-Multimedia Systems for Communications

      Page(s):
    2323-2332

    In this paper, we propose a novel layered scalable- multiple description coding (LS-MDC) which offers the benefits of both scalable video coding and multiple description coding for robust video transmission over packet lossy networks. In the proposed LS-MDC method, multiple descriptions including base layer, enhancement layers, and their corresponding FEC parity data are allocated into two network paths of a path diversity system. Unlike the conventional approaches, the source base/enhancement data and their own parities in the proposed method are not transmitted together but are transferred over different paths. Therefore, the effect of burst packet losses can be effectively reduced for the descriptions. Furthermore, in order to minimize the overall distortion for the LS-MDC system and exploit the benefits of path diversity, we also propose an optimal rate allocation scheme that can adaptively control the transmission rate as well as the channel coding rate for media senders. Experiments show that the proposed method provides much better peak signal-to-noise ratio (PSNR) than conventional MDC techniques.