Author Search Result

[Author] Tsuneo NAKANISHI(2hit)

1-2hit
  • Node Mobility Aware Routing for Mobile Ad Hoc Network

    Shinichi FURUSHO  Teruaki KITASUKA  Tsuneo NAKANISHI  Akira FUKUDA  

     
    LETTER

      Vol:
    E87-B No:7
      Page(s):
    1926-1930

    In ad-hoc on-demand routing algorithm, when a route is broken a relay node must perform error transaction and the source node must do rerouting to discover an alternate route. It is important to construct a stable route when route discovery occurs. In this paper, we use relative speeds among nodes as a measure of node mobility. Our routing algorithm chooses nodes of lower relative speed as relay nodes. As a result of our simulation, when there is one session in the network, our proposing algorithm can reduce the number of route breaks: about 3 times smaller than DSR. And our proposing algorithm can deliver more packets than DSR: 18% higher rate. However, in the congested traffic situation our algorithm should be improved.

  • Multipoint Relay Selections with QoS Support in Link State Routing Protocol for Multi-Hop Wireless Networks

    Takeaki KOGA  Shigeaki TAGASHIRA  Teruaki KITASUKA  Tsuneo NAKANISHI  Akira FUKUDA  

     
    PAPER-Multi-hop Wireless Network

      Vol:
    E92-A No:9
      Page(s):
    2218-2226

    In OLSR (Optimized Link State Routing Protocol), the multipoint relay mechanism has been introduced to minimize routing overhead for flooding control traffic. In order to achieve as low a routing overhead as possible, the selection of MPRs (multipoint relays) is designed to limit the overall number of such relays in the network. OLSR provides the shortest paths in terms of hops; however, it does not take into account the QoS (quality of service) requirements. Therefore, QOLSR (Quality OLSR), which adds a QoS extension to the OLSR, has been proposed. Although QOLSR provides the best QoS path, its selection process does not consider the number of MPRs, which causes an increase in the routing overhead. In this paper, we focus on the selection process of MPRs in link state QoS routing protocol. We propose three heuristics for high-efficiency selections: MIMS, MQES, and MCIS. The basic approach of these selections is to determine a smaller set of MPRs that provide better QoS paths between any two nodes. The main objective in doing so is to maximize the QoS effect while limiting the routing overhead. In addition, we evaluate the performance of the routing protocols with the proposed selections by simulation. The results indicate that MIMS and MCIS achieve high-efficiency selection; as compared to QOLSR, MIMS reduces the maintenance cost by 30%, while the throughput of the resultant path is decreased by 13%, and MCIS reduces the cost by 21% without any decrease in the throughput.

FlyerIEICE has prepared a flyer regarding multilingual services. Please use the one in your native language.