• 한국컴퓨터정보학회논문지
• /
• 제14권7호
• /
• pp.97-103
• /
• 2009

본 논문의 무선 센서네트워크에서 사용할 수 있는 효율적인 라우팅 방법인 MP-DD (MultiPath-Direct Diffusion) 알고리즘을 제안한다. 기존의 DD(Directed Diffusion)에서는 하나의 경로만을 강화하여 사용하는 것과 달리 제안한 알고리즘은 다중 경로를 강화하면서, 해당 경로에 높여 있는 센서 노드의 남은 에너지 등급을 고려하여 에너지 레벨이 높은 경로에 따라 가중치를 부여하고, 몇 개의 다중경로를 이용하여 사용함으로써 에너지 소모를 감소시키고 동시에 네트워크에 전체적으로 에너지를 골고루 사용하게 할 수 있다. 시뮬레이션 결과에서는 이러한 센서 네트워크를 위한 단순한 라우팅 방법의 가능성을 증명하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2362-2378
• /
• 2017

To mitigate the performance degradation caused by performance anomaly, a number of channel assignment algorithms have been proposed for multi-rate wireless mesh networks. However, network conditions have not been fully considered for routing process in these algorithms. In this paper, a joint scheme called Multi-rate Dijkstra's Shortest path - Rate Separated (MDSRS) is proposed, combining routing metrics and channel assignment algorithm. In MDSRS, the routing metric are determined through the synthesized deliberations of link costs and rate matches; then the rate separated channel assignment is operated based on the determined routing metric. In this way, the competitions between high and low rate links are avoided, and performance anomaly problem is settled, and the network capacity is efficiently improved. Theoretical analysis and NS-3 simulation results indicate that, the proposed MDSRS can significantly improve the network throughput, and decrease the average end-to-end delay as well as packet loss probability. Performance improvements could be achieved even in the heavy load network conditions.

• 한국통신학회논문지
• /
• 제40권12호
• /
• pp.2450-2460
• /
• 2015

최근 IoT(Internet of Things)에 대한 관심이 증가함에 따라, IoT의 특징을 고려한 새로운 프로토콜에 대한 연구 및 표준화가 진행되고 있다. 그 중 RPL(IPv6 for Low-Power Lossy Network)는 IoT를 위해 표준화된 라우팅 프로토콜이다. RPL은 싱크 노드로부터 네트워크 전체로 플러딩 되는 DIO(DODAG Information Object) 메시지를 사용하여 라우팅 경로를 생성 및 관리한다. 그러나, 대규모 네트워크에서는 네트워크 전체에 DIO 메시지를 전파하는 데 많은 시간이 소모될 뿐만 아니라 싱크 노드 주변에서 데이터 패킷의 병목 현상이 발생하게 된다. 이러한 문제를 해결하기 위해서 라우팅 오버헤드 및 병목 현상을 감소시킬 수 있는 멀티 싱크 기반 접근법이 널리 활용된다. 이 논문에서는 멀티 싱크 기반 IoT 네트워크에 RPL 프로토콜을 적용 시 발생할 수 있는 '불필요한 경로 업데이트 문제'를 정의하고, 선택적인 경로 업데이트를 위한 2가지 기법인 Routing Metric based Path Update Decision 기법과 Immediate Successor based Path Update Decision 기법을 제안한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1846-1850
• /
• 2005

This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.

• 대한임베디드공학회논문지
• /
• 제5권3호
• /
• pp.157-167
• /
• 2010

One of the most famous proactive routing protocols, DSDV (Destination -Sequenced Distance-Vector), is based on the minimum hop count. This paper suggests BIMP(Bypass Information Multi-Path) DSDV routing protocol that this protocol could route reliably as it can take the information of the bypass for the solution of the problem on EHMP DSDV. In this paper, the protocol checks throughput, packet delivery delay, packet delivery ratio, number of management messages, packet transmit finish time, etc on the traffic compared to DSDV, HMP DSDV, and EHMP DSDV protocols.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.772-776
• /
• 2004

This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권6호
• /
• pp.1063-1079
• /
• 2010

Vehicle ad hoc networks (VANET) are one of the most important technologies to provide various ITS services. While VANET requires rapid and reliable transmission, packet transmission in VANET is unstable because of high mobility. Many routing protocols have been proposed and assessed to improve the efficiency of VANET. However, topology-based routing protocols generate heavy overhead and long delay, and position-based routing protocols have frequent packet loss due to inaccurate node position. In this paper, we propose a position-based routing repair algorithm to improve the efficiency of VANET. This algorithm is proposed based on the premise that AODV (-PGB) can be used effectively in VANET, if the discovery, maintenance and repair mechanism of AODV is optimized for the features of VANET. The main focus of this algorithm is that the relay node can determine whether its alternative node exits and judge whether the routing path is disconnected. If the relay node is about to swerve from the routing path in a multi-hop network, the node recognizes the possibility of path loss based on a defined critical domain. The node then transmits a handover packet to the next hop node, alternative nodes and previous node. The next node repairs the alternative path before path loss occurs to maintain connectivity and provide seamless service. We simulated protocols using both the ideal traffic model and the realistic traffic model to assess the proposed algorithm. The result shows that the protocols that include the proposed algorithm have fewer path losses, lower overhead, shorter delay and higher data throughput compared with other protocols in VANET.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2001년도 가을 학술발표논문집 Vol.28 No.2 (3)
• /
• pp.805-807
• /
• 2001

네트워크상의 자원을 효율적으로 사용하기 위한 방범의 하나로 다중 경로 라우팅(multi-path routine)이 있다. 트래픽 엔지니어링(traffic engineering)을 위하여 다중 경로 라우팅을 이용하면 트래픽(traffic) 을 여러 경로로 분산 시켜 트래픽이 한 곳으로 집중하는 현상은 제거 할 수 있을 뿐 아니라 네트워크 상의 유휴자원을 효율적으로 사용할 수 있는 장점이 있다. 본 논문에서는MPLS환경 하에서 다중 경로 라우팅을 효율적으로 사용하기 위해 제안 되었던 알고리즘에 대하여 분석 하고 각 알고리즘들의 장단점을 비교한다. 그리고 효율적인 다중 경로 라우팅을 위해 추가적으로 필요한 요소를 기술하고, 새로운 다중 경로 라우팅을 위한 구조를 제안한다.

• 한국인터넷방송통신학회논문지
• /
• 제9권6호
• /
• pp.43-48
• /
• 2009

무선 메쉬 네트워크(Wireless mesh networks, WMNs)는 Ad-hoc 네트워크와는 달리 백본망 구조를 가지고 있기 때문에 이동성이 적고, 단말들이나 다른 망들과 다중경로로 통신이 가능하다. 무선 메쉬 네트워크에서는 기존의 ad-hoc 네트워크의 알고리즘을 보완한 ETX, ETT, MIC 등과 같은 라우팅 경로선정 메트릭이 제안되고 있다. 제안된 다양한 라우팅 메트릭에는 최소의 흡수를 고려하는 Hop_count, 링크 품질을 고려하는 ETX(Expected Transmission Count)나 ETT(Expected Transmission Time)와 같은 metric이 존재한다. 하지만 ETX의 경우 전송률을 구할 때 각 방향에서 측정패킷의 조건이 달라 실질적인 전송률을 제공해주지 못한다는 단점이 있다. 본 논문에서는 ETX를 개선하여 hop_count를 반영하고, 실질 전송률을 고려하는 IETC(Improved Expected Transmission with hop count)를 제안하였다. 실험을 통해 제안된 메트릭이 전송율과 경로 선정에 있어서 기존 메트릭보다 나은 결과를 보였다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2001년도 봄 학술발표논문집 Vol.28 No.1 (A)
• /
• pp.367-369
• /
• 2001

GSPA(Generic Shortest Path Algorithm)은 각종 정보통신 네트워크 상에서 멀티미디어 정보전송시 요구되는 QoS 기반의 라우팅을 위한 새로운 라우팅 알고리즘이다. 전체적인 동작은 원시노드(Source Node)에서 목적노드(Destination Node) 사이에서 이전 단계의 재귀호출에서 찾은 최단 경로를 기준으로 해서 이웃 노드들을 대상으로 재귀호출을 통해서 QoS 요구조건을 만족하는 경로정보를 기록하면서 최단 경로를 찾는 알고리즘이다. GSPA는 기존 Distance Vector 알고리즘이 경로를 설정하기 위해 많은 시간과 대역폭을 낭비하며 네트워크 형상이 수시로 변경될 때 “Counting to Infinity”현상을 발생시키는 단점을 보완하고, Link-State 데이터 베이스를 이용해서 함수 재귀호츨을 통해서 최단 경로를 찾아냄으로써 구현하기가 쉬운 알고리즘이다. 또, Distance-Vector와 Link-State 알고리즘의 장점을 수용하였으며, 이 알고리즘을 분산 네트워크 환경에서 동작하도록 수정하면 분산 네트워크 환경에서의 Hierarchical Routing, Multi-Path Routing, QoS Routing을 위한 기본 알고리즘으로 매우 좋은 특성들을 가지고 있다. 본 논문에서는 이 알고리즘을 소개하고 간단한 예를 통해 기본 동작에 대해 살펴본다.