The search functionality is under construction.

Author Search Result

[Author] Kosuke SANADA(10hit)

1-10hit
  • End-to-End Delay Analysis for IEEE 802.11 String-Topology Multi-Hop Networks

    Kosuke SANADA  Jin SHI  Nobuyoshi KOMURO  Hiroo SEKIYA  

     
    PAPER-Fundamental Theories for Communications

      Vol:
    E98-B No:7
      Page(s):
    1284-1293

    String-topology multi-hop network is often selected as an analysis object because it is one of the fundamental network topologies. The purpose of this paper is to establish expression for end-to-end delay for IEEE 802.11 string-topology multi-hop networks. For obtaining the analytical expression, the effects of frame collisions and carrier-sensing effect from other nodes under the non-saturated condition are obtained for each node in the network. For expressing the properties in non-saturated condition, a new parameter, which is frame-existence probability, is defined. The end-to-end delay of a string-topology multi-hop network can be derived as the sum of the transmission delays in the network flow. The analytical predictions agree with simulation results well, which show validity of the obtained analytical expressions.

  • A Novel Backoff Scheme and Its Throughput Analysis for Full Duplex MAC Protocols in Wireless LANs

    Shota SAKAKURA  Chikara FUJIMURA  Kosuke SANADA  Hiroyuki HATANO  Kazuo MORI  

     
    PAPER-Wireless Communication Technologies

      Pubricized:
    2020/03/03
      Vol:
    E103-B No:9
      Page(s):
    989-1001

    Wireless full duplex (FD) communication can double the point-to-point throughput. To fully realize the benefits of the FD technique in wireless local area networks (WLANs), it is important to design the medium access control (MAC) protocols for FD communications. In FD MAC protocols, when a node wins the channel contention and transmits a primary transmission, its destination node can start a secondary transmission triggered by the primary transmission. Each secondary transmitter transmits a data frame even if its backoff timer is not zero. However, the backoff scheme in the FD MAC protocols follows the conventional scheme based on the distributed coordination function (DCF). Therefore, the nodes with FD MAC initialize the contention window (CW) size to minimum CW (CWmin) after their successful secondary transmissions. Therefore, CW initialization in the FD MAC causes further collisions at stations (STAs), which degrades network throughput. This paper proposes a novel backoff scheme for FD MAC protocols. In the proposed scheme, the CW size and backoff timer are not initialized but kept the current value after secondary transmissions. The proposed scheme can mitigate frame collisions at STAs and increase FD-transmission opportunity in the network, and then enhance the throughput significantly. This paper presents comprehensive performance evaluation in simulations, including non-saturation and saturation conditions, and co-existence conditions with legacy half duplex (HD) STAs. For performance analysis, this paper establishes Markov-chain models for the proposed scheme. The analytical results show theoretically that the operation of the proposed scheme enhances network throughput. The simulation results and analytical results show the effectiveness of the proposed scheme.

  • Analytical Expressions for End-to-End Throughput of String-Topology Wireless Full-Duplex Multi-Hop Networks

    Chikara FUJIMURA  Kosuke SANADA  Kazuo MORI  

     
    PAPER-Network

      Pubricized:
    2018/12/25
      Vol:
    E102-B No:6
      Page(s):
    1160-1169

    Wireless Full-Duplex (FD) communication can double the point-to-point throughput. To obtain the full benefits of the FD technique in multi-hop networks, its potential throughput performance in multi-hop networks should be clarified qualitatively and quantitatively. Developing an analytical model for FD multi-hop networks is effective and useful for not only clarifying such network dynamics but also developing the optimal protocol design. However, generalized analytical expression for the end-to-end throughput of FD multi-hop networks has not been proposed. This paper proposes analytical expressions for the end-to-end throughput of string-topology wireless FD multi-hop networks. Our approach is to integrate with the analytical model of the airtime expression, which is an effective analytical approach of the throughput analysis for Half-Duplex (HD) multi-hop networks, and the Markov-chain model considering the FD MAC operation. The proposed model clarify the detailed effect of the FD MAC operation on the throughput performance in multi-hop networks. In particular, it can obtain the end-to-end throughput of FD multi-hop networks for arbitrary number of hops, arbitrary payload size and arbitrary value of the minimum contention window. The analytical expressions verified by comparisons with the simulation results. From the comparisons with the results in HD multi-hop networks, we confirm the effectiveness of the FD communication in multi-hop networks.

  • Novel Network Structure and its Clustering Scheme Based on Residual Power for Wireless Powered Wireless Sensor Networks

    Kazuhisa HARAGUCHI  Kosuke SANADA  Hiroyuki HATANO  Kazuo MORI  

     
    PAPER-Network

      Pubricized:
    2022/05/19
      Vol:
    E105-B No:12
      Page(s):
    1498-1507

    In wireless sensor networks (WSNs), wireless power transfer (WPT) has been studied as an energy-harvesting technique for prolonging their network lifetime. The WPT can supply power resources to sensor nodes (SNs) wirelessly, however, the reception (harvesting) power at SNs depends on their distance from a WPT equipment (WPTE), leading to the location-dependent non-uniformity in the reception power among SNs. For the fixed-located WPTE, SNs distant from the WPTE suffer from insufficient reception power. To handle this problem, this paper proposes a novel network structure introducing multiple hybrid access points (HAPs), which equip two functions of conventional cluster head function, including data collection and relay transmission, and WPT function. Then, these HAPs take terms providing both functions. By periodically rotating the HAP providing the WPT function, the location of the WPTE can be changed, which reduces the non-uniformity in the SN reception power. Also, this paper proposes a clustering scheme based on the residual power at SNs to reduce their power depletion under the proposed network structure. The evaluation results through computer simulation show that the proposed system reduces the non-uniformity in the SN reception power and the power depletion at the SNs and then improves the data collection rate, compared with the conventional systems.

  • Performance Analysis of Full Duplex MAC protocols for Wireless Local Area Networks with Hidden Node Collisions

    Kosuke SANADA  Kazuo MORI  

     
    PAPER-Terrestrial Wireless Communication/Broadcasting Technologies

      Pubricized:
    2019/12/25
      Vol:
    E103-B No:7
      Page(s):
    804-814

    Full duplex (FD) communication can potentially double the throughput of a point-to-point link in wireless communication. Additionally, FD communication can mitigate the hidden node collision problem. The MAC protocols for FD communications are classified into two types; synchronous FD MAC and asynchronous one. Though the synchronous FD MAC mitigates hidden node collisions by using control frame, overhead duration for each data frame transmission may be a bottleneck for the networks. On the other hand, the asynchronous FD MAC mitigates the hidden node collisions by FD communication. However, it wastes more time due to transmission failure than synchronous FD MAC. Clarifying the effect of two major FD MAC types on networks requires a quantitative evaluation of the effectiveness of these protocols in networks with hidden node collisions. This paper proposes performance analysis of FD MAC protocols for wireless local area networks with hidden node collisions. Through the proposed analytical model, the saturated throughputs in FD WLANs with both asynchronous and synchronous FD MAC for any number of STAs and any payload size can be obtained.

  • Small-World-Network Model Based Routing Method for Wireless Sensor Networks

    Nobuyoshi KOMURO  Sho MOTEGI  Kosuke SANADA  Jing MA  Zhetao LI  Tingrui PEI  Young-June CHOI  Hiroo SEKIYA  

     
    PAPER

      Vol:
    E99-B No:11
      Page(s):
    2315-2322

    This paper proposes a Watts and Strogatz-model based routing method for wireless sensor network along with link-exchange operation. The proposed routing achieves low data-collection delay because of hub-node existence. By applying the link exchanges, node with low remaining battery level can escape from a hub node. Therefore, the proposed routing method achieves the fair battery-power consumptions among sensor nodes. It is possible for the proposed method to prolong the network lifetime with keeping the small-world properties. Simulation results show the effectiveness of the proposed method.

  • Design and Analysis of Multi-Channel MAC Protocol with Channel Grouping in Wireless Ad-Hoc Networks

    Nobuyoshi KOMURO  Ryo MANZOKU  Kosuke SANADA  Jing MA  Zhetao LI  Tingrui PEI  Young-June CHOI  Hiroo SEKIYA  

     
    PAPER

      Vol:
    E99-B No:11
      Page(s):
    2305-2314

    This paper presents a Multi-channel MAC protocol with channel grouping for multi-channel ad-hoc networks. The proposed protocol has both concepts of the multiple rendezvous and the single control channel protocols, which were proposed as a MAC protocol for multi-channel ad-hoc network without centralized stations. In the proposed protocol, all the channels are divided into some groups and each group has a control channel. Network nodes circulate among the groups and channel negotiations are carried out on a control channel of the group. By applying the channel grouping, it is possible to enhance network throughput without reducing the channel-usage probability. Because there is an optimum group number for obtaining the highest throughput, this paper gives analytical expressions of maximum network throughput for the proposed protocol as a function of system parameters. The effectiveness of the proposed protocol is shown from simulation results. In addition, the validity of the analytical expressions is confirmed from quantitative agreements between analytical predictions and simulation results.

  • Throughput and Delay Analysis of IEEE 802.11 String-Topology Multi-Hop Network in TCP Traffic with Delayed ACK

    Kosuke SANADA  Hiroo SEKIYA  Kazuo MORI  

     
    PAPER-Network

      Pubricized:
    2017/11/20
      Vol:
    E101-B No:5
      Page(s):
    1233-1245

    This paper aims to establish expressions for IEEE 802.11 string-topology multi-hop networks with transmission control protocol (TCP) traffic flow. The relationship between the throughput and transport-layer function in string-topology multi-hop network is investigated. From the investigations, we obtain an analysis policy that the TCP throughput under the TCP functions is obtained by deriving the throughput of the network with simplified into two asymmetric user datagram protocol flows. To express the asymmetry, analytical expressions in medium access control-, network-, and transport layers are obtained based on the airtime expression. The expressions of the network layer and those of transport layer are linked using the “delayed ACK constraint,” which is a new concept for TCP analysis. The analytical predictions agree well with the simulation results, which prove the validity of the obtained analytical expressions and the analysis policy in this paper.

  • Adaptive K-Repetition Transmission with Site Diversity Reception for Energy-Efficient Grant-Free URLLC in 5G NR

    Arif DATAESATU  Kosuke SANADA  Hiroyuki HATANO  Kazuo MORI  Pisit BOONSRIMUANG  

     
    PAPER

      Pubricized:
    2023/10/11
      Vol:
    E107-B No:1
      Page(s):
    74-84

    The fifth-generation (5G) new radio (NR) standard employs ultra-reliable and low-latency communication (URLLC) to provide real-time wireless interactive capability for the internet of things (IoT) applications. To satisfy the stringent latency and reliability demands of URLLC services, grant-free (GF) transmissions with the K-repetition transmission (K-Rep) have been introduced. However, fading fluctuations can negatively impact signal quality at the base station (BS), leading to an increase in the number of repetitions and raising concerns about interference and energy consumption for IoT user equipment (UE). To overcome these challenges, this paper proposes novel adaptive K-Rep control schemes that employ site diversity reception to enhance signal quality and reduce energy consumption. The performance evaluation demonstrates that the proposed adaptive K-Rep control schemes significantly improve communication reliability and reduce transmission energy consumption compared with the conventional K-Rep scheme, and then satisfy the URLLC requirements while reducing energy consumption.

  • Throughput Analysis of WLANs in Saturation and Non-Saturation Heterogeneous Conditions with Airtime Concept

    Yin WAN  Kosuke SANADA  Nobuyoshi KOMURO  Gen MOTOYOSHI  Norio YAMAGAKI  Shigeo SHIODA  Shiro SAKATA  Tutomu MURASE  Hiroo SEKIYA  

     
    PAPER

      Vol:
    E99-B No:11
      Page(s):
    2289-2296

    This paper presents an analytical model for network throughput of WLANs, taking into account heterogeneous conditions, namely network nodes transmit different length frames with various offered load individually. The airtime concept, which is often used in multi-hop network analyses, is firstly applied for WLAN analysis. The proposed analytical model can cover the situation that there are saturation and non-saturation nodes in the same network simultaneously, which is the first success in the WLAN analyses. This paper shows the network throughput characteristics of four scenarios. Scenario 1 considers the saturation throughputs for the case that one or two length frames are transmitted at the identical offered load. Scenarios 2 and 3 are prepared for investigating the cases that all network nodes transmit different length frames at the identical offered load and identical length frames at the different offered loads, respectively. The heterogeneous conditions for not only frame length but also offered load are investigated in Scenario 4.