• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.87-97
• /
• 2009

A Mobile Ad hoc Network (MANET) is characterized by multi-hop wireless connectivity, frequently changing network topology with mobile nodes and the efficiency of the dynamic routing protocol plays an important role in the performance of the network. In this paper, the performance of five routing protocols for MANET is compared by using OPNET modeler: AODV, DSR, GRP, OLSR and TORA. The various performance metrics are examined, such as packet delivery ratio, end-to-end delay and routing overhead with varying data traffic, number of nodes and mobility. In our simulation results, OLSR shows the best performance in terms of data delivery ratio in static networks, while AODV has the best performance in mobile networks with moderate data traffic. When comparing proactive protocols (OLSR, GRP) and reactive protocols (AODV, DSR) with varying data traffic in the static networks, proactive protocols consistently presents almost constant overhead while the reactive protocols show a sharp increase to some extent. When comparing each of proactive protocols in static and mobile networks, OLSR is better than GRP in the delivery ratio while overhead is more. As for reactive protocols, DSR outperforms AODV under the moderate data traffic in static networks because it exploits caching aggressively and maintains multiple routes per destination. However, this advantage turns into disadvantage in high mobility networks since the chance of the cached routes becoming stale increases.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.633-636
• /
• 2011

The paper deals with the performance of contention-based medium access control (MAC) protocols for underwater sensor networks. We extensively analyze the number of received-packets and the end-to-end delay of ALOHA, CSMA, CSMA-RTS-CTS and CSMA-RTS-CTS-ACK protocols using a Qualnet underwater network simulator which accommodates diverse underwater acoustic channel environments. Using simulation results, we support an engineering table to determine an adequate contention-based MAC protocol for underwater sensor networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.4
• /
• pp.627-635
• /
• 2008

Using directional antenna in wireless network can offer many advantages including significant decrease of interference, increase of spatial reuse and possibility of improving network capacity. However, existing 802.11 MAC is designed for use of omni-directional antenna then those advantages can not be shown in that MAC protocol when it uses directional antenna. In this paper, we present a MAC protocol specifically designed for directional antenna to achieve spatial reuse and improve capacity of MAC protocol. Simulation result shows the advantages of our proposal in comparison with existing MAC in terms of end-to-end delay and network throughput.

• Journal of the Korean Institute of Navigation
• /
• v.7 no.1
• /
• pp.1-32
• /
• 1983

The delay due to congestion has recently attracted widespread attention with the analysis of over-all operation at the port. But, the complexity of the situation is evident in view of the large number of factors which impinge on the considerable end. Queueing theory is applicable to a large scale transportation system which is associated with arrivals of vessels in a large port. The attempt of this paper is to make an extensive analysis of the port transport system and its economic implications from the viewpoint that port is one of the physical distribution facilities and a kind of queueing system which includes ships and cargoes as port customer. By analyzing the real data on the Port of Pusan, it is known that this port can be represented as a set of multi-channel with identical setof Poisson arrival and Erlang service time, and also it is confirmed that the following formula is suitable to calculate the mean delay in this port, namely, $W_4={\frac{\rho}{\lambda(1-\rho)} {\frac{e_N(\rho{\cdot}N)}{D_{N-1}(\rho{\cdot}N)}$ where, ${\lambda}$: mean arrival rate $\mu$: mean servicing rate; N: number of servicing channel; ${\rho}$: utillization rate (${\lambda}/N{\mu}$) $e_N$: the Poisson function Coming to grips with the essentials of the cost of delay due to congestion, a simple ship journey cost model is adopted and the operating profit sensitivity to variation in port time is examined, and for purpose of a future development for port princing service the marginal cost is approximately calculated on the basis of queueing theory.

• Journal of the Korean Society of Combustion
• /
• v.4 no.2
• /
• pp.11-22
• /
• 1999

Combustion characteristics of the wood chips(balsa chips) were experimentally investigated with respect to the thermal recycle system of the urban waste. The urban waste contains plastics, vegetable and wood materials. Wood was chosen as an example of the one of the component of urban dust. A small wood chip was burned in a electric furnace by the micro-electric balance. The mass reduction rate was normalized by the initial mass of test piece and the time of volatile combustion end. When the mass of the wood chips(balsa chips) was larger than 0.5g, the combustion similarity was found on the normalized mass reduction rate.

• Convergence Security Journal
• /
• v.6 no.1
• /
• pp.55-63
• /
• 2006

In this paper, an algorithm that provisions absolute differentiation of packet delays is proposed with an objective for enhancing quality of service (QoS) in future packet networks. It features an adaptive scheme that compensates the deviation for prediction on the traffic to be arrived continuously. It predicts the traffic to be arrived at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot, and derives the deviation between the two quantity. The deviation is utilized to the delay control operation for the next time slot to offset it. As it compensates the prediction error continuously, it shows superior adaptability to the bursty traffic as well as the constant rate traffic. It is demonstrated through simulation that the algorithm meets the quantitative delay bounds and shows superiority to the traffic fluctuation in comparison with the conventional mechanism.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.1
• /
• pp.20-33
• /
• 2002

Usage of ATM AAL2 packets becomes dominant to increase transmission efficiency of voice traffic in the backbone network. In case of voice service that uses AAL2 mechanism, if resources of network are enough, connection of new call is accepted. However, due to packets generated by the new call, transmission delay of packets from old calls can increase sharply. To control this behavior, in this paper we present an AAL2 buffer management scheme that allocates a virtual buffer to each call and after calculating its propagation delay variation(PDV), decides to drop packets coming from each call according to the PDV value. We show that this packet dropping algorithm can effectively prevent abrupt QoS degradation of old calls. To do this, we analyze AAL2 packet composition process to find a critical factor in the process that influences the end-to-end delay behavior and model the process by K-policy M/D/1 queueing system and MIN(K, Tc)-policy M/D/1 queueing system. From the mathematical model, we derive the probability generating function of AAL2 packets in the buffer and mean waiting time of packets in the AAL2 buffer. Analytical results show that the AAL2 packet dropping algorithm can provide stable AAL2 packetization delay and ATM cell generation time even if the number of voice sources increases dramatically. Finally we compare the analytical result to simulation data obtained by using the COMNET Ⅲ package.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.7
• /
• pp.1951-1975
• /
• 2023

Recent advances in Cognitive Radio Networks (CRN) have elevated them to the status of a critical instrument for overcoming spectrum limits and achieving severe future wireless communication requirements. Collaborative spectrum sensing is presented for efficient channel selection because spectrum sensing is an essential part of CRNs. This study presents an innovative cooperative spectrum sensing (CSS) model that is built on the Firefly Algorithm (FA), as well as machine learning artificial neural networks (ANN). This system makes use of user grouping strategies to improve detection performance dramatically while lowering collaboration costs. Cooperative sensing wasn't used until after cognitive radio users had been correctly identified using energy data samples and an ANN model. Cooperative sensing strategies produce a user base that is either secure, requires less effort, or is faultless. The suggested method's purpose is to choose the best transmission channel. Clustering is utilized by the suggested ANN-FA model to reduce spectrum sensing inaccuracy. The transmission channel that has the highest weight is chosen by employing the method that has been provided for computing channel weight. The proposed ANN-FA model computes channel weight based on three sets of input parameters: PU utilization, CR count, and channel capacity. Using an improved evolutionary algorithm, the key principles of the ANN-FA scheme are optimized to boost the overall efficiency of the CRN channel selection technique. This study proposes the Artificial Neural Network with Firefly Algorithm (ANN-FA) for cognitive radio networks to overcome the obstacles. This proposed work focuses primarily on sensing the optimal secondary user channel and reducing the spectrum handoff delay in wireless networks. Several benchmark functions are utilized We analyze the efficacy of this innovative strategy by evaluating its performance. The performance of ANN-FA is 22.72 percent more robust and effective than that of the other metaheuristic algorithm, according to experimental findings. The proposed ANN-FA model is simulated using the NS2 simulator, The results are evaluated in terms of average interference ratio, spectrum opportunity utilization, three metrics are measured: packet delivery ratio (PDR), end-to-end delay, and end-to-average throughput for a variety of different CRs found in the network.

• Smart Structures and Systems
• /
• v.13 no.2
• /
• pp.305-318
• /
• 2014

This paper numerically investigates the feasibility of an active mass damper (AMD) system using the time delay control (TDC) algorithm, which is one of the robust and adaptive control algorithms, for effectively suppressing the excessive vibration of a building structure under wind loading. Because of its several attractive features such as the simplicity and the excellent robustness to unknown system dynamics and disturbance, the TDC algorithm has the potential to be an effective control system for mitigating the vibration of civil engineering structures such as buildings and bridges. However, it has not been used for structural response reduction yet. In this study, therefore, the active control method combining an AMD system with the TDC algorithm is first proposed in order to reduce the wind-induced vibration of a building structure and its effectiveness is numerically examined. To this end, its stability analysis is first performed; and then, a series of numerical simulations are conducted. It is demonstrated that the proposed active structural control system can effectively reduce the acceleration response of the building structure.

• Korean Journal of Remote Sensing
• /
• v.30 no.1
• /
• pp.137-147
• /
• 2014

We proposed and verified the methods to maintain data qualities as well as to reduce data volume for the Geostationary Ocean Color Imager (GOCI), the world's first ocean color sensor operated in geostationary orbit. For the GOCI level-2 data, 92.9% of data volume could be saved by only the data compression. For the GOCI level-1 data, however, just 20.7% of data volume could be saved by the data compression therefore another approach was required. First, we found the optimized number of bits per a pixel for the GOCI level-1 data from an idea that the quantization bit for the GOCI (i.e. 12 bit) was less than the number of bits per a pixel for the GOCI level-1 data (i.e. 32 bit). Experiments were conducted using the $R^2$ and the Modulation Transfer Function (MTF). It was quantitatively revealed that the data qualities were maintained although the number of bits per a pixel was reduced to 14. Also, we performed network simulations using the Network Simulator 2 (Ns2). The result showed that 57.7% of the end-toend delay for a GOCI level-1 data was saved when the number of bits per a pixel was reduced to 14 and 92.5% of the end-to-end delay for a GOCI level-2 data was saved when 92.9% of the data size was reduced due to the compression.