• Title/Summary/Keyword: Node-Link

Search Result 623, Processing Time 0.027 seconds

Node Matching of Road Network Data by Comparing Link Shape (링크 형상 비교를 이용한 도로 네트워크 데이터의 노드 매칭)

  • Bang, Yoon-Sik;Lee, Jae-Bin;Huh, Yong;Yu, Ki-Yun
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2009.04a
    • /
    • pp.23-25
    • /
    • 2009
  • Nowadays, owing to the development of techniques for collecting geographic information, an increasing need is thus appearing: integrating heterogeneous databases. This paper proposes an algorithm for finding matching relationship between two node sets in road network data. We found the corresponding node pair using link shape linked with them as well as their location. The accuracy of matching was grown by this process. Result then can be used to reflect the topological information in performing link matching.

  • PDF

Virtual Network Embedding based on Node Connectivity Awareness and Path Integration Evaluation

  • Zhao, Zhiyuan;Meng, Xiangru;Su, Yuze;Li, Zhentao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.7
    • /
    • pp.3393-3412
    • /
    • 2017
  • As a main challenge in network virtualization, virtual network embedding problem is increasingly important and heuristic algorithms are of great interest. Aiming at the problems of poor correlation in node embedding and link embedding, long distance between adjacent virtual nodes and imbalance resource consumption of network components during embedding, we herein propose a two-stage virtual network embedding algorithm NA-PVNM. In node embedding stage, resource requirement and breadth first search algorithm are introduced to sort virtual nodes, and a node fitness function is developed to find the best substrate node. In link embedding stage, a path fitness function is developed to find the best path in which available bandwidth, CPU and path length are considered. Simulation results showed that the proposed algorithm could shorten link embedding distance, increase the acceptance ratio and revenue to cost ratio compared to previously reported algorithms. We also analyzed the impact of position constraint and substrate network attribute on algorithm performance, as well as the utilization of the substrate network resources during embedding via simulation. The results showed that, under the constraint of substrate resource distribution and virtual network requests, the critical factor of improving success ratio is to reduce resource consumption during embedding.

Position-based Routing Algorithm for Improving Reliability of Inter-Vehicle Communication

  • Ryu, Min-Woo;Cha, Si-Ho;Koh, Jin-Gwang;Kang, Seok-Joong;Cho, Kuk-Hyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.8
    • /
    • pp.1388-1403
    • /
    • 2011
  • A vehicular ad-hoc network (VANET) consists of vehicles that form a network without any additional infrastructure, thus allowing the vehicles to communicate with each other. VANETs have unique characteristics, including high node mobility and rapidly changing network topology. Because of these characteristics, routing algorithms based on greedy forwarding such as greedy perimeter stateless routing (GPSR) are known to be very suitable for a VANET. However, greedy forwarding just selects the node nearest to the destination node as a relay node within its transmission range. This increases the possibility of a local maximum and link loss because of the high mobility of vehicles and the road characteristics in urban areas. Therefore, this paper proposes a reliability-improving position-based routing (RIPR) algorithm to solve those problems. The RIPR algorithm predicts the positions, velocities, and moving directions of vehicles after receiving beacon messages, and estimates information about road characteristics to select the relay node. Thus, it can reduce the possibility of getting a local maximum and link breakage. Simulation results using ns-2 revealed that the proposed routing protocol performs much better than the existing routing protocols based on greedy forwarding.

A Study on the Performance of Similarity Indices and its Relationship with Link Prediction: a Two-State Random Network Case

  • Ahn, Min-Woo;Jung, Woo-Sung
    • Journal of the Korean Physical Society
    • /
    • v.73 no.10
    • /
    • pp.1589-1595
    • /
    • 2018
  • Similarity index measures the topological proximity of node pairs in a complex network. Numerous similarity indices have been defined and investigated, but the dependency of structure on the performance of similarity indices has not been sufficiently investigated. In this study, we investigated the relationship between the performance of similarity indices and structural properties of a network by employing a two-state random network. A node in a two-state network has binary types that are initially given, and a connection probability is determined from the state of the node pair. The performances of similarity indices are affected by the number of links and the ratio of intra-connections to inter-connections. Similarity indices have different characteristics depending on their type. Local indices perform well in small-size networks and do not depend on whether the structure is intra-dominant or inter-dominant. In contrast, global indices perform better in large-size networks, and some such indices do not perform well in an inter-dominant structure. We also found that link prediction performance and the performance of similarity are correlated in both model networks and empirical networks. This relationship implies that link prediction performance can be used as an approximation for the performance of the similarity index when information about node type is unavailable. This relationship may help to find the appropriate index for given networks.

A Methodology on System Implementation for Road Monitoring and Management Based on Automated Driving Hazard Levels (위험도 기반 도로 모니터링 및 관리 시스템 구축 방안)

  • Kyuok Kim;Sang Soo Lee;SunA Cho
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.21 no.6
    • /
    • pp.299-310
    • /
    • 2022
  • The ability of an automated driving system is based on vehicle sensors, judgment and control algorithms, etc. The safety of automated driving system is highly related to the operational status of the road network and compliant road infrastructure. The safe operation of automated driving necessitates continuous monitoring to determine if the road and traffic conditions are suitable and safe. This paper presents a node and link system to build a road monitoring system by considering the ODD(Operational Design Domain) characteristics. Considering scalability, the design is based on the existing ITS standard node-link system, and a method for expressing the monitoring target as a node and a link is presented. We further present a technique to classify and manage hazard risk into five levels, and a method to utilize node and link information when searching for and controlling the optimal route. Furthermore, we introduce an example of system implementation based on the proposed node and link system for Sejong City.

An Improved Distributed Algorithm for Delay-Constrained Unicast Routing (개선된 분산 Delay-Constrained Unicast Routing 알고리듬)

  • Zhou, Xiao-Zheng;Suh, Hee-Jong
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.109-112
    • /
    • 2005
  • In this paper, we propose an improved delay-constrained unicast routing (I-DCUR) algorithm for real-time networks which is based on the delay-constrained unicast routing (DCUR) algorithm. Our I-DCUR algorithm is quite different from DCUR algorithm, because the node will choose the link between the active node and the previous node, and it will replace the original loop path when it detects a loop. Thus, firstly consider to choose the link between the active node and the previous node to replace the original loop path when a node detects a loop. So our algorithm can make the construction of path more efficiently, as compared to DCUR algorithm. We could see that the performance of I-DCUR algorithm is much better than DCUR algorithm in the experimental results. There were over 40% improvement in 100 nodes, 60% in 200 nodes, and 9% reduction of costs.

  • PDF

Selection of Input Nodes in Artificial Neural Network for Bankruptcy Prediction by Link Weight Analysis Approach (연결강도분석접근법에 의한 부도예측용 인공신경망 모형의 입력노드 선정에 관한 연구)

  • 이응규;손동우
    • Journal of Intelligence and Information Systems
    • /
    • v.7 no.2
    • /
    • pp.19-33
    • /
    • 2001
  • Link weight analysis approach is suggested as a heuristic for selection of input nodes in artificial neural network for bankruptcy prediction. That is to analyze each input node\\\\`s link weight-absolute value of link weight between an input node and a hidden node in a well-trained neural network model. Prediction accuracy of three methods in this approach, -weak-linked-neurons elimination method, strong-linked-neurons selection method and integrated link weight model-is compared with that of decision tree and multivariate discrimination analysis. In result, the methods suggested in this study show higher accuracy than decision tree and multivariate discrimination analysis. Especially an integrated model has much higher accuracy than any individual models.

  • PDF

Topology Aggregation Schemes for Asymmetric Link State Information

  • Yoo, Young-Hwan;Ahn, Sang-Hyun;Kim, Chong-Sang
    • Journal of Communications and Networks
    • /
    • v.6 no.1
    • /
    • pp.46-59
    • /
    • 2004
  • In this paper, we present two algorithms for efficiently aggregating link state information needed for quality-of-service (QoS) routing. In these algorithms, each edge node in a group is mapped onto a node of a shufflenet or a node of a de Bruijn graph. By this mapping, the number of links for which state information is maintained becomes aN (a is an integer, N is the number of edge nodes) which is significantly smaller than N2 in the full-mesh approach. Our algorithms also can support asymmetric link state parameters which are common in practice, while many previous algorithms such as the spanning tree approach can be applied only to networks with symmetric link state parameters. Experimental results show that the performance of our shufflenet algorithm is close to that of the full-mesh approach in terms of the accuracy of bandwidth and delay information, with only a much smaller amount of information. On the other hand, although it is not as good as the shufflenet approach, the de Bruijn algorithm also performs far better than the star approach which is one of the most widely accepted schemes. The de Bruijn algorithm needs smaller computational complexity than most previous algorithms for asymmetric networks, including the shufflenet algorithm.

Web Site Construction Using Internet Information Extraction (인터넷 정보 추출을 이용한 웹문서 구조화)

A Broadcast Tree Construction Algorithm for Minimizing Latency in Multi-Rate Wireless Mesh Networks (다중 전송률을 지원하는 무선 메쉬 네트워크에서 지연시간 최소화를 위한 브로드캐스트트리 생성 알고리즘)

  • Kim, Nam-Hee;Park, Sook-Young;Lee, Sang-Kyu
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.5
    • /
    • pp.402-408
    • /
    • 2008
  • This paper considers the problem of minimizing network-wide broadcast latency in multi-rate wireless mesh networks where a node can dynamically adjust its link layer transmission rates to its neighbors. We propose a broadcast algorithm that complements existing broadcast construct algorithm which chooses a multicast node randomly when each candidate node has same metric. We consider the currently accumulated broadcast latency from source node to the each candidate node so far to choose the next broadcast node. The proposed broadcast algorithm for minimizing latency in a multi-rate mesh networks which exploit wireless advantage and the multi-rate nature of the network. Simulation based on current 802.11 parameters shows that proposed MinLink_WCDS algorithm improves overall latency than the previous existing broadcast algorithm.