• Title/Summary/Keyword: 헬로우 메시지

Search Result 2, Processing Time 0.016 seconds

An Efficient Route Maintenance Scheme Utilizing Hello Messages for AODV-based Ad Hoc Networks (AODV 기반 애드 혹 네트워크에서 헬로우 메시지를 이용한 효과적인 경로 유지 기법)

  • 서재홍;김기형;서현곤
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.3
    • /
    • pp.280-288
    • /
    • 2004
  • In Ad Hoc Networks, a connection breaks due to the irregular movement of mobile nodes and the inherent characteristics of the wireless medium such as the interference and the multi-path fading. AODV, a typical on-demand routing protocol in Ad Hoc networks, uses the local repair mechanism to cope with the connection breaks. This paper proposes an efficient route maintenance scheme for AODV, named as AODV-ERM, by utilizing hello messages. The proposed AODV-ERM scheme can recover some link breaks efficiently without relying on the expensive local repair process, thereby reducing the repair time. To show the effectiveness of the proposed scheme, we performed extensive simulation with NS2. The simulation results show that the proposed scheme can reduce the repair time effectively and thus, increase the overall packet delivery ratio.

An Efficient Route Discovery using Adaptive Expanding Ring Search in AODV-based MANETs (AODV 기반의 MANET에서 적응적인 확장 링 검색을 이용한 효율적인 경로 탐색)

  • Han, Seung-Jin
    • The KIPS Transactions:PartC
    • /
    • v.14C no.5
    • /
    • pp.425-430
    • /
    • 2007
  • Without the aid of stationary infrastructure, maintaining routing information for all nodes is inefficient in the Mobile Ad hoc Networks(MANET). It is more efficient when every time routing information is necessary that the source node broadcasts a query message to neighbour nodes. The source node using Ad hoc On-Demand distance Vector(AODV), which is one of the routing protocols of MANET, uses the Expanding Ring Search(ERS) algorithm which finds a destination node efficiently. In order to reduce the congestion of the network, ERS algorithm does not broadcast Route REQuest(RREQ) messages in the whole network. When the timer expires, if source node does not receive Route REPly(RREP) messages from the destination node, it gradually increases TTL value and broadcasts RREQ messages. Existing AODV cost a great deal to find a destination node because it uses a fixed NODE_TRAVERSAL_TIME value. Without the message which is added in existing AODV protocols, this paper measures delay time among the neighbours' nodes by making use of HELLO messages. We propose Adaptive ERS(AERS) algorithm that makes NET_TRAVERSAL_TIME optimum which apply to the measured delay time to NODE_TRAVERSAL_TIME. AERS suppresses the unnecessary messages, making NET_TRAVERSAL_TIME optimum in this paper. So we will be able to improve a network performance. We prove the effectiveness of the proposed method through simulation.