• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.10 no.3
• /
• pp.101-109
• /
• 2011

In this paper, we present a new routing protocol, multipath and multi-priority based routing protocol, (MMRP) for wireless multimedia sensor networks. The proposed MMRP chooses the multiple routing paths from source to the sink, then the selected paths are assigned with different priority levels depending upon the residual energy and transmission delay in the routing paths. That is, the highly prioritized I frames of the MPEG video are transmitted over the high priority routing paths, and other P and B frames are transmitted over the lower priority routing paths. The proposed MMRP protocol can be applied to time critical applications which require both lower latency and low power consumption over wireless multimedia sensor network. Simulations results of MMRP protocol show respectively an improvement of 23.48% and 23.11% in energy conservation and 81.6% and 32.01% improvement in latency as compared to protocols without and with multipath routing.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.745-752
• /
• 2005

BGP is a unique routing protocol in broadband internet. It chooses routing paths considering internet hierarchy and local policies. As BGP routers selectively bypass routing information to a subset of neighboring BGP routers, connectivity by way of a series of links between source and destination nodes does not mean reachability of routing information of the two. In emergency when BGP routers or links over wide range are not available, BGP routers have to use links that are not normally used to keep reachability. This paper listed out the requirements for BGP backup routing and proposed a routing solution that hides most demerits in currently published ones. The proposed backup operates in three tiers according to network damage. Under this rule, BGP routers use tier-0 routing paths at normal. If networks are impaired, they choose tier-1 paths. If networks are seriously damaged, tier-2 paths are allowed to use. Also this paper proves that the proposed backup guarantees stability and safeness. As results, the proposed backup is very adaptive to light network damages as well as serious ones and provides strong routing reachability at all times.

• Journal of KIISE:Information Networking
• /
• v.33 no.4
• /
• pp.299-309
• /
• 2006

In Mobile ad hoc networks, AODV is one of the famous on-demand routing protocol, which use the routing tables in the nodes if possible, or Route Discovery Process (RDP) is triggered to find a new route. However increasing the traffic of RDP causes dropping of the network performance in the large size of ad hoc networks. In this paper, we propose a novel routing protocol, named as AOZDV (Ad hoc On-demand Zone and Distance-Vector Routing), which enhances the AODV protocol with zone routing. AOZDV creates a Zone with neighbor nodes of the source/destination using traffic and power information, and utilizes Destination-Vector Table for internal routing in the Zone. We show by simulations that AOZDV can reduce the occurrence rate of route fail and RDP caused by route fail compared to existing routing protocols such as DSR and AODV.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.815-818
• /
• 2015

AODV routing protocol, one of the most studied routing protocols for the Mobile Ad hoc Network (MANET), uses the number of hops as the metric to choose a path from a source node to a destination node. If the path is deteriorated, it will cause many problems to the communication. In order to improve the performance of the network, we propose AuM-AODV routing protocol that contains an auxiliary metric besides the number of hops. Nodes using AuM-AODV use control packets such as Route Request (RREQ), Route Reply (RREP), and HELLO to exchange information about network topology like AODV routing protocol. AuM-AODV routing protocol is implemented in NS-3 for performance evaluation. We use three performance metrics, that is to say, throughput, packet delivery ratio, and average end-to-end delay. According to numerical results, the new AuM-AODV routing protocol has better performance over three performance metrics than AODV routing protocol.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.94-96
• /
• 2021

Software-Defined Networking (SDN), which has emerged to overcome the limitations of existing network architectures, makes routing management simpler and more efficient through a central controller. SR (Segment Routing) is a flexible and scalable way of doing source routing, and defines the information path of the network through a list of segments arranged in the packet header. In an SDN environment, the performance of each router is almost the same, but packets tend to be concentrated on routes that are frequently used depending on routing algorithms. Routers in that path have a relatively high frequency of failure and are more likely to become bottlenecks. In this paper, we propose a routing algorithm that allows the router, which is a resource in the network, to evenly process packets in the SDN with SR, so that the administrator can utilize the resources in the network without idle routers, and at the same time facilitate the management of the router.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1390-1411
• /
• 2024

Underwater Wireless Sensors Networks (UWSNs) are deployed in remotely monitored environment such as water level monitoring, ocean current identification, oil detection, habitat monitoring and numerous military applications. Providing scalable and efficient routing is very challenging in UWSNs due to the harsh underwater environment. The biggest difficulties are the nodes inherent movement due to water current, long delay in data transmission, low bandwidth of the acoustic signal, high error rate and energy scarcity in battery powered nodes. Many routing protocols have been proposed to solve the aforementioned problems. There are three broad categories of routing protocols namely depth based, energy based and vector-based routing. Vector Based Forwarding protocols perform routing through virtual pipeline by defining their radius which give proper direction to packets communication. We proposed a routing protocol termed as Path-Oriented Energy Scaled Expanded Vector Based Forwarding (PESEVBF). PESEVBF takes into account all parameters; holding time, the source nodes packets routing path and void holes creation on the second hop; PESEVBF not only considers the packet upward advancement but also focus on density of the forwarded nodes in terms of number of potential forwarding and suppressed nodes for path selection. Node selection in resultant holding time is based on minimum Path Factor (PF) value. Moreover, the suppressed node will be selected for packet forwarding to avoid the void holes occurrences on the second hop. Performance of PESEVBF is compared with other routing protocols using matrices such as energy consumption, packet delivery ratio, packets dropping ratio and duplicate packets creation indicating considerable performance improvement.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.11a
• /
• pp.300-302
• /
• 1999

The multicast routing trees that have recently been proposed can be classified into three types: source-based trees, renter-based shared trees and non-renter based shared trees. In this paper, those multicast trees are compared and evaluated in term of the link costs and the maximum delay on the tree by experiments.

• Electronics and Telecommunications Trends
• /
• v.38 no.2
• /
• pp.36-45
• /
• 2023

Segment routing (SR) is a source-based routing architecture in which a node steers packets adhering to service and topological requirements. Using programmable segments, SR enables end-to-end service connectivity to satisfy the network constraints of various services. SR can be implemented with both MPLS and IPv6 dataplanes. This survey presents the overview of SR for IPv6 dataplane (SRv6), network programming technologies based on SRv6, and the SR deployment status.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.116-122
• /
• 2006

Most of the multimedia applications require strict quality of service (QoS) guarantee during the communication between a single source and multiple destinations. This gives rise to the need for an efficient QoS multicast routing strategy. Determination of such QoS-based optimal multicast routes basically leads to a multi-objective optimization problem, which is computationally intractable in polynomial time due to the uncertainty of resources in Internet. This paper describes a network model for researching the routing problem and proposes a new multicast tree selection algorithm based on genetic algorithms to simultaneously optimize multiple QoS parameters. The paper mainly presents a QoS multicast routing algorithm based on genetic algorithm (QMRGA). The QMRGA can also optimize the network resources such as bandwidth and delay, and can converge to the optimal or near-optimal solution within few iterations, even for the networks environment with uncertain parameters. The incremental rate of computational cost can close to polynomial and is less than exponential rate. The performance measures of the QMRGA are evaluated using simulations. The simulation results show that this approach has fast convergence speed and high reliability. It can meet the real-time requirement in multimedia communication networks.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.3
• /
• pp.206-210
• /
• 2009

In this paper, we propose a new routing scheme based on multi-path routing which provides uniform energy consumption for all nodes. This scheme adds a new type of root node for constructing multi-path. The sink node delegates some partial roles to these root nodes. Such root nodes carry out path establishment independently. As a result, each nodes consume energy more uniformly and the network life-time will be extended. Through simulation, we confirmed that energy consumption of the whole network is scattered and the network life-time is extended. Moreover, we show that the proposed routing scheme improves the performance of network compared to previous routing strategies as the number of source nodes increases.