• The Journal of the Korea Contents Association
• /
• v.12 no.4
• /
• pp.60-68
• /
• 2012

In recent years, the requirements on the high quality environment monitoring by using the sensor nodes which can handle the multimedia data in WSN have been increased. However, because the volume of multimedia data is tremendous, the limited bandwidth of a wireless channel may incur the bottleneck of a system. To solve such a problem, most of the existing distributed multi-path routing protocols based on multimedia data just focused on overcoming the limited bandwidth in order to enhance the energy efficiency and the transmission rate. However, because the existing methods can not apply a key-based technique to encrypt the multimedia data, they are very weak for the security. In this paper, we propose a secure disjointed multipath routing scheme for multimedia data transmission. Since our proposed scheme divides multimedia data(eg. image) into pixels and sends them through disjointed multipath routing, it can provide security to the whole network without using the key-based method. Our experimental results show that our proposed scheme reduces about 10% the amount of the energy consumption and about 65% the amount of the missed data packets caused by malicious nodes over the existing methods on average.

• Journal of KIISE
• /
• v.42 no.8
• /
• pp.1057-1064
• /
• 2015

The tactical network is system based on wireless networking technologies that ties together surveillance reconnaissance systems, precision strike systems and command and control systems. Several alternative paths exist in the network because it is connected as a grid to improve its survivability. In addition, the network topology changes frequently as forces and combatants change their network access points while conducting operations. However, most Internet routing standards have been designed for use in stable backbone networks. Therefore, tactical networks may exhibit a deterioration in performance when these standards are implemented. In this paper, we propose Priority based Multi-Path routing with Local Optimization(PMPLO) for a tactical backbone network. The PMPLO separately manages the global and local metrics. The global metric propagates to other routers through the use of a routing protocol, and it is used for a multi-path configuration that is guaranteed to be loop free. The local metric reflects the link utilization that is used to find an alternate path when congestion occurs, and it is managed internally only within each router. It also produces traffic that has a high priority privilege when choosing the optimal path. Finally, we conducted a simulation to verify that the PMPLO can effectively distribute the user traffic among available routers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1055-1063
• /
• 2002

In this paper, we have studied path selection problem using multiple metric. Current Internet selects a path using only one metric. The path selected by one metric is a best-effort service that can satisfy one requirements. In order to satisfy a call with various Qualify-of-Service(QoS) requirements, the path must satisfy multiple constraints. In many cases, path selection is NP-complete. The proposed algorithm is widest-least cost routing algorithm that selects a path based on cost metric which is basically a delay metric influenced by the network status. The proposed algorithm is a multiple metric path selection algorithm that has traffic distribution ability to select shortest path when network load is light and move traffic to other alternate path when the link load is high. We have compared the results with other routing algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1395-1404
• /
• 2000

In this paper, we propose a heuristic wavelength routing algorithm for IP datagrams in WDM (Wavelength-Division Multiplexing) networks which operates in a distributed manner, while most previous works have focused centralized algorithms. We first present an efficient construction method for a loose virtual topology with a connectivity property, which reserves a few wavelength to cope with dynamic traffic demands properly. This connectivity property assures that data from any source node could reach any destination node by hopping one or multiple lightpaths. We then develop a high-speed distributed wavelength routing algorithm adaptive to dynamic traffic demands by using such a loose virtual topology and derive the general bounds on average utilization in the distributed wavelength routing algorithms. Finally, we show that the performance of the proposed algorithms is better than that of the FSP(Fixed Shortest-Path) wavelength routing algorithms through simulation using the NSFNET[1] and a dynamic hot-spot traffic model, and that the algorithms is a good candidate in distributed WDM networks in terms of the blocking performance, the control traffic overhead, and the computation complexity.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.100-102
• /
• 2002

네트워크 기술의 급속한 발달로 인해 최근 무선 Ad-hoc 통신망에 관한 연구가 활발하게 진행되어 오고 있다. Ad-hoc망은 기존의 유선망에서와는 다르게 중앙 집중화된 관리를 필요로 하지 않고 지리적으로 분산된 각 노드들이 역동적으로 위치를 변경하며 라우터의 역할을 수행하여 단대단 정보전송 서비스를 제공한다. 그러나 제한된 통신 자원으로 인한 낮은 대역폭과 높은 전송 오류를 포함하고 있으며, 한정된 대역과 단말기능에 있어서의 제약으로 현재의 인터넷 라우팅 프로토콜들을 그대로 사용하기 어렵다. 현재 사용되고 있는Ad-hoc 네트워크에서의 라우팅 프로토콜은 네트워크 토폴로지가 변화해야만 새로운 경로를설정하도록 되어 있어 이동성이 낮은 환경에서의 트래픽 집중화 현상과 경로 설정을 위한 반복적 검색으로 서비스 효율이 떨어지는 문제점을 가지고 있다. 따라서 본 논문에서는 다중 이웃 노드 테이블을 별도 관리하고 혼잡 상황시 자노드 중계 차단을 수행하여 효율적으로 부하균등을 제어하는 라우팅 기법을 제시한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06a
• /
• pp.160-161
• /
• 2008

• The KIPS Transactions:PartC
• /
• v.15C no.2
• /
• pp.79-86
• /
• 2008

MANET(Mobile Ad hoc Network) is a collection of two or more nodes equipped with wireless communications and constrained by the factor of energy limitation. The running out of energy on some nodes may bring down the performance of network seriously. For solving the problems above, this paper uses completely separated Node-Disjoint multipaths from a source to a destination as many as possible. And, based on average, minimum or variance of energy values on the each multipath, the packets are distributed on paths. Generally, collecting methods for energy information can be classified into two main categories, Static and Dynamic. As the different energy values collected, the packet distribution methods are classified into six criteria, Static-Average, Static-Minimum, Static-Variance, Dynamic-Average, Dynamic-Minimum and Dynamic-Variance respectively. The performance of the packet distribution methods and that of AODV are compared by NS2 simulation.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.8
• /
• pp.269-280
• /
• 2022

With the rise of a decentralized finance market (so called, DeFi) using blockchain technology, users and capital liquidity of decentralized finance applications are increasing significantly. The Automated Market Maker (AMM) is a protocol that automatically calculates the asset price based on the liquidity of the decentralized trading platform, and is currently most commonly used in the decentralized exchanges (DEX), since it can proceed the transactions by utilizing the liquidity pool of the trading platform even if the buyers and sellers do not exist at the same time. However, Automated Market Maker have some disadvantages since the cost efficiency of each transaction using Automated Market Maker depends on the liquidity size of some liquidity pools used for the transaction, so the smaller the size of the liquidity pool and the larger the transaction size, the smaller the cost efficiency of the trade. To solve this problem, some platforms are adopting Transaction Path Routing Algorithm that bypasses transaction path to other liquidity pools that have relatively large size to improve cost efficiency, but this algorithm can be further improved because it uses only a single transaction path to proceed each transaction. In addition to just bypassing transaction path, in this paper we proposed a Multi-Path Routing Algorithm that uses multiple transaction paths simultaneously by distributing transaction size, and showed that the cost efficiency of transactions can be further improved in the Automated Market Maker-based trading environment.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.303-310
• /
• 2008

To increase the lifetime of ad-hoc networks, a ratio of energy consumption for each node should be kept constant by equally distributing network traffic loads into all of the nodes. In this paper, we propose a modified AODV routing protocol to determine a possible route by considering a remaining battery capacity of a node and the degree of its usage. In addition, to reduce the amount of energy consumption during the path rediscovery process due to the huge amount of the AODV control messages the limited number of possible routes are stored into a routing table of a source node. When some links of a route fail, another possible path can be looked up in the table before the route discovery process should be initiated. We have tested our proposed method with a conventional AODV and a MMBCR method which is one of the power-efficient energy routing protocols based on the three performance metrics, i.e., the total remaining battery capacity, network lifetime and the ratio of data packets received by the destination node to compare their performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12B
• /
• pp.1083-1096
• /
• 2008

This paper proposes an energy-aware path management scheme, so-called the TBP(Threshold based Back-Pressure) algorithm, which is designed for lifetime extension of the energy-constrained wireless sensor networks. With the goal of fair energy consumptions, we extensively utilize the available paths between the source and the sink nodes. The traffic distribution feature of the TBP algorithm operates in two scales; the local and the whole routing area. The threshold and the back-pressure signal are introduced for implementing those operations. It is noticeable that the TBP algorithm maintains the scalability by defining both the threshold and the back-pressure signal to have their meanings locally confined to one hop only. Throughout several experiments, we observe that the TBP algorithm enhances the network-wide energy distribution. which implies the extension of the network lifetime. Additionally, both the delay and the throughput outcomes show remarkable improvements. This shows that the energy-aware path control scheme holds the effects of the congestion control.