• Title/Summary/Keyword: 경로발견 프로토콜

Search Result 35, Processing Time 0.02 seconds

A Simple CBT-Based Overlay Multicast Protocol for Ad-Hoc Networks (Ad-Hoc 네트워크에서의 간단한 CBT 기반의 Overlay 멀티캐스트 프로토콜)

  • Yang, Ki-Seon;Lee, Won-Jun
    • Annual Conference of KIPS
    • /
    • 2003.05b
    • /
    • pp.1393-1396
    • /
    • 2003
  • 멀티캐스트 그룹의 멤버들만으로 트리를 구성하는 Overlay 멀티캐스트 프로토콜인 AMRoute은 이동이 빈번한 Ad hoc 네트워크 환경에서 중간 라우터의 이동에 대한 트리의 견고함으로 높은 데이터 전송을 제공하는 장점이 있으나, 네트워크의 변동으로 인하여 중복되는 전송 경로가 발생하여 대역폭이 낭비되는 효율성 문제를 가지고 있다. 본 논문에서는 기존의 AMRoute 제어 메시지에 각 멤버의 메쉬 링크 상태 정보가 추가된 제어 메시지를 통하여 멤버간에 장치 상태를 교환함으로써 AMRoute에서의 중복되는 전송 경로를 제거하여 대역폭의 낭비를 줄이는 방안을 제안한다. 본 논문에서 제안한 방안은 기존의 제어 메시지를 활용함으로써 적은 오버헤드로 새로운 메쉬 링크를 발견하여 기존의 AMRoute의 중복되는 전송 경로로 인한 대역폭의 낭비를 줄여 멀티캐스트의 성능을 향상시키는 효과를 기대할 수 있다.

  • PDF

The establishment of Proactive Routing Selection and Maintenance Algorithms for Mobile Ad Hoc Networks (이동 Ad Hoc 네트워크에서 사전 활성화 라우팅 선택과 관리유지 알고리즘의 구축)

  • Cho, Young-Joo;Lee, Yeo-Jin;Chung, Il-Yong
    • The KIPS Transactions:PartC
    • /
    • v.14C no.1 s.111
    • /
    • pp.73-80
    • /
    • 2007
  • In conventional on-demand mobile ad hoc routing algorithms, an alternate path is sought only after an active path is broken. It incurs a significant cost in terms of money and time in detecting the disconnection and establishing a new route. In this thesis, we propose proactive route selection and maintenance to conventional mobile ad hoc on-demand routing algorithms. The key idea for this research is to only consider a path break to be likely when the signal power of a received packet drops below an optimal threshold value and to generate a forewarning packet. In other words, if a path is lost with high probability, the neighboring node that may easily be cut off notifies the source node by sending a forewarning packet. Then the source node can initiate route discovery early and switched to a reliable path potentially avoiding the disconnection altogether. For the simulational study, network simulator(NS2) is used. The result of simulation shows that the algorithm significantly improves the performance of networks comparing to conventional on-demand routing protocols based on DSR and AODV in terms of packet delivery ratio, packet latency and routing overhead.

Study on Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (이동 Ad Hoc 망에 대한 동적 소스 라우팅 프로토콜에 관한 연구)

  • 하재승
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.9
    • /
    • pp.1219-1224
    • /
    • 2001
  • There can exist unidirectional links due to asymmetric property of mobile terminals or current wireless environments on practical mobile ad hoc networks. However, at present, the existing mobile ad hoc routing protocols are implemented to support only bidirectional links. Thus, in this paper, we extend the existing dynamic source routing protocol in order to implement a new routing protocol, which is fit to mobile ad hoc networks containing unidirectional links. For performance evaluation, we use combinations of mobility scenario files and connection pattern files from Carnegimelon Univ. We consider received data rate and average route discovery time as evaluation items, which are compared and evaluated for three suggested route discovery methods.

  • PDF

A Crossover Node Discovery and Local Repair Mechanism for Reducing the Signaling Delay of Resource Reservation on HMIPv6 Networks (HMIPv6 네트워크에서 자원예약 시그널링 지연을 줄이기 위한 크로스오버 노드 발견 및 지역적 자원 갱신 방안)

  • Byun, Hae-Sun;Lee, Mee-Jeong
    • The KIPS Transactions:PartC
    • /
    • v.15C no.1
    • /
    • pp.37-44
    • /
    • 2008
  • In order to minimize the signaling delay for a resource reservation on the new routing path after the handover of Mobile Node(MN) is completed, it is important to discover the crossover node where the old and new routing paths meet. With the 크로스오버 노드 being found, the signaling messages only need to be transferred on the changed part of the end-to-end path. The crossover node is generally discovered using the end-to-end Session ID(SID) of the established session between MN and Correspondent Node(CN). However, in the Hierarchical Mobile IPv6(HMIPv6) network, if the Mobile Anchor Point (MAP) reserves the resource by aggregate with the Home Agent(HA), the crossover node discovery cannot be performed in the general way since the aggregate SID that has established between the previous MAP and HA is different from the that of the current MAP and HA after MN's handover. In this paper, we propose a mechanism to discover the crossover node within the tunnel between the MAP and the HA in an HMIPv6 network, assuming that the Next Steps in Signaling(NSIS) is deployed for the resource reservation and the aggregate reservation is applied over the MAP and HA tunnel. The local repair required for the change of path is performed upon the crossover node discovery. The simulation results show that the proposed scheme reduces the signaling delay for the reservation and outperforms the existing scheme with respect to throughput during the handover.

AFLRS: An AODV-based Fast Local Repair Scheme in Ad Hoc Networks (AFLRS: 애드 혹 네트워크에서 AODV에 기반한 빠른 경로 복구 기법)

  • 서현곤;김기형;서재홍
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.1
    • /
    • pp.81-90
    • /
    • 2004
  • A Mobile Ad Hoc Network (MANET) is a collection of wireless mobile nodes dynamically self-organizing in arbitrary and temporary network topologies without the use of any existing network infrastructure. The AODV (Ad Hoc On-Demand Distance Vector) Protocol is one of the typical reactive routing protocols, in that mobile nodes initiate routing activities only in the presence of data packets in need of a route. In this paper, we focus upon the local repair mechanism of AODV. When a link is broken, the upstream node of the broken link repairs the route to the destination by initiating a local route discovery process. The process involves the flooding of AODV control messages in every node within a radius of the length from the initiating node to the destination. In this paper, we propose an efficient local repair scheme for AODV called AFLRS (AODV-based Fast Local Repair Scheme). AFLRS utilizes the existing routing information in the intermediate nodes which have been on the active route to the destination before a link break occurs. AFLRS can reduce the flooding range of AODV control messages and the route recovery time because it can repair route through the intermediate nodes. For the performance evaluation of the proposed AFLRS, we have simulated the local repair mechanisms by using NS2 and AODV-UU. The performance results show that AFLRS can achieve faster route recovery than the local repair mechanism of AODV.

The MCSTOP Algorithm about the Minimum Cost Spanning Tree and the Optimum Path Generation for the Multicasting Path Assignment (최적 경로 생성 및 최소 비용 신장 트리를 이용한 멀티캐스트 경로 배정 알고리즘 : MCSTOP)

  • Park, Moon-Sung;Kim, Jin-Suk
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.4
    • /
    • pp.1033-1043
    • /
    • 1998
  • In this paper, we present an improved multicasting path assignment algorithm based on the minimum cost spanning tree. In the method presented in this paper, a multicasting path is assigned preferentially when a node to be received is found among the next degree nodes of the searching node in the multicasting path assignment of the constrained steiner tree (CST). If nodes of the legacy group exist between nodes of the new group, a new path among the nodes of new group is assigned as long as the nodes may be excluded from the new multicasting path assignment taking into consideration characteristics of nodes in the legacy group. In assigning the multicasting path additionally, where the source and destination nodes which can be set for the new multicasting path exist in the domain of identical network (local area network) and conditions for degree constraint are satisfied, a method of producing and assigning a new multicasting path is used. The results of comparison of CST with MCSTOP, MCSTOp algorithm enhanced performance capabilities about the communication cost, the propagation delay, and the computation time for the multicasting assignment paths more than CST algorithm. Further to this, research activities need study for the application of the international standard protocol(multicasting path assignment technology in the multipoint communication service (MCS) of the ITU-T T.120).

  • PDF

An Internet Gateway Based Link State Routing for Infrastructure-Based Mobile Ad Hoc Networks (인프라구조 기반의 이동 애드혹 네트워크를 위한 인터넷 게이트웨이 중심의 링크상태 라우팅 프로토콜)

  • Lee, Sung Uk;Ngo, Chi-Trung;Han, Trung-Dinh;Kim, Je-Wook;Oh, Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.10
    • /
    • pp.859-876
    • /
    • 2012
  • Since the existing protocols separated mobility management part and routing protocol part in their design and used a flooding, they suffer from the high control overhead, thereby limiting performance. In this paper, we use a tree-based mobility management method and present a simple and efficient routing protocol that exploits the topology information which is built additionally through mobility management. Thus, the mobility management and the routing protocol closely cooperate to optimize control overhead. Furthermore, we use a progressive path discovery method to alleviate traffic congestion around IG and a unicast-based broadcast method to increase the reliability of message delivery and to judge link validity promptly. The proposed protocol reduces control overhead greatly and works in a stable manner even with the large number of nodes and high mobility. This was proven by comparing with the AODV protocol that employs the hybrid mobility management protocol.

The QoS support using DSR protocol In Mobile Ad-hoc Network (이동 애드혹 네트워크에서 DSR 프로토콜을 이용한 QoS 지원)

  • Park, Gyong-Bae;Kang, Kyoeng-In;Oh, Se-Duck
    • Journal of IKEEE
    • /
    • v.7 no.1 s.12
    • /
    • pp.63-71
    • /
    • 2003
  • In this paper, we propose an DSR(Dynamic Source Routing) protocol to support QoS for reliable data transmission in the mobile ad-hoc network. The proposed algorithm uses DSR protocol to support QoS as its basic routing protocol, and uses the nodes which are between source and destination nodes as key QoS support. Because of moving nodes there is some problem that is restricted reliable data transmission. For solve this problem, source node set up the QoS link with destination node. The nodes that are located at QoS link and find out loss of transmission path save the transmitting data packets. Those search a new transmission path to destination node and transmit the saved data packet to destination node. As the result of evaluation, we found the proposed QoS network guaranteed reliable data transmission with almost 100% data reception rate for slowly moving mobile ad-hoc network and with more 96% data reception rate, which is improvement of 3.7737% reception rate compared with none QoS network, for continuously fast moving mobile ad-hoc network.

  • PDF

Routing Protocol with QoS Support in ice Mobile Ad Hoc Networks (이동 애드 흑 네트워크에서의 QoS를 지원하는 라우팅 프로토콜)

  • 강경인;박경배;유충열;정찬혁;이광배
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.4C
    • /
    • pp.273-281
    • /
    • 2002
  • Recently, demand for real-time data and multimedia data is rapidly increasing, and it is impossible for mobile Ad Hoc networks with only best effort service to efficiently transfer such data. So, we absolutely need the QoS service which reserves the communication resources in advance. The existing routing protocols, which assume that the links between nodes are bidirectional, provide the convenience for the route discovery and maintenance, but can not support the routing function for the unidirectional links due to the wireless link property easily changing with time under the real wireless environment. In order to solve such problems, in this dissertation we suggested a unidirectional QoS routing a waste of communication resources. The waste of protocol that supports unidirectional links and reduces communication resources is reduced by establishing the shortest route suitable to QoS support, considering in advance the usable communication resources at each node.

A Load-Sharing Scheme using SCTP Multi-homing (SCTP 멀티호밍 특성을 활용한 부하 분산 기법)

  • Song Jeonghwa;Lee Meejeong
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.6
    • /
    • pp.595-607
    • /
    • 2004
  • Networks often evolve to provide a host with multiple access points to the Internet. In this paper, we propose a transport layer load distribution mechanism utilizing the multiple network interfaces simultaneously. We specifically propose an extension of Stream Control Transmission Protoco1 (SCTP) to have load sharing over multiple network interfaces. We named the particular service provided by the Proposed load sharing mechanism to be LS (Load Sharing) mode service. LS mode service is based on the following four key elements: (i) the separation of flow control and congestion control, (ii) congestion window based striping, (iii) redundant packet retransmission for fast packet loss recovery, (iv) a novel mechanism to keep track of the receiver window size with the SACKS even if they arrive out-of-order. Through simulations, it is shown that the proposed LS mode service can aggregate the bandwidth of multiple paths almost ideally despite of the disparity in their bandwidth. When a path with a delay of 100% greater is utilized as the second path, the throughput is enhanced about 20%.