• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.56-66
• /
• 2008

Contention-based forwarding in wireless ad-hoc networks reduces transmission failure rate by selecting one receiver with good channel among multiple receivers. However, contention-based forwarding may increase transmission latency due to the collision problem caused by the simultaneous transmission among multiple receivers. In this paper, we present an analytic model that reflects the delay and collision rate of contention-based forwarding in lossy wireless links. Through the analytic model, we calculate the expected delay and progress in one-hop transmission under given wireless link model and delay model. Based on the analytic results, we observe that delay model should be adapted to wireless link model for optimal performance in contention-based forwarding.

• ETRI Journal
• /
• v.21 no.2
• /
• pp.31-39
• /
• 1999

Given two sorted lists A=(a0, a1, ${\cdots}$,a${\ell}$-1}) and B=(b0, b1, ${\cdots}$, bm-1), we are to merge these two lists into a sorted list C=(c0,c1, ${\cdots}$, cn-1), where n=${\ell}$+m. Since this is a fundamental problem useful to solve many problems such as sorting and graph problems, there have been many efficient parallel algorithms for this problem. But these algorithms cannot be performed efficiently in the postal model since the communication latency ${\lambda}$, which is of prime importance in this model, is not needed to be considered for those algorithms. Hence, in this paper we propose an efficient merge algorithm in this model that runs in $$2{\lambda}{\frac{{\log}n}{{\log}({\lambda}+1)}}+{\lambda}-1$$ time by using a new property of the bitonic sequence which is crucial to our algorithm. We also show that our algorithm is near-optimal by proving that the lower bound of this problem in the postal model is $f_{\lambda}({\frac{n}{2}})$, where $${\lambda}{\frac{{\log}n-{\log}2}{{\log}([{\lambda}]+1)}{\le}f_{\lambda}({\frac{n}{2}}){\le}2{\lambda}+2{\lambda}{\frac{{\log}n-{\log}2}{{\log}([{\lambda}]+1)}}$$.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.4
• /
• pp.412-417
• /
• 2005

The Internet has been widely applied to the remote control system. The network-based control system, however, has a random time delay and an inherent weak point of the network, when the data ate transmitted. The network delay may result in performance degradation or even system instability in teleoperation. In this paper a prediction model of network delay using TSK (Takagi-Sugeno-Kang) fuzzy model is presented. An adaptive scheme is developed to update the prediction model according to the current network status. The prediction model is applied to the control of an Internet-based mobile robot to show its usefulness. In the computer simulation the TSK Prediction model of network delay is proven superior to the conventional algorithms.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.11 s.353
• /
• pp.35-43
• /
• 2006

In this paper we have presented a network based high-speed handover protocol using NetLMM(Network based Localized Mobility Management) WG protocol in IETF(Internet Engineering Task Force). We use IEEE 802.21 MIHS(Media Independent Handover Services) for improving handover latency and we analysis proposed Fast NetLMM protocol performance using Fluid Flow Mobility Model. Evaluation results show that the Fast NetLMM protocol performance is better than other mobility management protocols.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.1814_1816
• /
• 2009

ZigBee is a technology that is being rapidly developed since its power consumption is low and the stability of its communication is high. However, documented data which is coded using conventional programming languages such as C or assembly programming language would not be able to fulfill the various requirements upon application development by ZigBee. Unified Modelling Languge (UML) could be one of the alternatives to solve this problem. UML provides a variety of diagrams by which the results of the software development can be presented visually and by which the developers can communicate more spontaneously. This paper shows the results of an ongoing study into the application of model-driven methods for ZigBee Application. Also, this paper shows that this approach is feasible by comparing memory usage, latency, and power consumption of UML modelling code with those of handwritten code.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.368-371
• /
• 1999

In this paper, we propose a neural network processor architecture with on-chip learning and with reconfigurability according to the data dependencies of the algorithm applied. For the neural network model applied, the proposed architecture can be configured into either SIMD or SRA(Systolic Ring Array) without my changing of on-chip configuration so as to obtain a high throughput. However, changing of system configuration can be controlled by user program. To process activation function, which needs amount of cycles to get its value, we design it by using PWL(Piece-Wise Linear) function approximation method. This unit has only single latency and the processing ability of non-linear function such as sigmoid gaussian function etc. And we verified the processing mechanism with EBP(Error Back-Propagation) model.

• Proceedings of the KSME Conference
• /
• 2004.04a
• /
• pp.557-562
• /
• 2004

For constructing virtual environment it is more natural to model object as deformable body than as rigid body. High accuracy of simulation of model and low-latency computational cost for real-time simulation should be guaranteed. We pre-compute Green function through finite element analysis of deformable body and it is possible to simulate deformation of body in real-time environment using Capacitance Matrix Algorithm. Also, the capacitance matrix algorithm enables to construct the haptic rendering which serves the reaction force through a haptic device. The Newmark scheme is used for the more realistic haptic rendering and dynamic simulation in real-time.

• Journal of Communications and Networks
• /
• v.15 no.2
• /
• pp.222-227
• /
• 2013

This paper presents an analytical framework for dynamic spectrum allocation in cognitive radio networks. We propose a distributed queuing based Markovian model each for single channel and multiple channels access for a contending user. Knowledge about spectrum mobility is one of the most challenging problems in both these setups. To solve this, we consider probabilistic channel availability in case of licensed channel detection for single channel allocation, while variable data rates are considered using channel aggregation technique in the multiple channel access model. These models are designed for a centralized architecture to enable dynamic spectrum allocation and are compared on the basis of access latency and service duration.

• Journal of the Semiconductor & Display Technology
• /
• v.20 no.4
• /
• pp.10-15
• /
• 2021

Cache bypassing schemes have been studied to remove unnecessary updating the data in cache blocks. Among them, a statistics-based cache bypassing method for asymmetric-access caches is one of the most efficient approach for non-voliatile memories and shows the lowest cache access latency. However, it is proposed under the condition of the normal cache system, so further study is required for the hybrid cache architecture. This paper proposes a novel cache bypassing scheme, called hybrid bypassing block selector. In the proposal, the new model is established considering the SRAM region and the non-volatile memory region separately. Based on the model, hybrid bypassing decision block is implemented. Experiments show that the hybrid bypassing decision block saves overall energy consumption by 21.5%.

• Journal of Communications and Networks
• /
• v.3 no.4
• /
• pp.342-350
• /
• 2001

The Internet routing instability, or the rapid fluctuation of network reachability information, is an important problem currently facing the Internet engineering community. High levels of network instability can lead to packet loss, increased network latency, and delayed routing convergence. At the extreme, high levels of routing instability can lead to the loss of internal connectivity in wide-area networks. In this paper, we investigate the variation of domain degree and domain count of the inter-domain network over time by using linear regression model in order to analyze the topology variation of inter-domain network. We Also propose an efficient policy management model to reduce the instability in the inter-domain routing system. The proposed model can be used to identify whether a routing policy is adequate to reduce convergence time that is required to return to a normal state when BGP routing instability happens. Experimental analysis shows that the proposed model can be used to set up routing policy in domains for the purpose of minimizing the effects and the propagation of BGP routing instability.