• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.6
• /
• pp.417-426
• /
• 2013

The Korea Internet AS-level topology was constructed using three data sources: Border Gateway Protocol (BGP) trace collector, Internet Routing Registry (IRR), and Internet Exchange Point (IXP). It has 685 nodes and 1,428 links. The Korea Internet AS-level topology is a small regional subgraph of the massive global one. We investigate how well the Korea Internet preserves the topological characteristics of the global one or how different they are. We carefully select several topology metrics that can analyze the characteristics of the Korea Internet AS-level topology. We also investigate how well Internet topology generators can represent the characteristics of the Korea Internet AS-level topology.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.1060-1068
• /
• 2016

The range-free localization using connectivity information has problems of mobile tracking. This paper proposes two Bayesian filter-based mobile tracking algorithms considering a propagation scenario. Kalman and Markov Chain Monte Carlo (MCMC) particle filters are applied according to linearity of two measurement models. Measurement models of the Kalman and MCMC particle filter-based algorithms respectively are defined as connectivity between mobiles, information fusion of connectivity information and received signal strength (RSS) from neighbors within one-hop. To perform the accurate simulation, we consider a real indoor map of shopping mall and degree of radio irregularity (DOI) model. According to obstacles between mobiles, we assume two types of DOIs. We show the superiority of the proposed algorithm over existing range-free algorithms through MATLAB simulations.

• Journal of applied mathematics & informatics
• /
• v.38 no.1_2
• /
• pp.189-200
• /
• 2020

Let G be a simple connected graph with n vertices and m edges. Denote by d₁ ≥ d₂ ≥ ⋯ ≥ d_n > 0 and d(e₁) ≥ d(e₂) ≥ ⋯ ≥ d(e_m) sequences of vertex and edge degrees, respectively. If vertices v_i and v_j are adjacent, we write i ~ j. The general sum-connectivity index is defined as 𝒳_α(G) = ∑_i~j(d_i + d_j)^α, where α is an arbitrary real number. Firstly, we determine a relation between 𝒳_α(G) and 𝒳_α-1(G). Then we use it to obtain some new bounds for 𝒳_α(G).

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.31-46
• /
• 2021

Let a and b be positive integers, and let V (G), ��(G), and ��2(G) be the vertex set of a graph G, the minimum degree of G, and the minimum degree sum of two non-adjacent vertices in V (G), respectively. An even [a, b]-factor of a graph G is a spanning subgraph H such that for every vertex v ∈ V (G), dH(v) is even and a ≤ dH(v) ≤ b, where dH(v) is the degree of v in H. Matsuda conjectured that if G is an n-vertex 2-edge-connected graph such that $n{\geq}2a+b+{\frac{a^2-3a}{b}}-2$, ��(G) ≥ a, and ${\sigma}_2(G){\geq}{\frac{2an}{a+b}}$, then G has an even [a, b]-factor. In this paper, we provide counterexamples, which are highly connected. Furthermore, we give sharp sufficient conditions for a graph to have an even [a, b]-factor. For even an, we conjecture a lower bound for the largest eigenvalue in an n-vertex graph to have an [a, b]-factor.

• Journal of Korean Society of Transportation
• /
• v.26 no.5
• /
• pp.117-127
• /
• 2008

After the deregulation of the aviation market in the United States in 1978, airlines took advantage of the possibilities of the liberalized market and reorganized their networks. Then, the hub-and-spoke networks became widely used in the aviation market. The framework of hub-and-spoke network made it feasible to amplify flight networks. Thus, a number of airlines were able to fly to more destinations than ever before through the networks. Amplification of networks can be implementing through the transfer of passengers, transshipment of cargo, or both most researches have been concentrated on the passenger aspect at airports worldwide. Air cargo, however, has become one of the most significant areas at hub airports to keep their leading position in terms of the provision of services and handling volumes. This paper investigates the connectivity of airfreight networks as the temporal concentrations in current network at Incheon International Airport. In order to evaluate airline flight schedule effects to stimulate hubbing at an airport, the indirect connectivity can be considered to be the number of direct frequencies, the minimum connecting times and the quality of the connection determine indirect connectivity. Therefore the connectivity of freight transshipment depends on both the quality of the connection at the hub airport and the quality of the indirect flight compared to the direct flight. In addressing these issues, this paper analyzes the connectivity of flight schedules using a temporal wave-system structure and estimates the degree of connectivity and quality of connectivity applying the NETSCAN model.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.25 no.1
• /
• pp.25-38
• /
• 2022

Urban problems are constantly occurring around the world due to rapid industrialization and population decline. In particular, as the number of vacant houses is gradually increasing as the population decreases, it is necessary to prepare countermeasures. A plan to utilize vacant houses has emerged to restore the natural environment of the urban ecosystem where forest destruction, damage to habitats of wild animals and plants, and disconnection have occurred due to large-scale development. Through connectivity analysis, it is possible to understand the overall ecosystem flow based on the movement of species and predict the effect when vacant houses are converted into green spaces. Therefore, this study analyzed the green area network to confirm the possibility of greening of vacant houses neglected in Jeonju based on circuit theory. Using Circuitscape and Least-cost path, we tried to identify the connectivity of green areas and propose an ecological axis based on the analysis. In order to apply the resistance values required for analysis based on previous studies, the 2020 subdivision land cover data were integrated into the major classification evaluation items. When the eight forests in the target site were analyzed as the standard, the overall connectivity and connectivity between forests in the area were high, so it is judged that the existing green areas can perform various functions, such as species movement and provision of habitats. Based on the results of the connectivity analysis, the importance of vacant houses was calculated and the top 20 vacant houses were identified, and it was confirmed that the higher the ranking, the more positive the degree of landscape connectivity was when converted to green areas. In addition, it was confirmed that the results of analyzing the least-cost path based on the resistance values such as connectivity analysis and the existing conceptual map showed some differences when comparing the ecological axes in the form. As a result of checking the vacant houses corresponding to the relevant axis based on the width standards of the main and sub-green areas, a total of 30 vacant houses were included in the 200m width and 6 vacant houses in the 80m width. It is judged that the conversion of vacant houses to green space can contribute to biodiversity conservation as well as connectivity between habitats of species as it is coupled with improved green space connectivity. In addition, it is expected to help solve the problem of vacant houses in the future by showing the possibility of using vacant houses.

• Journal of Korea Water Resources Association
• /
• v.51 no.11
• /
• pp.989-998
• /
• 2018

Connectivity between water source and demand node can be served as a critical system performance indicator of the degree of water distribution network (WDN)' failure severity under abnormal conditions. Graph theory-based approaches have been widely applied to quantify the connectivity due to WDN's graph-like topological feature. However, most previous studies used undirected-unweighted graph theory which is not proper to WDN. In this study, the directed-weighted graph theory was applied for WDN connectivity analyses. We also proposed novel connectivity indicators, Source-to-Node Shortest Pathway (SNSP) and SNSP-Degree (SNSP-D) which is an inverse of the SNSP value, that does not require complicate hydraulic simulation of a WDN of interest. The proposed SNSP-D index was demonstrated in total 42 networks in J City, South Korea in which Pearson Correlation Coefficient (PCC) between the proposed SNSP-D and four other system performance indicators was computed: three resilience indexes and an energy efficiency metric. It was confirmed that a system representative value of the SNSP-D has strong correlation with all resilience and energy efficiency indexes (PCC = 0.87 on average). Especially, PCC was higher than 0.93 with modified resilience index (MRI) and energy efficiency indicator. In addition, a multiple linear regression analysis was performed to identify the system hydraulic characteristic factors that affect the correlation between SNSP-D and other system performance indicators. The proposed SNSP is expected to be served as a useful surrogate measure of resilience and/or energy efficiency indexes in practice.

• Korean Journal of Mathematics
• /
• v.10 no.1
• /
• pp.29-35
• /
• 2002

It is well known that a random graph $G_{1/2}(n)$ is Hamiltonian almost surely. In this paper, we show that every quasirandom graph $G(n)$ with minimum degree $(1+o(1))n/2$ is also Hamiltonian.

• Current Research on Agriculture and Life Sciences
• /
• v.27
• /
• pp.69-75
• /
• 2009

This research regard it as most meaningful to realize the importance of the hedgerow in cultivated areas functioning as a residual landscape element in rural landscape and set improvement guidelines through landscape character and value analysis to cope with landscape malfunction. The results of summary are as follows. 1) First of all, as a result of landscape character analysis of edge stripe in cultivated land in total of 7 case areas, for example, the edge stripe in cultivated land in case area 4 and 8 maintain the width of 10m and are assessed satisfactory in terms of vegetation development condition, appearance of living species, connectivity, buffer capacity and so on. Also, as a result of structural character of correlation analysis among items, the correlation coefficient between width and appearance of living species showed 0.941, the highest. Following are connectivity and appearance of living species and width and buffer capacity respectively: 0.841 and 0.740. 2) As a result of landscape character analysis of uncultivated stripe in total of 6 case areas, it is analyzed that case area 4 maintains the widest width as almost 4.5m average width and considered valuable as I degree in vegetation development condition, filtering, and connectivity. 3) As a result of problem analysis of uncultivated stripe, for example, case 3, 9, and 10 was analyzed that the width was below 1.25m which is too small to carry out the function of buffer and habitat for living creature, so minimum standard width was set between 4~5m through comprehensive analysis of character of each case area. Based on the result above landscape character, value and problem analysis, main improvement guidelines are set in terms of width, connectivity, filtering, and vegetation development, restrictive practices and so on.

• Journal of Convergence Society for SMB
• /
• v.4 no.1
• /
• pp.7-15
• /
• 2014

In this paper, we propose an efficient routing protocol to achieve an optimal route searching process of the network lifetime by balancing power consumption per node. The proposed protocols aim at finding energy-efficient paths at low protocol power. In our protocol, each intermediate node keeps power level and branch number of child nodes and it transmits the data the nearest neighbor node. Our protocol may minimize the energy consumption at each node, thus prolong the lifetime of the system regardless of the location of the sink outside or inside the cluster. In the proposed protocol for inter-cluster communication, a cluster head chooses a relay node from its adjacent cluster heads according to the node's residual energy and its distance to the base station. Simulation results show that proposed protocol successfully balances the energy consumption over the network, and achieves a remarkable network lifetime improvement as highly as 7.5%.