• 대한전자공학회논문지TC
• /
• 제39권6호
• /
• pp.1-1
• /
• 2002

본 논문은 기존의 Topology Aggregation 알고리즘에 따른 성능을 비교 평가하는데 초점을 두었다. 이를 위해 PNNI 라우팅 시뮬레이터를 설계 및 구현하여 TA알고리즘의 성능을 비교 분석하였다. ATM Forum에서는 계층으로 구성된 네트워크에서 계층적 라우팅 프로토콜과 토폴로지 정보를 요약하기 위한 PNNI 1.0 규격을 권고하였다. 토폴로지 정보를 요약하는 일련의 과정을 Topology Aggregation 이라 하며, 라우팅과 네트워크의 확장성 및 보안에 중요한 역할을 하게 된다. 따라서 라우팅 알고리즘과 Topology Aggregation 알고리즘이 PNNI 네트워크의 성능에 중요한 변수가 된다. 이를 비교·분석하기 위해 구현된 PNNI 라우팅 시뮬레이터는 라우팅 알고리듬 및 Topology Aggregation 알고리듬 개발에 적용되어 빠른 기간 내에 보다 개선된 알고리듬 개발에 사용될 수 있다.

• 대한전자공학회논문지TC
• /
• 제39권6호
• /
• pp.259-267
• /
• 2002

본 논문은 기존의 Topology Aggregation 알고리즘에 따른 성능을 비교 평가하는데 초점을 두었다. 이를 위해 PNNI 라우팅 시뮬레이터를 설계 및 구현하여 TA알고리즘의 성능을 비교 분석하였다. ATM Forum에서는 계층으로 구성된 네트워크에서 계층적 라우팅 프로토콜과 토폴로지 정보를 요약하기 위한 PNNI 1.0 규격을 권고하였다. 토폴로지 정보를 요약하는 일련의 과정을 Topology Aggregation 이라 하며, 라우팅과 네트워크의 확장성 및 보안에 중요한 역할을 하게 된다. 따라서 라우팅 알고리즘과 Topology Aggregation 알고리즘이 PNNI 네트워크의 성능에 중요한 변수가 된다. 이를 비교·분석하기 위해 구현된 PNNI 라우팅 시뮬레이터는 라우팅 알고리듬 및 Topology Aggregation 알고리듬 개발에 적용되어 빠른 기간 내에 보다 개선된 알고리듬 개발에 사용될 수 있다.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2006년도 춘계 종합학술대회 논문집
• /
• pp.411-414
• /
• 2006

토폴로지 정보는 망에서 계층적으로 구성될 수 있으며, 토폴로지 정보를 요약하는 과정을 토폴로지 요약(TA : Topology Aggregation)이라 한다. 이는 라우팅과 네트워크의 확장성에 매우 중요한 요소이다. 특히, 사설망 인터페이스(PNNI : Private Networks - Networks Interface)에서 라우팅 알고리즘과 토폴로지 요약 알고리즘은 네트워크의 성능에 중요한 변수가 된다. 따라서 본 논문에서는 사설망 인터페이스에서 토폴로지 요약을 위한 라우팅 시뮬레이터를 설계 및 구현하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
• /
• pp.448-450
• /
• 2005

A ubiquitous network allows all users to access and exchange information of any kind freely at any time, from anywhere, and from any appliance through the use of broadband and mobile access. Bluetooth commincation can provide the missing wireless extension to the heterogeneous network, allowing a more ubiquitous access. In this point of view, the BT specifications define ways for which each BT device can set up multiple connections with neighboring devices to communicate in a multi-hop fashion. this paper provides insights on the Bluetooth technology and on some limitations of the scatternet formations. so that, we describe a new multi-hop routing protocol for the establishment of scatternets. this protocol defines rules for forming a multi-hop topology in two phases. the first phase, topology discovery, concerns the discovery of the node's depth from a root node initiating inquiry process. the second phase forms scatternet topology based on the result of topology discovery.

• International journal of advanced smart convergence
• /
• 제7권2호
• /
• pp.22-32
• /
• 2018

In VANET, frequent movement of nodes causes dynamic changes of the network topology. Therefore the routing protocol, which is stable to effectively respond the changes of the network topology, is required. Moreover, the existing cluster-based routing protocol, that is the hybrid approach, has routing delay due to the frequent re-electing of the cluster header. In addition, the routing table of CBRP has only one hop distant neighbor nodes. PCBRP (Paired CBRP), proposed in this paper, ties two clusters in one pair of clusters to make longer radius. Then the pair of the cluster headers manages and operates corresponding member nodes. In the current CBRP, when the cluster header leaves the cluster the delay, due to the re-electing a header, should be occurred. However, in PCBRP, another cluster header of the paired cluster takes the role instead of the left cluster header. This means that this method reduces the routing delay. Concurrently, PCBRP reduces the delay when routing nodes in the paired cluster internally. Therefore PCBRP shows improved total delay of the network and improved performance due to the reduced routing overhead.

• 정보처리학회논문지C
• /
• 제11C권7호
• /
• pp.905-916
• /
• 2004

자율구성 계층구조 에드혹 네트워크(Self-organizing hierarchical ad hoc network, SOHAN)는 편평구조 에드혹 네트워크의 확장성을 향상시키기 위해 설계된 새로운 형태, 즉, 액세스 포인트, 전달 노드, 이동 노드의 3 계층의 애드혹 노드로 구성된 네트워크 구조이다. 본 논문에서는 SOHAN의 자율구성을 위한 토폴로지 탐색과 라우팅 프로토콜을 소개한다. 또한 높은 전송 용량을 갖는 최적의 클러스터 기반 계층구조 토폴로지를 형성하기 위한 링크 품질 및 MAC 지연 시간 기반의 크로스레이어 설계방식의 경로 척도를 제안한다. 토폴로지 탐색 프로토콜은 2.5 계층에서 MAC 주소를 기반으로 동작하는 라우팅 프로토콜을 위한 기본적인 정보를 제공한다. 이 라우팅 프로토콜은 AODV 프로토콜을 기반으로 하며, 계층구조의 장점을 활용하기 위해 토폴로지 탐색 프로토콜과 상호 연동하도록 설계된다. 시뮬레이션을 통해 전송용량, 종단간 지연시간, 패킷 전달률, 제어 오버헤드 관점에서 SOHAN의 우수한 성능과 확장성을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권5호
• /
• pp.1708-1734
• /
• 2022

In the development of logistics system, the breakthrough of important technologies such as technology platform for logistics information management and control is the key content of the study. Based on Javascript and JQuery, the logistics system realizes real-time monitoring, collection of historical status data, statistical analysis and display, intelligent recommendation and other functions. In order to strengthen the cooperation of warehouse storage, enhance the utilization rate of resources, and achieve the purpose of real-time and visual supervision of transportation equipment and cargo tracking, this paper studies the VNF dynamic deployment and SFC routing problem in the network load change scenario based on the logistics system. The BIP model is used to model the VNF dynamic deployment and routing problem. The optimization objective is to minimize the total cost overhead generated by each SFCR. Furthermore, the application of the SFC mapping algorithm in the routing topology solving problem is proposed. Based on the concept of relative cost and the idea of topology transformation, the SFC-map algorithm can efficiently complete the dynamic deployment of VNF and the routing calculation of SFC by using multi-layer graph. In the simulation platform based on the logistics system, the proposed algorithm is compared with VNF-DRA algorithm and Provision Traffic algorithm in the network receiving rate, throughput, path end-to-end delay, deployment number, running time and utilization rate. According to the test results, it is verified that the test results of the optimization algorithm in this paper are obviously improved compared with the comparison method, and it has higher practical application and promotion value.

• 한국멀티미디어학회지
• /
• 제12권4호
• /
• pp.28-40
• /
• 2008

Vehicular ad hoc networks (VANETs) are a practical application class of wireless ad hoc networks, which consist of moving vehicles equipped with radio communication capabilities that collaborate to form a temporary network. This paper addresses issues and protocols of multihop routing in such emerging networks in the context of safety and infotainment applications. Due to the highly dynamic mobility of vehicles, frequent link breakage and short connection time are inevitable and, thus, the routing is a challenging task and interest for many researchers and industrial community. The frequent and dynamic change of topology makes the topology-based routing unreliable but the position-based routing more effective. The position-based routing consists of the location service which maps a node id to a geo-graphical position and the forwarding scheme which selects the next hop based on geo-graphical information of the node, its neighbors and the destination. The routing techniques are further categorized into geographical forwarding, trajectory forwarding and opportunistic forwarding based on the forwarding scheme. In this paper, we first present the distinguished properties of VANETs and the challenges and intractable issues posed in designing the routing protocols, followed by the comprehensive survey of existing routing protocols. Then, the different routing protocols designed for VANETs are compared in terms of characteristics, performance and application domains.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2011년도 춘계학술발표대회
• /
• pp.590-593
• /
• 2011

Time goes on, Ad Hoc network is hot issues. So far, there are a lot of protocols have been proposed for Ad Hoc routing protocol to support the mobility. This paper presents an enhanced DSDV(Destination-Sequenced Distance Vector) routing protocol which nominates one node to take care of a specific area. Simply Area-Aware(AA) DSDV routing protocol has one nominee to take care of some area. It has two jobs. One is to take care of its neighbour and another is to transfer the routing table to its other node as it works. It is called as Area Nominee(AN). The new scheme extends the routing table to include the nominee in the area. The general node is the same as the previous DSDV routing protocol. In the other hands, the node which is nominated has two routing protocols. One is for Regional Routing(RR) table which is the same routing table in DSDV. Another is Global Routing(GR) table which is about the area round its area which it cares nearby. GR table is the table for the designated node like the nominee. Each area has one nominee to transfer between ANs. It has only nominee's information about every area. This concept decreases the topology size and makes the information of topology more accurate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권7호
• /
• pp.1735-1755
• /
• 2012

Wireless sensor networks (WSNs) are becoming increasingly attractive for a variety of applications and have become a hot research area. Routing is a key technology in WSNs and can be coarsely divided into two categories: flat routing and hierarchical routing. In a flat topology, all nodes perform the same task and have the same functionality in the network. In contrast, nodes in a hierarchical topology perform different tasks in WSNs and are typically organized into lots of clusters according to specific requirements or metrics. Owing to a variety of advantages, clustering routing protocols are becoming an active branch of routing technology in WSNs. In this paper, we present an overview on clustering routing algorithms for WSNs with focus on differentiating them according to diverse cluster shapes. We outline the main advantages of clustering and discuss the classification of clustering routing protocols in WSNs. In particular, we systematically analyze the typical clustering routing protocols in WSNs and compare the different approaches based on various metrics. Finally, we conclude the paper with some open questions.