• Journal of KIISE:Information Networking
• /
• v.37 no.2
• /
• pp.157-161
• /
• 2010

Vehicular Ad-hoc NETworks (VANETs) suffer from frequent network disconnections due to obstacles such as buildings even in urban environments with high density of traffic. Thus, in this paper, we propose a routing algorithm that finds optimal end-to-end paths in terms of both traffic density and distance in the urban VANET and selects the next hop with the minimum distance, while maintaining the minimum hop counts over the path. The simulation results show that the proposed algorithm achieves higher throughput and smaller end-to-end delay than Greedy Perimeter Stateless Routing (GPSR) with message carrying.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5B
• /
• pp.247-256
• /
• 2007

In this paper, we propose Geographical Back-off Routing (Geo-Back Routing) protocol for wireless sensor networks. Geo-Back uses the positions of nodes, a packet's destination and a optimal back-off time to make the packet forwarding decisions using only source and destination's location information without information about neighbor nodes' location or the number of one hop neighbor nodes. Under the frequent topology changes in WSNs, the proposed protocol can find optimal next hop location quickly without broadcast algorithm for update. In our analysis, Geo-Back's scalability and better performance is demonstrated on densely deployed wireless sensor networks.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.4 no.1
• /
• pp.14-19
• /
• 2009

In Mobile Ad-hoc Network, link failure and packet loss may occur frequently due to its nature of mobility and limited battery life. In this paper, an enhanced robust routing protocol based on AODV(Ad hoc On-demand Distance Vector routing) by monitoring variation of receiving signal strength is proposed. New metric function that consists of node mobility and hops of path is used for routing decision. For preventing route failure by node movement during data transmission, a new route maintenance is presented. If the node movement is detected, the routing agent switches local path to its neighbor node. Simulation results show that the performance of the proposed routing scheme is superior to previous AODV protocol.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.593-596
• /
• 2010

본 논문에서는 선형적인 무선 센서 네트워크에서 지연 및 신뢰성을 고려한 클러스터 기반의 멀티홉 라우팅 알고리즘을 제안한다. 제안한 알고리즘은 선형적인 네트워크 환경에서 전송 지연시간 및 Single Point Of Failure 를 해결하기 위해 짝수 ID 노드일 경우 다음 짝수 ID 노드로 전송하고, 홀수 ID 노드일 경우 다음 ID 노드로 데이터를 전송하는 방법을 사용한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.1213-1216
• /
• 2007

본 논문에서는 IEEE 802.15.4 LR-WPAN 네트워크에서 계층화된 주소 할당방식을 통한 TDMA 방식의 비콘 스케쥴링 기법을 제안한다. 본 제안은 각 노드가 데이터를 전달할 다음 노드의 active 구간을 비콘 추적 없이도 알 수 있어 데이터 전송시에 다음 노드의 경쟁구간(Contention Access Period, CAP)에 바로 참여할 수 있는 있는 형태로 되어 있다. 또한 계층적 주소 할당 방식을 사용하므로 다중 홉(multi-hop) 센서 네트워크에서 에너지 효율적인 라우팅이 가능해진다.

• Proceedings of the Korean Radioactive Waste Society Conference
• /
• 2005.06a
• /
• pp.432-432
• /
• 2005

사용후핵연료시료 중에 함유된 요오드(I-127 및 129)를 정량하기 위하여 화학적 방법으로 분리 회수하고 중성자방사화분석법을 이용하였다. 사전실험으로 모의사용후핵연료를 이용하여 회수율을 측정하였다. 모의 및 실제사용후핵연료시료를 $90^{\circ}C$에서 8 M $HNO_3$ 용액으로 용해하고 용해 후 용해용액 중의 잔류 요오드, 응축 및 휘발된 요오드 각각을 정량하였다. 응축 요오드는 핵연료 용해 후 재증류하여 회수하였다. 잔류 및 응축 요오드는 시료의 산화상태를 조절한 후 용매추출로 요오드를 회수한 다음 이온교환 또는 침전법으로 방사화학적으로 분리한 후 중성자방사화분석(RNAA)으로 정량하였다. 제작한 이온교환분리관 및 여과키트에 요오드를 흡착 또는 침전시켜 분리한 다음 중성자조사를 위한 삽입체(Insert)로 이용하였다. 휘발 요오드는 제조한 흡착체(Ag-silica gel)를 담은 흡착관에 포집하고 홉착체를 구간별 균질시료로 만든 다음 비파괴중성자 방사화분석(INAA)으로 정량하였다. 침전 및 흡착 요오드의 화학적 특성을 EPMA(electron probe microanalysis) 분석으로 조사하였다. 요오드 정량결과를 다른 방법으로 비교분석하기 위하여 음이온교환수지상에서 요오드를 정제 및 회수하기 위한 용리거동을 조사하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.2143-2149
• /
• 2010

An agent based geographic routing protocol is proposed to improve the well-known geographic routing protocol-GPSR routing protocol. In the proposed scheme, the agent is selected by sink node which concern about the source node's position as well as agent candidate's state. So packets will first be forwarded to agent and next step is to be forwarded to their final goal- sink node from agent. During the next hop selection process, nodes select their neighbors by considering not only position but also their average available buffer size. This results in efficient selection of next hop node in congestion area, and then increases the successful packet delivery ratio. The simulation is conducted for two scenarios: general number of connections and large number of connections in our map. Results show that new method with agent achieves improved performance in successful packet delivery ratio when compares to GPSR without our scheme.

• Journal of Life Science
• /
• v.15 no.2 s.69
• /
• pp.311-315
• /
• 2005

When paraquat was added to the bacterial membrane or mitochondrial suspension, the mixture turned dark blue, but the color was disappeared by aeration. The same phenomenon was seen when electrons were supplied to the paraquat. Blue color appeared from near the cathode, and then spreaded to whole transit system. Coloration was accelerated by addition of alkali, but the color was reduced by addition of acid or oxygen. Paraquat exhibited absorption at ultraviolet region by electron transfer at the concentrations as low as 1.0 mM which did not exert difficulty in showing color reaction. Paraquat caused the increase of the optical density at 340 nm by electron transit, and an aspect of that had a strong resemblance to NADH. The acute toxic action of paraquat seemes to depend on inhibition of energy metabolism cased by paraquat action of electron donor and acceptor.

• The KIPS Transactions:PartC
• /
• v.15C no.1
• /
• pp.45-50
• /
• 2008

Mobile ad hoc networks (MANETs) allow mobile nodes to communicate among themselves via wireless multiple hops without the help of the wired infrastructure. Therefore, in the MANET, a route setup mechanism that makes nodes not within each other's transmission range communicate is required and, for this, the Ad-hoc On-demand Distance Vector (AODV) was proposed as one of the reactive routing protocols well suited for the characteristics of the MANET. AODV uses the hop count as the routing metric and, as a result, a node selects the farthest neighbor node as its next hop on a route, which results in a problem of deteriorating the overall network throughput because of selecting a relatively low data rate route. In this paper, we propose an efficient reactive routing protocol based on the multi-rate aware MAC. Through the simulations, we analyze the performance of our proposed mechanism and, from the simulation results, we show that our proposed mechanism outperforms the existing mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5A
• /
• pp.511-520
• /
• 2011

In this paper, we introduce a multiuser (MU) scheduling method for multiuser amplify-and-forward relay systems, which selects both the transmission mode, i.e., either one- or two-hop transmission, and the desired user via two steps. A closed-form expression for the average achievable rate of the proposed scheduling is derived under two transmission modes with MU scheduling, and its asymptotic solution is also analyzed in the limit of large number of mobile stations. Based on the analysis, we perform our two-step scheduling algorithm: the transmission mode selection followed by the user selection that needs partial feedback for instantaneous signal-to-noise ratios (SNRs) to the base station. We also analyze the average SNR condition such that the MU diversity gain is fully exploited. In addition, it is examined how to further reduce a quantity of feedback under certain conditions. The proposed algorithm shows the comparable achievable rate to that of the optimal one using full feedback information, while its required feedback overhead is reduced below half of the optimal one.