• Title/Summary/Keyword: Node Architecture

Search Result 490, Processing Time 0.026 seconds

Design of an Algorithm for the Validation of SCL in Digital Substations

  • Jang, B.T.;Alidu, A.;Kim, N.D.
    • KEPCO Journal on Electric Power and Energy
    • /
    • v.3 no.2
    • /
    • pp.89-97
    • /
    • 2017
  • The substation is a critical node in the power network where power is transformed in the power generation, transmission and distribution system. The IEC 61850 is a global standard which proposes efficient substation automation by defining interoperable communication and data modelling techniques. In order to achieve this level of interoperability and automation, the IEC 61850 (Part 6) defines System Configuration description Language (SCL). The SCL is an XML based file format for defining the abstract model of primary and secondary substation equipment, communications systems and also the relationship between them. It enables the interoperable exchange of data during substation engineering by standardizing the description of applications at different stages of the engineering process. To achieve the seamless interoperability, multi-vendor devices are required to adhere completely to the IEC 61850. This paper proposes an efficient algorithm required for verifying the interoperability of multi-vendor devices by checking the adherence of the SCL file to specifications of the standard. Our proposed SCL validation algorithm consists of schema validation and other functionalities including information model validation using UML data model, the Vendor Defined Extension model validation, the User Defined Rule validation and the IED Engineering Table (IET) consistency validation. It also integrates the standard UCAIUG (Utility Communication Architecture International Users Group) Procedure validation for quality assurance testing. Our proposed algorithm is not only flexible and efficient in terms of ensuring interoperable functionality of tested devices, it is also convenient for use by system integrators and test engineers.

Service Mobility Support Scheme in SDN-based Fog Computing Environment (SDN 기반 Fog Computing 환경에서 서비스 이동성 제공 방안)

  • Kyung, Yeun-Woong;Kim, Tae-Kook
    • Journal of Internet of Things and Convergence
    • /
    • v.6 no.3
    • /
    • pp.39-44
    • /
    • 2020
  • In this paper, we propose a SDN-based fog computing service mobility support scheme. Fog computing architecture has been attracted because it enables task offloading services to IoT(Internet of Things) devices which has limited computing and power resources. However, since static as well as mobile IoT devices are candidate service targets for the fog computing service, the efficient task offloading scheme considering the mobility should be required. Especially for the IoT services which need low-latency response, the new connection and task offloading delay with the new fog computing node after handover can occur QoS(Quality of Service) degradation. Therefore, this paper proposes an efficient service mobility support scheme which considers both task migration and flow rule pre-installations. Task migration allows for the service connectivity when the fog computing node needs to be changed. In addition, the flow rule pre-installations into the forwarding nodes along the path after handover enables to reduce the connection delay and service interruption time.

An Attribute-Based Naming Architecture for Wireless Sensor Networks (무선 센서 네트워크를 위한 속성 기반 네이밍 구조)

  • Jung, Eui-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.4
    • /
    • pp.95-102
    • /
    • 2007
  • Recently, a lot of researchers focus on the sensor middleware that hide the complexity of application developments and provide the abstraction of functions to upper application layer. Although there we several factors to design sensor middleware, the attribute-based naming is considered to be an essential factor among them. However, most existing researches were not designed to reflect the characteristics of sensor networks and have the limitation of attribute-based query extension. This study adopts the concept of Virtual Counterpart to suggest the structure there attribute-based naming is supported by virtual sensor nodes of the middleware on the sink node. Unlike traditional data-centric middleware in which individual sensor nodes process attribute-based query, virtual sensor nodes mapped to physical sensor nodes are running on the middleware of the sink node and process attribute-based query as a proxy of the physical sensor. This approach enables attribute-based naming independent of physical infrastructure and easy extensibility.

  • PDF

Route-optimized Handoff in Mobile CORBA Environment (Mobile CORBA 환경에서 게이트웨이간의 경로최적화 핸드오프)

  • Shin, Hye-Ryung;Lee, Hyung-Woo;Kim, Ju-Ho
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.3
    • /
    • pp.224-232
    • /
    • 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 these protocols are applied to support real time services like multimedia transmission, they still have problems in ad-hoe networks, where the topology changes drastically. In this paper, we propose a new route selection algorithm which selects the most reliable rouse that is impervious to route failures by topological changes by mobile hosts. For reliable route selection, the concept of virtual zone (stable lone and caution zone) is proposed. The lone is located in a mobile node's 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.

WDMA protocol with collision avidance for high speed optical networks (고속 광통신망에서 충돌 회피를 위한 파장 분할 다중 액세스 프로토콜)

  • 이호숙;최형원;박성우;김영천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.3
    • /
    • pp.664-674
    • /
    • 1996
  • In high speed multi-wavelength networks, retransmission overhead due to desination conflict or control packet collision is one factor of performance degration because signal prpagation delay is much larger than the transmission time of data packet. In this paper, an efficient WDMA protocol with a collision avoidance mechanism is proposed for high speed WDM single-hop network with a passive star topology. In proposed protocol, each node has cource queues and routing table to store souting informatio. This architecture makes is possible to avoid any kind of collision when a node reserves the channel to transmit a data packet. High system thoughput and channel utilization can be achieved by proposed protocol since there are no discarded packets caused by any collision at transmission time. The performance of proposed protocol is evaluated in term of throughput and delay with variations in offered load. Simulation results show that the proposed protocol has superior performance to convertional protocols under nonuniform traffic as well as uniform traffic.

  • PDF

A realization of up/down-stream transmission on an optical subscriber network with the PON structure (PON구조의 광가입자망에서 상/하향전송 구현)

  • 김효중;이찬구;강성수;이만섭
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.3
    • /
    • pp.795-806
    • /
    • 1996
  • A structure which transmits and receives 3 subscribers packet data through an optical splitter node in an optical subscriber network of PON wave suggested and realized. All the functions which are necessary to use PON structure such as 155.52Mb/s multiplexer/demultiplexer of down-stream signal, 25.92Mb/s multiplexer/demultiplexer of up-stream signal, frame synchronizer, and phase aligner for aligning phase of the clock and received data have been integrated within 2 ICs using CMOS technonology. TDMAtechnology was suggested for up-stream transmission. In the optical up-stream transmission of the urst signals transmissionquality degradataion by APC and AGC of optical tranceiver was observed. By compensating the degradation, more than 17dB of link budget which is enough to satisfy 11.2dBthat is required in SWAN of PON architecture has been obtained with optical transceiver whose power and sensitivity are -17dBm and -34dBm respectively.

  • PDF

Design of Location and User Status Awareness Service Architecture Based on Opportunistic Computing with Ad-hoc Nodes (Ad-hoc 통신 노드를 이용한 기회 컴퓨팅형 위치인식 및 상황인지 서비스 구조 설계)

  • Kim, Tae-Hyon;Jo, Hyeong-Gon;Jeong, Seol-Young;Kang, Soon-Ju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12B
    • /
    • pp.1199-1210
    • /
    • 2010
  • In recent years opportunistic computing has gained popularity in Ad-hoc network research area and it is highly required to research for actual services and related requirements. In this paper we summarized a virtual opportunistic service that is named "Children Care System" and proposed an Ad-hoc communication node (uMobile) that is connected with cellular phone and a sensor node (uClo) which is embedding into clothes. uMobile can support cellular phone communication and Ad-hoc communication and uClo can be embedded into clothes and recognize the user status using multiple sensors. In this paper we implemented the location awareness and user status awareness services using uMobile and uClo. We also tested them in indoor situation and showed the result. We expect that our research can play a significant role to inspire another various opportunistic computing services.

A Study on the Enhancement of Network Survivability through Smart Sensor Technologies Convergence (스마트 센서 기술 융합을 통한 망 생존성 강화에 관한 연구)

  • Yang, Jung-Mo;Kim, Jeong-Ho
    • Journal of Digital Convergence
    • /
    • v.14 no.8
    • /
    • pp.269-276
    • /
    • 2016
  • Public Safty-LTE(Long Term Evolution) is being deployed in the direction of reducing cost by using both of municipal network and commercial network. However, LTE Network is difficult to ensure the survivability during the information communication infrastructure failures. In addition, it is vulnerable in communication coverage of inside buildings and underground. In this study, we propose to implement effectively the network survivability technique through the convergence to the proven technology. As the advent of the IoT Age, smart sensors which are embedded in the environment and the things will be able to provide a useful infrastructure for ensuring the network survivability. Based on the feature of the smart sensor, we designed the sink node architecture to guarantee the network survivability in disaster situation through the convergence of the small cell technology and extension of wireless network coverage technology. The computing power inherent in the environment is a valuable resource that can be utilized in the disaster situation.

Effective Parallel Hash Join Algorithm Based on Histoftam Equalization in the Presence of Data Skew (데이터 편재 하에서 히스토그램 변환기법에 기초한 효율적인 병렬 해쉬 결합 알고리즘)

  • Park, Ung-Gyu;Choe, Hwang-Gyu;Kim, Tak-Gon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.2
    • /
    • pp.338-348
    • /
    • 1997
  • In this pater, we first propose a data distribution framework to resolve load imbalance and bucket oerflow in parallel hash join.Using the histogram equalization technique, the framework transforms a histogram of skewed data to the desired uniform distribution that corresponds to the relative computing power of node processors in the system.Next we propose an effcient parallel hash join algorithm for handing skwed data based on the proposed data distribution methodology.For performance comparison of our algorithm with other hash join algorithms.we perform similation experiments and actual exeution on COREDB database computer with 8-node hyperube architecture. In these experiments, skwed data distebution of the join atteibute is modeled using a Zipf-like distribution.The perfomance studies undicate that our algorithm outperforms other algorithms in the skewed cases.

  • PDF

A Method of Selecting Core for the Shared-Tree based Multicast Routing (공유 트리 기반 멀티캐스트 라우팅을 위한 코어 선택 방법)

  • Hwang, Soon-Hwan;Youn, Sung-Dae
    • The KIPS Transactions:PartC
    • /
    • v.10C no.7
    • /
    • pp.885-890
    • /
    • 2003
  • The Core Base Tree (CBT) multicast routing architecture is a multicast routing protocol for the internet. The CBT establishes a single shared tree for a multicast connection. The shared tree Is rooted at a center node called core. The location of the core may affect the cost and performance of the CBT. The core placement method requires the knowledge of the network topology In this Paper, we propose a simple and effective method for selecting the core. This method requires the distance vector information. in addition, we used results that calculated sample correlation coefficient. And then we select suitable routing algorithm according to member's arrangement states in muliticast group. we select core node that have minimum average cost or PIM-SM protocol is selected. The performance of this method is compared with several other methods by extensive simulations (i.e mean delay, maximum delay, and total cost). Our results shows that this method for Selecting Core is very effective.