The search functionality is under construction.

Author Search Result

[Author] Masato SAITO(13hit)

1-13hit
  • Efficient Route Discovery Scheme in Ad Hoc Networks Using Routing History

    Mika MINEMATSU  Masato SAITO  Hiroto AIDA  Hideyuki TOKUDA  

     
    PAPER-Network

      Vol:
    E88-B No:3
      Page(s):
    1017-1025

    In this paper, we propose an efficient route discovery scheme for mobile ad hoc networks called Hop-Wise Limited broadcast (HoWL). Since nodes do not identify the location of other nodes, some of the routing protocols proposed for mobile ad hoc networks use network-wide broadcasts to discover a route. In contrast, HoWL limits the area of a route discovery by predicting the current location of the destination node using history of hop counts of previously used routes. We also introduce Characterized Environmental Indicators (CEI) which characterize environments for networks of mobile nodes. Specifically, environments can be characterized by three indicators: node density, average hop count of utilized routes, and frequency of link failure. We have implemented HoWL as an extension to DSR on GloMoSim network simulator. Quantitative and qualitative performance comparisons were evaluated between HoWL and its related work, Expanding Ring Search (RING) and LAR. The simulations show that HoWL performs best when low communication overhead is desired where up to 20% decrease over RING and three-fold decrease over LAR in the overhead were demonstrated. Thus, HoWL is most effective in overhead sensitive environments such as battery-limited sensor networks.

  • Throughput Improvement of CDMA Slotted ALOHA Systems

    Masato SAITO  Hiraku OKADA  Takeshi SATO  Takaya YAMAZATO  Masaaki KATAYAMA  Akira OGAWA  

     
    PAPER-Protocol

      Vol:
    E80-B No:1
      Page(s):
    74-80

    In this paper, we evaluate the throughput performance of CDMA Slotted ALOHA systems. To improve the throughput performance, we employ the Quasi-synchronous sequences and the Modified Channel Load Sensing Protocol as an access control procedure. As a result, we found a good throughput by the QS-sequences. By employing MCLSP, we can keep the maximum throughput even in high offered load and in the presence of a long access timing delay, which is one of the issue in satellite packet communication systems.

  • Diversity Reception and Interference Cancellation for Receivers Using Antenna with Periodically Variable Antenna Pattern Open Access

    Nobuhide KINJO  Masato SAITO  

     
    PAPER

      Vol:
    E104-A No:1
      Page(s):
    253-262

    In this paper, we propose a model of a diversity receiver which uses an antenna whose antenna pattern can periodically change. We also propose a minimum mean square error (MMSE) based interference cancellation method of the receiver which, in principle, can suffer from the interference in neighboring frequency bands. Since the antenna pattern changes according to the sum of sinusoidal waveforms with different frequencies, the received signals are received at the carrier frequency and the frequencies shifted from the carrier frequency by the frequency of the sinusoidal waveforms. The proposed diversity scheme combines the components in the frequency domain to maximize the signal-to-noise power ratio (SNR) and to maximize the diversity gain. We confirm that the bit error rate (BER) of the proposed receiver can be improved by increase in the number of arrival paths resulting in obtaining path diversity gain. We also confirm that the proposed MMSE based interference canceller works well when interference signals exist and achieves better BER performances than the conventional diversity receiver with maximum ratio combining.

  • New Quasi-Synchronous Sequences for CDMA Slotted ALOHA Systems

    Masato SAITO  Takaya YAMAZATO  Masaaki KATAYAMA  Akira OGAWA  

     
    PAPER

      Vol:
    E81-A No:11
      Page(s):
    2274-2280

    One of unique features of CDMA slotted ALOHA (CDMA S-ALOHA) is that user must synchronize his transmission to given slot. Thus orthogonal sequence as spreading sequence would achieve ideal throughput if each of packets accomplish perfect synchronization. In the presence of any ambiguity in synchronizations, however, quasi-synchronous (QS) sequences suit well with CDMA S-ALOHA system. In this paper, we introduce new QS-sequences obtained from the orthogonal Gold sequences and discuss their performance when applying to CDMA S-ALOHA systems. As a result, withstanding to access timing error, good performance is ensured with this sequence under the environment of AWGN, MAI (multiple access interference) and frequency non-selective fading, that is, micro or pico cellular systems and indoor wireless LANs.

  • Generation of Sets of Sequences Suitable for Multicode Transmission in Quasi-Synchronous CDMA Systems

    Masato SAITO  Takaya YAMAZATO  Hiraku OKADA  Masaaki KATAYAMA  Akira OGAWA  

     
    LETTER

      Vol:
    E84-B No:3
      Page(s):
    576-580

    In this letter, we present a method to generate sets of sequences suitable for multicode transmission in quasi-synchronous (QS) CDMA systems. We focus on Gold code but extension to orthogonal Gold code is straightforward. We show that by appropriate classification of sequences, it is possible to have sets whose cross correlation is small in QS situations.

  • Large Code Set for Double User Capacity and Low PAPR Level in Multicarrier Systems

    Khoirul ANWAR  Masato SAITO  Takao HARA  Minoru OKADA  

     
    PAPER-Communication Theory and Signals

      Vol:
    E91-A No:8
      Page(s):
    2183-2194

    In this paper, a new large spreading code set with a uniform low cross-correlation is proposed. The proposed code set is capable of (1) increasing the number of assigned user (capacity) in a multicarrier code division multiple access (MC-CDMA) system and (2) reducing the peak-to-average power ratio (PAPR) of an orthogonal frequency division multiplexing (OFDM) system. In this paper, we derive a new code set and present an example to demonstrate performance improvements of OFDM and MC-CDMA systems. Our proposed code set with code length of N has K=2N+1 number of codes for supporting up to (2N+1) users and exhibits lower cross correlation properties compared to the existing spreading code sets. Our results with subcarrier N=16 confirm that the proposed code set outperforms the current pseudo-orthogonal carrier interferometry (POCI) code set with gain of 5 dB at bit-error-rate (BER) level of 10-4 in the additive white Gaussian noise (AWGN) channel and gain of more than 3.6 dB in a multipath fading channel.

  • A Proximity-Based Path Compression Protocol for Mobile Ad Hoc Networks

    Masato SAITO  Hiroto AIDA  Yoshito TOBE  Hideyuki TOKUDA  

     
    PAPER-Ad Hoc Network

      Vol:
    E87-B No:9
      Page(s):
    2484-2492

    This paper presents a path compression protocol for on-demand ad hoc network routing protocols, which is called dynamic path shortening (DPS). In DPS, active route paths adapt dynamically to node mobility based on the "local" link quality estimation at each own node, without exchanging periodic control packets such as Hello messages. Each node monitors its own local link quality only when receiving packets and estimates whether to enter the "proximity" of the neighbor node to shorten active paths in a distributed manner. Simulation results of DPS in several scenarios of various node mobility and traffic flows reveal that adding DPS to DSR which is the conventional prominent on-demand ad hoc routing protocol significantly reduces the end-to-end packet latency up to 50-percent and also the number of routing packets up to 70-percent over the pure DSR, in heavy traffic cases. We also demonstrate the other simulation results obtained by using our two novel mobility models which generate more realistic node mobility than the standard random waypoint mobility model: Random Orientation Mobility and Random Escape Mobility models. Finally, simple performance experiments using DPS implementation on FreeBSD OS demonstrate that DPS shortens active routes in the order of milliseconds (about 5 ms).

  • Throughput Performance of CDMA Slotted ALOHA Systems Based on Average Packet Success Probability Considering Bit-to-Bit Dependence

    Masato SAITO  Takaya YAMAZATO  Masaaki KATAYAMA  Akira OGAWA  

     
    PAPER-Spread Spectrum Technologies and Applications

      Vol:
    E84-A No:2
      Page(s):
    653-659

    We propose the analytical calculation method of average packet success probability of CDMA Slotted ALOHA systems, which derives accurate probability, and that is applicable to the system with any spreading codes and any amplitude distributions. In the method, we consider the bit-to-bit dependence of amplitude of signals, used spreading sequences, relative timing delays, and relative carrier phases. This bit-to-bit dependence is the case that the parameters above mentioned are constant for a slot time. By using the method to obtain the average packet success probability, we derive useful throughput performance of CDMA Slotted ALOHA systems on fading channel, and show that the normalized throughput becomes worse in the case of larger spreading factor.

  • The Enhancement on Communication Stability in MANETs with Unit Disk Graph Model

    Makoto TAKIZAWA  Hiroto AIDA  Masato SAITO  Yoshito TOBE  Hideyuki TOKUDA  

     
    PAPER

      Vol:
    E89-D No:5
      Page(s):
    1644-1653

    In this paper, we present a novel forwarding scheme to enhance communication stability based on geographic routing in mobile ad hoc networks, which is called "Position-based Heuristic Forwarding" (PHF). For alternative solutions to traditional ad hoc routings, many geographic routing algorithms have been proposed. Most of the existing routings impose a certain restriction, planarity, on the graph structure of network for delivering messages to destination definitely. PHF achieves the guaranteed packet delivery over Unit Disk Graph, which is more widely employed graph model for the study of ad hoc networks. Accordingly, to eliminate the restriction of the routing algorithms enhances the probability to deliver messages successfully in networks with high nodes' mobility rate. In the simulation of PHF, we have evaluated the performance comparisons between PHF and its related work, Greedy Perimeter Stateless Routing (GPSR) and Dynamic Source Routing (DSR), which are the prominent geographic and conventional topology-based routing protocols, respectively. The results show that PHF provides higher packet delivery success rate indicating better communication stability and equal or less overhead than these work.

  • Periodic Reactance Time Functions for 2-Element ESPAR Antennas Applied to 2-Output SIMO/MIMO Receivers

    Kosei KAWANO  Masato SAITO  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2018/10/22
      Vol:
    E102-B No:4
      Page(s):
    930-939

    In this paper, we propose a periodic reactance time function for 2-element electronically steerable passive array radiator (ESPAR) antennas applicable to the receivers of both single-input multiple-output (SIMO) and multiple-input multiple-output (MIMO) systems with 2 outputs. Based on the proposed function, we evaluate the power patterns of the antenna for various distances between two antenna elements. Moreover, for the distances, we discuss the correlation properties and the strength of the two outputs to find the appropriate distance for the receiver. From the discussions, we can conclude that distances from 0.1 to 0.35 times the wavelength are effective in terms of receive diversity.

  • Performance Analysis of Source-Destination ARQ Scheme for Multiroute Coding in Wireless Multihop Networks

    Hiraku OKADA  Masato SAITO  Tadahiro WADA  Kouji OHUCHI  

     
    PAPER-Terrestrial Radio Communications

      Vol:
    E90-B No:8
      Page(s):
    2111-2119

    For reducing bit errors on wireless channels, we have proposed the multiroute coding scheme on multiple routes for wireless multihop networks. In this paper, we introduce ARQ to our multiroute coding scheme. In our multiroute coding scheme, a destination node combines and decodes subpackets which are encoded and divided by a source node. Each intermediate node relays a subpacket, that is, only a part of a packet. Therefore, intermediate nodes cannot detect packet errors, and only a destination node can do so after combining and decoding subpackets. We propose an ARQ scheme between a source node and a destination node. We analyze the proposed ARQ scheme and evaluate the system performance.

  • New Analytical Model for TCP in Wireless Environments

    Katsuhiro NAITO  Hiraku OKADA  Masato SAITO  Takaya YAMAZATO  Masaaki KATAYAMA  

     
    PAPER

      Vol:
    E85-A No:7
      Page(s):
    1501-1510

    We propose a new analytical model of Transmission Control Protocol (TCP) in wireless environments where transmission errors occur frequently. In our proposed model, we consider the exponential increase of a congestion window and the exponential increase of a timeout back-off. Finally, we have clarified the behavior of TCP mechanisms of different versions and TCP throughput characteristics analytically. From our result, the behavior of TCP mechanisms is different in each implementation version. These differences mean that the required characteristics of wireless links are different in each implementation version. Therefore, our proposed model is a base analysis of designing wireless link mechanisms.

  • CDMA ALOHA Systems with Modified Channel Load Sensing Protocol for Satellite Communications

    Hiraku OKADA  Masato SAITO  Takeshi SATO  Takaya YAMAZATO  Masaaki KATAYAMA  Akira OGAWA  

     
    PAPER

      Vol:
    E79-A No:12
      Page(s):
    2035-2042

    The one of the problems in the satellite packet communication system is the existence of a long time delay, which may cause an improper packet access control resulting in a great deal of degradation of the system performance. In this paper, we clarify the effect of long time delay on the performance of CDMA ALOHA systems and then propose a new access control protocol, called Modified Channel Load Sensing Protocol (MCLSP), for the CDMA ALOHA systems. As a result, we show that a significant improvement in the throughput performance was obtained with MCLSP even in the presence of a long time delay.