• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.6
• /
• pp.760-772
• /
• 1999

The CAN is a serial communication protocol for distributed real-time control and automation systems. Data generated from field devices in the distributed control of power plant are classified into three categories: real-time event data, real-time control data, non-real-time data. These data share a CAN medium. If the traffic of the CAN protocol is not efficiently controlled, performance requirements of the power plant system could not be satisfied. This paper proposes a bandwidth allocation algorithm that can be applicable to the CAN protocol. The bandwidth allocation algorithm not only satisfies the performance requirements of the real-time systems in the power plant but also fully utilizes the bandwidth of CAN. The bandwidth allocation algorithm introduced in this paper is validated using the integrated discrete-event/continuous-time simulation model which comprises the CAN network and distributed control system of power plant.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5820-5834
• /
• 2017

This paper investigates the channel selection problem with dynamic users and the asymmetric interference relation in distributed opportunistic spectrum access systems. Since users transmitting data are based on their traffic demands, they dynamically compete for the channel occupation. Moreover, the heterogeneous interference range leads to asymmetric interference relation. The dynamic users and asymmetric interference relation bring about new challenges such as dynamic random systems and poor fairness. In this article, we will focus on maximizing the tradeoff between the achievable utility and access cost of each user, formulate the channel selection problem as a directional graphical game and prove it as an exact potential game presenting at least one pure Nash equilibrium point. We show that the best NE point maximizes both the personal and system utility, and employ the stochastic learning approach algorithm for achieving the best NE point. Simulation results show that the algorithm converges, presents near-optimal performance and good fairness, and the directional graphical model improves the systems throughput performance in different asymmetric level systems.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.11
• /
• pp.205-210
• /
• 2012

This paper investigated the performance of QoS management using variations of RED parameters in Differentiated Service. Differentiated Service separates packets from a specific traffic by using QoS parameters such as CIR or PIR. A code point is used to mark each packet which is enqueued into each virtual queue. Different RED parameters are configured for virtual queues according to each code point. As the code point value increases, the RED parameters become harsher. To show QoS Management using variations of RED parameters, this paper used the policy model of time sliding window with 2 color marking (TSW2CM). Simulation results using NS-2 showed that the QoS management of a differentiated service can be obtained from using variations of RED parameters.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.17 no.5
• /
• pp.561-568
• /
• 2014

The Republic of Korea Army is using R-NAD of MIL-STD-188-220 as a Media Access Control protocol. Under urgent situations, almost all stations transmit data frames and then the network will reach a saturation state. Several articles have been devoted to the study of R-NAD performance. However, most of them focus on comparing the performance of some NADs using network simulation tools. We propose an analytical model to compute the throughput of R-NAD under the assumption of a network traffic saturation. Analytical results were verified by Monte Carlo methods. We have shown that the performance of a success probability and an average idle time remains almost unchanged as the total number of stations increases. We have also shown that Type 1/2/4 operation mode outperforms Type 3 operation mode in throughput. The results showed that the system with a squelch detection achieved a better performance than the one without it. The longer DATA time had a higher throughput.

• The Journal of the Korea Contents Association
• /
• v.9 no.3
• /
• pp.49-57
• /
• 2009

This paper has proposed Flow Holding Time based Link State Update(LSU) Algorithm that can improve the performance of the existing LSU algorithms. As the existing LSU algorithms are based on the network traffic information, the proposed algorithm is based on flow holding time so we can minimize the LSU message overhead and has not had a strong influence on the depreciation of QoS routing performance. We apply a flow holding time in order to decrease the number of LSU message. We have evaluated the performance of the proposed model and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1868-1875
• /
• 1999

The design of LAI(Local Area Identifier), the first paging area for searching the mobile terminal has a close relation with the performance of paging channel in CDMA cellular network. This paper discussed the performance of the forward channel of IS-95 CDMA standard, known as the paging through the related messages such as call control message, channel assignment message, etc. Modeling and simulation work were conducted to quantify the performance of paging channel in terms of traffic handling capacity and blocking levels. The results shown are based on a specific system call model based on the operating system of cell cite. This serves as illustrative guidelines for the proper engineering of common control channel, which has a major impact on the overall performance of cellular network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4701-4719
• /
• 2015

A Mobile Ad hoc Network (MANET) consists of mobile nodes which co-operate to forward each other's packets without the presence of any centralized authority. Due to this lack of centralized monitoring authority, MANETs have become vulnerable to various kinds of routing misbehaviour. Sometimes, nodes exhibit non-cooperating behaviour for conserving their own resources and exploiting others' by relaying their traffic. A node may even drop packets of other nodes in the guise of forwarding them. This paper proposes an efficient Reputation and Collaboration technique through route-request for handling such misbehaving nodes. It lays emphasis not only on direct observation but also considers the opinion of other nodes about misbehaving nodes in the network. Unlike existing schemes which generate separate messages for spreading second-hand information in the network, nodes purvey their opinion through route-request packet. Simulation studies reveal that the proposed scheme significantly improves the network performance by efficiently handling the misbehaving nodes in the network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1133-1151
• /
• 2010

Energy balanced consumption routing is based on assumption that the nodes consume energy both in transmitting and receiving. Lopsided energy consumption is an intrinsic problem in low-cost sensor networks characterized by multihop routing and in many traffic overhead pattern networks, and this irregular energy dissipation can significantly reduce network lifetime. In this paper, we study the problem of maximizing network lifetime through balancing energy consumption for uniformly deployed low-cost sensor networks. We formulate the energy consumption balancing problem as an optimal balancing data transmitting problem by combining the ideas of corona cluster based network division and optimized transmitting state routing strategy together with data transmission. We propose a localized cluster based routing scheme that guarantees balanced energy consumption among clusters within each corona. We develop a new energy cluster based routing protocol called "OECR". We design an offline centralized algorithm with time complexity O (log n) (n is the number of clusters) to solve the transmitting data distribution problem aimed at energy balancing consumption among nodes in different cluster. An approach for computing the optimal number of clusters to maximize the network lifetime is also presented. Based on the mathematical model, an optimized energy cluster routing (OECR) is designed and the solution for extending OEDR to low-cost sensor networks is also presented. Simulation results demonstrate that the proposed routing scheme significantly outperforms conventional energy routing schemes in terms of network lifetime.

• Fire Science and Engineering
• /
• v.20 no.2 s.62
• /
• pp.72-79
• /
• 2006

The objective of this study is to analyze the smoke extraction efficiency using by the partial extraction system with CFD simulation for case of tunnel fire. The Comparison of CFD results with the preceding scaled model test results, it is equal to the smoke extraction efficiency and smoke stratification in tunnel by the partial smoke extraction system (distributed damper). It shows that the smoke extraction efficiency is increased about 7% by the distributed damper which is opened near fire, compare with the distributed damper which is all opened. The case of the fire occurs on a traffic jam in a tunnel, it is proposed that the operating method of partial smoke extraction system for the escaping passengers.

• Geomechanics and Engineering
• /
• v.12 no.2
• /
• pp.185-195
• /
• 2017

With the rapid development of urban underground traffic, the study of soil deformation induced by subway tunnel construction and its settlement prediction are gradually of general concern in engineering circles. The law of soil displacement caused by shield tunnel construction of adjacent buildings is analyzed in this paper. The author holds that ground surface settlement based on the Gauss curve or Peck formula induced by tunnel excavation of adjacent buildings is not reasonable. Integrating existing research accomplishments, the paper proposed that surface settlement presents cork distribution curve characters, skewed distribution curve characteristics and normal distribution curve characteristics when the tunnel is respectively under buildings, within the scope of the disturbance and outside the scope of the disturbance. Calculation formulas and parameters on cork distribution curve and skewed distribution curve were put forward. The numerical simulation, experimental comparison and model test analysis show that it is reasonable for surface settlement to present cork distribution curve characters, skewed distribution curve characteristics and normal distribution curve characteristics within a certain range. The research findings can be used to make effective prediction of ground surface settlement caused by tunnel construction of adjacent buildings, and to provide theoretical guidance for the design and shield tunnelling.