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

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

• Journal of Korea Society of Industrial Information Systems
• /
• v.6 no.2
• /
• pp.7-15
• /
• 2001

In this paper, we suggest the algorithm that inserts or deletes documents into web sites without creating tag. This algorithm uses tag which links between documents to automatically inset or delete the web documents. This study extracts the texts in the ... tag of the document to put into the structure as a type of graph creating the link as a node m of sub-node. That is, in this case of configurating new link between web documents, this algorithm allows to insert or delete the node to or from the graph without creating the tag. In the case of deleting the document, it removes the broken link connecting the sub-nodes of deleted node newly to its parent node.

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

• ETRI Journal
• /
• v.40 no.5
• /
• pp.604-612
• /
• 2018

To solve the problem of unbalanced loads and the short network lifetime of heterogeneous wireless sensor networks, this paper proposes a node-selection algorithm based on energy balance and dynamic adjustment. The spacing and energy of the nodes are calculated according to the proximity to the network nodes and the characteristics of the link structure. The direction factor and the energy-adjustment factor are introduced to optimize the node-selection probability in order to realize the dynamic selection of network nodes. On this basis, the target path is selected by the relevance of the nodes, and nodes with insufficient energy values are excluded in real time by the establishment of the node-selection mechanism, which guarantees the normal operation of the network and a balanced energy consumption. Simulation results show that this algorithm can effectively extend the network lifetime, and it has better stability, higher accuracy, and an enhanced data-receiving rate in sufficient time.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.3
• /
• pp.63-68
• /
• 2022

Two wavelength reconfigurable optical nodes are designed. One for 20km or shorter link length, and the other for up to 60km link length. While the first one requires no dispersion compensation, the latter needs dispersion compensation fiber included in the node, which requires additional optical amplifier to compensate the insertion loss of DCF. We calculate all the optical path losses in both cases using the typical value of optical components in the market to see the feasibility of the designed optical node. The minimum received power in the node is calculated to be -21.5dBm without DCF and -12.5dBm with DCF, respectively. These received powers are above the receiver sensitivity both for OC-48 and OC-192 according to the previous work.

• Journal of Digital Contents Society
• /
• v.12 no.1
• /
• pp.133-139
• /
• 2011

Structured P2P (peer-to-peer) networks have received much attention in research communities and the industry. The data stored in structured P2P networks can be located in a log-scale time without using central severs. The link-structure of structured P2P networks should be maintained for keeping log-scale search performance of it. When nodes join or leave structured P2P networks frequently, some links become unavailable and search performance is degraded by these links. To sustain search performance of structured P2P networks, periodic link recovery scheme is generally used. However, when the link recovery period is short or long compared with node join and leave rates, it is possible that sufficient number of links are not restored or excessive messages are used after the link-structure is restored. We propose the adaptive link recovery determination algorithm to maintain the link-structure of structured P2P networks when the rates of node joining and leaving are changed dynamically. The simulation results show that the proposed algorithm can maintain similar QoS under various node leaving rates.

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

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

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• 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.