• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.144-150
• /
• 2015

A system for providing a distributed device resource-object-connection service based on a service delivery platform (SDP) is described. The system includes an SDP and proxy. The SDP configures to define distributed service functions as enablers, generates a convergence service by combining the enablers, and provides the generated convergence service. The proxy configures to connect a distributed device and an SDP to allow the SDP to use the distributed device as a resource, and define and use the distributed device as an enabler. The system are capable of defining distributed service functions as well as distributed sensors as enablers, and thereby allowing the distributed sensors to be used in the same sense as service-function enablers.

• ETRI Journal
• /
• v.43 no.2
• /
• pp.221-231
• /
• 2021

To resolve energy depletion issues in massive Internet of Things sensor networks, we developed a set of distributed energy beamforming methods with one-bit feedback and clustering for multi-node wireless energy transfer, where multiple singleantenna distributed energy transmitters (Txs) transfer their energy to multiple nodes wirelessly. Unlike previous works focusing on distributed information beamforming using a single energy receiver (Rx) node, we developed a distributed energy beamforming method for multiple Rx nodes. Additionally, we propose two clustering methods in which each Tx node chooses a suitable Rx node. Furthermore, we propose a fast distributed beamforming method based on Tx sub-clustering. Through computer simulations, we demonstrate that the proposed distributed beamforming method makes it possible to transfer wireless energy to massive numbers of sensors effectively and rapidly with small implementation complexity. We also analyze the energy harvesting outage probability of the proposed beamforming method, which provides insights into the design of wireless energy transfer networks with distributed beamforming.

• Smart Media Journal
• /
• v.10 no.4
• /
• pp.15-20
• /
• 2021

The distributed trigger counting problem is to notify the user when the total number of triggers received from a distributed system consisting of n nodes reaches a predefined value w. The distributed trigger counting problem is used for monitoring and global snapshots in various distributed systems. In this paper, we propose a simple and efficient algorithm for the distributed trigger counting problem. The proposed algorithm operates based on a tree structure of degree $\sqrt{n}$ and height 2. The proposed algorithm operates in three different phases based on the remaining number of triggers. Experimental results show that the proposed algorithm has a smaller message complexity than CoinRand, and MaxRcv also performed better when the number of nodes is not large.

• Journal of Energy Engineering
• /
• v.18 no.3
• /
• pp.147-155
• /
• 2009

Demand for distributed source by new and renewable energy has been gradually increasing recently. For the characteristics of distributed generation, distributed source is located near the distribution system and customers' buildings and can be operated in standalone mode or in interface mode with distribution system. When the distributed sources are interfaced with distribution system, the standard for interfacing distributed source with existing distribution system and operation manual should be updated with revisions in order to manage the distributed source effectively and operate the distribution system stably because how to operate the interfaced system is different from that of existing distribution system. In this paper, the FEP(Front End Processor) using the international standard protocol IEC-60870 for interfacing with distributed resources was designed. The designed system was verified via the test result using main control system for distributed generation and RTU(Remote Terminal Unit) for interface with distributed power generating.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.5
• /
• pp.1778-1790
• /
• 2018

Based on the requirements and characteristics of multi-zone autonomous decision-making in modern power system, fully distributed computing methods are needed to optimize the economic dispatch (ED) problem coordination of multi-regional power system on the basis of constructing decomposition and interaction mechanism. In this paper, four fully distributed methods based on alternating direction method of multipliers (ADMM) are used for solving the ED problem in distributed manner. By duplicating variables, the 2-block classical ADMM can be directly used to solve ED problem fully distributed. The second method is employing ADMM to solve the dual problem of ED in fully distributed manner. N-block methods based on ADMM including Alternating Direction Method with Gaussian back substitution (ADM_G) and Exchange ADMM (E_ADMM) are employed also. These two methods all can solve ED problem in distributed manner. However, the former one cannot be carried out in parallel. In this paper, four fully distributed methods solve the ED problem in distributed collaborative manner. And we also discussed the difference of four algorithms from the aspects of algorithm convergence, calculation speed and parameter change. Some simulation results are reported to test the performance of these distributed algorithms in serial and parallel.

• Journal of KIISE:Software and Applications
• /
• v.26 no.11
• /
• pp.1298-1305
• /
• 1999

네트워크 및 분산 처리 기술의 발달로 분산 환경에서 동작하는 응용 프로그램에 대한 생산성 향상이 요구되고 있다. 본 논문에서는 MVC(Model, View, Controller) 패턴을 기반으로 하는 분산 응용 프로그램의 생산성 향상을 위해, 조립식 분산 응용의 작성을 지원하는 분산 객체 조립기, DOC(Distributed Object Composer)를 소개한다. 분산 객체 조립성의 기반이 되는 DOC의 구성적{{) '전체'를 창조해 내기 위해 여러 요소들을 결합, 배치하여 하나의 예술작품을 성립시키는 방법. 모아서 조립한다는 의미.}} 인터페이스(Structural Interface)는 기존 객체지향 기술의 절차적 인터페이스(Procedural Interface)에 비해 콤포넌트 재사용성을 개선하고, 분산 응용의 신속한 개발을 지원하여, 소프트웨어의 생산성 및 확장성을 향상시킨다. 또한, DOC 방식으로 모델링하고 구현한 공급망 관리(Supply Chain Management: SCM) 응용 프로그램의 조립식 작성을 통해, DOC의 실시간 정보 처리 및 조립 기능을 보인다.DOC는 이질적인 통신 환경에서 클라이언트와 서버 객체간의 네트워크 투과성을 제공하는 미들웨어, CORBA를 기반으로 한다. 또한, 분산 객체들 간의 상호작용을 자동 처리하기 위해 Java의 관찰자/피관찰자(Observer/Observable)를 확장한 분산 관찰자/피관찰자 패턴을 정의하여 DOC와, 서버 및 클라이언트의 분산 응용 객체들을 정의하기 위한 인터페이스에 적용한다.Abstract Due to the availability of advances in network and distributed processing technologies, the enhanced productivity of application software that runs on distributed environment is demanded. In this paper, we introduce the Distributed Object Composer (DOC) that supports the structural composition of distributed applications for the enhanced productivity of MVC (Model, View, Controller) pattern-based application programs. The structural interface of DOC that is the basis for the composibility of distributed objects increases the reusability of software components and provides better software productivity and extendibility than the procedural interface of the traditional object-oriented technology by supporting rapid constructions of distributed applications. In this paper, we also discuss the real-time information processing and composibility features of DOC by applying the DOC mechanism to the Supply Chain Management (SCM) application.DOC is implemented using the CORBA middleware that supports the network transparency between client and server objects on heterogeneous communication environments. We apply the distributed Observer/Observable pattern that extends the Observer/Obseverable of Java to DOC itself and distributed client/server objects as their interface definitions for the automatic interactions of distributed objects.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.42-48
• /
• 1999

Consider the situation that informations necessary to solve a certain problem are distributed among processors on a network. It is called a distributed algorithm that in this situation each processor exchanges the message with adjacent processors to solve the problems. This paper proposes a distributed algorithm to solve the problem that constructs the weighted shortest path tree in an asynchronous network system. In general, a distributed algorithm is estimated by the number of messages(message complexity of the distributed algorithm proposed in this paper are O(n53) and O(nln) respectively. where n is the number of processors on the network.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1133-1136
• /
• 1987

In designing and implementing of a distributed system, a programming language which can describe and implement the various interactions between distributed processes in distributed systems is indispensible. High level language constructs such as concurrency. process synchronization between distributed processes and mutually exclusive access to common data could be built in a distributed programming language under the proper support of a language kernel. In this paper, we studied the language constructs a distributed programming language must have and specified the kernel supports necessary in implementing that high level language constructs.

• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.703-705
• /
• 1999

In this paper, we introduce the direction of arrival(DOA) estimation of distributed signal based on the improved ESPRIT algorithm. Most research on the estimation of DOA has been performed based on the assumption that the signal sources are point sources. However, we consider a two-dimensional distributed signal source model using improved ESPRIT algorithm. In the distributed signal source model, a source is represented by two parameters, the azimuth angle and elevation angle. We address the estimation of the elevation and azimuth angles of distributed sources based on the parametric source modeling in the three-dimensional space with two uniform linear arrays. The array output vector is obtained by integrating a steering vector over all direction of arrival with the weighting of a distributed source density function. We also develop an efficient estimation procedures that can reduce the computational complexity. Some examples are shown to demonstrate explicity the estimation procedures under the distributed signal source model.

• Journal of the Korea Society for Simulation
• /
• v.5 no.1
• /
• pp.81-90
• /
• 1996

In this paper, we propose a new events ordering mechanism for the optimistic distributed simulation of DEVS models. To simulate DEVS models in a distributed environment, a synchronization protocol is required for correct simulation. Time Warp is the most well-known optimistic synchronization protocol for distributed simulation. However, employing the Time Warp protocol in distributed simulation of DEVS models incurs events ordering problem due to the semantic difference between Time Warp and DEVS, Thus, to resolve such semantic difference, we devise the time-and-priority-stamp and $\varepsilon$ -delay schemes. The proposed schemes can order simultaneous events correctly in Time Warp-based distributed simulation of DEVS models.Time Warp and DEVS, Thus, to resolve such semantic difference, we devise the time-and-priority-stamp and $\varepsilon$ -delay schemes. The proposed schemes can order simultaneous events correctly in Time Warp-based distributed simulation of DEVS models.