• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3081-3099
• /
• 2012

We propose a new multipath-based reliable routing protocol on MANETs, Multipath-based Reliable routing protocol with Fast-Recovery of failures (MRFR). For reliable message transmission, MRFR tries to find the most reliable path between a source and a destination considering the end-to-end packet reception reliability of the routes. The established path consists of a primary path that is used to transmit messages, and the secondary paths that are used to recover the path when detecting failures on the primary path. After establishing the path, the source transmits messages through the primary path. If a node detects a link failure during message transmission, it can recover the path locally by switching from the primary to the secondary path. By allowing the intermediate nodes to locally recover the route failure, the proposed protocol can handle the dynamic topological change of the MANETs efficiently. The simulation result using the QualNet simulator shows that the MRFR protocol performs better than other protocols in terms of the end-to-end message delivery ratio and fault-tolerance capability.

• Journal of Digital Convergence
• /
• v.10 no.9
• /
• pp.363-368
• /
• 2012

The Cluster-based routing protocol is consumed the energy consumption efficiently, but there are many isolated nodes while clustering, so these are impeding energy efficiency. Hop-by-hop based routing protocol is suitable large-scaled network or dynamic environment. However, with the periodic flooding signal and rapid energy loss of near sink nodes, the network life time become shorter. In this paper, We propose the hybrid routing protocol that combine the cluster based routing method for energy efficiency of nodes and hop-by-hop method for re-joining the isolated nodes and load balance of nodes in the near cluster using fibonacci sequence. Based on the analysis, it is proved that the hybrid routing protocol provided higher energy efficiency and less the isolated nodes than previous methods.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.31-34
• /
• 2012

In MANET, frequent movement of nodes causes the dynamic network topology changes. Therefore the routing protocol, which is very stable to effectively respond the changes of the network changes, is required. Moreover, the existing cluster-based routing protocol, that is the hybrid approach, has routing delay due to the re-electing of the cluster header. In addition, the routing table of CBRP has all only one hop distant neighbor nodes. PCBRP, proposed in this paper, ties two clusters in one pair of clusters to make longer radius. Then the pair of the cluster headers manages and operates corresponding member nodes. When they route nodes in the paired cluster internally, PCBRP reduces the delay by requesting a route. Therefore PCBRP shows improved total delay of the network and improved performance of packet transmitting rate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1214-1221
• /
• 2007

Ad-hoc network is soft wireless communication network that is consisted of mobile node and clusters without helping of infrastructure. We propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. Proposed structure is consisted of context awareness parameters as like distance between each nodes. The proposed architecture performs two types of routing discovery. One is Flooding Discovery Routing(FDR) for comparing analysis step and Local Discovery Routing(LDR) to compose path of node forecast(preservation) step from node's state value. The inference network structure of proposed RODMRP(Resilient Ontology-based Dynamic Multicast Routing Protocol) adopts a tree structure to enhance an efficient packet in various environment between mobile node. We will have developed an algorithm that will desist multi-hierarchy Layered networks to simulate a desired system.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.60 no.4
• /
• pp.257-261
• /
• 2011

In this paper, we research the OLSR(Optimized Link State Routing Protocol) of the mobile ad-hoc network protocols, and design the system implementation based on the Embedded Linux for the Ubiquitous Space construction. We prove the performance of proposed system in the various experiment environments through several scenarios which is about transmitting the image data on the mobile ad-hoc network environment.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.592-594
• /
• 2003

애드 혹 네트워크는 고정된 기반 구조 없이 이동 호스트들로만 구성된 네트워크 망이다. 애드 혹 네트워크는 노드의 잦은 이동으로 인한 토폴로지의 잦은 변화로 관리면에서 많은 어려움을 가지고 있다. 따라서 애드 혹 네트워크에서의 라우팅 경로에 대한 신뢰도를 높이는 방법의 중요도가 커지고 있다. 본 논문에서는 기존의 Zone Routing Protocol을 응용하여 만든 Clustered Zone Routing Protocol을 기반으로 하여 라우팅 경로의 신뢰도를 향상시키고자 한다. 기존의 라우팅 프로토콜에 비해 경로상의 노드끼리의 인증을 통한 보안성을 증가시키고, 질의 제어 메커니즘을 통해 전체적인 질의 제어 메시지의 수를 감소시키고자 한다.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.350-355
• /
• 2007

Border gateway protocol allows autonomous systems(ASes) to apply diverse routing policies for selecting routes and for propagating reachability information to other ASes. Although a significant number of studies have been focused on the Internet topology, little is known about what routing policies network operators employ to configure their networks. In this paper, we infer and characterize routing policies employed in the Internet. We find that routes learned from customers are preferred over those from peers and providers, and those from peers are typically preferred over those from providers. We present an algorithm for inferring and characterizing export policies. We show that ASes announce their prefixes to a selected subset of providers to perform traffic engineering for incoming traffic. We find that the selective announcement routing policies imply that there are much less available paths in the Internet than shown in the AS connectivity graph, and can make the Internet extremely sensitive to failure events. We hope that our findings will help network operators in designing routing policies.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2012.01a
• /
• pp.105-108
• /
• 2012

Wireless mesh networks are considered a promising solution to last mile broadband. The unique characteristics of WMN impose unique requirements on designing routing protocols and metrics for WMN. However, existing routing schemes that are designed for single-channel multi-hop wireless networks may lead to inefficient routing paths in multichannel. This paper focuses on the routing problem for multi-radio multichannel WMNs. We list the challenges in designing routing algorithms for multi-radio multichannel WMNs. Then we examine the requirements and considerations for designing routing metrics according to the characteristics of multi-radio multichannel WMNs. Finally we survey and investigate the existing routing metrics in terms of their ability to satisfy these requirements.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.9
• /
• pp.760-766
• /
• 2012

In this paper, we propose an efficient flooding process on link-state routing protocol. It is possible to exchange information using typical link-state routing protocol; for example, OSPF(Open Short Path First) or IS-IS(Intermediate system routing protocol) that floods LSA between nodes when the network topology change occurs. However, while the scale of network is getting bigger, it affects the network extensibility because of the unnecessary LSA that causes the increasing utilization of CPU, memory and bandwidth. An existing algorithm based on the Minimum spanning tree has both network instability and inefficient flooding problem. So, we propose algorithm for efficient flooding while maintaining network stability. The simulation results show that the flooding of proposed algorithm is more efficient than existing algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.173-179
• /
• 2008

An ad hoc network is multi-hop wireledss formed by mobile node without infrastructure. Due to the mobility of nodes in mobile ad hoc networks, the topology of network changes frequently. In this environments, multicast protocols are faced with the challenge of producing multi-hop routes and limitation of bandwidth. We compare the performance of two multicast routing protocols for mobile ad hoc networks - Serial Multiple Disjoint Tree Multicast Routing Protocol (Serial MDTMR) and Adaptive Core Multicast Routing Protocol (ACMRP). The simulator is implemented with GloMoSim.