• 한국신재생에너지학회:학술대회논문집
• /
• 2010.06a
• /
• pp.227.2-227.2
• /
• 2010

본 연구에서는 양극산화된 $TiO_2$ 전극(anodized tubular $TiO_2$ electrode, ATTE)을 수소제조용 PEC(Photoelectrochemical)시스템에서 광어노드와 기존의 백금전극을 대체하고 $H^+$ 환원능을 향상시키기 위하여 엔자임(Pyrococcus furiosus, Pfu)을 고정화한 후 캐소드로 동시에 활용하였으며, 엔자임 고정을 위한 crosslinker 종류 및 금속담지 여부, ATTE 길이를 통한 수소발생양에 미치는 영향을 연구하였다. ATTE 표면과 엔자임의 amine group의 연결을 위하여 heterobifunctional crosslinker로써 사슬 길이가 상대적으로 짧은 Sulfo-SDA가 유리하였으며, 금속담지의 경우 짧은 튜브의 경우 1% 내에서 효과가 증진되었으나 긴 튜브의 경우는 오히려 광전류 및 궁극적으로 수소발생속도에 불리하게 작용하였다. 또한, 튜브 길이가 긴 ATTE가 짧은 ATTE 보다 수소발생양에서 더욱 효율적임을 알 수 있었다. 텅스텐산화물 담지의 가시광감응에의 담지 효과는 예비 실험 결과로 나타나지 않아, 추가적인 연구가 필요한 것으로 판단된다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.05a
• /
• pp.415-418
• /
• 2018

To reduce the flooding overhead of typical AODV, we propose a local flooding initiated by a destination. The proposed routing protocol determines the one-hop neighbor nodes around the shortest path between source and destination by overhearing, and periodically generate flooding at the destination to cope with topology changes. This flooding process involves only one-hop neighbor nodes around the shortest path for reducing the flooding overhead and forms multiple alternate paths around the shortest path. This makes it possible to seamlessly route to the newest shortest path around when the current routing path is disconnected.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2008.11a
• /
• pp.443-443
• /
• 2008

본 연구에서는 Ga-doped ZnO(GZO)-Ag-GZO 다층 투명전극을 Dual DC magnetron sputtering system을 이용 하여 유리기판 위에 상온에서 제작하여 Ag 두께에 따른 전기적, 광학적, 구조적 특성변화를 조사하였다. Hall effect measurement와 UV/Vis spectrometer로 전기적, 광학적 특성을 분석하였으며, X-ray diffraction(XRD)와FE-SEM분석을 통해 결정성과 표면 특성을 조사하였다. FE-SEM 분석결과 island 형태에서 continuous layer로 박막의 형상이 바뀌면서 다층 투명전극의 전기적, 광학적 특성에 영향을 미치는 것을 알 수 있었다. 본 실험에서 Ag 두께 12 nm에서 가장 최적화되어 유리기판위에 상온에서 증착되었음에도 불구하고 $5.5{\times}{\times}10^{-5}\Omega$-cm, $6\Omega$/sq. 의 매우 낮은 면저항과 비저항을 각각 나타내었고 550 nm 파장에서 87 % 의 높은 광 투과도를 나타내었다. 또한 두께 12 nm의 Ag가 삽입된 다층 투명전극을 polyethylene terephthalate (PET) 기판위에 성막하여 Bending test를 실시하여 0.1% 이하의 매우 낮은 저항변화를 확인함으로써 플렉시블 기반의 디스플레이나 태양전지의 투명 전극으로서의 응용 가능성을 확인하였고 마지막으로 최적화된 다층 투명전극을 유기물태양전지의 애노드에 적용하여 기존 ITO 애노드를 대체할 수 있는 투명전극으로서의 가능성을 제시하였다.

• Journal of IKEEE
• /
• v.10 no.2 s.19
• /
• pp.123-127
• /
• 2006

An Ad-hoc network which is composed of mobile nodes only should be able to distribute the traffic load evenly to the network so that the network could utilize its resources effectively However, most of researches have been concentrated in channel establishment level, not in channel reestablishment level. In this paper, the existing AODV routing protocol has been modified and upgraded to disperse the traffic load more quickly A node which uses the modified AODV routing protocol proposed in this paper broadcasts a control message to adjacent nodes, which announces congestion around the node. In order to verify the performance improvement of the proposed protocol, simulation study has been carried out by using ns2 simulator.

• Journal of Internet Computing and Services
• /
• v.18 no.2
• /
• pp.13-20
• /
• 2017

Recently, researches to adopt Content-centric network (CCN), which is one of the promising technologies for replacing TCP/IP-based networks, to wireless networks has actively performed. However, because of erroneous and unreliable channel characteristics, there are many problems to be resolved to adopt CCN to wireless networks. This paper proposes a method to reduce content download time because nodes possess only parts of content chunks. The proposed method enables a node having parts of content chunks to request the rest of parts of content chunks to a provider before a Consumer requests the content. As a consequence, the content download time is reduced.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.401-408
• /
• 2005

We propose a new MPLS restoration scheme that uses network resources more efficiently and minimizes the backup path cost effectively. Contrary to other restoration strategies, the proposed restoration scheme starts the recovery action at the selected node of a working LSP. At LSP setup, the working and backup path cost is evaluated and the starting node of restoration is designated. By doing so, the restoration speed could be further increased and resource utilization could be maximized. We simulated the proposed scheme and compared with other restoration and protection schemes. The result shows that our scheme can provide fast restoration with acceptable delay and loss characteristics.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1756-1769
• /
• 1999

Parallel paths in an interconnection network have some significance in that message transmission time can be reduced because message is divided into packets and transmitted in parallel through several paths, and also an whose nodes has 2n binary bit string, is an interconnection network which has a lower network cost than hypercube and its variation. In this paper, we analyze node disjoint parallel path in Folded Hyper-Star graph FHS(2n,n) proposed as the topology of parallel computers and, using the result, prove that the fault diameter of a Folded Hyper-Star graph FHS(2n,n) is 2n-1.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.4
• /
• pp.2370-2375
• /
• 2014

Wireless sensor networks (WSNs) have a big potential for distributed sensing for large geographical area. The improvement of the lifetime of WSNs is the important research topic because it is considered to be difficult to change batteries of sensor nodes. Clustering communication protocols are energy-efficient because each sensor node can send its packet to the cluster head near from itself rather than the sink far from itself. In this paper, we present an energy-efficient clustering communication protocol, which chooses cluster heads based on the expected residual lifetime of each sensor node. Simulation results show that our proposed scheme increases average lifetimes of sensor nodes as much as 20% to 30% in terms of the traffic quantity and as much as 30% to 40% in terms of the scalability compared to the existing clustering communication protocol, LEACH.

• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.601-606
• /
• 2006

Decode-and-forward cooperative communications protocol (DFP) allows single-antenna users in wireless medium to obtain the powerful benefits of multi-antenna systems without physical antenna arrays. For this protocol, so far the relays have used SNR to evaluate the reliability of the received signal before deciding whether to forward the decoded data so as to prevent their unsuccessful detection. However, SNR only characterizes the long-term statistic of Gaussian noise and thus leading to inaccurate assesment. Therefore, we propose using log-likelihood ratio (LLR) which accounts for the instantaneous noise in the received signal as an alternative to SNR. A variety of simulation results reveal the significant superiority of the SNR-based DFP to the SNR-based DFP regardless of threshold level and relay position under the flat Rayleigh fading channel plus AWGN (Additive White Gaussian Noise).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.3
• /
• pp.587-595
• /
• 2015

A by-pass path in wireless sensor networks is the alternative path which be able to forward data when a routing path is being broken. One reason of depleting energy is occurred by the path. The method for solving prior to addressed the problem is proposed. However, this method may deplete radio resource. The best path has advantage that network lifetime of sensor nodes is prolonged; on the contrary, in order to maintain the best path it have to share their information between the entire nodes. In this paper, we propose the best path searching algorithm in the distributed three dimensional sensor networks. Through the neighboring informations sharing in the proposed method, the proposed algorithm can decide the best k-path as well as the extension of network lifetime.