• Journal of information and communication convergence engineering
• /
• 제19권4호
• /
• pp.205-213
• /
• 2021

The properties of a scale-free network are little known; its node degree following a power-law distribution is among its few known properties. By selecting real-field scale-free networks from a network dataset and comparing them to other networks, such as random and non-scale-free networks, the topology characteristics of scale-free networks are identified. The assortative coefficient is identified as a key metric of a scale-free network. It is also identified that most scale-free networks have negative assortative coefficients. Traditional generation models of scale-free networks are evaluated based on the identified topology characteristics. Most representative models, such as BA and Holme&Kim, are not effective in generating real-field scale-free networks. A link-rewiring method is suggested that can control the assortative coefficient while preserving the node degree sequence. Our analysis reveals that it is possible to effectively reproduce the assortative coefficients of real-field scale-free networks through link-rewiring.

• Journal of applied mathematics & informatics
• /
• 제31권3_4호
• /
• pp.443-456
• /
• 2013

In this paper we consider a model with demographics for sexually transmitted diseases (STDs) spread on scale-free networks. We derive the epidemic threshold, which is depend on the birth rate, the natural death rate and other parameters. The absence of a threshold in infinite scale-free network is proved. For a hard cut off scale-free network, we also analyze the stability of disease-free equilibrium and the persistence of STDs infection. Two immunization schemes, proportional scheme and targeted vaccination, are studied and compared. We find that targeted strategy is more effective on scale-free networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권3호
• /
• pp.1238-1259
• /
• 2019

Saving energy is a big challenge for Wireless Sensor Networks (WSNs), which becomes even more critical in large-scale WSNs. Most energy waste is communication related, such as collision, overhearing and idle listening, so the schedule-based access which can avoid these wastes is preferred for WSNs. On the other hand, clustering technique is considered as the most promising solution for topology management in WSNs. Hence, providing interference-free clustering is vital for WSNs, especially for large-scale WSNs. However, schedule management in cluster-based networks is never a trivial work, since it requires inter-cluster cooperation. In this paper, we propose a clustering method, called Interference-Free Clustering Protocol (IFCP), to partition a WSN into interference-free clusters, making timeslot management much easier to achieve. Moreover, we model the clustering problem as a multi-objective optimization issue and use non-dominated sorting genetic algorithm II to solve it. Our proposal is finally compared with two adaptive clustering methods, HEED-CSMA and HEED-BMA, demonstrating that it achieves the good performance in terms of delay, packet delivery ratio, and energy consumption.

• 한국통신학회논문지
• /
• 제41권7호
• /
• pp.754-764
• /
• 2016

최근 들어 다양한 SNS(Social Network Service)에 대한 이해와 분석을 위해 가장 중요한 두 종류의 망인 small-world와 scale-free망에 대한 많은 연구가 수행되고 있다. 본 연구에서는 두 개의 입력 파라미터를 적절히 조정함으로서 small-world 망, scale-free 망 혹은 두 개의 성질을 동시에 모두 갖는 망을 생성 할 수 있는 보다 일반화된 망 생성 방법을 제안하였다. 두개의 입력 파라미터중 하나는 small-world 성질을 나태내주는 파라미터고 다른 하나는 scale-free와 small-world 성질 모두를 나타내주는 파라미터다. Small-world와 scale-free를 나타내주는 망의 성질로 군집계수, 평균 최단거리 그리고 power-law 상수를 이용하였다. 본 연구에서 제안한 방법을 사용하면 small-world 망과 scale-free 망의 성질과 관계에 대한 보다 명확한 이해를 할 수 있다. 다양한 여러 예제들을 통하여 두 개의 입력 파라미터들이 군집계수, 평균 최단거리 그리고 power-law 상수에 미치는 영향을 검증하였다. 이를 통해 어떠한 입력 파라미터들의 조합이 small-world 망, scale-free 망 혹은 두 개의 성질을 모두 갖는 망을 생성 할 수 있는지를 조사하였다.

• Smart Structures and Systems
• /
• 제19권4호
• /
• pp.383-391
• /
• 2017

In this paper, we investigate the impacts of network topology on the performance of a distributed estimation algorithm, namely combine-then-adaptive (CTA) diffusion LMS, based on the data with or without the assumptions of temporal and spatial independence with noisy links. The study covers different network models, including the regular, small-world, random and scale-free whose the performance is analyzed according to the mean stability, mean-square errors, communication cost (link density) and robustness. Simulation results show that the noisy links do not cause divergence in the networks. Also, among the networks, the scale free network (heterogeneous) has the best performance in the steady state of the mean square deviation (MSD) while the regular is the worst case. The robustness of the networks against the issues like node failure and noisier node conditions is discussed as well as providing some guidelines on the design of a network in real condition such that the qualities of estimations are optimized.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권11호
• /
• pp.3984-3996
• /
• 2014

Mobile social network can be seen as a specific application of the DTN (Delay Tolerant Network), in which the information propagation can be impacted by many social behaviors of the nodes. For a specific node, its social behaviors are various. For example, the node may not be interested in the information before receiving it and may also discard the information after getting it. On the other hand, people are more willing to forward the message to his friends. These interactive behaviors between nodes can be seen as social behaviors. It is easy to see that the impact of the social behaviors is related to the social ties, which can be manifested by the structure of the social network. State of the art works often simply assumes that the social networks can be divided into some communities. At present, some works find that the structure of some social networks is scale-free. To overcome this problem, this paper proposes a theoretical model to evaluate the impact of above social behaviors in the DTN-like scale-free network. Simulation shows the accuracy of the model. Numerical results show that both social behaviors and scale-free character have significant impact on information propagation. Moreover, the impact of social behaviors is related to the scale-free character of the networks.

• 인터넷정보학회논문지
• /
• 제17권5호
• /
• pp.1-8
• /
• 2016

본 논문에서는 복잡계 네트워크 이론에 기반한 무선 네트워크 토폴로지를 구성하고, 실제 환경의 토폴로지 구성을 반영한 척도없는 네트워크의 노드 링크 분포 확률을 분석하여 실제 무선 네트워크를 위한 브로드캐스트 전송 스케줄링 알고리즘 기법을 제안한다. 본 논문에서는 기존의 브로드캐스트 스케줄링 알고리즘 기법들이 반영하지 못한 복잡계 네트워크의 특성을 분석하고 그 특성에 맞는 알고리즘 기법과 분석 기법에 대하여 제안한다. 실험 결과를 통해 제안하는 방식의 알고리즘법이 네트워크의 지연시간 감소와 전송효율에 있어서의 우수함을 밝히고, 복잡계 네트워크 기반 무선 네트워크의 전송효율과 전체지연시간에 대한 최적화 방식의 기법을 제안한다.

• 한국콘텐츠학회논문지
• /
• 제11권5호
• /
• pp.474-480
• /
• 2011

고구려, 백제, 신라 왕조실록에 등장하는 인물 네트워크는 다른 사회 네트워크와는 달리 척도 없는 네트워크 (scale-free network)의 특성이 아닌 정보의 보급, 인터넷 연쇄 편지, 청원 편지 등에서 보여주는 유포 네트워크 (dissemination network) 의 특성을 보여주고 있다. 그러나 이들 세 왕조를 통합한 삼국왕조실록은 사회 네트워크와 마찬가지로 척도 없는 네트워크의 전형적인 특성을 보여주고 있었다. 일반적으로 생명체 네트워크는 척도 없는 네트워크와 계층적 네트워크 (hierarchical network)의 특성을 동시에 가지는데, 삼국왕조실록도 척도 없는 네트워크뿐만 아니라 계층적 네트워크의 특성을 동시에 보여주고 있었다. 네트워크를 기반으로 각 국가의 영토 변화 양상을 분석하였는데, 고구려나 백제와는 달리 신라만의 독특한 양상을 가지는데, 이 양상이 삼국 통일을 이루는 근간을 만든 것으로 분석하였다. 고구려, 백제, 신라의 전반적인 나라 경영, 발전 양상 및 이들 나라의 중심이 되는 왕의 인물 네트워크를 바탕으로 통치 양상을 분석하였다. 본 연구는 삼국 왕조실록에 등장하는 인물을 역사학적 관점이 아닌 실록에 등장하는 인물 네트워크를 기반으로 분석함으로서 새로운 각도에서 해석할 수 있는 가능성을 제시하였다.

• 대한산업공학회지
• /
• 제40권1호
• /
• pp.1-7
• /
• 2014

We consider a human contact social network that has connections through cellphone addresses. To construct such a social network, we use real call records provided by a large carrier, and connect to each other if there exists a call record between any two cellphone users. Due to its huge amount of data, we down-sample it in a way that the smallest-degree nodes are removed, in turn, from the network. For a moderate size of the networks we show that the degree distribution of the network follows a power-law distribution via linear regression analysis, implying the so-called scale-free property. We finally suggest some alternative measures to analyze a social network.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 2007년도 정기학술대회
• /
• pp.321-329
• /
• 2007

This paper reports on the application of network analysis approaches to investigate the characteristics of graph representations of Japanese word associations. Two semantic networks are constructed from two separate Japanese word association databases. The basic statistical features of the networks indicate that they have scale-free and small-world properties and that they exhibit hierarchical organization. A graph clustering method is also applied to the networks with the objective of generating hierarchical structures within the semantic networks. The method is shown to be an efficient tool for analyzing large-scale structures within corpora. As a utilization of the network clustering results, we briefly introduce two web-based applications: the first is a search system that highlights various possible relations between words according to association type, while the second is to present the hierarchical architecture of a semantic network. The systems realize dynamic representations of network structures based on the relationships between words and concepts.