• Journal of the Korea Society of Computer and Information
• /
• v.14 no.4
• /
• pp.59-67
• /
• 2009

In wireless sensor networks (WSNs), geographic greedy forwarding fails to move a packet further towards its destination if the sender does not have any closer node to the destination in its one hop transmission region. In this paper, we propose a enhanced geographic routing, called CGR(Cost based Geographic Routing) for efficient data delivery against void problem environment. CGR first establishes Shadow Bound Region and then accomplishes Renewing Cost Function Algorithm for effective greedy forwarding data delivery. Our simulation results show significant improvements compared with existing schemes in terms of routing path length, success delivery ratio and energy efficiency.

• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.91-97
• /
• 2002

This paper describes a heuristic search technique carrying out collision avoidance for Autonomous Underwater Vehicles(AUVs). Fuzzy relational products are used as the mathematical implement for the analysis and synthesis of relations between obstacles that are met in the navigation environment and available candidate nodes. In this paper, we propose a more effective evaluation function that reflects the heuristic information of domain experts on obstacle clearance, and an advanced heuristic search method performing collision avoidance for AUVs. The search technique adopts fuzzy relational products to conduct path-planning of intelligent navigation system. In order to verify the performance of proposed heuristic search, it is compared with $A^*$ search method through simulation in view of the CPU time, the optimization of path and the amount of memory usage.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.436-438
• /
• 2001

광 네트워크상의 SONET계층에서 수행되었던 망의 고장에 대한 복구 등의 요구사항은 Generalized Multiprotocol Lambda Switching (GMPLS)에서 해결해야 할 가장 중요한 문제중의 하나이다. GMPLS망 구현 시 고려되어야 할 사항중의 하나는 중단 없는 서비스를 제공하고 망의 효율을 극대화하기 위하여 망의 고장이나 성능의 저하를 대응하기 위한 관리 방안이다. 신뢰성 있는 망 서비스를 제공하기 위한 망 복구 기능에 있어서 주요 과제는 복구의 대상으로 하는 작업 경로에 대한 대체경로를 설정하는 것이다. 본 논문은 GMPLS를 이용하여 광 네트워크에서 최소한의 링크 정보로 망 자원의 효율성을 증가시키는 동시에 모든 작업 경로와 대체 경로의 경로 구성 정보를 이용하여 정확한 대역 공유가 가능한 경로 자동 복구 기법을 제안한다. 본 메커니 즘의 경우 확장된 CR-LDP프로토콜을 이용하게 되므로 망의 변형을 최소화하는 동시에 효율성 면에서 매우 뛰어난 메커니즘이라 할수 있다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.1
• /
• pp.65-73
• /
• 2004

In this paper, we propose a tunnel establishment scheme using Next Hop Resolution Protocol over mobile IP networks, which consist of LAN-based IP networks and ATM-based IP networks. As a basic idea, we use the shortest path algorithm to establish a short-cut tunnel between HA and FA. Also, we classify methods for establishing a short-cut tunnel into four cases considering the locations of HA, FA, CN and MN. To confirm the advantages of our schemes, which deliver packets using short-cut tunnel in optimized path method over mobile IP networks, we performed mathematical analysis and simulation, compared proposed schemes with existing IP routing method in terms of transmission delay between CN and MN. The simulation results show that our scheme have superior performance to that of existing IP routing mechanism, because the store-and-forward delay which occurred in IP routing mechanism is considerably reduced in short-cut tunnel over ATM networks.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.6
• /
• pp.131-142
• /
• 2011

In this paper, we propose a new multipath routing protocol and compare it with other multipath routing protocols in mobile ad hoc network (MANET) environments. The new multipath routing establishes the main route using a mechanism based on Ad Hoc On-demand Distance Vector(AODV), after which data transmission starts immediately. The backup route search process takes place while data are transmitted, to reduce the transmission delay. The protocol can also operate in a hybrid node-disjoint/link-disjoint mode, where the protocol finds the node-disjoint backup route first; if the node-disjoint does not exist, the protocol discovers the link-disjoint backup route from the main route. When either of the main route or the backup route is broken, data are transmitted continuously through the other route and the broken route is recovered by the route maintenance process. The results of simulations, based on the Qualnet simulator, show that the proposed multipath routing protocol increases the packet transmission success rate and reduces end-to-end delays, when compared with AODV and AOMDV protocols.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.11
• /
• pp.141-149
• /
• 2013

IETF 6LoWPAN standard technique has been studied in IoT environment to support the IPv6 packet communication. 6LoWPAN protocol for transmission of packets mainly in the AODV routing protocol and a variety of extended techniques have been investigated. In particular, consisting of nodes with limited resources in a network error occurs when the 6LoWPAN reliable data transfer and fast routing method is needed. To this end, in this paper, we propose resilient routing protocol and extension of IETF LOAD algorithm, for optimal recovery path, More specifically, the optimal recovery path setup algorithm, signal flow, and detailed protocols for the verification of the reliability of packet transmission mathematical model is presented. The proposed protocol techniques to analyze the performance of the NS-3 performance through the simulation results that is end-to-end delay, throughput, packet delivery fraction and control packet overhead demonstrated excellence in comparison with existing LOAD.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1A
• /
• pp.23-29
• /
• 2006

In wireless sensor networks(WSNs), it is crucial to maintain network connectivity as long as possible since nodes are battery-powered and unchange-able. We propose a new routing protocol called Energy Aware Source Routing(EASR) which can be efficient in respect of network lifetime and long-term connectivity. Our protocol is multipath source routing, only one path will be selected at the same time and each path has probability to be selected like as Energy Aware Routing(EAR) protocol. The route discovery procedure of EASR protocol is reformed from the route discovery procedure of Split Multipath Routing(SMR) protocol. However, there is the difference between SMR and EASR. In EASR, we define an overhearing ratio in order to reduce energy waste due to overhearing effect among each selected path. Thus, we can establish energy efficient multiple paths by making use of overhearing ratio. The simulation results are also demonstrated that our scheme increases in network lifetimes, and achieves reasonable packet latency time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6C
• /
• pp.544-561
• /
• 2002

In this paper, we propose a new hybrid type of the routing protocol (Virtual Cluster-based Routing Protocol: VCRP) for mobile ad-hoc networks, based on a virtual cluster, which is defined as a narrow-sense network to exchange the basic information related to the routing among the adjacent nodes. This particular approach combines advantage of proactive routing protocol (PRP), which immediately provides the route collecting the network-wide topological and metric information, with that of reactive routing protocol, which relies on the route query packet to collect the route information on its way to the destination without exchanging any information between nodes. Furthermore, it also provides the back-up route as a byproduct, along with the optimal route, which leads to the VCBRP (Virtual Cluster-based Routing Protocol with Backup Route) establishing the alternative route immediately after a network topology is changed due to degradation of link quality and terminal mobility, Our simulation studies have shown that the proposed routing protocols are robust against dynamics of network topology while improving the performances of packet transfer delay, link failure ratio, and throughput over those of the existing routing protocols without much compromising the control overhead efficiency.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.246-247
• /
• 1998

PCS를 포함한 차세대 이동통신은 ATM/B-ISDN을 core network으로 하여 다양한 서비스를 제공하는 방향으로 발전할 것으로 예상된다. 이러한 유.무선 통합환경에서 PCS mobility를 효율적으로 제공하기 위해서 TINA와 같은 계층적 연결관리 구조와 이 구조에 적합한 라우팅 기법이 필요하다. 본 논문에서는 ATM/B-ISDNTINA통신망에서 기존의 라우팅 기법에 비해 장점을 가지면서, TINA의 계층적 연결관리 구조를 기바능로 하는 병렬.분산 라우팅 기법을 제안한다. 제안된 병렬.분산 라우팅 기법은 라우팅 알고리즘이 서브네트워트 단위로 병렬적, 계층적으로 실행되어 사용자가 원하는 QoS연결을 제한된 시간내에 빠르게 설정할 수 있으므로, PCS mobility지원을 위한 빈번한 경로 재설정 요구에 유연하게 대처 할수 있다. 또한, 연결관리 체계가 계층적으로 이루어져 있어 TMN/TNA를 통한 체계적인 통신망 관리에도 효율적이다.

• The KIPS Transactions:PartC
• /
• v.15C no.3
• /
• pp.205-212
• /
• 2008

In the environment with multiple heterogeneous wireless sensor networks with a single point of sensed data collection or a gateway (GW), relay points (RPs) may be required for the energy efficient delivery of sensed data from static or mobile sinks to the GW. The optimal placement of RPs becomes an even more difficult problem if static sinks are dynamically added or the trajectory of mobile sinks can not be known in advance. In order to resolve this problem, we propose a mechanism to deploy RPs in a grid pattern and to use the tree-based relaying network for reducing the cost of the RP and for reducing the control overhead incurred by the route setup from sinks to the GW. For the performance evaluation of our proposed mechanism, we have carried out a numerical analysis on a single route setup from a sink to the GW and, for more general performance evaluations, ns-2 based simulations have been carried out. According to the performance evaluation results, our tree-based relaying network mechanism outperforms that based on AODV in terms of the data delivery time, the network service time and the control overhead.