• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.314-323
• /
• 2002

The routing protocols designed for wired networks can hardly be used for mobile ad-hoc networks due to limited bandwidth of wireless transmission and unpredictable topological change. Recently, several routing protocols for mobile ad-hoc networks have been Proposed. However, when theme protocols are applied to support real time services like multimedia transmission, they still have problems in ad-hoc networks, where the topology changes drastically. In this paper, we propose a new route selection algorithm which selects the most reliable route that is impervious to route failures by topological changes by mobile hoots. For reliable route selection, the concept of virtual zone (stable zone and caution zone) is proposed. The zone is located in a mobile node'transmission range and determined by mobile node's mobility information received by Global Positioning System (GPS). The proposed algorithm is applied to the route discovery procedure of the existing on-demand routing protocol, AODV, and evaluated by simulation in various traffic conditions and mobility patterns.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.140-149
• /
• 2004

Data broadcast has received much attention as a very efficient method for disseminating data items in mobile environment with large number of mobile clients. In this approach, a database server periodically and continuously broadcasts data items through wireless channels and clients perform read-only transactions by accessing necessary data items from the air. While broadcasting, the server must also process update transactions on the database, which raises an obstacle for client's accessing consistent data. In this research, we propose a new algorithm SCDSC(Serialization Checking with DirtySet on Commit) which is an alternative for solving the concurrency control problem efficiently. The SCDSC is a kind of optimistic concurrency control in that a client checks the consistency of data using a DirtySet as a part of data broadcast when it commits its transaction. In each broadcast cycle, the server updates and disseminates the DirtySet with newly changed data items for last few cycles in the sliding window approach. We perform an analysis and a simulation study to evaluate the performance of our SCDSC algorithm in terms of data consistency and data currency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.1
• /
• pp.175-182
• /
• 2011

In this paper, we implemented a high-performence memory controller which can accommodate processing blocks(multiple masters) in SoC for video signal processing. The memory controller is arbitrated by the internal arbiter which receives request signals from masters and sends grant and data signals to masters. The designed memory controller consists of Master Selector, Mster Arbiter, Memory Signal Generator, Command Decoder, and memory Signal Generator. It was designed using VHDL, and verified using the memory model of SAMSING Inc. For FPGA synthesis and verification, Quartus II of ATERA Inc. was used. The target device is Cyclone II. For simulation, ModelSim of Cadence Inc was used. Since the designed H/W can be stably operated in 174.28MHz, it satisfies the specification of SDRAM technology.

• Journal of Internet Computing and Services
• /
• v.15 no.4
• /
• pp.9-20
• /
• 2014

Making good predictions about the outcome of one's actions would seem to be essential in the context of social interaction and decision-making. This paper proposes a computational model for learning articulated motion patterns for action recognition, which mimics biological-inspired visual perception processing of human brain. Developed model of cortical architecture for the unsupervised learning of motion sequence, builds upon neurophysiological knowledge about the cortical sites such as IT, MT, STS and specific neuronal representation which contribute to articulated motion perception. Experiments show how the model automatically selects significant motion patterns as well as meaningful static snapshot categories from continuous video input. Such key poses correspond to articulated postures which are utilized in probing the trained network to impose implied motion perception from static views. We also present how sequence selective representations are learned in STS by fusing snapshot and motion input and how learned feedback connections enable making predictions about future input sequence. Network simulations demonstrate the computational capacity of the proposed model for motion recognition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11C
• /
• pp.140-147
• /
• 2001

In this paper, we propose a scheme of calculating resources\` costs for precomputation in QoS routing schemes. This scheme is effective in respect to the g1oba1 network utilization and the balanced use of network resources. We also propose a QoS routing scheme for transit and intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load and then selects paths with the probability of path selection. We, therefore, expect that the paths are better than any other paths in respect to reserving the network resources on paths. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme. And for analysis of a load balancing cost calculation proposed a simulation is done.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.10
• /
• pp.841-849
• /
• 2012

This paper proposes an low-complexity soft-output multiple-input multiple-output (soft-MIMO) detection algorithm for achieving soft-output maximum-likelihood (soft-ML) performance under max-log approximation. The proposed algorithm is based on a parallel tree-search (PTS) applying a channel ordering by a sorted-QR decomposition (SQRD) with altered sort order. The empty-set problem that can occur in calculation of log-likelihood ratio (LLR) for each bit is solved by inserting additional nodes at each search level. Since only the closest node is inserted among nodes with opposite bit value to a selected node, the proposed node insertion scheme is very efficient in the perspective of computational complexity. The computational complexity of the proposed algorithm is approximately 37-74% of that of existing algorithms, and from simulation results for a $4{\times}4$ system, the proposed algorithm shows a performance degradation of less than 0.1dB.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9A
• /
• pp.758-766
• /
• 2011

Cooperative communications are adopted as a promising solution to achieve high data rate over large areas in the future 40 wireless system and the relay station (RS) is the key concept in cooperative communications. However, most existing works in this area focus only on optimal RS selections. In addition, there are only few works consider another crucial issue: how many relay stations we need to place. Only when the number of relay stations is defined, the relay station selection can be performed well. In this paper we derive a formula which describes the impact of varying number of RS on end-to-end link throughput assuming a clustering scheme which is based on Voronoi tessellation. In addition to mathematical analysis on the feasibility of the formula, we also examine its performance through a set of simulations under the Erceg path loss model. Simulation results verify that the link throughput gain of our proposed scheme is promising.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.981-987
• /
• 2009

Recently, the study on wireless body area network for providing ubiquitous healthcare services has been actively done, including the standardization of the IEEE and others. Wireless body area network is usually configured in tree format using multi-hop communication mode due to the power limitation and the characteristics of human body. In this case, differently from existing sensor network, the wireless body area network tends to be disconnected due to the frequent movement of human body. The number of connections which can be supported at each node has some limitations due to the constraint imposed on power consumption. In this paper, we have proposed a heuristic algorithm for optimal selection of parent node with guaranteed QoS for a disconnected node, which considers the priority on packet transmission. Simulation has been performed to evaluate the performance of the proposed algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.2
• /
• pp.1-8
• /
• 2010

In this paper, we propose a scheduling strategy for grid environment that reduces resource cost. This strategy considers resource cost and job failure rate to efficiently allocate local computing resources. The key idea of our strategy is that we use two-level scheduling using remote and local scheduler. The remote scheduler determines the expected total execution times of jobs using the current network and local system status maintained in its resource database and allocates jobs with minimum total execution time to local systems. The local scheduler recalculates the waiting time and execution time of allocated job and uses it to determine whether the job can be processed within the specified deadline. If it cannot finish in time, the job is migrated other local systems, through simulation, we show that it is more effective to reduce the resource cost than the previous Greedy strategy. We also show that the proposed strategy improves the performance compared to previous Greedy strategy.

• The Korean Journal of Applied Statistics
• /
• v.26 no.6
• /
• pp.933-942
• /
• 2013

Common factor analysis and principal component analysis represent two technically distinctive approaches to exploratory factor analysis. Much of the psychometric literature recommends the use of common factor analysis instead of principal component analysis. Nonetheless, factor analysts use principal component analysis more frequently because they believe that principal component analysis could yield (relatively) less accurate estimates of factor loadings compared to common factor analysis but most often produce similar pattern of factor loadings, leading to essentially the same factor interpretations. A simulation study is conducted to evaluate the relative performance of these two approaches in terms of factor pattern recovery under different experimental conditions of sample size, overdetermination, and communality.The results show that principal component analysis performs better in factor recovery with small sample sizes (below 200). It was further shown that this tendency is more prominent when there are a small number of variables per factor. The present results are of practical use for factor analysts in the field of marketing and the social sciences.