• Journal of information and communication convergence engineering
• /
• v.19 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.7
• /
• pp.754-764
• /
• 2016

To understand and analyze SNS(Social Network Service) two important classes of networks, small-world and scale-free networks have gained a lot of research interests. In this study, a generalized network generation method is developed, which can produce small-world network, scale-free network, or network with the properties of both small-world and scale-free by controlling two input parameters. By tuning one parameter we can represent the small-world property and by tuning the other one we can represent both scale-free and small-world properties. For the network measures to represent small-world and scale-free properties clustering coefficient, average shortest path distance and power-law property are used. Using the model proposed in this study we can have more clear understanding about relationships between small-world network and scale-free network. Using numerical examples we have verified the effects of two parameters on clustering coefficient, average shortest path distance and power-law property. Through this investigation it can be shown that small-world network, scale-free network or both can be generated by tuning two input parameters properly.

• Journal of Korean Institute of Industrial Engineers
• /
• v.40 no.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.

• Journal of applied mathematics & informatics
• /
• v.31 no.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.

• Journal of Internet Computing and Services
• /
• v.22 no.4
• /
• pp.123-134
• /
• 2021

This paper suggests that the Internet is not free through analysis of U.S. Internet history and lawsuits related to the Charter merger in 2016. Generally speaking, the players in internet connectivity market agree to Non-Disclosure Agreement, when connecting their facilities and networks each other. So, I adopted the case study & analysis as research methodologies due to limitation of collecting the transaction data between them. The former finds that Internet access has never been free in U.S Internet history. As we know, some including Content Providers(CPs) argue that the Internet is a free network and there are many cases to use the internet for free, so they came to conclusion that ISPs have no right to charge the users like CPs. This study refutes these arguments in two ways. One is that using the internet has never been free. From ARPANET, known as the beginning of the U.S. Internet, to the commercialization of backbone, no Internet has been considered or implemented for free since the early Internet network was devised. Also, the U.S government was paying subsidies or institutions were paying fees to secure network operations for the NSFNET backbone. the other is that "free peering" refers to barter transactions between ISPs, not to free access to counterpart internet networks. Second, this study analyze the FCC' executive order of conditioned merger approval and the court's related ruling and verify that using the internet is not free. According to the analysis, this study finds that it's real situation to make paid settlements between ISP-CPs (including OTTs) in the US Internet market at the moment. This study concludes that the Internet has never been free in terms of its technical characteristics, network structure, network operation, and system. Also it proposes how to improve the domestic settlement system between ISPs-CPs in terms of policy and regulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.7
• /
• pp.914-924
• /
• 2020

In this study we developed artificial network generation model, which can generate on-line social network. The suggested model can represent not only scale-free and small-world properties, but also can produce networks with various values of topological characteristics through controlling two input parameters. For this purpose, two parameter K and P are introduced, K for controlling the strength of preferential attachment and P for controlling clustering coefficient. It is found out on-line social network can be generated with the combinations of K(0~10) and P(0.3~0.5) or K=0 and P=0.9. Under these combinations of P and K small-world and scale-free properties are well represented. Node degree distribution follows power-law. Clustering coefficients are between 0.130 and 0.238, and average shortest path distance between 5.641 and 5.985. It is also found that on-line social network properties are maintained as network node size increases from 5,000 to 10,000.

• The Journal of the Korea Contents Association
• /
• v.11 no.5
• /
• pp.474-480
• /
• 2011

Most social networks have power-law distribution that is one of distinct properties in scale-free network. In contrast to social network character, people networks of the Goguryeo, Baekje, and Silla show dissemination network that is a narrow and deep-reaching style of information transmission. However, people network of three kingdoms that is integrated each national people reveals scale-free and hierarchical properties. Pattern of territory expansion and abridgment in Silla is distinct from those in Goguryeo and Baekje, indicating that the distinct pattern reflects a power for unification. Several patterns in national management and national development of the three kingdoms are also analyzed based on network. Our results provide new insight that is analyzed by network-based approaches but is not analyzed by historial approaches in history of three kingdoms.

• Journal of information and communication convergence engineering
• /
• v.11 no.2
• /
• pp.82-94
• /
• 2013

In this paper, we propose a novel tunnel-free scheme in a proxy mobile IPv6 (PMIPv6)-based nested network mobility environment; several mobile nodes (MNs) and mobile routers (MRs) compose a hierarchical wireless network topology. Because tunnels created by several MRs overlap and data packets travel along several local mobility anchors (LMAs), the utilization of the wireless section is reduced and the packet forwarding path of the wire-line section is not optimal. In our tunnel-free scheme, the mobile access gateway (MAG) plays an important role in both the wireless and wire-line sections. Using a local binding update, this tunnel-free scheme forwards data packets with a host-based routing table without any tunnel. Establishing a direct tunnel between the MAG and the last LMA, this scheme removes nested tunnels between intermediate LMAs and MRs, and optimizes the forwarding path to the MN in the wire-line section.

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.11
• /
• pp.2550-2556
• /
• 2012

We proposed the energy-efficient routing algorithm ALPS (Ad hoc network Localized Positioning System) algorithm that is range-free based on the distance information. The routing coordinate method of ALPS algorithm consists of hierarchical cluster routing that provides immediately relative coordinate location using RSSI(Received Signal Strength Indication) information. Existing conventional DV-hop algorithm also to manage based on normalized the range free method, the proposed hierarchical cluster routing algorithm simulation results show more optimized energy consumption sustainable path routing technique to improve the network management.