• Journal of Information Processing Systems
• /
• 제5권2호
• /
• pp.97-104
• /
• 2009

In this paper we propose a Differentiated Services Based Admission Control and Routing Algorithm for IPv6 (ACMRA). The basic DiffServ architecture lacks an admission control mechanism, the injection of more QoS sensitive traffic into the network can cause congestion at the core of the network. Our Differentiated Services Based Admission Control and Routing Algorithm for IPv6 combines the admission control phase with the route finding phase, and our routing protocol has been designed in a way to work alongside DiffServ based networks. The Differentiated Services Based Admission Control and Routing Algorithm for IPv6 constructs label switched paths in order to provide rigorous QoS provisioning. We have conducted extensive simulations to validate the effectiveness and efficiency of our proposed admission control and routing algorithm. Simulation Results show that the Differentiated Services Based Admission Control and Routing Algorithm for IPv6 provides an excellent packet delivery ratio, reduces the control packets' overhead, and makes use of the resources present on multiple paths to the destination network, while almost each admitted flow shows compliance with its Service Level Agreement.

• 한국통신학회논문지
• /
• 제27권6C호
• /
• pp.544-561
• /
• 2002

본 논문에서는 이동 ad-hoc 네트워크(Mobile Ad-hoc Networks)에서 인접 단말(node)간에만 경로 설정 정보를 교환하는 협의의 네트워크인 가상 클러스터(Virtual Cluster)를 정의하고, 이를 기반으로 하는 새로운 형태의 혼합 방식 경로 설정 프로토콜(Virtual Cluster-based Routing Protocol. VCRP)을 제안한다. 이는 단말이 전체 네트워크의 구성 및 비용 정보를 알고 즉시 경로를 설정할 수 있는 Proactive Routing Protocol (PRP)이 갖는 짧은 전송 지연시간의 장점과 모든 단말이 자신을 제외한 어떠한 단말과도 정보를 교환하지 않고 단지 경로탐색 패킷(Route Query Packet)에 의존하여 동작하는 Reactive Routing Protocol (RRP)이 갖는 우수한 오버헤드 효율성의 장점을 동시에 만족하도록 설계된 방식이다. 이는 경로탐색 패킷이 가상 클러스터가 갖는 장점을 이용하여 적은 오버헤드로 신속하게 네트워크 토폴로지 정보의 수집이 가능한 형태로 수정된 전파(flooding) 기법에 기인한 것이다. 또한, 제안 방식은 수집된 정보를 기반으로 최적 경로뿐만 아니라 부수적으로 백업 경로를 동시에 파악할 수 있기 때문에 이를 이용하는 프로토콜(Virtual Cluster-based Routing Protocol with Backup Route: VCBRP)도 고려하였다. VCRP와 VCBRP 방식은 네트워크 토폴로지 변화에 대해 강인한 특성을 지니며, 동시에 패킷 전송 지연(Packet Transfer Delay), 링크 단절률(Link Failure Ratio), 그리고 무선 자원 수율(Throughput) 및 오버헤드 효율성의 성능이 기존의 경로 설정 프로토콜들에 비해 우수함을 모의 실험을 통해 검증했다.

• 한국멀티미디어학회논문지
• /
• 제10권12호
• /
• pp.1733-1740
• /
• 2007

In this paper, we propose a wireless location-based routing algorithm which uses the location information of its neighbor nodes and a destination node. At first, the proposed routing algorithm forwards a packet to the X direction by selecting a closest node to its destination as a next hop in terms of the X coordinate until the packet reaches closely to the packet's destination. Then the packet is forwarded to the Y direction by selecting a closest node to its destination in terms of the Y coordinate. We use a back off mechanism in case that a next hop cannot be found using the proposed routing algorithm, which resolves loops while forwarding. The experimental results show that the proposed routing algorithm performs well like the existing routing algorithms Ad hoc On-demand Distance Vector and Greedy Perimeter Stateless Routing. It is expected to use the proposed routing algorithm in the digital battlefield of military environments and survival games of commercial environments.

• 디지털산업정보학회논문지
• /
• 제16권2호
• /
• pp.61-68
• /
• 2020

Nuclear power plants have a lower cost of power generation, and they are more eco-friendly than other power generation plants. Also, we need to prepare nuclear plant accidents because of their severe damage. In the event of a safety accident, such as a radiation leak, by applying a wireless sensor network to a nuclear power plant, many sensor nodes can be used to monitor radiation and transmit information to an external base station to appropriately respond to the accident. However, applying a wireless sensor network to nuclear power plants requires routing protocols that consider the sensor network size and bypass obstacles such as plant buildings. In general, the hierarchical-based routing protocols are efficient in energy consumption. In this study, we look into the problems that may occur if hierarchical-based routing protocols are applied to nuclear power plants and propose improved routing protocols to solve these problems. Simulation results show that the proposed routing protocol is more effective in energy consumption than the existing LEACH protocol.

• 한국산학기술학회논문지
• /
• 제14권4호
• /
• pp.1969-1975
• /
• 2013

ICN(Information-Centric Network)은 인터넷 상에 존재하는 방대한 정보를 효율적으로 이용하기 위하여 기존의 인터넷 통신 패러다임을 정보 기반의 통신 방법으로 전환하기 위한 차세대 인터넷 통신 기술이다. 따라서 ICN은 호스트 주소를 중심으로 통신 절차에 집중하던 기존 인터넷 통신 기술과는 달리 인터넷 상에 존재하는 모든 것을 정보라는 개념으로 정의함으로써 각 정보를 이용하기 위한 통신 목적에 집중한다. 이를 위하여 ICN에서는 각 정보에 이름을 붙여 사용하는 이름 기반 라우팅(NbR, Name-based Routing) 방법을 사용하며 ICN에 참여하는 모든 라우터는 각 라우터 마다 정보를 공유할 수 있도록 물리적인 스토리지를 가지는 특징이 있다. ICN에서의 NbR 방법은 각 라우터에서 보유하고 있는 스토리지에 도달하는 방법에 따라 one-phase routing과 two-phase routing으로 나뉜다. 그러나 현재 제시되고 있는 ICN에서의 NbR 방법은 ICN이 가지고 있는 고유한 특징을 반영하지 못하고 있기 때문에 많은 문제점을 발생시키고 있다. 따라서 본 논문에서는 ICN을 위한 효율적인 NbR 방법을 제시하기 위하여 정보에 대한 캐싱, 접근 시간, 분산, 이동성, 확장성, 배포 측면에서 NbR 이슈들을 점검하고, ICN을 위해 제안된 기존 방법들에 대한 비교 분석을 수행하였다. 또한 분석된 내용을 기반으로 ICN에서의 효율적인 NbR 기법에 대한 연구 방향을 제시하였다.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2001년도 The Pacific Aisan Confrence On Intelligent Systems 2001
• /
• pp.50-58
• /
• 2001

Modern day networks are increasingly moving towards peer to peer architecture where routing tasks will not be limited to some dedicated routers, but instead all computers in a network will take part in some routing task. Since there are no specialized routers, each node performs some routing tasks and information passes from one neighbouring node to another, not in the form of dumb data, but as intelligent virtual agents or active code that performs some tasks by executing at intermediate nodes in its itinerary. The mobile agents can run, and they are free to d other tasks as the agent will take care of the routing tasks. The mobile agents because of their inherent 'intelligence'are better able to execute complex routing tasks and handle unexpected situations as compared to traditional routing techniques. In a modern day dynamic network users get connected frequently, change neighbours and disconnect at a rapid pace. There can be unexpected link failure as well. The mobile agent based routing system should be able to react to these situations in a fact and efficient manner so that information regarding change in topology propagates quickly and at the same time the network should not get burdened with traffic. We intend to build such a system.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.7-8
• /
• 2007

In this paper, an efficient routing algorithm for the heterogeneous home network in which IEEE 802.15.4 compensates for limitations of PLC based home networks. The efficient routing algorithm changes the broadcast period of routing information frame according to the mobility of the node. We implemented the routing algorithm and built a test-bed.

• 한국통신학회논문지
• /
• 제35권6A호
• /
• pp.538-546
• /
• 2010

This paper presents an overview of position-based routing algorithms. We analyze performances of routing algorithms such as Hybrid Opportunistic Forwarding (HOF), Opportunistic multi-hop routing (ExOR), Location based Geocasting and Forwarding (LGF), and Greedy Forwarding in nearest with forward Progress (GFP) routing algorithms to find the best one in terms of packet error rate and throughput efficiency over effects of fading and noise variance in wireless networks. The analyses in closed form expressions are confirmed by the simulation results, which fully agree to analysis results. Additionally, the simulation results indicate significant differences among algorithms when varying the average SNR or the number of relays.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권2호
• /
• pp.649-663
• /
• 2012

We propose a percolation based M2M networking architecture and its data transmission method. The proposed network architecture can be server-free and router-free, which allows us to operate routing efficiently with percolations based on six degrees of separation theory in small world network modeling. The data transmission can be divided into two phases: routing and data transmission phases. In the routing phase, probe packets will be transmitted and forwarded in the network thus multiple paths are selected and performed based on the constriction of the maximum hop number. In the second phase, the information will be encoded, say, with the fountain codes, and transmitted using the paths generated in the first phase. In such a way, an efficient routing and data transmission mechanism can be built, which allow us to construct a low-cost, flexible and ubiquitous network. Such a networking architecture and data transmission can be used in many M2M communications, such as the stub network of internet of things, and deep space networking, and so on.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2003년도 춘계학술대회논문집
• /
• pp.61-66
• /
• 2003

Mobile IP has been designed only to maintain communication as they move form place to place, so it doesn't guarantee Quality of Service(QoS). QoS in mobile IP is important to provide multimedia and real-time applications services in mobile, and it is closely related to handoff delay. Therefore, handoff delay problem is actively studied to guarantee QoS as a main issue in mobile IP research area Next generation Mobile IPv6 resolve this problem somewhat, triangle problem for first packet and handoff delay still remain. In this paper, we suggest SNMP Information-based routing that adds keyword management method to Information-based routing in active network in order to resolve such a problem, and then suggest QoS controlled handoff based on SNMP Information-Based routing. After modeling of suggested method and existing handoff method simulations we carried out with NS-2 for performance evaluation. The results of simulations show the some improvement on handoff delay, and therefore on QoS improvement.