• Journal of Digital Convergence
• /
• v.11 no.9
• /
• pp.87-94
• /
• 2013

The existing legal regulations that indiscriminately distributed various illegal information on the information network are discussing focused on civil liability and criminal liability. however, at this paper that approached with problem of police responsibility as a target of the exert of police authority for blocking illegal information on the information network. based on this recognition, this paper propose the problem and reformation about the present Information Communication Networks law's 7 of Article 44, Section 2 that for prompt blocking illegal information on the information network, not about direct regulatory approach to a person in charge of act but about the information network service provider which is a person in charge of condition.

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

• Journal of Communications and Networks
• /
• v.14 no.5
• /
• pp.546-553
• /
• 2012

Compact routing intends to achieve good tradeoff between the routing path length and the memory overhead, and is recently considered as a main alternative to overcome the fundamental scaling problems of the Internet routing system. Plenty of studies have been conducted on compact routing, and quite a few universal compact routing schemes have been designed for arbitrary network topologies. However, it is generally believed that specialized compact routing schemes for peculiar network topologies can have better performance than universal ones. Studies on complex networks have uncovered that most real-world networks exhibit power-law degree distributions, i.e., a few nodes have very high degrees while many other nodes have low degrees. High-degree nodes play the crucial role of hubs in communication and inter-networking. Based on this fact, we propose two highest-degree landmark based compact routing schemes, namely HDLR and $HDLR^+$. Theoretical analysis on random power-law graphs shows that the two schemes can achieve better space-stretch trade-offs than previous compact routing schemes. Simulations conducted on random power-law graphs and real-world AS-level Internet graph validate the effectiveness of our schemes.

• Journal of Information Technology Services
• /
• v.10 no.1
• /
• pp.21-34
• /
• 2011

Spam refers to any unwanted or unauthorized commercial messages. Spam may violate individuals' privacy or other personal rights. Spam often overloads network traffic, wastes individuals' time, lowers productivity and quality of life, and limits the trustworthiness of Internet businesses. As the use of mobile messaging services and social networking services both on mobile communication networks and on the Internet increase, newer and more complex types of IT applications and services are often used as new means of spam. In this research, the characteristics and impact of new and future forms of spam, and anti-spam related policies and regulations are surveyed. To improve the effectiveness of anti-spam policies and regulations in Korea, adding a definition of spam in the law, changing policies to focus on the 'type of services' rather on the medium of transmission, and redefining the scope of 'commercial purposes' in Korean law are suggested.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.511-517
• /
• 2011

The capacity of wireless ad-hoc networks is analyzed for all kinds of information dissemination based on single and multiple packet reception schemes under the physical model. To represent the general information dissemination scheme, we use (n, m, k)-cast model [1] where n, m, and k (k ${\leq}$ m) are the number of nodes, destinations and closest destinations that actually receive packets from the source in each (n, m, k)-cast group, respectively. We first consider point-to-point communication, which implies single packet reception between transmitter-receiver pairs and compute the (n, m, k)-cast communications. Next, the achievable throughput capacity is computed when receiver nodes are endowed with multipacket reception (MPR) capability. We adopt maximum likelihood decoding (MLD) and successive interference cancellation as optimal and suboptimal decoding schemes for MPR. We also demonstrate that physical and protocol models for MPR render the same capacity when we utilize MLD for decoding.

• Journal of Internet of Things and Convergence
• /
• v.8 no.5
• /
• pp.111-117
• /
• 2022

Anonymous networks are designed to protect information and communication by avoiding monitoring or tracking traffic. In recent years, however, cybercriminals have evaded law enforcement tracking by exploiting the characteristics of anonymous networks. In this paper, we investigate related research focusing on Tor, one of the anonymous networks. This paper introduces how Tor provides anonymity, and how tracing technologies can track users against Tor. In addition, we compare and analyze tracing techniques, and explain how a researcher can establish an experimental environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.1028-1048
• /
• 2011

The relation of multicast transmission and directional antennas is an open problem that has been debated for a long period of time. In this paper, we propose a group-aware multicast scheme of efficient multicast communication using the directional antennas for 60GHz millimeter wave wireless networks. For this purpose, we first derive the relation among beamwidth, distance between devices and most suitable data rate in the 60GHz frequency-based wireless network. In addition, for the dynamic beamforming of multicast communication, the x and y coordinates of any point with sender device at the center is generated, and a best-chosen group is deduced based on the Euclidean distance. Then the most suitable data rate for the group is obtained using the law of cosine. Using the Standard IEEE 802.11ad MAC protocol as an example, extensive simulation results demonstrate that the proposed scheme outperforms the existing multicast communication schemes with directional antennas under different situations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.57-62
• /
• 2014

The benefits of infrastructure support are shown by analyzing a throughput scaling law of an erasure network in which multiple relay stations (RSs) are regularly placed. Based on suitably modeling erasure probabilities under the assumed network, we show our achievable network throughput in the hybrid erasure network. More specifically, we use two types of physical models, a exponential decay model and a polynomial decay model. Then, we analyze our achievable throughput using two existing schemes including multi-hop transmissions with and without help of RSs. Our result indicates that for both physical models, the derived throughput scaling law depends on the number of nodes and the number of RSs.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.1
• /
• pp.39-43
• /
• 2007

In high speed communication networks, the determination of a transmission rate is critical for the stability of a closed-loop network system with the congestion control scheme. In ATM networks, the available bit rate (ABR) service is based on a feedback mechanism, i.e., the network status is transferred to the ABR source by a resource management (RM) cell. RM cells contain the traffic information of the downstream nodes for the traffic rate control. However, the traffic status of the downstream nodes can not be directly transferred to the source node in the IP based networks. In this paper, a new rate-based congestion control scheme using an exponential weighted moving average algorithm is proposed to build an efficient feedback control law for congestion avoidance in high speed communication networks. The proposed congestion control scheme assures the stability of switch buffers and higher link utilization of the network. Moreover, we note that the proposed congestion scheme can flexibly work along with the increasing number of input sources in the network, which results in an improved scalability.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.226-234
• /
• 2004

This work presents a deterministic channel that rules according to inverse a power propagation law. The proposed channel model allows us to derive the lower bound and upper bound of packet's capture probability in Rayleigh fading and shadowing cellular mobile system. According to these capture probabilities, we analyze the system performance in the case of finite stations and finite communicated coverage of a base station. We also adopted a dynamic backoff window size to discuss the robustness of IEEE 802.11 draft standard. Some suggestions and conclusions from numerical results are given to establish the more strong CSMA/CA protocol.