• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 2007년도 춘계학술대회
• /
• pp.139-151
• /
• 2007

Decision-making in the crisis management happens in dynamic, rapidly changing, and often unpredictable distributed environments. Crisis management Decision Support Systems (DSSs) in E-Government are challenged by the need to use it availably at anytime, from anywhere, and even under any-situation. In this paper the reasons of developing distributed architecture for crisis management Decision Support Systems (DSSs) in E-Government are analyzed. Consequently, a distributed architecture for crisis management Decision Support System (DSS) is proposed in this paper. Finally it is implemented by Web Services. If crisis management Decision Support System (DSS) based on distributed architecture is implemented by Web Service, then it can provide decision support for decision-makers to deal with crisis at anytime, from anywhere, and even under any-situation.

• International Journal of Control, Automation, and Systems
• /
• 제6권2호
• /
• pp.282-287
• /
• 2008

In distributed mobile robot systems, autonomous robots accomplish complicated tasks through intelligent cooperation with each other. This paper presents behavior learning and online distributed evolution for cooperative behavior of a group of autonomous robots. Learning and evolution capabilities are essential for a group of autonomous robots to adapt to unstructured environments. Behavior learning finds an optimal state-action mapping of a robot for a given operating condition. In behavior learning, a Q-learning algorithm is modified to handle delayed rewards in the distributed robot systems. A group of robots implements cooperative behaviors through communication with other robots. Individual robots improve the state-action mapping through online evolution with the crossover operator based on the Q-values and their update frequencies. A cooperative material search problem demonstrated the effectiveness of the proposed behavior learning and online distributed evolution method for implementing cooperative behavior of a group of autonomous mobile robots.

• 한국콘텐츠학회논문지
• /
• 제8권2호
• /
• pp.9-17
• /
• 2008

본 논문에서는 동기적인 분산시스템에서 불리 알고리즘에 기초하여 하나의 새로운 선출(election) 알고리즘을 설계하고 이를 분석하고자 한다. 동기적인 분산시스템에서 기존의 불리 알고리즘은 고장 추적 장치를 이용하여 더욱 효율적으로 설계되고 구현 될 수 있음을 보인다.

• 디지털콘텐츠학회 논문지
• /
• 제11권4호
• /
• pp.453-461
• /
• 2010

모바일 애드혹 분산 시스템에서 선출 알고리즘을 명세하고 설계하는 것은 매우 어려운 작업이다. 왜냐하면 모바일 애드혹 분산 시스템은 기존의 분산시스템보다 시스템의 실패에 취약하기 때문이다. 본 논문의 목적은 모바일 애드혹 분산 컴퓨팅 환경에 적합한 선출 알고리즘을 명세하고 하나의 설계모형을 제시하는데 있다. 이러한 목적을 위하여 본 논문에서는 하나의 선출 알고리즘을 설계하고 알고리즘의 정확성을 정형적으로 검증 하였다. 이러한 해결방안은 기존의 분산시스템에서 고전적인 알고리즘인 노드 탐지 알고리즘에 기반으로 하고 있다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 1998년도 가을 학술발표논문집 Vol.25 No.2 (3)
• /
• pp.211-213
• /
• 1998

셀룰러 시스템에서 이동구그이 위치관리는 중요한 문제이다. 이동국의 위치관리를 위해 셀룰러 시스템은 기본적으로 위치 갱싱과 페이징 기법을 사용한다. 이 논문에서는 갱신비용과 페이징 비용의 증가에 영향을 미치는 여러 인자 중 이동국의 속도와 호 도착률을 이용하여 이동국의 위치과리 비용을 최소화시키는 방법을 제안하였으며 성능을 분석하였다. 제안하는 방식은 이동국의 속도와 호 도착률을 사용하여 위치 갱신의 여부를 판별함으로써 위치 갱신 횟수를 줄일 수 있을뿐 아니라 진동 효과의 완화를 기대할 수 있다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.1982-1985
• /
• 2003

Future cellular networks will mainly be driven by, high quality channels, high band with utilization, low power consumption and efficient network management. For a given channel allocation, the capacity and quality of communication of cellular radio systems using CDMA(Code Division Multiple Access) can be increased by using a transmitter power control scheme to combat the near-far problem. Centralized power control schemes or distributed ones to maximize the minimum signal-to-interference in each user of CDMA wireless network have been investigated. This paper has proposed a distributed power control algorithm, which employs an adaptive search scheme, in order to solve quickly the linear systems of equations for power update in CDMA cellular radio systems. The simulation results show that the proposed scheme has faster convergence rate than the typical bang-bang type of distributed power control algorithm, which has been much used as a reference algorithm in IS-95A and W-CDMA communication network.

• 한국정보처리학회논문지
• /
• 제7권5호
• /
• pp.1426-1433
• /
• 2000

As distributed computing systems become popular, many modeling techniques and methods have been developed in specify the specification formally and verify the distributed/concurrent sytems. In spite of importance of communication in distributed object-oriented systems, specifying of communication method generally has not been emphasized in the design phase. One reason is due to the system designer misunderstanding, that is, a specification needs to be independent on the implementation. However, since defining communication pattern indistributed object-oriented systems is more serious than the required message passing method in the design phase. specifying the communication pattern is necessary instead of postponing until the implementation. In this paper, two formal specification techniques, temporal logic method and Petri nets method, for the communication in distributed systems are discussed. One is based on the temporal logic, which specifies the different patterns of primitive predicates. This method enable to define the underlying mechanism which can be interpreted as constraints. The Petri net method helps to specify the dynamic behavior of communicational patterns using the properties of Petri nets.

• Journal of Communications and Networks
• /
• 제18권4호
• /
• pp.649-657
• /
• 2016

In this paper, we investigate energy efficiency (EE) of the traditional co-located and the distributed massive multiple-input multiple-output (MIMO) systems. First, we derive an approximate EE expression for both the idealistic and the realistic power consumption models. Then an optimal energy-efficient remote access unit (RAU) selection algorithm based on the distance between the mobile stations (MSs) and the RAUs are developed to maximize the EE for the downlink distributed massive MIMO systems under the realistic power consumption model. Numerical results show that the EE of the distributed massive MIMO systems is larger than the co-located massive MIMO systems under both the idealistic and realistic power consumption models, and the optimal EE can be obtained by the developed energy-efficient RAU selection algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권4호
• /
• pp.1182-1199
• /
• 2023

Fractional repetition (FR) codes can achieve exact uncoded repair for multiple failed nodes, with lower computational complexity and bandwidth overhead, and effectively improve repair performance in distributed storage systems (DSS). The actual distributed storage system is dynamic, that is, the parameters such as node storage overhead and number of storage nodes will change randomly and dynamically. Considering that traditional FR codes cannot be flexibly applied to dynamic distributed storage systems, a new construction scheme of adaptive-and-resolvable FR codes based on hypergraph coloring is proposed in this paper. Specifically, the linear uniform regular hypergraph can be constructed based on the heuristic algorithm of hypergraph coloring proposed in this paper. Then edges and vertices in hypergraph correspond to nodes and coded packets of FR codes respectively, further, FR codes is constructed. According to hypergraph coloring, the FR codes can achieve rapid repair for multiple failed nodes. Further, FR codes based on hypergraph coloring can be generalized to heterogeneous distributed storage systems. Compared with Reed-Solomon (RS) codes, simple regenerating codes (SRC) and locally repairable codes (LRC), adaptive-and-resolvable FR codes have significant advantages over repair locality, repair bandwidth overhead, computational complexity and time overhead during repairing failed nodes.

• Transactions on Control, Automation and Systems Engineering
• /
• 제3권3호
• /
• pp.181-189
• /
• 2001

The software components of embedded control systems get extremely complex as they are designed into distributed systems get extremely complex as they are designed into distributed systems consisting of a large number of inexpensive microcontrollers interconnected by low-bandwidth real-time networks such as the controller area network (CAN). While recently emerging middleware technologies such as CORBA and DCOM address the complexity of distributed programming, they cannot be directly applied to distributed control system design due to their excessive resource demand and inadequate communication models. In this paper, we propose a CORBA-based middleware design for CAN-based distributed embedded control systems. Our design goal is to minimize its resource need and make it support group communication without losing the IDL (interface definition language) level compliance to the OMG standards. To achieve this, we develop a transport protocol on the CAN and a group communication scheme based on the well-known publisher/subscriber model. The protocol effectively realizes subject-based addressing and supports anonymous publisher/subscriber communication. We also customize the method invocation and message passing protocol, referred to as the general inter-ORB protocol (GIOP), of CORBA so that CORBA method invocations are efficiently serviced on a low-bandwidth network such as the CAN. This customization includes packed data encoding and variable-length integer encoding for compact representation of IDL data types. We have implemented our CORBA-based middleware on the mArx real-time operating system we have developed at Seoul National University. Our experiments clearly demonstrate that it is feasible to use CORBA in developing distributed embedded control systems possessing severe resource limitations. Our design clearly demonstrates that it is feasible to use a CORBA-based middleware in developing distributed embedded systems on real-time networks possessing severe resource limitations.