• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.273-280
• /
• 2008

In WSN(Wireless Sensor Network) many routing algorithms such as LEACH, PEGASIS and PEDEP consisting of sensor nodes with limited energy have been proposed to extend WSN lifetime. Under the assumption of perfect fusion, these algorithms used convergecast that periodically collects sensed data from all sensor nodes to a base station. But because these schemes studied less energy consumption for a convergecast as well as fairly energy consumption altogether, the minimum energy consumption for a convergecast was not focused enough nor how topology influences to energy consumption. This paper deals with routing topology and energy consumption for a single convergecast in the following ways. We chose major WSN topology as MSC(Minimum Spanning Chain)s, MSTs, PEGASIS chains and proposed LECSEN chains. We solved the MSC length by Linear Programming(LP) and propose the LECSEN chain to compete with MST and MSC. As a result of simulation by Monte Carlo method for calculation of the topology length and standard deviation of link length, we learned that LECSEN is competitive with MST in terms of total energy consumption and shows the best with the view of even energy consumption at the sensor nodes. Thus, we concluded LECSEN is a very useful routing topology in WSN.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.4
• /
• pp.27-34
• /
• 2016

In the train system, railway vehicles are connected in a line. Therefore, this feature should be considered in composing network topology in a train system. Besides, inter-car communication should be distinguished from in-car communication. As for the inter-car communication, the hybrid topology was proposed to use rather than the conventional ring, star, daisy-chain, and bus topologies. In the hybrid topology, a number of cars are bound to be a group. Then star topology is used for the communication in a group and daisy-chain topology is used for the communication between groups. Hybrid topology takes the virtue of both star and daisy-chain topologies. Hence it maintains communication speed with reducing the number of connecting cables between cars. Therefore, it is important to choose the number of cars in a group to obtain higher performance. In this paper, we focus on the optimization of hybrid topology for railway cars. We first assume that the size of data and the frequency of data production for each car is identical. We also assume that the importance for the maximum number of cables to connect cars is variable as well as the importance of the communication speed. Separated weights are granted to both importance and we derive the optimum number of cars in a group for various number of cars and weights.

• Proceedings of the KIPE Conference
• /
• 2013.07a
• /
• pp.395-396
• /
• 2013

고주파 유도가열 시스템은 고효율 및 생산의 편의성으로 산업 전반에 걸쳐 다양하게 적용되고 있다. 이러한 고주파 유도 가열 시스템은 크게 정류부, 전압조절부, 공진형 인버터로 구분된다. 공진형 인버터는 공진 주파수로 스위칭 시, 순수 실수 어드미턴스만 남게 되어 최대 효율을 얻는다. 공진 주파수는 공진회로의 입력 어드미턴스에 의해 결정되는데, 용융과정에서 피가열체의 저항 값은 시간에 따라 변화한다. 이는 전체 입력 어드미턴스의 변화와 공진 주파수의 변화로 나타나고, 효율이 저하되는 단점이 있다. 본 논문에서는 공진 인버터의 공진 주파수를 스스로 추종하는 자기공진 추종 토폴로지를 제안한다. 제안된 토폴로지는 고주파 유도가열 시스템의 용융과정에서 피가열체의 저항 값이 시변하여 공진 주파수가 이동하더라도 반주기 내에 정확하게 추종 동작을 한다. 본 논문에서는 제안된 자동 공진 추종회로를 기존의 병렬 공진 유도가열 시스템에 적용하여 타당성을 검증하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.244-246
• /
• 2004

애드혹 네트워크(Ad hoc networks)에서 각 노드는 자유로이 이동하며, 이러한 변화에 맞춰 매번 각 노드 간에는 새로운 신뢰관계가 형성되어야 한다. 이와 같은 시스템에서 토폴로지의 변화에 따른 정보를 빠르게 획득하는 것은 물론이거니와 이에 수반되는 노드 간 라우팅 경로를 안전하게 형성하는 것은 애드혹 네트워크 환경에서는 매우 중요한 부분이다. 이에 본 논문에서는 애드혹 네트워크 환경에서 효율적인 플러딩(flooding) 기법을 사용하여 최적의 인증서 체인(certificate-chain)을 안전하게 구축하는 방법을 제안하고자 한다. 이는 노드들이 잦은 이동성으로 인해 극심한 토폴로지 변화에도 효율적으로 신뢰 관계를 유지하도록 하며, 효과적인 플러딩 방식을 사용하여 최소의 시간 동안 최적의 인증서 경로를 찾아내는 방식이다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.5
• /
• pp.411-419
• /
• 2013

Research on developing algorithms for building modeling such as extracting outlines of the buildings and segmenting patches of the roofs using aerial images or LiDAR data are active. However, utilizing information from the building model is not well implemented yet. This study aims to propose a scheme for search identical or similar shape of buildings by utilizing graph topology pattern matching under the assumptions: (1) Buildings were modeled beforehand using imagery or LiDAR data, or (2) 3D building data from digital maps are available. Side walls, segmented roofs and footprints were represented as nodes, and relationships among the nodes were defined using graph topology. Topology graph database was generated and pattern matching was performed with buildings of various shapes. The results show that efficiency of the proposed method in terms of reliability of matching and database structure. In addition, flexibility in the search was achieved by altering conditions for the pattern matching. Furthermore, topology graph representation could be used as scale and rotation invariant shape descriptor.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.458-465
• /
• 2007

Wireless Sensor Network(WSN) is a special network that collects measured data by sensor nodes in the predefined sensor field and forwards them to the base station in a distance using their own routing scheme. WSN requires routing techniques to maximize energy efficiency because sensor nodes have non-rechargeable and thus limited energy. Characteristics of WSN are various according to applications, many of routing algorithms have been proposed. This paper proposes an algorithm called A-PEGASIS that basically bases on PEGASIS and enhances in two aspects - an elegant chain generation algorithm and periodical update of chains. We compare performance of the previous algorithm of LEACH, PEGASIS, PEDAP and PEDAP-PA with ours through simulation. It confirms that the A-PEGASIS is most superior in terms of average WSN lifetime and high probability of node survival rate during WSN life time.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.2
• /
• pp.97-103
• /
• 2009

Improving TCP performance has long been the focus of many research efforts in 802.11 wireless networks study. Hop count and Round Trip Time (RTT) are the critical sources which serious affect the TCP performance on end to end connection. In this paper, we analytical derived the affection and based on the analysis we propose TCP should Change its Expected Value (TCP-CEV) when hop count and RTT change by setting a reasonable CWND change rate to improve the performance. The proposed scheme is applicable to a wide range of transport protocols using the basic TCP mechanism, and the protocol behavior is analytically tractable. We show that our simple strategy improves TCP performance at least over 12% in a chain topology, 4.9% in a grid topology and improve the TCP convergence.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.230-235
• /
• 2008

현재 대부분의 무선랜은 유선 분산 시스템을 통하여 백본에 연결되어 있다. 그러나 지역회담이나 재해재난 지역 그리고 군사용등은 유선 백본을 사용할 수 없다. 따라서 무선으로 액세스 포인트를 연결하여 일시적으로 네트워크 서비스를 원하는 곳이나 케이블을 연결하기 힘든 지역에서 빠르고 쉽게 네트워크 구성을 제공하기 위한 무선 메쉬 네트워크의 요구가 늘어나고 있다. 본 논문에서는 이러한 무선 메쉬 네트워크의 기반 기술인 무선 분산 시스템 환경에서 TCP와 UDP 프로토콜의 성능에 대하여 연구하였다. 시스템 성능 측정은 IEEE 802.11g 인터페이스를 가지고 있는 액세스 포인트에서 체인 토폴로지를 기본으로 측정되어졌고, 홉수와 트래픽 종류 그리고 트래픽 흐름의 방향에 따라 수율(throughput)과 전송시간(transaction time) 그리고 전송실패율(loss rate) 등을 비교 분석하였다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2015.07a
• /
• pp.275-276
• /
• 2015

네트워크 가상화를 위한 대표적인 개방적 아키텍처로 OpenFow를 들 수 있다. OpenfFow는 가상 네트워크(Software Defined Network) 개념을 실현하기 위한 랜 스위치 제어 프로토콜의 집합체로서 데이터 센터 등 주로 유선랜 환경을 목표로 설계되어 활용되고 있다. 이 논문에서는 OpenFlow를 무선랜의 AP(Access Point)에 적용하여 WiFi 디바이스들로 구성된 가상 무선 네트워크 관리 프레임을 구현한다. 구현된 관리 프레임은 WiFi 디바이스들의 토폴로지와 트래픽 상황을 중앙 관제 센터에서 모니터링할 수 있고, 플로우 경로를 설정함으로써 라우터를 경유하지 않고 AP 수준에서 스위칭(라우팅)이 가능하여 전체적인 트래픽 혼잡을 크게 줄일 수 있다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.9 s.351
• /
• pp.165-174
• /
• 2006

In this paper, we propose a new contention window control algorithm to increase TCP performance in wireless multi-hop networks. The new contention window control algorithm is suggested to reduce the hidden and exposed terminal problems of wireless multi-hop networks. Most of packet drops in wireless multi-hop networks results from hidden and exposed terminal problems, not from collisions. However, in normal DCF algorithm a failed user increases its contention window exponentially, thus it reduces the success probability of fined nodes. This phenomenon causes burst data transmissions in a particular node that already was successful in packet transmission, because the success probability increases due to short contention window. However, other nodes that fail to transmit packet data until maximum retransmission attempts try to set up new routing path configuration in network layer, which cause TCP performance degradation and restrain seamless data transmission. To solve these problems, the proposed algorithm increases the number of back-of retransmissions to increase the success probability of MAC transmission, and fixes the contention window at a predetermined value. By using ns-2 simulation for the chain and grid topology, we show that the proposed algorithm enhances the TCP performance.