• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.12
• /
• pp.642-652
• /
• 2001

Recently, the advent of World-Wide-Web(WWW) and the explosive popularity of the Internet gave birth to collaborative applications which were enabled by computers and networks as their primary media. The progress of 3D computer graphics enabled collaborative application with 3D virtual environments or distributed virtual environments. In this paper, we explain our implementation of the Share collaboration engine which is for collaboration applications based on a distributed virtual environment. We introduce Virtual Architectural Engineering 2000 (VAE2000) that is our pilot application implemented with the Share collaboration engine. The Share collaboration engine proposes a new Share network architecture for management of participants, and it provides some synchronization methods for 3D objects in virtual collaboration. VAE2000 is an experimental application that tries to prevent wastes of human, material and time resources in networked virtual collaboration.

• Journal of the Korean Society for Railway
• /
• v.17 no.6
• /
• pp.402-409
• /
• 2014

Wireless local area network (WLAN) is a widely used wireless access method due to its easy usability and excellent performance. However, its performance degrades significantly as the number of users increases. In busy train stations, where the number of WLAN users are large and, more importantly the number of simultaneous packet transmission attempts is extremely large due to the time synchronization upon train arrival, the packet transmission delay problem is very severe and almost impossible for WLAN stations to initiate communication with WLAN networks. In this paper, a novel distributed WLAN access scheme for efficient WLAN communication in busy train stations is proposed. Using the proposed scheme, WLAN access delay can be significantly reduced under highly congested traffic environments. Therefore, a significant performance enhancement for the WLAN performance used in the Communication Based Train Control (CBTC) can be achieved.

• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.20-29
• /
• 2002

The composite stock cutting problem is to allocate rectangular and/or irregular patterns onto a large composite stock sheet of finite dimensions in such a way that the resulting scrap will be minimized. In this paper, the distributed simulated annealing with the new cost error tolerant spatial decomposition is applied to the composite stock cutting problem in MPI environments. The cost error tolerant scheme relaxes synchronization and chooses small perturbations on states asynchronously in a dynamically changed stream length to keep the convergence property of the sequential annealing. This paper proposes the efficient data structures for representation of patterns and their affinity relations and also shows how to determine move generations, annealing parameters, and a cost function. The spatial decomposition method is addressed in detail. This paper identifies that the final quality is not degraded with almost linear speedup. Composite stock shapes are not constrained to convex polygons or even regular shapes, but the rotations are only allowed to 2 or 4 due to its composite nature.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.1
• /
• pp.77-87
• /
• 2008

Recently, many hash-based authentication protocols were presented to guarantee mutual authentication between tag and DB in RFID system. To be suitable for distributed DB environment, one generally uses fixed constant value as a tag ID. However, some existing protocols have security flaws or heavy computational loads in DB in order to search a tag ID. We propose a secure authentication protocol which is suitable for distributed DB environment by using unchangeable tag ID. The storage method of pre-synchronized information in DB at previous session is core idea of our proposal which gives low-cost ID search of DB at next session. In normal synchronization state, our protocol only requires 3 hash operations in tag and DB respectively.

• Journal of Internet Computing and Services
• /
• v.13 no.6
• /
• pp.63-74
• /
• 2012

In this paper, we develop an integrated management/monitoring system that supports to dynamically reconfigure information models for systems or applications managed by heterogeneous distributed systems. When the subsystems on diverse platforms are added, removed, or modified, the altered configurations should conform to the configuration information of the integrated management/monitoring system. Further, upon the system configurations being changed, the altered system configurations should be synchronized with the information on the integrated management/monitoring system. Moreover, availability should be assured during synchronization to the extent that users can access the monitoring information with no system halting. This paper focuses on notifying the integrated management/monitoring system of any changes in hardware/software configurations on any subsystems under its management, and on dynamically re-configuring the information about hardware and software being managed based on the information notified. Finally, we expect that this research will be contributory to carrying out reliable integrated management by reflecting the information on any heterogeneous distributed systems in the integrated management/monitoring system.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.831-833
• /
• 2004

In this paper, an obstacle avoidance algorithm is proposed for a network-based robot considering network delay by distribution. The proposed algorithm is based on the VFH(Vector Field Histogram) algorithm, and for the network-based robot system, in which it is assumed robot localization information is transmitted through network communication. In this paper, target vector for the VFH algorithm is estimated through the robot localization information and the measurement of its delay by distribution. The delay measurement is performed by time-stamp method. To synchronize all local clocks of the nodes distributed on the network, a global clock synchronization method is adopted. With the delay measurement, the robot localization estimation is performed by calculating the kinematics of the robot. The validation of the proposed algorithm is performed through the performance comparison of the obstacle avoidance between the proposed algorithm and the existing VFH algorithm on the network-based autonomous mobile robot.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.941-955
• /
• 2015

In dual-channel networks (DCNs), all frequency hopping (FH) sequences used for data channels are chosen from the original FH sequence used for the control channel by shifting different initial phases. As the number of data channels increases, the hitting frequency point problem becomes considerably serious because DCNs is non-orthogonal synchronization network and FH sequences are non-orthogonal. The increasing severity of the hitting frequency point problem consequently reduces the resource utilization efficiency. To solve this problem, we propose a novel hitting frequency point collision avoidance method, which consists of a sequence-selection strategy called sliding correlation (SC) and a collision avoidance strategy called keeping silent on hitting frequency point (KSHF). SC is used to find the optimal phase-shifted FH sequence with the minimum number of hitting frequency points for a new data channel. The hitting frequency points and their locations in this optimal sequence are also derived for KSHF according to SC strategy. In KSHF, the transceivers transmit or receive symbol information not on the hitting frequency point, but on the next frequency point during the next FH period. Analytical and simulation results demonstrate that unlike the traditional method, the proposed method can effectively reduce the number of hitting frequency points and improve the efficiency of the code resource utilization.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2008.11a
• /
• pp.31-34
• /
• 2008

양방향 중계 채널(two-way relay channel)은 2명의 사용자가 중계기(relay)의 도움을 받아 서로 정보를 주고받는 통신 채널이다. 중계기에서는 각각의 사용자로부터 독립적으로 수신한 두 데이터 패킷에 네트워크 코딩 기법을 적용하고, 이를 통해 만든 패킷을 두 사용자에게 동시에 전송한다. 따라서 양방향 중계 채널에서는 기존의 협력 통신에 비해 보다 효율적인 자원의 사용이 가능하다. 한편, 다중 중계기 환경에서의 중계기 선택 기반 전송 방식은 시스템의 전력 제한(power constraint), 전송 패킷의 동기화(synchronization) 문제 등을 고려할 때 다중 중계기 기반 전송 방식보다 우수한 성능을 얻을 수 있다. 본 논문에서는 양방향 다중 중계기 채널에서 중계기 선택 기법을 제안한다. 양방향 중계 채널에서는 수신한 두 신호의 결합을 위해 중계기에서 네트워크 코딩 기법을 적용함으로써 중계기의 부담이 보다 증가하는 특징이 있다. 또한, 중계기는 신호 전송 시 두 사용자 모두에게 전송하게 되고 이로 인해 두 수신지와의 채널 조건을 모두 고려하여야 한다. 따라서 중계기 선택은 데이터 패킷의 전송이 시작되기 전에 분산된 방식(distributed method)으로 이루어지며, 각각의 사용자와 중계기 간 일시적(instantaneous) 채널 이득을 바탕으로 사용자-사용자 간(end-to-end) 경로 조건의 최대값을 계산하는 메트릭(metric)을 중계기 선택 기준으로 사용한다. 모의실험을 통해 제안된 중계기 선택 기법이 중계기의 개수에 해당하는 다이버시티 이득을 얻을수 있음을 보여준다.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.4
• /
• pp.361-372
• /
• 2004

Collaborative and distributed engineering web services are emerging as a viable alternative to the traditional design and engineering process automation. Existing approaches have limitations in supporting long-running engineering transactions, automatic engineering process orchestration and choreography, synchronous and asynchronous conversation, and geometric abstraction for transmission and sharing. In this paper, we present a process-centric engineering web service methodology to overcome these limitations by utilizing BPEL-based (Business Process Execution Language) process templates and coordination broker-based conversation support. This paper discusses the synchronization of engineering web services which can be either peer-centric or process-centric to support long-running engineering transactions and conversation. The process orchestration and choreography broker works as a service dispatching and aggregation mediator for executing process templates, which enables the individual activity or the engineering process to dynamically select and invoke one of the alternative web services through the run-time process brokering. Further, the paper presents how to support collaboration over the running process using conversation policy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.684-702
• /
• 2011

This paper proposes a TDMA-based multichannel medium access control (MAC) protocol for QoS provisioning in mobile ad hoc networks (MANETs) that enables nodes to transmit their packets in distributed channels. The IEEE 802.11 standard supports multichannel operation at the physical (PHY) layer but its MAC protocol is designed only for a single channel. The single channel MAC protocol does not work well in multichannel environment because of the multichannel hidden terminal problem. Our proposed protocol enables nodes to utilize multiple channels by switching channels dynamically, thus increasing network throughput. Although each node of this protocol is equipped with only a single transceiver but it solves the multichannel hidden terminal problem using temporal synchronization. The proposed energy efficient multichannel MAC (EM-MAC) protocol takes the advantage of both multiple channels and TDMA, and achieves aggressive power savings by allowing nodes that are not involved in communications to go into power saving "sleep mode". We consider the problem of providing QoS guarantee to nodes as well as to maintain the most efficient use of scarce bandwidth resources. Our scheme improves network throughput and lifetime significantly, especially when the network is highly congested. The simulation results show that our proposed scheme successfully exploits multiple channels and significantly improves network performance by providing QoS guarantee in MANETs.