• Structural Engineering and Mechanics
• /
• 제39권3호
• /
• pp.339-360
• /
• 2011

In the h-type adaptive analysis, when an element is refined or subdivided, new nodes are added. Among them are the transition nodes which are the corner nodes of the new elements formed by subdivision and, simultaneously, the mid-side nodes of the adjacent non-subdivided elements. To secure displacement compatibility, the slave-node approach in which the DOFs of a transition node are constrained by those of the adjacent nodes had been used. Alternatively, transition elements which possess the transition nodes as active mid-side/-face nodes can be used. For C0 plate analyses, the conventional slave-node constraints and the previously derived ANS transition elements are implemented. In both implementations, the four-node element is the ANS element. With reference to the predictions of the transition elements, the slave-node approach not only delivers erroneous results but also fails the patch test. In this paper, the patch test failure is resolved by developing a set of new constraints with which the slave-node approach surpasses the transition-element approach. The accuracy of the slave-node approach is further improved by developing a hybrid four-node element in which the assumed moment and shear force modes are in strict equilibrium.

• 정보통신설비학회논문지
• /
• 제8권1호
• /
• pp.40-46
• /
• 2009

This paper presents a self-sustaining system, and an effective method in enhancing overall energy efficiency. The proposed system consists of the two major nodes: a slave node, which contains the environment information (e.g., temperature, humidity, etc.); and a master node, which communicates with the slave nodes, and transmit the slave node's information to users. All slave nodes are under control of the master node. Each slave node uses two power sources: the piezoelectric power generator (PPG); and the continuous wave from the master node. The paper highlights the basic operational principle, each node's specifications, and experimental data for performance verification. The two nodes successfully communicate each other in a range of 3.3m (maximal range), where the user's computer is wired the master node.

• 한국통신학회논문지
• /
• 제34권12B호
• /
• pp.1435-1443
• /
• 2009

본 논문에서는 에너지 수확 센서 네트워크 시스템을 DEVS 형식론을 이용해서 시뮬레이션하고 모델링한다. 이 시스템은 주전원이나 배터리를 사용하는 싱크(마스터(master)) 노드와 에너지 수확 소자로부터 전원을 공급 받는 센서(slave) 노드로 구성 된다. 시뮬레이션을 위해 (i) 슬레이브 노드에서 에너지 수확하고 저장하는 회로의 동작을 연속적인 구간들로 분할한 후에 각 구간을 이산적인 상태로 표현하고, (ii) 마스터 노드와 슬레이브 노드의 컴포넌트들의 동작의 관계를 면밀하게 분석하여, (iii) 분석된 결과를 DEVS 형식론을 이용하여 모델링하고 시뮬레이션 한다.

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2009년도 정보통신설비 학술대회
• /
• pp.349-352
• /
• 2009

WBAN/USN systems are applied from the various environment. Therefore, it is coming to be important efficient use power and communication method. The present paper materialize Slave node system which get power from light energy. Also, it materialize Wake-up module and self-power-off circuit which use S-R Flip Flop for efficient using power. This system can be efficient using power at Slave node system. Also, it can be possible application of Self sustaining system by performance verification Wake-up module which determine system "on" without power and Self-power-off circuit.

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

The data transmission of MVB(Multifunction Vehicle Bus) of TCN(Train Network Communication) is divided into the periodic transmission phase and the sporadic transmission phase. TCN standard defines the event-polling method for the message transfer in the sporadic phase. However, since the event-polling method does not use pre-scheduling to the priority of the messages to be transmitted, it is inefficient for the real-time systems. To schedule message transmission, a master node should know the priority of message to be transmitted by a slave node prior to the scheduling the sporadic phase, but the existing TCN standard does not support any protocol for this. This paper proposes the slave frame bit-stuffing algorithm, with which a master node gets the necessary information for transmission scheduling and includes the simulation results of the event-polling method and the proposed algorithm.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권10호
• /
• pp.720-726
• /
• 2004

The data transmission over MVB(Multifunction Vehicle Bus) of TCN(Train Communication Network) is divided into the periodic transmission phase and the sporadic transmission phase. TCN standard recommends the event-polling method as the message transfer in the sporadic phase. However, since the event-polling method does not use pre-scheduling to the priority of the messages, it is inefficient for the real-time systems. To schedule message transmission, a master node should know the priority of message to be transmitted by a slave node prior to the sporadic phase, but the existing TCN standard does not support any protocol for this. This paper proposes the slave frame bit-stuffing algorithm, with which a master node gets the necessary information for scheduling and includes the simulation results of the event-polling method and the proposed algorithm.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 1999년도 가을 학술발표논문집 Vol.26 No.2 (3)
• /
• pp.117-119
• /
• 1999

Disk mirroring 시스템은 안정성과 고 가용성(High Availability)을 제공하기 때문에 고성능 시스템에서 많이 사용되고 있다. 본 논문에서는 Windows NT 커널에 remote node에 대한 disk mirroring 기능을 추가하여 시스템 자체에서 이러한 기능을 제공할 수 있는 모델을 설계하고자 한다. 설계 시스템은 Windows NT TDI 계층을 사용하여 network 으로 연결된 두 대의 시스템이 master node와 slave node의 pair로 구성되며,slave node가 master node의 디스크를 mirror하게 된다. 또한 fault tolerance 기능을 제공하여 node의 장애 발생시 log를 생성하고, 이 정보를 바탕으로 장애가 발생한 node에 대하여 데이터 복구 기능을 제공하도록 한다.

• 반도체디스플레이기술학회지
• /
• 제16권3호
• /
• pp.65-70
• /
• 2017

This paper presents the implementation for the master changing algorithm between nodes in a general electric vehicle. The packet processing method based on the unique network method of an electric vehicle is that the method of processing a communication packet has the priority from the node of a vehicle installed at both ends. An important factor in deciding master or slave in a train is that the request data, the status data, and transmits or control codes of sub-devices are controlled from the node which master becomes. If the request data or the status data is transmitted from the non- master side, it is very important that only one of the devices of both stages be master since the data of the request data may collide with each other. This paper proposes an algorithm to select master or slave depending on which vehicle is started first, which node is master or slave, and whether the vehicle key is operation. Finally experimental results show the stable performance and effectiveness of the proposed algorithm.

• Journal of Communications and Networks
• /
• 제1권2호
• /
• pp.89-98
• /
• 1999

In a synchronization (sync) $network^1$containing N nodes, it is shown (Theorem 1c) that an arbitrarily connected sync network & is the union of a countable set of isolated connecting sync networks${&_i,i= 1,2,.., L}, I.E., & = \bigcup_{I=1}^L&_i$ It is shown(Theorem 2e) that aconnecting sync network is the union of a set of disjoint irreducible subnetworks having one or more nodes. It is further shown(Theorem 3a) that there exists at least one closed irreducible subnetwork in $&_i$. It is further demonstrated that a con-necting sync network is the union of both a master group and a slave group of nodes. The master group is the union of closed irreducible subnetworks in $&_i$. The slave group is the union of non-colsed irre-ducible subnetworks in $&_i$. The relationships between master-slave(MS), mutual synchronous (MUS) and hierarchical MS/MUS ent-works are clearly manifested [1]. Additionally, Theorem 5 shows that each node in the slave group is accessible by at least on node in the master group. This allows one to conclude that the synchro-nization information avilable in the master group can be reliably transported to each node in the slave group. Counting and combinatorial arguments are used to develop a recursive algorithm which counts the number $A_N$ of arbitrarily connected sync network architectures in an N-nodal sync network and the number $C_N$ of isolated connecting sync network in &. EXamples for N=2,3,4,5 and 6 are provided. Finally, network examples are presented which illustrate the results offered by the theorems. The notation used and symbol definitions are listed in Appendix A.

• Journal of Communications and Networks
• /
• 제6권3호
• /
• pp.197-202
• /
• 2004

This work presents a stability analysis of the synchronous state for one-way master-slave time distribution networks with single star topology. Using bifurcation theory, the dynamical behavior of second-order phase-locked loops employed to extract the synchronous state in each node is analyzed in function of the constitutive parameters. Two usual inputs, the step and the ramp phase perturbations, are supposed to appear in the master node and, in each case, the existence and the stability of the synchronous state are studied. For parameter combinations resulting in non-hyperbolic synchronous states the linear approximation does not provide any information, even about the local behavior of the system. In this case, the center manifold theorem permits the construction of an equivalent vector field representing the asymptotic behavior of the original system in a local neighborhood of these points. Thus, the local stability can be determined.