• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.917-922
• /
• 2004

Mobile ad hoc networks (MANETs) are networks of mobile nodes that have no fixed network infrastructure. Since the mobile node's location changes frequently, it is an attractive area to maintain the node's location efficiently. In this paper, we present an adaptive randomized database group (ARDG) scheme to manage the mobile nodes mobility in MHANETs. The proposed scheme stores the network nodes' location in location databases to manage the nodes' mobility. When a mobile node changes its location or needs a node's location, the node randomly select some databases to update or que교 the location information. The number of the selected databases is fixed in the case of querying while the number of the databases is determined according to the node's popularity in the case of updating. We evaluated the performance of the proposed scheme using an analytical model, and compared the performance with that of the conventional randomized database group (RDG) scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.8
• /
• pp.22-33
• /
• 2009

Mobile Ad Hoc Networks (MANETs) are self-organized networks that do not rely in their operation on wired infrastructure. As in any networking technology, security is an essential element in MANET as well, for proliferation of this type of networks. But supporting secure communication in MANETs proved to be a significant challenge, mainly due to the fact that the set of nodes in the network can change frequently and rapidly and due to the lack of access to the wired infrastructure. In particular, the trust model and the authentication protocols, which were developed for wired and infrastructure-based networks, cannot be used in MANETs. In [1], we addressed the problem of efficient authentication of distributed mobile users in geographically large networks and proposed a new authentication scheme for this case of MANETs. The proposed scheme exploits randomized groups to efficiently share authentication information among nodes that together implement the function of a distributive Certification Authority(CA). In this paper, we analyze numerically the performance of authentication method using randomized groups and compare with the simulation result.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1490-1495
• /
• 1998

Call packing has been recognized as a routing scheme that significantly reduces the blocking probability of connection requests in a circuit-switched Clos multistage interconnection network. In this paper, for the first time, a general analytical model for the point-to-point blocking probability of the call-packing scheme applied to Clos networks is developed. By introducing a new parameter called the degree of call packing, the model can correctly estimate the blocking probability of both call-packing and random routing schemes. The model is verified by computer simulation for various size networks and traffic conditions.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.3
• /
• pp.138-146
• /
• 2010

It is well known that many biological networks are very robust against various types of perturbations, but we still do not know the mechanism of robustness. In this paper, we find that there exist a number of feedback loops in a real biological network compared to randomly generated networks. Moreover, we investigate how the topological property affects network robustness. To this end, we properly define the notion of robustness based on a Boolean network model. Through extensive simulations, we show that the Boolean networks create a nearly constant number of fixed-point attractors, while they create a smaller number of limit-cycle attractors as they contain a larger number of feedback loops. In addition, we elucidate that a considerably large basin of a fixed-point attractor is generated in the networks with a large number of feedback loops. All these results imply that the existence of a large number of feedback loops in biological networks can be a critical factor for their robust behaviors.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.11a
• /
• pp.193-195
• /
• 2020

최근 IoT 기술의 발전을 통해 스마트홈 서비스가 사용자에게 활발하게 보급이 되고 있다. 스마트홈 서비스에서 발생하는 데이터는 개인정보를 내포하고 있으므로 보안이 매우 중요한 요소이다. 그러나 매해 스마트홈 해킹 신고가 증가하고 있으며 기존 네트워크 침입탐지 시스템은 관리자 계정을 탈취 당했을 경우 대응할 방법이 미비하다. 본 논문에서는 스마트홈 환경에서 발생하는 활동 데이터를 인공지능 알고리즘의 종류 중 하나인 랜덤포레스트를 통해 학습하고 분류모델을 구현했다. 구현한 모델은 87%이상의 높은 정확도로 측정되었다. 따라서 활동 데이터를 통해 분류를 시행하므로 네트워크에 이미 침입한 사용자를 탐지하여 대응할 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.337-339
• /
• 2005

본 논문에서는 임베디드 시스템의 제어를 위해 동기화 언어인 에스테렐로 개발된 소프트웨어가 소프트웨어 요구사항을 만족하는지 확인하기 위한 Model-based Test(MBT) 프레임 워크를 제안한다. 제안된 프레임 워크를 기반으로 작성한 프로토 타입의 테스트 도구는 요구사항 모델을 창조하여 On-the-fly 방법을 통해 테스트 케이스를 랜덤하게 자동으로 생성하여 소프트웨어에 대하 테스트를 자동으로 수행한다. 간단한 case study로 레고 마인드스톰 로봇 제어 소프트웨어에 MBT를 수행하고 그 결과를 확인한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.155-156
• /
• 2013

VM 간섭은 VM 프로비저닝을 할 때 예상된 VM 의 컴퓨팅 자원이 실제와 다르지 않도록 하기 위해 반드시 고려되어야 할 사항이다. 이에 본 논문에서는 예상된 VM 의 컴퓨팅 자원을 사용자가 보장받을 수 있도록 랜덤 워크를 이용해 간섭을 고려한 필요 자원을 구하는 방법에 대해 다루고 있다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.10
• /
• pp.735-745
• /
• 2001

Processors require both intensive and extensive functional verification in their design phase due to their general purpose. The proposed random vector verification method for embedded control RISC cores meets this goal by contributing assistance for conventional methods. The proposed method proved its effectiveness during the design of CalmRISCTM-32 developed by Yonsei Univ. and Samsung. It adopts a cycle-accurate instruction level simulator as a reference model, runs simulation in both the reference and the target HDL and reports errors if any difference is found between them. Consequently, it successfully covers errors designers easily pass over and establishes other new error check points.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.1
• /
• pp.190-197
• /
• 2010

The ACR (Access Control Router) of WiBro processes location registration of the Correspondent Node and Home Agent as the Correspondent Node moves between ACRs. Therefore, the location update cost is low compared with MIPv6. However, all packets which are sent and received are sent through the ACR, so as the number of mobile nodes that are managed by the ACR increases, the cost of packet delivery also increases. Therefore, the communication state of the ACR domain remains smooth when the ACR which manages the mobile node in the ACR domain has good performance. However, network delays occur unless the ACR performs well, so the role of the ACR is important. In this paper, we analysis performance of the ACR for efficient realization of the WiBro standard. By using the Deny Probability and the Total Profit of ACR performance and apply it to the Random Walk Mobility model as the mobility model.

• Journal of the Korea Convergence Society
• /
• v.11 no.4
• /
• pp.33-39
• /
• 2020

Interest in 5G communication security has been growing recently amid growing expectations for 5G technology with faster speed and stability than LTE. However, 5G has so far included disparate areas, so it has not yet fully supported the issues of security. This paper proposes a blockchain-based IoT management model in order to efficiently provide the authentication of users using IoT in 5G In order to efficiently fuse the authentication of IoT users with probabilistic theory and physical structure, the proposed model uses two random keys in reverse direction at different layers so that two-way authentication is achieved by the managers of layers and layers. The proposed model applied blockchain between grouped IoT devices by assigning weights to layer information of IoT information after certification of IoT users in 5G environment is stratified on a probabilistic basis. In particular, the proposed model has better functions than the existing blockchain because it divides the IoT network into layered, multi-layered networks.