The search functionality is under construction.

Author Search Result

[Author] Daichi KOMINAMI(2hit)

1-2hit
  • Mobile Network Architectures and Context-Aware Network Control Technology in the IoT Era Open Access

    Takanori IWAI  Daichi KOMINAMI  Masayuki MURATA  Ryogo KUBO  Kozo SATODA  

     
    INVITED PAPER

      Pubricized:
    2018/04/13
      Vol:
    E101-B No:10
      Page(s):
    2083-2093

    As IoT services become more popular, mobile networks will have to accommodate a wide variety of devices that have different requirements such as different bandwidth limitations and latencies. This paper describes edge distributed mobile network architectures for the IoT era based on dedicated network technology and multi-access edge computing technology, which have been discussed in 3GPP and ETSI. Furthermore, it describes two context-aware control methods that will make mobile networks on the network architecture more efficient, reliable, and real-time: autonomous and distributed mobility management and bandwidth-guaranteed transmission rate control in a networked control system.

  • Robust and Resilient Data Collection Protocols for Multihop Wireless Sensor Networks

    Daichi KOMINAMI  Masashi SUGANO  Masayuki MURATA  Takaaki HATAUCHI  

     
    PAPER

      Vol:
    E95-B No:9
      Page(s):
    2740-2750

    Robustness is one of the significant properties in wireless sensor networks because sensor nodes and wireless links are subjected to frequent failures. Once these failures occur, system performance falls into critical condition due to increases in traffic and losses of connectivity and reachability. Most of the existing studies on sensor networks, however, do not conduct quantitative evaluation on robustness and do not discuss what brings in robustness. In this paper, we define and evaluate robustness of wireless sensor networks and show how to improve them. By computer simulation, we show that receiver-initiated MAC protocols are more robust than sender-initiated ones and a simple detour-routing algorithm has more than tripled robustness than the simple minimum-hop routing algorithm.