• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.293-300
• /
• 2004

Ad hoc networks are groups of mobile hosts without any fixed infrastructure. Frequent changes in network topology owing to node mobility make these networks very difficult to manage. Therefore, enhancing the reliability of routing paths in ad hoc networks gets more important. In this paper, we propose a ZRP(Zone Routing Protocol)-based route discovery scheme that can not only reduce the total hops of routing path, but Improve security through authentications between two nodes. And to solve the problem in maintenance of routing paths owing to frequent changes of the network topology, we adopt a query control mechanism. The effectiveness of our scheme is shown by simulation methods.

• 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.

• Journal of information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.610-614
• /
• 2011

Nowadays Mobile Ad Hoc Networks (MANETs) are a very popular and emerging technology in the world. MANETs helps mobile nodes to communicate with each other anywhere without using infrastructure. For this purpose we need good routing protocols to establish the network between nodes because mobile nodes can change their topology very fast. Mobile node movements are very important features of the routing protocol. They can have a direct effect on the network performance. In this paper, we are going to discuss random walk and random waypoint mobility models and their effects on routing parameters. Previously, mobility models were used to evaluate network performance under the different routing protocols. Therefore, the network performance will be strongly modeled by the nature of the mobility pattern. The routing protocols must rearrange the changes of accurate routes within the order. Thus, the overheads of traffic routing updates are significantly high. For specific network protocols or applications, these mobility patterns have different impacts.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1839-1842
• /
• 2002

Ad hoc networks are characterized by multi- hop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. In this paper, we proposed a new technique to adjust the zone radius by concentrating the changes of network traffic in a particular direction, which we refer to as AZRP. We demonstrate that even though ZRP and AZRP share a similar hybrid routing behavior, the differences in the protocol mechanics can lead to significant performance differentials. We discuss the algorithm and report on the performance of AZRP scheme, and compare it to the ZRP routing protocol. Our results indicate clearly that AZRP outperforms ZRP by reducing significantly the number of route query messages. And thereby increases the efficiency of the network load.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.5
• /
• pp.365-374
• /
• 2004

This paper proposes the architecture of Intermediate System to Intermediate System routing protocol. IS-IS is a link state routing protocol designed to provide routing in a network layer protocols with datagram services. IS-IS has favored scalability and stability. So, it is important to support IS-IS for the MPLS system used in backbone networks. Especially, IS-IS must provide network state information and available resource information for supporting qualify of services in MPLS network. Therefore, we propose the design architecture of IS-IS routing protocol and the implementation technologies. Also, we propose extended architecture for traffic engineering in ATM based MPLS system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.401-405
• /
• 2007

In sensor network, cluster based routing protocol about efficient energy usage method has researched variously. But existing cluster based routing protocol have problems. one of the problem is sensor nodes's imbalance energy consumption problem at cluster reconstruction. anther is non- connection problem between header node and spc node when they are far from each other, not properly connected. We propose cluster re-division and header node of multihop transmission method in this paper. The cluster re-division method is the method that re-divides existing routing protocol with the small-scale cluster and multihop transmission method is the method regarding the relay transmission between the header nodes. Through the simulation, the proposed routing mechanism shows more excellent than exiting routing protocol in balance energy consumption and energy efficiency.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2008.10b
• /
• pp.449-454
• /
• 2008

Finding an energy efficient route is one of the very important issues in the wireless sensor networks. The route scheme should consider both of the energy level of sensor nodes and the number of hops at the same time. First of all, this paper proposes an optimum routes finding scheme (ORFS), which could be used in the sensor network routing protocols. The scheme uses an optimum value for the path with the considerations of both the minimum energy level of a path and the number of hops at the same time. After that, this paper proposes a routing protocol based on the ORFS for how it could be used for the multipath directed diffusion with data aggregation (MDD-A), to get the better energy efficiency. The analysis result shows that the proposed routing protocol could lengthen the network life cycle about 18.7% compared to the previous MDD-A related protocols.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.119-122
• /
• 2004

This mobile oriented Ad-hoc network yet steps on development level, related issues and standardization are progressing. This paper presented ad-hoc network's overview and overall property, followed by routing scheme that must be setup for communication between each nodes. Among several routing scheme proposed for standardization, ZRP that is foaled by this paper, is hybrid type algorithm, and only includes advantages of others This paper presented running process and implementation method, result that is made from network simulation, shows analysis of each parameter values's change. Each parameters changed with many differences according to Zone radius and communication node's location from simualtion that was performed changing a number of nodes and a velocity of nodes.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.131-138
• /
• 2022

A Mobile Ad-hoc Network (MANET) is a collection of moving nodes that communicate and collaborate without relying on a pre-existing infrastructure. In this type of network, nodes can freely move in any direction. Routing in this sort of network has always been problematic because of the mobility of nodes. Most existing protocols use simple routing algorithms and criteria, while another important criterion is path selection. The existing protocols should be optimized to resolve these deficiencies. 'Particle Swarm Optimization (PSO)' is an influenced method as it resembles the social behavior of a flock of birds. Genetic algorithms (GA) are search algorithms that use natural selection and genetic principles. This paper applies these optimization models to the OLSR routing protocol and compares their performances across different metrics and varying node sizes. The experimental analysis shows that the Genetic Algorithm is better compared to PSO. The comparison was carried out with the help of the simulation tool NS2, NAM (Network Animator), and xgraph, which was used to create the graphs from the trace files.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.5 no.3
• /
• pp.157-167
• /
• 2010

One of the most famous proactive routing protocols, DSDV (Destination -Sequenced Distance-Vector), is based on the minimum hop count. This paper suggests BIMP(Bypass Information Multi-Path) DSDV routing protocol that this protocol could route reliably as it can take the information of the bypass for the solution of the problem on EHMP DSDV. In this paper, the protocol checks throughput, packet delivery delay, packet delivery ratio, number of management messages, packet transmit finish time, etc on the traffic compared to DSDV, HMP DSDV, and EHMP DSDV protocols.