• 제목/요약/키워드: 경로기반방식

Search Result 548, Processing Time 0.024 seconds

Enhanced Packet Transmission in Ad-hoc Networks using Unicast with Temporary Routing (애드혹 네트워크에서 임시 경로 설정 유니캐스트를 기반으로 한 향상된 멀티 홉 전송 기법)

  • Ko, Sung-Hyun;Yoo, Sung-Jae;Jung, Sou-Hwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.2
    • /
    • pp.131-140
    • /
    • 2011
  • Smart packet agent is an application that is proposed to provide routing protocol and service module in ubiquitous network environment. However, it uses multi-hop broadcast, thus it causes increasing network traffic, low-speed data transmission, and the unnecessary joining nodes. In this paper, a transmit technique that uses unicast-based multi-hop to have lower network traffic and faster transmission time than the multi-hop broadcast technique. In our scheme, u-Zone Master establishes temporary routing paths by calculating moving nodes' hop-counter. Therefore, it reduces smart packet agent's network traffic and retransmission rate. Besides, this paper proposed an UDP transmission that bases on sliding window. Hence, the Stop & Wait transmission speed is improved. The results, which are taken by analyzing performance prove that the proposed scheme has better performance.

QoS Mesh Routing Protocol for IEEE 802.16 based Wireless Mesh Networks (IEEE 802.16 기반의 무선 메쉬 네트워크를 위한 QoS 메쉬 라우팅 프로토콜)

  • Kim, Min;Kim, Hwa-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12A
    • /
    • pp.1226-1237
    • /
    • 2007
  • This paper proposes QoS mesh routing protocol for IEEE 802.16 based wireless mesh networks. QoS mesh routing protocol proposed in this paper is a proactive hop-by-hop QoS routing protocol. The goal of our routing protocol is not only to find a route from a source to a destination, but also optimal route that satisfies QoS requirements, given in terms of bandwidth and delay as default QoS parameters. In this paper, we first analyze possible types of routing protocols that have been studied for MANET and show proactive hop-by-hop routing protocols are the most appropriate for wireless mesh networks. Then, we present a network model for IEEE 802.16 based wireless mesh networks and propose a proactive hop-by-hop QoS routing protocol. Through our simulation, we represent that our routing protocol outperforms QOLSR protocol in terms of end-to-end delay, packet delivery ratio and routing overhead.

On Comparison Of The Multicast Protocols Based On Qos (QoS 기반의 멀티캐스트 프로토콜 비교에 관한 연구)

  • Choi, Jun;Choi, Won-Hyuck;Lee, Tae-Seung;Kim, Jung-Sun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.05b
    • /
    • pp.1237-1240
    • /
    • 2003
  • 최근 대두되고 있는 멀티미디어 응용을 지원하기 위해서는 광대역 네트워크의 링크, 실시간 전송, 보다 효과적인 멀티캐스트 프로토콜이 요구된다. 멀티캐스트 프로토콜 알고리즘에는 DVMRP, MOSPF, CBT, PIM 구조의 멀티캐스팅 프로토콜 있다. 이는 네트워크 패킷의 특성을 송수신의 경로비용으로 라우터 자체의 근거리 알고리즘이 적용되고 있다. 본 연구에서는 인터넷에서 멀티캐스트 라우팅 프로토콜인 QosMIC를 제안한다. QosMIC는 멀티캐스트 네트워크에서 신뢰성과 능률적 자원관리와 탄력적인 방법으로 Qos특징을 제공한다. QosMIC는 확인된 다중경로에서 하나의 라우터를 선택하여 경로를 선택하고, 경로에서 요구하는 Qos를 제공한다. QosMIC는 데이터를 미리 제공하는 방식에 있어 이전의 프로토콜과 다르다. 본 연구에서는 QosMIC와 CBT를 분석하여 각 데이터 패킷 전송을 위한 공정하고 실용적인 대역폭 사용과 대역폭과 데이터처리능력을 시뮬레이션 상에서 구현하고 성능을 평가한다.

  • PDF

QoS-based Distributed LSP set-up scheme in MPLS networks (MPLS 네트워크에서 QoS를 고려한 LSP 생성)

  • 백성청;정태환;임경수;안순신
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04d
    • /
    • pp.268-270
    • /
    • 2003
  • DSPF/IS-IS extension과 같은 기존 constraint-based 라우팅 알고리즘은 링크 상태(Link State) 정보에 constraints를 포함해야 하기 때문에 네트워크의 대역폭을 많이 낭비하게 되고, 모든 경로 탐색 정보를 모아서 초기에 적합한 최적 경로를 유지하고 있으므로 서로 다른 노드에서 다양한 멀티미디어 서비스가 요구될 때 서비스별 QoS를 만족시키기 힘들어진다. 본 논문은 다양한 005가 요구되는 네트워크 트래픽 상황에 맞는 QoS 기반의 새로운 라우팅 알고리즘(QRDGSPA)을 제안하여 복잡한 계산 과정없이 유용 자원을 측정하는(measured) 방식으로 QoS5가 고려된 경로들 중 단일 또는 여러 개의 최적 경로를 선택할 수 있도록 하고, CR-LDP를 이용한 LSP Feedback을 적용하여 네트워크의 자원 상황을 미리 파악함으로써 MPLS 네트워크의 이용율을 극대화하고 효율적인 네트워크 운용이 가능하도록 한다.

  • PDF

Performance Analysis of UWA Communication System by Diversity in UWA Channel (수중 음향 다중 경로 채널에서 수중 음향 통신 시스템 성능 분석)

  • Lee, Hojun;Kang, Jiwoong;Ahn, Jongmin;Chung, Jaehak
    • The Journal of the Convergence on Culture Technology
    • /
    • v.3 no.4
    • /
    • pp.191-198
    • /
    • 2017
  • In this paper, we compare the transmission performance of Code Division Multiple Access (CDMA) and Orthogonal Frequency Division Multiplexing (OFDM) under long duration multipath channel environments. This paper generates underwater channels through Bellhop based on the underwater environmental data of the west sea. BER performance of CDMA and OFDM are analyzed through various underwater channels based on the channels. Computer simulations result show that CDMA has better performance than OFDM when multipath delay time of underwater channel is shorter than spreading factor (SF). However, OFDM has better BER performance than CDMA as multi-path delay time increases.

Performance Experimentation and an Optimal Iterative Coding Algorithm for Underwater Acoustic Communication (수중음향통신에서 최적의 반복부호 알고리즘 및 성능 실험)

  • Park, Gun-Yeol;Lim, Byeong-Su;Jung, Ji-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.11
    • /
    • pp.2397-2404
    • /
    • 2012
  • Underwater acoustic communication has multipath error because of reflection by sea-level and sea-bottom. The multipath of underwater channel causes signal distortion and error floor. In order to improve the performance, it is necessary to employ an iterative coding scheme. Among the iterative coding scheme, turbo codes and LDPC codes are dominant channel coding schemes in recent. This paper concluded that turbo coding scheme is optimal for underwater communications system in aspect to performance, coded word length, and equalizer combining. Also, decision directed phase recovery was used for correcting phase offset induced by multipath. Based on these algorithms, we confirmed the performance in the environment of oceanic experimentation.

Hardware based set-associative IP address lookup scheme (하드웨어 기란 집합연관 IP 주소 검색 방식)

  • Yun Sang-Kyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.8B
    • /
    • pp.541-548
    • /
    • 2005
  • IP lookup and forwarding process becomes the bottleneck of packet transmission as IP traffic increases. Previous hardware-based IP address lookup schemes using an index-based table are not memory-efficient due to sparse distribution of the routing prefixes. In this paper, we propose memory-efficient hardware based IP lookup scheme called set-associative IP address lookup scheme, which provides the same IP lookup speed with much smaller memory requirement. In the proposed scheme, an NHA entry stores the prefix and next hop together. The IP lookup procedure compares a destination IP address with eight entries in a corresponding set simultaneously and finds the longest matched prefix. The memory requirement of the proposed scheme is about $42\%$ of that of Lin's scheme. Thus, the set-associative IP address lookup scheme is a memory-efficient hardware based IP address lookup scheme.

Generation of Ship's Optimal Route based on Q-Learning (Q-러닝 기반의 선박의 최적 경로 생성)

  • Hyeong-Tak Lee;Min-Kyu Kim;Hyun Yang
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2023.05a
    • /
    • pp.160-161
    • /
    • 2023
  • Currently, the ship's passage planning relies on the navigator officer's knowledge and empirical methods. However, as ship autonomous navigation technology has recently developed, automation technology for passage planning has been studied in various ways. In this study, we intend to generate an optimal route for a ship based on Q-learning, one of the reinforcement learning techniques. Reinforcement learning is applied in a way that trains experiences for various situations and makes optimal decisions based on them.

  • PDF

Local Repair Routing Algorithm using Link Breakage Prediction in Mobile Ad Hoc Networks (모바일 애드 혹 네트워크에서 링크 단절 예측을 사용한 지역 수정 라우팅 알고리즘)

  • Yoo, Dae-Hun;Choi, Woong-Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.11A
    • /
    • pp.1173-1181
    • /
    • 2007
  • A number of routing algorithms have been studied for wireless mobile ad-hoc network. Among them, the AODV routing algorithm with on-demand method periodically transmits hello message and monitors link state during data transmission in order to maintain routing paths. When a path is disconnected, a node that senses it transmits a RERR packet to the transmitting node or transmits a RREQ locally so that the path could be repaired. With that, the control packet such as a RREQ is broadcast, which causes the consumption of bandwidth and incurs data latency. This paper proposes a LRRLBP algorithm that locally repairs a path by predicting link state before disconnecting the path based on the AODV routing protocol for solving such problems. Intensive simulations with the results using NS-2 simulator are shown for verifying the proposed protocol.

Clustering and Routing Algorithm for QoS Guarantee in Wireless Sensor Networks (무선 센서 네트워크에서 QoS 보장을 위한 클러스터링 및 라우팅 알고리즘)

  • Kim, Soo-Bum;Kim, Sung-Chun
    • The KIPS Transactions:PartC
    • /
    • v.17C no.2
    • /
    • pp.189-196
    • /
    • 2010
  • The LEACH does not use flooding method for data transmission and this makes low power consumption. So performance of the WSN is increased. On the other hand, QoS based algorithm which use restricted flooding method in WSN also achieves low power consuming rate by reducing the number of nodes that are participated in routing path selection. But when the data is delivered to the sink node, the LEACH choose a routing path which has a small hop count. And it leads that the performance of the entire network is worse. In the paper we propose a QoS based energy efficient clustering and routing algorithm in WSN. I classify the type of packet with two classes, based on the energy efficiency that is the most important issue in WSN. We provide the differentiated services according to the different type of packet. Simulation results evaluated by the NS-2 show that proposed algorithm extended the network lifetime 2.47 times at average. And each of the case in the class 1 and class 2 data packet, the throughput is improved 312% and 61% each.