• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1983.10a
• /
• pp.108-111
• /
• 1983

This paper presents a new method for the optimum capacity assignment in store-and-forward communication networks under a total fixed-capacity constraints. Any two link capacities needed in this method can have the desirable quantites and then other capacities can be obtained from the fixed two link capacities. When the minimum and the maximum capacities that are the quantites of the conventional method are fixed, the total average time delay from the new method is almost the same as that from the conventional method. And when the minimum capacity is fixed, the new method gives smaller average time delay.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.24 no.7
• /
• pp.26-40
• /
• 2010

We propose a new routing protocol, MCQosR, that is based on bandwidth estimation, admission control, and a routing metric, MCCR - suitable for wireless ad-hoc networks with multiple radios and channels. To use the full capacity of a wireless link, we assume a node with multiple radios for full duplex operation, and a radio using multiple channels to exclude route-intra interference. This makes it possible to use the capacity of a wireless link. Then, to provide bandwidth and delay guarantee, we have a radio with a fixed channel for layer-3 data reception at each node, used to estimate the available bandwidth and expected delay of a wireless link. Based on the estimate of available bandwidth and delay, we apply the call admission control to a new call requiring bandwidth and delay guarantee. New calls with traffic that will overflow link or network capacity are rejected so the accepted calls can use the required bandwidth and delay. Finally, we propose a routing metric, MCCR, which considers the channel contentions and collisions of a wireless link operating in CSMA/CA. MCCR is useful for finding a route with less traffic and distributing traffic over the network to prevent network congestion as much as possible. The simulation of the MCQosR protocol and the MCCR metric shows traffic is distributed and guaranteed service is provided for accepted calls.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.651-669
• /
• 2013

In this paper, we study a novel routing algorithm based on load balancing for multi-channel wireless mesh networks. In order to increase the network capacity and reduce the interference of transmission streams and the communication delay, on the basis of weighted cumulative expected transmission time (WCETT) routing metric this paper proposes an improved routing metric based on load balancing and channel interference (LBI_WCETT), which considers the channel interference, channel diversity, link load and the latency brought by channel switching. Meanwhile, in order to utilize the multi-channel strategy efficiently in wireless mesh networks, a new channel allocation algorithm is proposed. This channel allocation algorithm utilizes the conflict graph model and considers the initial link load estimation and the potential interference of the link to assign a channel for each link in the wireless mesh network. It also utilizes the channel utilization percentage of the virtual link in its interference range as the channel selection standard. Simulation results show that the LBI_WCETT routing metric can help increase the network capacity effectively, reduce the average end to end delay, and improve the network performance.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1876-1883
• /
• 2016

The new channel model for high data rate common data link(CDL) is proposed. The Two-ray channel, which is composed of the reflected signals on the front ground of the receiver, is considered in this paper. This channel arises due to the curvature of the earth when the altitude of the transmitter is tens of kilometers and distance between the transmitter and the receiver is hundreds of kilometers. The Two-ray channel is modeled by estimating the maximum delay profile and the power delay profile, depending on the transmitting and receiving beamforming angle and the radiation pattern of antenna. The power delay profile has a larger effect on the bit error rate(BER) over signal to noise ratio(SNR) than the maximum delay profile, because the distance range is too long in the proposed channel model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1045-1053
• /
• 2012

Link-16 is a widely used TDL (Tactical Data Link) which uses TDMA (Time Division Multiple Access). Link-16 is a very low rate system, so it supports small size of data like tactical message and voice. However, there are related works to transmit situation awareness information like image due to the increasing interest about EBO(Effect-Based Operation), recently. Special TDMA scheduling is needed not static TDMA of Link-16 for image transmission because image data has much larger size than the existing tactical data. In this paper, we proposed Link-16K which enhances the Link-16 MAC. The proposed Link-16K is compatible with Link-16, and includes dynamic TDMA, new packing method, and an efficient retransmission scheme for image transmission effectively. We can see that image transmission delay is reduced and channel utilization is increased through simulation results of proposed idea.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10B
• /
• pp.831-840
• /
• 2004

Providing quality of service (QoS) guarantees over wireless link requires thorough understanding and quantification of the interactions among the traffic source, the wireless channel, and the underlying error control mechanisms. In this paper, we account for such interactions in a network-layer model that we use to investigate the delay performance of a wireless channel. We consider a single ON/OFF traffic stream transported over a wireless link. The capacity of this link fluctuates according to a fluid version of Gilbert-Elliot's model. We derive the packet delay distribution via two different approaches: uniformization and Laplace transform. Numerical aspects of both approaches are compared. The delay distribution is further used to quantify the wireless effective bandwidth under a given delay guarantee. Numerical results and simulations are used to verify the adequacy of our analysis and to study the impact of error control and bandwidth allocation on the packet delay performance. Wireless networks, QoS, delay distribution, fluid analysis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5200-5222
• /
• 2017

The separation of control plane and data plane in Software Defined Network (SDN) makes it flexible to control the network behavior, while also causes some inconveniences to the link failure recovery due to the delay between fail point and the controller. To avoid delay and packet loss, pre-defined backup paths are used to reroute the disrupted flows when failure occurs. However, it may introduce large overhead to build and maintain these backup paths and is hard to dynamically construct backup paths according to the network status so as to avoid congestion during rerouting process. In order to realize congestion aware fast link failure recovery, this paper proposes a novel method which installs multi backup paths for every link via source routing and per-hop-tags and spread flows into different paths at fail point to avoid congestion. We carry out experiments and simulations to evaluate the performance of the method and the results demonstrate that our method can achieve congestion aware fast link failure recovery in SDN with a very low overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.12B
• /
• pp.1586-1594
• /
• 2011

LED-ID (light emitting diode - identification) technology is the new paradigm in the identification technology environment. LED-ID system typically needs line of sight (LOS) that supports narrow FOV transceivers links to achieve high data rate. On the other hand, narrow FOV reduces the coverage area. Therefore, the number of tags is increased significantly to cover the whole area. In this case number of link switching is increased when the reader moves within whole coverage area. Link switching delay is the important factor for the moving reader to maintain the communication with high data rate and better QoS. In this paper we propose in literature a new link switching scheme and measure the link switching delay time for LED-ID system. The simulation results show that the proposed link switching scheme is a possible candidate for multi-tag LED-ID system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.684-693
• /
• 2003

This paper analyzes transmissiondelays of a message and a packet in a time-varying and packet-based radio link. The paper assumes that thearrivals of messages have a Bernoulli process and the lengths of the messages a exponential distribution. To reflect the feature of the time-varying radio link, we use a two-state Markov model. From the model the mean transmission delay of and the mean queue length of the packet are analyzed in terms of the packet distribution function, the packet transmission service time, and the PER of the radio link. And the mean message transmission delay time and the mean queue length are derived using the performance indices of the packet. Numerical results show that the message arrival rate and the message length have some bounds to keep the transmission of the message steady and to improve the performance indices of the message. It can be known that the PER of the state influences on the performance indices more than the sojourn time of the state.