• ETRI Journal
• /
• v.29 no.3
• /
• pp.405-407
• /
• 2007

A globally adaptive load-balanced routing algorithm for torus interconnection networks is proposed. Unlike previously published algorithms, this algorithm employs a new scheme based on collision detection to handle deadlock, and has higher routing adaptability than previous algorithms. Simulation results show that our algorithm outperforms previous algorithms by 16% on benign traffic patterns, and by 10% to 21% on adversarial traffic patterns.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5B
• /
• pp.304-309
• /
• 2005

In this paper, we propose a localized Adaptive QoS Routing using TD method and evaluate performance of various exploration methods when path is selected. Expecially, through extensive simulation, the proposed routing algorithm and exploration method using Exploration Bonus are shown to be effective in significantly reducing the overall blocking probability, when compared to the other path selection method(exploration method), because the proposed exploration method is more adaptive to network environments than others when path is selected.

• Journal of the Korea Society for Simulation
• /
• v.21 no.4
• /
• pp.47-56
• /
• 2012

In this study, we use a parallel simulator PASENS(Parallel SEnsor Network Simulator) to predict power consumption and data reception rate of the hierarchical routing protocols for sensor network - LEACH (Low-Energy Adaptive Clustering Hierarchy), TL-LEACH (Two Level Low-Energy Adaptive Clustering Hierarchy), M-LEACH (Multi hop Low-Energy Adaptive Clustering Hierarchy) and LEACH-C (LEACH-Centralized). According to simulation results, M-LEACH routing protocol shows the highest data reception rate for the wider area, since more sensor nodes are involved in the data transmission. And LEACH-C routing protocol, where the sink node considers the entire node's residual energy and location to determine the cluster head, results in the most efficient energy consumption and in the narrow area needed long life of sensor network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2044-2062
• /
• 2018

Information theory progression along with the advancements being made in the field of Vehicular Ad hoc NETworks (VANETs) supports the use of coding-aware opportunistic routing for efficient data forwarding. In this work, we propose and investigate an adaptive coding-aware routing scheme in a specific VANET scenario known as a vehicular platoon. Availability of coding opportunities may vary with time and therefore, the accurate identification of available coding opportunities at a specific time is a quite challenging task in the highly dynamic scenario of VANETs. In the proposed approach, while estimating the topology of the network at any time instance, a forwarding vehicle contemplates the composition of multiple unicast data flows to encode the correct data packets that can be decoded successfully at destinations. The results obtained by using OMNeT++ simulator reveal that higher throughput can be achieved with minimum possible packet transmissions through the proposed adaptive coding-aware routing approach. In addition, the proposed adaptive scheme outperforms static transmissions of the encoded packets in terms of coding gain, transmission percentage, and encoded packet transmission. To the best of our knowledge, the use of coding-aware opportunistic routing has not been exploited extensively in available literature with reference to its implications in VANETs.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2732-2744
• /
• 1997

This paper is based on multicasting model in k-ary n-cubes, and Proposes an adaptive wormhole routing algorithm which allows faults and channel contention. The proposed algorithm only requires $2{\times}n$ virtual channels per physical channel which is proportional to the dimension n in order to allow (n-1) faults in a k-ary n-cube. This method uses smaller number of virtual channels than the previously Proposed adaptive routing algorithms [5, 18]. Through a chaos simulator, we have measured message delay considering fault-tolerant as well as message traffic to our adaptive routing algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.2
• /
• pp.93-99
• /
• 2011

In this paper, we propose a policy-gradient routing scheme under Reinforcement Learning that can be used adaptive QoS routing. A policy-gradient RL routing can provide fast learning of network environments as using optimal policy adapted average estimate rewards gradient values. This technique shows that fast of learning network environments results in high success rate of routing. For prove it, we simulate and compare with three different schemes.

• ETRI Journal
• /
• v.28 no.6
• /
• pp.815-818
• /
• 2006

In the global Internet, a constraint-based routing algorithm performs the function of selecting a routing path while satisfying some given constraints rather than selecting the shortest path based on physical topology. It is necessary for constraint-based routing to disseminate and update link state information. The triggering policy of link state updates significantly affects the volume of update traffic and the quality of services (QoS). In this letter, we propose an adaptive triggering policy based on link-usage statistics in order to reduce the volume of link state update traffic without deterioration of QoS. Also, we evaluate the performance of the proposed policy via simulations.

• Journal of information and communication convergence engineering
• /
• v.16 no.3
• /
• pp.135-141
• /
• 2018

Wireless sensor networks (WSN) are composed of a large number of sensor nodes. Battery-powered sensor nodes have limited coverage; therefore, it is more efficient to transmit data via multi-hop communication. The network lifetime is a crucial issue in WSNs and the multi-hop routing protocol should be designed to prolong the network lifetime. Prolonging the network lifetime can be achieved by minimizing the power consumed by the nodes, as well as by balancing the power consumption among the nodes. A power imbalance can reduce the network lifetime even if several nodes have sufficient (battery) power. In this paper, we propose a routing protocol that prolongs the network lifetime by balancing the power consumption among the nodes. To improve the balance of power consumption and improve the network lifetime, the proposed routing scheme adaptively controls the transmission range using a power control according to the residual power in the nodes. We developed a routing simulator to evaluate the performance of the proposed routing protocol. The simulation results show that the proposed routing scheme increases power balancing and improves the network lifetime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3A
• /
• pp.219-224
• /
• 2008

In the c-DSDV routing protocol proposed to improve the scalability of DSDV, clusterheads manage a routing table that has only clusterheads as potential destinations and flood update request message to its neighbor clusterheads periodically or at the time of topology change. Accordingly, the convergence range of topology change by a single update request message was expanded nine times as wide as that of DSDV, increasing routing correctness; however, c-DSDV suffers from the congestion of clusterheads since data packets always go through clusterheads of the clusters on the routing path. To improve this problem, we propose an adaptive routing scheme that judges if detouring clusterhead is possible on the fly while packets are forwarded. As a result, a routing path length is shortened and an end-to-end delay is improved by the reduced queue length. It shows that the end-to-end delay is reduced by almost 40% through simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.6
• /
• pp.1463-1469
• /
• 1996

A crossed incoplete hypercube structure is based on previous crossed hypercube structure that reduces the diameter about 50% and has the same complexity with general hypercube and is able to expand to any number of nodes. In this study, we proposed a fault-tolerant adaptive routing scheme and broadcasting scheme. Fault-tolerant adaptive routing scheme is resilient to system faults. And performance evaluation is executed on the proposed sturcture. It is enhanced about 30%.