• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.2
• /
• pp.78-97
• /
• 2010

Route discovery in wireless mobile networks requires a considerable amount of resources due to the mobility of the hosts. Therefore, it would be wise to utilize the effort already invested in existing paths. This paper proposes an efficient way to reuse, whenever possible, existing paths when a new path is being established. In our proposed algorithm, called Route Reutilization Routing (RRR), the reusability is accomplished by the notion of the dynamic proactive zones (DPZ), through which nearby existing path information is disseminated. By utilizing the information stored in DPZs, RRR can achieve considerable savings over other on-demand routing algorithms that use flooding. The unique feature of the proposed algorithm is that DPZs are created and destroyed dynamically around the existing paths, whereas proactive zones are formed around the nodes throughout the network in other route finding algorithms. Even though using DPZs may not result in the shortest path between source and destination, simulation results show the considerable reduction in traffic needed to find a path and therefore increases the available bandwidth for data transmission.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.26 no.1
• /
• pp.217-231
• /
• 2015

This study aims to infer the gene-protein 'brings_about' chains of pancreatic cancer which were referred to in the pancreatic cancer related researches by constructing the gene-protein interaction network of pancreatic cancer. The chains can help us uncover publicly unknown knowledge that would develop as empirical studies for investigating the cause of pancreatic cancer. In this study, we applied a novel approach that grafts text mining and the main path analysis into Swanson's ABC model for expanding intermediate concepts to multi-levels and extracting the most significant path. We carried out text mining analysis on the full texts of the pancreatic cancer research papers published during the last ten-year period and extracted the gene-protein entities and relations. The 'brings_about' network was established with bio relations represented by bio verbs. We also applied main path analysis to the network. We found the main direct 'brings_about' path of pancreatic cancer which includes 14 nodes and 13 arcs. 9 arcs were confirmed as the actual relations emerged on the related researches while the other 4 arcs were arisen in the network transformation process for main path analysis. We believe that our approach to combining text mining analysis with main path analysis can be a useful tool for inferring undiscovered knowledge in the situation where either a starting or an ending point is unknown.

• 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.

• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.573-581
• /
• 2004

Recently, the rapid growth of Internet technology and the deployment of high speed networks make many kinds of multimedia services possible. Preexisting multimedia services are designed based on the client/server model which has the problems such as the network failure and the low speed communication due to the high load on the central server. In order to solve these problems, peer-to-peer networks are introduced and expanded through Internet environments. In this paper, we propose a pure peer-to-peer network based resource discovery mechanism for multimedia services. In the proposed scheme, each host maintains the location information of resources which are recently requested by other hosts as well as that oi the replicas of local resources. The proposed scheme has the faster response time and incurs the smaller traffic than the preexisting discovery schemes in pure peer-to-peer network environments. Also, by decentralizing the location information and differentiating the reply path, our proposed scheme can solve the search result loss problem that occurs when the network is unsettled.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.658-660
• /
• 2004

모바일 멀티미디어 서비스에서는 핸드오프의 효율적인 처리를 통한 QoS를 보장하는 것이 중요하다. 본 논문에서는 기존 핸드오프 기법의 경로 최적화, 회선의 재활용률, 핸드오프 수행시간 등의 문제점을 개선을 위해 Crossover Switch(CX)탐색 기법에 적용되는 기존의 Loose select, Prior path knowledge와 제안한 Hybrid CX 탐색 알고리즘의 성능분석을 위해 C#을 사용하여 시뮬레이터를 구현하고 회선 재이용률, 경로 최적화 정도를 비교분석하였다. 실험결과 제안한 Hybrid CX 탐색 알고리즘이 우수하다는 것을 확인하였다.

• Journal of applied mathematics & informatics
• /
• v.26 no.1_2
• /
• pp.235-249
• /
• 2008

On-demand routing protocol in ad hoc network is that establishes a route to a destination node only when it is required by a source node. But, it is necessary to reestablish a new route when an active route breaks down. The reconstruction process establishes another route by flooding messages from the source to the destination, cause not only heavy traffic but also long delays in route discovery. A good method for analyzing performance of protocols is important for deriving better systems. In this paper, we suggest the numerical formulas of a representative on-demand routing protocol AODV, ARMP, and RRAODV to estimate the performance of these routing protocols for analyzing the performance of these protocols. The proposed analytical models are very simple and straightforward. The results of analysis show good agreement with the results of computer simulations.

• Review of KIISC
• /
• v.12 no.2
• /
• pp.50-61
• /
• 2002

최근 전자상거래의 활성화 및 안전한 네트워크의 구현에 공개키 기반구조의 응용이 확대되면서 공개키의 무결성과 신뢰성을 제공하기 위해 공개키 인증서 상태 검증에 관한 연구가 활발히 진행되고 있다. 본 고에서는 PKI 응용 프로토콜 중에서 인증서의 유효성을 검증하기 위한 온라인 인증서 상태 검증 프로토콜(Outline Certificate Status Protocol)의 최근 연구 동향에 대하여 분석하였으며, 현재 상용화되어 있는 제품들에 대하여 조사하였다. 또한, 특정 인증서에 대한 온라인 취소 상태 확인 서비스(ORS: Online Revocation Status), 인증 경로의 발견을 서버로 위임하는 대리 인증 경로 발견 서비스(DPD: Delegated Path Discovery), 그리고 중앙 집중 서버에게 인증 경로 검증의 기능을 위임하는 대리 인증 경로 검증 서비스(DPV: Delegated Path Validation) 등의 온라인 인증서 상태 검증 프로토콜에서 제공하는 서비스들에 대해서도 살펴보았다. 현재 온라인 인증서 상태 검증 프로토콜(OCSP)에 관한 문서는 IETF에서 표준화한 RFC2560과 2000년 11월과 2001년 3월에 제안된 드래프트가 있으며, 본 고에서는 RFC2560과 제안된 드래프트를 비교 분석하였으며 국내\ulcorner외 제품의 동향과 온라인 인증서 상태 검증 프로토콜의 활용 범위에 대해서 간략하게 살펴보았다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.3
• /
• pp.1022-1034
• /
• 2023

Various aspects of artificial intelligence (AI) have become of significant interest to academia and industry in recent times. To satisfy these academic and industrial interests, it is necessary to comprehensively investigate trends in AI-related changes of diverse areas. In this study, we identified and predicted emerging convergences with the help of AI-associated research abstracts collected from the SCOPUS database. The bidirectional encoder representations obtained via the transformers-based topic discovery technique were subsequently deployed to identify emerging topics related to AI. The topics discovered concern edge computing, biomedical algorithms, predictive defect maintenance, medical applications, fake news detection with block chain, explainable AI and COVID-19 applications. Their convergences were further analyzed based on the shortest path between topics to predict emerging convergences. Our findings indicated emerging AI convergences towards healthcare, manufacturing, legal applications, and marketing. These findings are expected to have policy implications for facilitating the convergences in diverse industries. Potentially, this study could contribute to the exploitation and adoption of AI-enabled convergences from a practical perspective.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.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.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.15 no.1
• /
• pp.25-33
• /
• 2020

Multipath routing protocols with unmanned aerial vehicles have been proposed to improve reliability in tactical ad hoc networks. Most of existing studies tend to establish the paths with multiple metrics. However, these approaches suffer from link loss and congestion problems according to the network condition because they apply same metric for both ground and air path or employ the simple weight value to combine multiple metrics. To overcome this limitation, in this study, we propose new routing metrics for path over unmanned aerial vehicles and use the multi-criteria decision making (MCDM) method to determine the weight factors between multiple metrics. For the case studies, we extend the ad-hoc on-demand distance vector protocol and propose a strategy for modifying the route discovery and route recovery procedure. The simulation results show that the proposed mechanism is able to achieve high end-to-end reliability and low end-to-end delay in tactical ad hoc networks.