• Title/Summary/Keyword: Packet bursting

Search Result 3, Processing Time 0.027 seconds

A Distance Adaptive Packet Bursting Scheme in Wireless Multihop Networks (무선 멀티홉 네트워크에서 거리 적응적 패킷 버스팅 기법)

  • Kim, Young-Duk;Kim, Jin-Wook;Kang, Won-Seok
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.733-734
    • /
    • 2008
  • In wireless multihop networks, most of on demand routing protocols suffer from performance degradation due to high mobility and channel errors. This problem is more serious as routing path increases. In this paper, we propose a new scheme which can improve network throughput by using distance adaptive packet bursting. The bursting mechanism is to transmit multiple packets after channel acquisition. Through the simulation, we show that our scheme is more efficient than existing methods.

  • PDF

A Solution for Congestion and Performance Enhancement using Dynamic Packet Bursting in Mobile Ad Hoc Networks (모바일 애드 혹 네트워크에서 패킷 버스팅을 이용한 혼잡 해결 및 성능향상 기법)

  • Kim, Young-Duk;Yang, Yeon-Mo;Lee, Dong-Ha
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.5
    • /
    • pp.409-414
    • /
    • 2008
  • In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To solve the congestion and achieve load balancing, many protocols have been proposed. However, the existing load balancing schemes has only considered avoiding the congested route in the route discovery procedure or finding an alternative route path during a communication session. To mitigate this problem, we have proposed a new scheme which considers the packet bursting mechanism in congested nodes. The proposed packet bursting scheme, which is originally introduced in IEEE 802.11e QoS specification, is to transmit multiple packets right after channel acquisition. Thus, congested nodes can forward buffered packets promptly and minimize bottleneck situation. Each node begins to transmit packets in normal mode whenever its congested status is dissolved. We also propose two threshold values to define exact overloaded status adaptively; one is interface queue length and the other is buffer occupancy time. Through an experimental simulation study, we have compared and contrasted our protocol with normal on demand routing protocols and showed that the proposed scheme is more efficient and effective especially when network traffic is heavily loaded.