• Title/Summary/Keyword: Topology Update Delay Time

Search Result 2, Processing Time 0.02 seconds

A TEST Frame Application Technique for Improving Data Communication and Topology Update Function in Ad-Hoc Tactical Wireless Networks (Ad-Hoc 전술 무선 통신망에서 데이터 통신 및 토폴로지 갱신 기능 향상을 위한 TEST 프레임 적용 기법)

  • You, Ji-Sang;Baek, In-Cheol
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.10 no.1
    • /
    • pp.44-54
    • /
    • 2007
  • In the military field, according to the MIL-STD-188-220, which is an Ad-Hoc communication protocol used for sending out or receiving data and voice smoothly among nodes in the situation that wireless communication nodes move arbitrarily, data communication is cut off because nodes can not know topology changes perpetually in the link disconnection state due to node movement in the case that transmitters do not confirm whether data is delivered to receivers or not, and transmit only the data having routine precedence continuously. In order to solve this problem, we have proposed the technique that makes efficient data communication possible by achieving a rapid topology change detection and link information update using TEST frame. We have analyzed TEST frame application effects in the two aspects of the topology update delay time and the data transmission success ratio.

Adaptive Routing Scheme to Avoid Clusterhead Congestion in c-DSDV Routing Protocol (c-DSDV 라우팅 프로토콜에서 클러스터헤드의 혼잡 회피를 위한 적응적 라우팅 방법)

  • Oh, Hoon;Yun, Seok-Yeol;Vu, Trong Tuan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.3A
    • /
    • pp.219-224
    • /
    • 2008
  • In the c-DSDV routing protocol proposed to improve the scalability of DSDV, clusterheads manage a routing table that has only clusterheads as potential destinations and flood update request message to its neighbor clusterheads periodically or at the time of topology change. Accordingly, the convergence range of topology change by a single update request message was expanded nine times as wide as that of DSDV, increasing routing correctness; however, c-DSDV suffers from the congestion of clusterheads since data packets always go through clusterheads of the clusters on the routing path. To improve this problem, we propose an adaptive routing scheme that judges if detouring clusterhead is possible on the fly while packets are forwarded. As a result, a routing path length is shortened and an end-to-end delay is improved by the reduced queue length. It shows that the end-to-end delay is reduced by almost 40% through simulation.