• 디지털융복합연구
• /
• 제11권9호
• /
• pp.87-94
• /
• 2013

정보통신망상에 무분별하게 유통되는 각종 불법정보에 대한 기존의 법적규제는 정보통신서비스제공자의 형사적 책임과 민사적 책임을 중심으로 논의되고 있다. 하지만 본 논문에서는 정보통신망상의 불법정보 차단을 위한 경찰권행사의 대상으로서 경찰책임의 문제로 접근해보았다. 이러한 인식을 근거로 정보통신망상 불법정보의 신속한 차단을 위해 행위책임자에 대한 직접적 규제방식이 아닌 상태책임자인 정보통신서비스제공자에 대한 간접적 규제방식을 채택하고 있는 현행 정보통신망법 제44조의7 제2항의 문제점과 개선방안을 제시하고자 하였다.

• 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 Communications and Networks
• /
• 제14권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.

• 한국IT서비스학회지
• /
• 제10권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
• /
• 제13권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.

• 사물인터넷융복합논문지
• /
• 제8권5호
• /
• pp.111-117
• /
• 2022

익명 네트워크는 감시나 트래픽 추적을 피하기 위한 정보통신 보호를 목적으로 설계된 네트워크이다. 그러나 최근에는 이러한 특성을 악용하여 사이버 범죄자들이 익명 네트워크를 활용하여 사이버 범죄를 일으키고, 사법 당국의 추적을 회피하고 있다. 본 논문에서는 익명 네트워크 중 하나인 Tor를 중심으로 관련 연구를 조사한다. 본 논문은 Tor가 어떻게 익명성을 제공하는지 소개하고, Tor를 대상으로 어떻게 사용자를 추적할 수 있는지 소개한다. 또한 각 추적 기술을 비교 분석하였으며, 연구자가 실험 환경을 어떻게 구축할 수 있는지 설명한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권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.

• 한국정보통신학회논문지
• /
• 제18권1호
• /
• pp.57-62
• /
• 2014

다수의 중계기가 균등하게 분포된 무선 소거 네트워크의 용량 스케일링 법칙을 분석함으로써 인프라 구조 사용시 이득을 보인다. 가정하는 네트워크 하에서 소거 확률을 적절히 모델링함에 근거하여, 혼합 소거 네트워크에서 취득 가능한 네트워크 용량을 보인다. 보다 구체적으로, 지수 감쇠 모델 및 다항 감쇠 모델 이렇게 두 가지 물리적 모델을 사용한다. 중계기 도움이 없는 다중 홉 전송, 중계기 도움을 받는 다중 홉 전송 이렇게 두 가지 존재하는 기술을 사용하여 취득 용량을 분석한다. 유도된 용량 스케일링 법칙은 두 가지 물리적 모델 모두에 대해 노드 수 및 중계기의 수에 의존함을 확인한다.

• 융합신호처리학회논문지
• /
• 제8권1호
• /
• pp.39-43
• /
• 2007

고속통신망에서 데이터 전송률의 결정은 폭주제어 기법을 갖는 되먹임 구조 통신망시스템의 안정성에 매우 중요한 요소이다. 비동기전송망에서, ABR 서비스는 하위 노드의 트래픽 정보를 전달할 수 있는 RM(resource management) 셀 기반의 되먹임 구조를 갖는다. 그러나 일반적인 IP 기반 통신망에서는 하위 노드 트래픽의 현재상태가 각 전송원으로 바로 전달되어 질 수 없다. 본 논문에서는 고속통신망에서의 폭주 제어를 위해 지수이동가중 평균(exponential weighted moving average: EWMA)을 이용한 전송률 기반의 효과적인 되먹임 통신망 제어 기법을 제안한다. 제안된 통신망 폭주 제어기법은 스위치 대기열의 안정성을 보장하고 보다 높은 통신망 활용 효율을 보인다. 또한, 제안된 폭주제어 기법은 통신망에서의 전송원의 수의 증가에 대하여 보다 유연성을 갖으며, 이를 통하여 망 확장성을 증가시킬 수 있다.

• Journal of Communications and Networks
• /
• 제6권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.