• Structural Engineering and Mechanics
• /
• v.37 no.6
• /
• pp.575-592
• /
• 2011

For seismic resistant design of critical structures, a dynamic analysis, either response spectrum or time history is frequently required. Owing to the lack of recorded data and the randomness of earthquake ground motion that may be experienced by structure in the future, usually it is difficult to obtain recorded data which fit the requirements (site type, epicenteral distance, etc.) well. Therefore, the artificial seismic records are widely used in seismic designs, verification of seismic capacity and seismic assessment of structures. The purpose of this paper is to develop a numerical method using Artificial Neural Network (ANN) and wavelet packet transform in best basis method which is presented for the decomposition of artificial earthquake records consistent with any arbitrarily specified target response spectra requirements. The ground motion has been modeled as a non-stationary process using wavelet packet. This study shows that the procedure using ANN-based models and wavelet packets in best-basis method are applicable to generate artificial earthquakes compatible with any response spectra. Several numerical examples are given to verify the developed model.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1606-1609
• /
• 2002

MAC state models appeared with an effort to overcome technical demerits of CDMA in provisioning packet data service. In the scenario of sojourn and transition on MAC states, the design of state sojourn time is a critical issue for an efficient utilization of limited recource; a longer sojourn time leads to more resource being preserved for inactive stations, while more connection components should be recovered with a shorter sojourn time. Thus, the sojourn time at each MAC state must be optimized in consideration of these two conflicting arguments. In this paper, we first present a generic MAC state model. Secondly, based on the generic model, we reveal a relation of inactive period and the delay time of the last packet served in pre- ceding active period and specify a loss function reflect-ing two antinomic features that result from a change of state sojourn time. Using the proposed loss function, we construct a decision problem to find an optima3 rule for state sojourn times. Finally, we present a way of computing Bayes rule by use of the posterior distribution of inactivity duration for given observation on the delay time of last packet. Furthermore, Bayes rules are explicitly expressed for special arrival processes and investigated with respect to traffic load and loss parameters.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.12
• /
• pp.1286-1299
• /
• 1991

In this paper we present a multiple capture model for common spreading code CDMA packet radio systems with star topology. Basic equations for the collision free, header detection. and multiple capture probabilities are derived at the central receiver. Link performances. including the average number of packet captures, allowable number of simultaneous transmission, and system throughput are theoretically evaluated for a hybrid system. combining envelope header detection and differential data detection, Using the Block Oriented Systems Simulator(BOSS), simulations were carried out for the central receivers with envelope or differential geader detection, It is shown that for a threshold approx-imation to the probability of data packet success, the mulyiple capture model significantly improves system throughput.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.475-478
• /
• 2004

In this paper, a CSSMA/AI MAC protocol for data services in packet CDMA network is presented. The proposed protocol is based on the code status sensing and reservation scheme. In the proposed protocol, the base station broadcast the rode status on a frame-by-frame basis just before the beginning of each preamble transmission, and the mobile station transmits a preamble for reserving a randomly selected code based on the received code status. After having transmitted the preamble, the mobile station listens to the downlink of the selected rode and waits for the base station reply. If this reply indicates that the code has been correctly acquired, it continues the packet transmission lot the rest of the frame. If there are other packets waiting for transmission, the base station broadcasts the status of the code as reserved, and the mobile station transmits a packet through the reserved code for the successive frames.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3447-3469
• /
• 2019

It is well-known that the cooperative communication and error control technology can improve the network performance, but most existing cooperative MAC protocols have not focused on how to cope with the contention process caused by cooperation and how to reduce the bad influence of channel packet error rate on the system performance. Inspired by this, this paper first modifies and improves the basic rules of the IEEE 802.11 Medium Access Control (MAC) protocol to optimize the contention among the multi-relay in a cooperative ARQ scheme. Secondly, a hybrid ARQ protocol with soft combining is adopted to make full use of the effective information in the error data packet and hence improve the ability of the receiver to decode the data packet correctly. The closed expressions of network performance including throughput and average packet transmission delay in a saturated network are then analyzed and derived by establishing a dedicated two-dimensional Markov model and solving its steady-state distribution. Finally, the performance evaluation and superiority of the proposed protocol are validated in different representative study cases through MATLAB simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11B
• /
• pp.953-959
• /
• 2006

This paper provides optimum TCP/IP packet size that maximizes the throughput efficiency of ATM layer as a function of TCP/IP packet length for several values of channel BER over wireless ATM LAN links applying data link error control schemes to reduce error problems encountered in using wireless links. For TCP/IP delay-insensitive traffc requiring reliable delivery, it is necessary to adopt data link layer ARQ protocol. So ARQ error control schemes considered in this paper include GBN ARQ, SR ARQ and type-I Hybrid ARQ, which ARQ is needed, but FEC can be used to reduce the number of retransmissions. Especially adaptive type-I Hybrid ARQ scheme is necessary for a variable channel condition to make the physical layer as SONET-like as possible.

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.161-170
• /
• 2007

The proposed switch which has separated data plane and switching plane can make parallel processing for packet data storing, memory address pointer switching and simultaneously can be capable of switching the variable length for IP packets. The proposed architecture does not require the complicated arbitration algorithms in VOQ, also is designed for QoS of generic output queue switch as well as input queue. At the result of simulations, the proposed architecture has less average packet delay than the one of the memory-sharing based architecture and guarantees keeping a certain average packet delay in increasing switch size.

• Journal of Information Technology Applications and Management
• /
• v.23 no.2
• /
• pp.61-80
• /
• 2016

The wireless mesh network (WMN) is a next-generation technology for data networking that has the advantage in cost and the flexibility in its construction because of not requiring the infra-structure such as the ethernet. This paper focuses on the optimal link scheduling problem under the wireless mesh network to effectuate real-time streaming by using the constraint programming. In particular, Under the limitation of half-duplex transmission in wireless nodes, this paper proposes a solution method to minimize the makespan in scheduling packet transmission from wireless nodes to the gateway in a WMN with no packet transmission conflicts due to the half-duplex transmission. It discusses the conflicts in packet transmission and deduces the condition of feasible schedules, which defines the model for the constraint programming. Finally it comparatively shows and discusses the results using two constraint programming solvers, Gecode and the IBM ILOG CP solver.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.105-107
• /
• 2006

As internet streaming data increase, transport protocol such as TCP, TGP-Friendly is important to study control transmission rate and share of Internet bandwidth. In this paper, we propose a TCP-Friendly protocol using Neural Network for media delivery over wired Internet which has various traffic size(PTFRC). PTFRC can effectively send streaming data when occur congestion and predict one-step ahead round trip time and packet loss rate. A multi-layer perceptron structure is used as the prediction model, and the Levenberg-Marquardt algorithm is used as a traning algorithm. The performance of the PTFRC was evaluated by the share of Bandwidth and packet loss rate with various protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1191-1199
• /
• 2009

As the Internet service evolves from the best effort data service to a multimedia service such as a mix of voice, data and video, a need for the guarantee of the quality of service to network services became one of the hot issues for the network operators. On the other hand, the introduction of the multimedia services over the IP network requires a managed differentiated service that adopts a prioritized treatment of packets. This incurs a need for a differentiated pricing scheme for the packets that receive different level of quality of service. This work proposes an analytic framework about packet pricing scheme for these services, and investigate the effect of service differentiation to the packet price for each class. Via numerical experiment, we validate our argument and illustrate the implication of the work.