• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.187-188
• /
• 2009

최근 무선 센서 노드를 이용하여 다양한 환경 정보를 수집하고 처리할 수 있는 기술들이 활발히 연구되고 있다. 무선 센서 네트워크는 제한적인 컴퓨팅 자원을 가진 소형의 센서 노드들로 구성된다. 무선 센서 네트워크에서 중요한 이슈중 하나는 모든 노드가 게이트웨이인 싱크 노드를 통해 정보수집 네트워크를 효율적으로 구성하는 것이다. 기존의 무선 센서 네트워크에서는 싱크 노드와 센서 노드들간의 데이터 통신에 있어서 한 싱크 노드가 다운되면 통신경로가 상실되는 문제점을 가지고 있다. 이를 해결하기 위해 본 논문에서는 무선 슬롯 링 방식을 제안한다. 무슨 슬롯 링 방식은 기존의 트리형 혹은 클러스터형과 달리 센서 노드로 링형 네트워크를 구성하고 한 노드를 통해 데이터를 싱크노드로 전송하는 통신 기법을 제안한다.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.6
• /
• pp.744-749
• /
• 2013

The protection switching technology is widely adopted in the fiber-optical transmission equipments based on TDM(Time Division Multiplexing), such as PDH, SDH/SONET. A variety of protection switching algorithms for Ethernet networks and the progress of standardization are summarized in the document. There are several kinds of protection switching algorithms for Ethernet networks, such as STP, RSTP, MSTP and etc. However, since Ethernet signal move through detour route, it causes much time to recover. Accordingly, it is difficult to secure a usability of Ethernet networks and QOS(Quality of Service). Also, if the protection switching protocol standardized by IEEE and ITU-T is used, it remains a inherent network switching time for protection. Therefore, a specific protection switching algorithm for Ethernet are needed for seamless and stable operation of Ethernet networks service for Distribution Automation System(DAS). A reliable protection algorithm with no switching delay time is very important to implement Self-healing service for DAS. This study of FPGA based protection switching algorithm for Ethernet networks shows that in case of faults occurrence on distribution power network, immediate fault isolation and restoration are conducted through interaction with distribution equipments using P2P(Peer to Peer) communication for protection coordination. It is concluded that FPGA based protection switching algorithm for Ethernet networks available 0ms switching time is crucial technology to secure reliability of DAS.

• Journal of KIISE:Information Networking
• /
• v.37 no.5
• /
• pp.409-414
• /
• 2010

The applications based on geographical location are increasing rapidly in wireless sensor networks (WSN). Recently, various localization algorithms have been proposed but the majority of algorithms rely on the specific hardware to measure the distance from the signal sources. In this paper, we propose the Weighted Multiple Rings Localization(WMRL). We assume that each deployed anchor node may periodically emit the successive beacon signals of the different power level. Then, the beacon signals form the concentric rings depending on their emitted power level, theoretically. The proposed algorithm defines the different weighting factor based on the ratio of each radius of ring. Also, If a sensor node may listen, it can find the innermost ring of the propagated signal for each anchor node. Based on this information, the location of a sensor node is derived by a weighted sum of coordinates of the surrounding anchor nodes. Our proposed algorithm is fully distributed and does not require any additional hardwares and the unreliable distance indications such as RSSI and LQI. Nevertheless, the simulation results show that the WMRL with two rings twice outperforms centroid algorithm. In the case of WMRL with three rings, the accuracy is approximately equal to WCL(Weighted Centroid Localization).

• Journal of KIISE:Information Networking
• /
• v.34 no.3
• /
• pp.226-238
• /
• 2007

In this paper, we present a novel fully distributed topology control protocol that can construct the multiple-ring topology of Minimal Connected Dominating Set (MCDS) as the transport backbone for mobile ad hoc networks. It makes a topology from the minimal nodes that are chosen from all the nodes, and the constructed topology is comprised of the minimal physical links while preserving connectivity. This topology reduces the interference. The all nodes work as the nodes of the distributed parallel Boltzmann machine, of which the objective function is consisted of two Boltzmann factors: the link degree and the connection domination degree. To define these Boltzmann factors, we extend the Connected Dominating Set into a fuzzy set, and also define the fuzzy set of nodes by which the multiple-ring topology can be constructed. To construct the transport backbone of the mobile ad hoc network, the proposed protocol chooses the nodes that are the strong members of these two fuzzy sets as the clusterheads. We also ran simulations to provide the quantitative comparison against the related works in terms of the packet loss rate and the energy consumption rate. As a result, we show that the network that is constructed by the proposed protocol has far better than the other ones with respect to the packet loss rate and the energy consumption rate.

• Polymer(Korea)
• /
• v.38 no.6
• /
• pp.752-759
• /
• 2014

Crosslinked polyimides (PIs) were synthesized by reacting 4,4'-(hexafluoroisopropylidene)-diphthalic anhydride (6FDA) and 2,2'-bis(trifluoromethyl)benzidine (TFDB) with various ratios of the cross-linkable, end-capping agent cis-1,2,3,6-tetrahydrophthalic anhydride (CDBA) via ring-opening metathesis polymerization. Residual stress behaviors were investigated in-situ during thermal imidization of the crosslinked PI precursors using a thin film stress analyzer (TFSA) by wafer bending method. The thermal properties were investigated via differential scanning calorimetry (DSC), thermomechanical analysis (TMA), and thermogravimetric analysis (TGA). The optical properties were measured by ultraviolet-visible spectrophotometer (UV-vis) and spectrophotometry. All properties were interpreted with respect to their morphology of crosslinked networks. With increasing the amounts of the end-capping agent, the residual stress decreased from 27.9 to -1.3 MPa, exhibited ultra-low stress and high thermal properties. The minimized residual stress and enhanced thermal properties of the crosslinked PI makes them potential candidates for versatile high-density multi-layer structure applications.

• Korean Management Science Review
• /
• v.11 no.3
• /
• pp.103-128
• /
• 1994

Due to the trend of evolution toward a broadband communication network with fiber-optics, the design and operation of fiber-optic network have been received a great deal of research attention recently. Furthermore, even a single fiber link failure in the network may result in severe service loss. Thus, the network survivability becomes an importantissue in planning and designing the network. This survey is on modelling of various fiber-optic subscriber loop network(FSLN) design problems, which are essential ones for providing broadband communication services and B-ISDN services. Models are classified and investigated as either conventional decomposition-iteration approach or integrated design method. To build survivable networks, SHR models are also suggested by ring control schemes. The result of this study will be effectively applied to build a design model for FSLN in the practical applications.

• Journal of Internet Computing and Services
• /
• v.2 no.5
• /
• pp.93-104
• /
• 2001

In this paper. we analyze networks in accordance with topology which consists of ATM-LAN in order to enhance performance in multimedia environment, We analyze job processing time of Email, FTP and Http server for variance of node in star, ring and mesh topology, We analyze a load factor of Email, FTP and Http server and variance of sending/receiving rate for various topology, We examined that the constituent networks in this paper can minimize load of server in any other topology.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.402-407
• /
• 2007

The network throughput is an important performance criteria for the packet ring networks. Since maximizing the network throughput can lead to severe bias in bandwidth allocation among all flows, fairness should be imposed to prevent bandwidth starvation. The challenge here, therefore, is the joint optimization of the network throughput and fairness. In this paper, we present the optimal bandwidth assignment scheme to decompose this optimization problem into two tasks, one for finding fair bandwidth assignment and the other for finding the optimal routing. The network throughput is maximized under the fairness constraints when these tasks are performed iteratively.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.493-496
• /
• 2000

We study the problem of designing at minimum cost a two-connected network topology such that the shortest cycle to which each edge belongs does not exceed a given maximum number of hops. This problem is considered as part of network planning and arises in the design of backbone networks. We propose a genetic algorithm approach that uses a solution representation, in which the connectivity and ring constraints can be easily encoded. We also propose a crossover operator that ensures a generated solution is feasible. By doing so, the checking of constraints is avoided and no repair mechanism is required. We carry out experimental evaluations to investigate the solution representation issues and GA operators for the network design problem.

• Journal of Communications and Networks
• /
• v.16 no.4
• /
• pp.421-429
• /
• 2014

We consider the problem of scheduling communications in wireless sensor networks (WSNs) to ensure battery preservation through the use of the sleeping mode of sensors.We propose a communication protocol for 1-hop WSNs and extend it to multi-hop WSNs through the use of a 1-hop clustering algorithm.We propose to schedule communications in each cluster in a virtual communication ring so as to avoid collisions. Since clusters are cliques, only one sensor can speak or listen in a cluster at a time, and all sensors need to speak in each of their clusters at least once to realize the communication protocol. We model this situation as a mathematical program.