• Proceedings of the Safety Management and Science Conference
• /
• 2000.11a
• /
• pp.63-71
• /
• 2000

대량생산체제를 위주로 했던 산업혁명 초기에는 원가계산방식이 비교적 수월하였다. 생산에 투입된 비용을 그대로 생산량으로 나누기만 하면 되었고 이 수치를 그대로 원가라고 간주하여도 기업이 존속하는데는 아무 영향이 없었다. 물론 이 때에도 간접비라는 것은 존재하였으나 그 비중이 미미했기에 이를 무시하여도 되었던 것이다. 그러나 그 때와 달리 지금은 기업환경은 다품종 소량생산, 고객 주문 생산 등의 다양한 형태로 변화되어 왔으며 유연생산시스템, 적시생산시스템 등과 같은 새로운 경영기법 및 생산관리 기법이 발달함에 따라 그간 무시되어 왔던 간접비가 오히려 직접비보다도 많아지는 현상이 생기게 되었다. 그래서 증가하는 간접비를 효과적으로 제품이나 서비스에 배부하여야 하는 필요성에서 연구가 시작되었고 그 결과로서 나온 원가계산방법이 활동기준원가계산시스템이다. 우리 나라에는 90년대 초반에 도입되어 여러기업이 시스템을 구축한 상태이며 이에 대한 사례를 연구한 논문도 발표되었다. 활동기준원가 계산시스템이 기존의 원가계산시스템보다 더 정교하다는 것은 많은 이미 많은 연구들에서 입증이 되었지만 그래도 실제 시스템의 구축에 있어서는 아직도 많은 연구과제가 남아있다. 본 연구는 시스템의 구축과정에서 핵심과정으로써 반드시 거쳐야 하는 활동분석단계에 관심을 두고 활동분석과정을 가능한 적은 비용으로 빠르게 수행하기 위한 방법을 모색하였다. 그 방법으로 선택한 것이 기존의 기업보유자료를 이용하여 활동분석을 수행하는 것으로 비록 활동분석데이터의 신뢰성에는 조금 부족한 면이 있을 수 있으나 기업보유자료가 활동분석과 개연성이 있음을 제시하고자 하였다. 한다.드가 전송한 패킷은 이전 셀 지역에 있는 에이전트가 새로운 셀 지역에 있는 이동 노드로 패킷을 재전송하여 전달하는 smooth 핸드오프 기능을 제공한다. 이전 셀 지역에 속한 외부 에이전트가 바인딩을 갱신하기 전에 송신 노드로부터 이동노드로 전달된 패킷이 있을 경우는 패킷을 저장하여 이후에 이동 노드의 위치 정보에 관한 바인딩 정보가 갱신되면 이러한 바인딩 정보에 따라 패킷을 재전송하는 버퍼기능도 제공한다. route optimization mobile IP는 기본적인 mobile IP에서의 복잡한 라우팅 문제를 해결하고, 핸드오프에서의 패킷 손실률을 최소화 한다.본 논문에서는 컴퓨터 시뮬레이션을 통해 smooth 핸드오프를 이용한 mobile IP의 성능을 분석한다. 일반적으로 데이터 트래픽 특성, 노드의 이동성, 바인딩 갱신시간, 버퍼관리 방법 등은 핸드오프 동안 mobile IP의 성능에 많은 영향을 미친다. 따라서 시뮬레이션 모델을 이용하여 다양한 트래픽 환경에서 위에 언급된 성능 파라미터들의 영향을 분석한다. 마지막으로 시뮬레이션 결과를 이용하여 mobile IP의 성능을 개선시키기 위한 방법을 제시한다. 제시하고자 한다.과로 여겨지며, 또한 혈청중의 ALT, ALP 및 LDH활성을 유의성있게 감소시키므로서 감잎 phenolic compounds가 에탄올에 의한 간세포 손상에 대한 해독 및 보호작용이 있는 것으로 사료된다.반적으로 홍삼 제조시 내공의 발생은 제조공정에서 나타나는 경우가 많으며, 내백의 경우는 홍삼으로 가공되면서 발생하는 경우가 있고, 인삼이 성장될 때 부분적인 영양상태의 불충분이나 기후 등에 따른

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9B
• /
• pp.610-618
• /
• 2005

As developed Internet and Computer Capability, Many Users take the many information through the network. So requirement of User that use to network was rapidly increased and become various. But it spend much time to accept user requirement on current network, so studied such as Active network for solved it. This Active node on Active network have the capability that stored and processed execution code aside from capability of forwarding packet on current network. So required execution code for executed packet arrived in active node, if execution code should not be in active node, have to take by request previous Action node and Code Server to it. But if this execution code take from previous active node and Code Server, bring to time delay by transport execution code and increased traffic of network and execution time. So, As used execution code stored in cache on active node, it need to increase execution time and decreased number of request. So, our paper suggest ANC caching technique that able to decrease number of execution code request and time of execution code by efficiently store execution code to active node. ANC caching technique may decrease the network traffic and execution time of code, to decrease request of execution code from previous active node.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.6
• /
• pp.29-36
• /
• 2013

In wireless sensor networks, energy is the most important consideration because the lifetime of the sensor node is limited by battery. Most of the existing energy efficient routing protocols use the minimum energy path to minimize energy consumption, which causes an unbalanced distribution of residual energy among nodes. As a result, the power of nodes on energy efficient paths is quickly depletes resulting in inactive. To solve these problems, a method to equalize the energy consumption of the nodes has been proposed, but do not consider the link error rate in the wireless environment. In this paper, we propose a uniform energy consumption of cluster-based multi-hop routing mechanism considering the residual energy and the link error rate. This mechanism reduces energy consumption caused by unnecessary retransmissions and distributes traffic evenly over the network because considering the link error rate. The simulation results compared to other mechanisms, the proposed mechanism is energy-efficient by reducing the number of retransmissions and activation time of all nodes involved in the network has been extended by using the energy balanced path.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.3
• /
• pp.113-122
• /
• 2008

In RFID system, Middleware collects and filters streaming data gathered continuously from readers to process applications requests. The enormous amount of data makes middleware in highly overloaded. Hence, we propose reader level filtering in order to reduce overall middleware load. In this paper, we consider reader filtering capability and define query plan to minimize number of queries for processing into middleware and reader level. We design and implement middleware system based on proposed query plan. We perform several experiments on implemented system. Our experiments show that the proposed query plan considerably improves the performance of middleware by diminishing processing time and network traffic between reader and middleware.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.15-23
• /
• 2002

We present a new MDA-based Mobile-IPv6 multicast routing algorithm for wirelese service operators to offer Mobile-IP over IMT-2000 service under IMT-2000 network by taking advantage of the existing infrastructure for IMT-2000 multimedia application services. The extended IMT-2000 system architectures use an PDSNs (i.e. IWFs), and the home network (i.e. Internet) backbone and intermediate network are composed of ATM entities. A key feature of the new protocol is the use of MDA(Multicast Delivery Agent) to reduce delivery path length of the multicast datagram. We show that proposed protocol is efficient in terms of various performance measures such as multicast traffic load, multicast related handoff, and average routing length when we implement it using the Mobile-IPv6. Particularly, the number of tunneling and average routing length of datagram are reduced relatively, the multicast traffic load is also decreased.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.1
• /
• pp.77-82
• /
• 2015

Recently, multi-user massive MIMO (MU-Massive MIMO) network has attracted a lot of attention as a technology to accommodate explosively increasing mobile data traffic. However, the MU-Massive MIMO network causes a tremendous hardware complexity in a base station and computational complexity to select optimal set of users. In this paper, we thus propose a simple algorithm for selecting antennas and users while reducing the hardware and computational complexities simultaneously. The proposed scheme has a computational complexity of $O((N-S_a+1){\times}min(S_a,K))$, which is significantly reduced compared to the complexity of optimal scheme based on Brute-Force searching, $$O\left({_N}C_S_a\sum_{i=1}^{min(S_a,K)}_KC_i\right)$$, where N, $S_a$, and K denote the number of total transmit antennas, the number of selected antennas, and the number of all users, respectively.

• The Journal of the Korea Contents Association
• /
• v.8 no.10
• /
• pp.20-26
• /
• 2008

The quality of stream remaking is decided the load of a server and Jitter through the traffic of the transmission path between end to end. In order to improve these problems in this paper, I propose tree construction method of low-delay-level-multicast. In this case which the network congestion will be occurred by streaming quality, I also propose the technique which dynamically changes the transmission path. This technique first constructs the overlay structure for relaxing the overload of server. Secondly, in order to decrease Jitter of client, it makes upload bandwidth and low latency balanced. In the evaluation of the performance, this paper showed better enhancement of about $15%{\sim}24%$ than P2CAST[4] in the simulation about node average join count, average bandwidth, service request refusal ratio, RTT measurement of nodes, and node average join count by defect ratio.

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.21-33
• /
• 2007

An overlay network is a virtual network which is constructed on top of a physical computer network. A node in the overlay network is connected through virtual or logical links, where each link corresponds to a path of the links in the underlying physical network. Overlay networks are suitable for sharing heterogeneous resources in distributed environments, However, overlay networks are limited for achieving reliable communication that failure detection in overlay networks is a very important issue. In this paper, we review conditions of conventional failure detection and propose a new approach to failure detection and resilience which can be applied to HRing (Hierarchical Ring) overlay networks. The proposed method consists of the failure detection and the failure resilience phases. Because it utilizes the characteristics of the HRing overlay network for failure detection, it can reduce unnecessary network traffic and provide better scalability and flexibility. We also analyzed and evaluated the performance of the proposed approach through simulations.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.633-640
• /
• 2005

This paper proposes and analyzes a message scheduling scheme and corresponding bandwidth allocation method for the hard real-time communication on dual standard 802.11 Wireless LANs. By making the superframeof one network precede that of the other by half, the dual network architecture can minimize the effect of deferred beacon and reduce the worst case waiting timeby half. The effect of deferred beacon is formalized and directly considered to decide the polling schedule of PCF phase. Simulation results executed via ns-2 show that the proposed scheme can improve the schedulability by 3$36\%$ for real-time messages and give $9\%$ more bandwidth to non-real-time messages for the given stream sets, compared with the network whose bandwidth is just doubled with the same MAC.

• Journal of KIISE:Information Networking
• /
• v.33 no.4
• /
• pp.299-309
• /
• 2006

In Mobile ad hoc networks, AODV is one of the famous on-demand routing protocol, which use the routing tables in the nodes if possible, or Route Discovery Process (RDP) is triggered to find a new route. However increasing the traffic of RDP causes dropping of the network performance in the large size of ad hoc networks. In this paper, we propose a novel routing protocol, named as AOZDV (Ad hoc On-demand Zone and Distance-Vector Routing), which enhances the AODV protocol with zone routing. AOZDV creates a Zone with neighbor nodes of the source/destination using traffic and power information, and utilizes Destination-Vector Table for internal routing in the Zone. We show by simulations that AOZDV can reduce the occurrence rate of route fail and RDP caused by route fail compared to existing routing protocols such as DSR and AODV.