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

Author Search Result

[Author] Yuichi MIYAJI(3hit)

1-3hit
  • Energy Budget Formulation in Progress-Based Nearest Forwarding Routing Policy for Energy-Efficient Wireless Sensor Networks

    Sho SASAKI  Yuichi MIYAJI  Hideyuki UEHARA  

     
    PAPER-Wireless networks

      Pubricized:
    2017/07/14
      Vol:
    E100-D No:12
      Page(s):
    2808-2817

    A number of battery-driven sensor nodes are deployed to operate a wireless sensor network, and many routing protocols have been proposed to reduce energy consumption for data communications in the networks. We have proposed a new routing policy which employs a nearest-neighbor forwarding based on hop progress. Our proposed routing method has a topology parameter named forwarding angle to determine which node to connect with as a next-hop, and is compared with other existing policies to clarify the best topology for energy efficiency. In this paper, we also formulate the energy budget for networks with the routing policy by means of stochastic-geometric analysis on hop-count distributions for random planar networks. The formulation enables us to tell how much energy is required for all nodes in the network to forward sensed data in a pre-deployment phase. Simulation results show that the optimal topology varies according to node density in the network. Direct communication to the sink is superior for a small-sized network, and the multihop routing is more effective as the network becomes sparser. Evaluation results also demonstrate that our energy formulation can well approximate the energy budget, especially for small networks with a small forwarding angle. Discussion on the error with a large forwarding angle is then made with a geographical metric. It is finally clarified that our analytical expressions can obtain the optimal forwarding angle which yields the best energy efficiency for the routing policy when the network is moderately dense.

  • Adaptive Group Formation Scheme for Mobile Group Wireless Sensor Networks

    Mochammad Zen Samsono HADI  Yuichi MIYAJI  Hideyuki UEHARA  

     
    PAPER-Network

      Pubricized:
    2019/01/09
      Vol:
    E102-B No:7
      Page(s):
    1313-1322

    In this paper, we propose a novel group formation scheme which is integrated with an EMGC protocol in order to cope with dynamic group change. It uses a link expiration time and residual energy to form a stable link in a group. It also has a group merging procedure to decrease the number of groups. Furthermore, we develop two additional functions for the protocol, i.e., GL rotation and a stay connection procedure to diminish energy consumption of sensor nodes in the network. Simulation results show that the proposed protocol outperforms MBC, EMGCwoh, and EMGC protocols in terms of data delivery, network lifetime, and energy dissipation per round with various group change probabilities and percentages of groups.

  • An Energy-Efficient Mobile Group Clustering Protocol for Wireless Sensor Networks

    Mochammad Zen Samsono HADI  Yuichi MIYAJI  Hideyuki UEHARA  

     
    PAPER-Network

      Pubricized:
    2018/02/19
      Vol:
    E101-B No:8
      Page(s):
    1866-1875

    In this paper, we present an Energy-efficient Mobile Group Clustering (EMGC) protocol that supports group mobility and a group handover scheme. The mobile sensor nodes are divided into three categories, namely cluster heads, group leaders and group members. In our cluster formation and group handover scheme, group leaders and cluster heads do most of the communications to save on energy consumption during which group members are placed in the sleep condition. This scheme will reduce the number of control packets and frequent topology changes in the networks. Simulation results show that the EMGC protocol outperforms MN-LEACH, GMAC, MBC protocols in terms of energy dissipation and the number of data items received at a base station.