• 제목/요약/키워드: packet data

검색결과 1,637건 처리시간 0.024초

Application of neural networks and an adapted wavelet packet for generating artificial ground motion

  • Asadi, A.;Fadavi, M.;Bagheri, A.;Ghodrati Amiri, G.
    • Structural Engineering and Mechanics
    • /
    • 제37권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.

Bayes Rule for MAC State Sojourn Time Supporting Packet Data Service in CDMA Wireless Celluar Networks

  • Park, Cheon-Won;Kim, Dong-Joon;Shin, Woo-Cheol;Ju, Jee-Hwan
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -3
    • /
    • 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.

  • PDF

다중캡쳐 특성의 단일확산코드 CDMA 패킷 라디오 시스팀들의 성능 분석 (Performance Analysis of Common Spreading Code CDMA Packet Radio Systems with Multiple Capture Capability)

  • 김동인
    • 한국통신학회논문지
    • /
    • 제16권12호
    • /
    • pp.1286-1299
    • /
    • 1991
  • 본 논문은 단일확산코드 CDMA 방식의 중앙 집중 패킷 라디오 시스팀들을 위한 다중캡쳐 모델을 적시하였다. 중양 수신기에서 collision-free, 헤더 검출, 다중캡쳐 확률들을 계산하기 위한 기본식들을 유도하였다 포락선(envelope) 헤더 검출방식과 차동(differential) 데이타 검출방식을 결합한 hybrid 시스팀에 평균 패킷캡쳐의 수, 동시전송가능한 패킷의 수, 시스팀 throughput 등 link 레벨의 성능들이 이론적으로 평가되었다. 포락선 또는 차동 헤더 검출방식의 중앙 수신기에 대해 블럭별 회로의 BOSS 시뮬레이션을 축행하였다. 데이타패킷 성공확률에 threshold 모델을 적용하여 다중캡쳐 모델이 시스팀의 throughput을 현저히 증가시킬 수 있음을 확인하였다.

  • PDF

패킷 CDMA 망에서 데이터 서비스를 위한 CSSMA/AI 프로토콜 (CSSMA/AI Protocol for Data Services in Packet CDMA Networks)

  • 임인택
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2004년도 춘계종합학술대회
    • /
    • pp.475-478
    • /
    • 2004
  • 본 논문에서는 패킷 CDMA 망에서 데이터 서비스를 위한 코드 상태 감지 및 예약 기반의 CSSMA/AI MAC 프로토콜을 제안한다 단말기들이 코드 예약을 위한 프리앰블을 전송하기 전에 기지국에서는 매 프레임마다 예약된 코드의 상태를 방송하고, 단말기는 수신한 코드의 상태를 기반으로 임의의 예약되지 않은 코드를 예약을 위한 프리앰블을 전송한다. 프리앰블을 전송한 단말기는 선택한 코드의 하향링크를 통하여 기지국으로부터 응답을 기다린다. 기지국으로부터 코드예약에 대한 응답을 수신한 단말기는 남은 프레임 동안 패킷을 전송한다. 한편 전송한 패킷이 남아있는 경우, 기지국에서는 코드의 상태를 예약상태로 방송하고, 단말기에서는 다음 프레임에서 예약한 코드를 통하여 남은 패킷을 전송한다.

  • PDF

Performance Analysis of a Novel Distributed C-ARQ Scheme for IEEE 802.11 Wireless Networks

  • Wang, Fan;Li, Suoping;Dou, Zufang;Hai, Shexiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권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.

Optimum TCP/IP Packet Size for Maximizing ATM Layer Throughput in Wireless ATM LAN

  • 이하철
    • 한국통신학회논문지
    • /
    • 제31권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.

초고속 포인터 스위칭 패브릭의 설계 (Design of High-speed Pointer Switching Fabric)

  • 류경숙;최병석
    • 인터넷정보학회논문지
    • /
    • 제8권5호
    • /
    • pp.161-170
    • /
    • 2007
  • 본 논문은 데이터 메모리 평면과 스위칭 평면을 분리하여 패킷 데이터의 저장과 메모리 주소 포인터의 스위칭이 병렬적으로 처리 가능하며 IP 패킷의 가변 길이 스위칭이 가능한 새로운 스위치 구조를 제안한다. 제안한 구조는 기존 VOQ방식의 복잡한 중재 알고리즘이 필요 없으며 출력 큐 방식의 스위치에서만 적용되고 있는 QoS를 입력 큐에서 고려한다. 성능분석 결과 제안한 구조는 기존의 공유 메모리 기반의 구조들에 비해 상대적으로 낮은 평균 지연 시간을 가지며 스위치의 크기가 증가하더라도 일정한 지연 시간을 보장함을 확인하였다.

  • PDF

제약식 프로그래밍을 이용한 일방향 전송 무선 메쉬 네트워크에서의 최적 링크 스케쥴링 (The Optimal Link Scheduling in Half-Duplex Wireless Mesh Networks Using the Constraint Programming)

  • 김학진
    • Journal of Information Technology Applications and Management
    • /
    • 제23권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.

신경회로망 예측 알고리즘을 적용한 TCP-Friednly 제어 방법 (A TCP-Friendly Control Method using Neural Network Prediction Algorithm)

  • 유성구;정길도
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2006년도 심포지엄 논문집 정보 및 제어부문
    • /
    • 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.

  • PDF

Optimal Packet Price for Differentiated Internet Services

  • Lee, Hoon
    • 한국통신학회논문지
    • /
    • 제34권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.