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

Keyword Search Result

[Keyword] relative speed(2hit)

1-2hit
  • Frame Length Control for Wireless LANs in Fast Mobile Environments

    Ryoichi SHINKUMA  Takayuki YAMADA  Tatsuro TAKAHASHI  

     
    PAPER

      Vol:
    E91-A No:7
      Page(s):
    1580-1588

    In this paper, we propose a novel solution to improving wireless channel quality of wireless local area networks (WLANs) in fast-mobile environments, which uses a media-access-control (MAC) layer approach: adaptive frame-length control and block acknowledgement (ACK). In fast-mobile environments, using short frame lengths can suppress channel estimation error and decrease frame errors. However, it increases the MAC overhead, resulting in decreased throughput. To solve this tradeoff, we combined block ACK, which is specified in IEEE802.11e as an optional function, with adaptive frame-length control. Although adaptive frame-length control considering this tradeoff has previously been investigated, the targets were different from WLANs using orthogonal frequency division multiplexing (OFDM) in fast-mobile environments. The MAC-overhead reduction using block ACK is suitable for our frame-length control because it does not change the frame format in the physical layer. Also, it is a new idea to use block ACK as a solution to improving channel quality in fast-mobile environments. In this paper, we evaluate our method through computer simulations and verify the effectiveness of adaptive frame-length control that can accommodate relative speeds.

  • 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.