• Title/Summary/Keyword: state-delay

Search Result 951, Processing Time 0.025 seconds

A Design for Solid-State Radar SSPA with Sequential Bias Circuits (순차바이어스를 이용한 반도체 레이더용 SSPA 설계)

  • Koo, Ryung-Seo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.11
    • /
    • pp.2479-2485
    • /
    • 2013
  • In this paper, we present a design for solid-state radar SSPA with sequential bias. We apply to variable extension pulse generator to eliminate signal distortion which is caused by bias rising/falling delay of power amplifier. There is an optimum impedance matching circuit to have high efficiency of GaN-power device by measuring microwave characteristics through load-pull method. The designed SSPA is consisted of pre-amplifier, drive-amplifier and main-amplifier as a three stages to apply for X-Band solid-state radar. Thereby we made a 200W SSPA which has output pulse maximum power shows 53.67dBm and its average power is 52.85dBm. The optimum design of transceiver module for solid-state pulse compression radar which is presented in this dissertation, it can be available to miniaturize and to improve the radar performances through additional research for digital radar from now on.

A new Fast Recovery Scheme for Resiliency of Attacked Resilient Packet Ring(RPR) (공격받은 IEEE802.17 Resilient Packet Ring(RPR) 망의 Resiliency를 위한 신속한 망 복원방안)

  • Lee, Young-Joo;Koo, Do-Jung
    • Convergence Security Journal
    • /
    • v.8 no.2
    • /
    • pp.57-62
    • /
    • 2008
  • In this paper, we suggest new fast recovery mechanism in RPR network, in case of node addition or removing by exterior attack. A RPR network recovery time is consist of two. Failure detecting time and reporting time are that. In this paper we propose fast recovery mechanism that can reduce each time. In a Legacy recovery mechanism, To report node's state, rpr node transmit protection messages. But interval of this protection messages increase exponentially. Thus A transmission failure of protection message cause delay of reporting of network state. Therefore we propose new node state reporting mechanism that put a node state in type b fairness message. And We also suggest fast failure detecting mechanism.

  • PDF

An Efficient Revocable Group Signature Scheme in Vehicular Ad Hoc Networks

  • Zhao, Zhen;Chen, Jie;Zhang, Yueyu;Dang, Lanjun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.4250-4267
    • /
    • 2015
  • Although many revocable group signature schemes has been proposed in vehicular ad hoc networks (VANETs), the existing schemes suffer from long computation delay on revocation that they cannot adapt to the dynamic VANETs. Based on Chinese remainder theorem and Schnorr signature algorithm, this paper proposes an efficient revocable group signature scheme in VANETs. In the proposed scheme, it only need to update the corresponding group public key when a member quits the group, and in the meanwhile the key pairs of unchanged group members are not influenced. Furthermore, this scheme can achieve privacy protection by making use of blind certificates. Before joining to the VANETs, users register at local trusted agencies (LTAs) with their ID cards to obtain blind certificates. The blind certificate will be submitted to road-side units (RSUs) to verify the legality of users. Thus, the real identities of users can be protected. In addition, if there is a dispute, users can combine to submit open applications to RSUs against a disputed member. And LTAs can determine the real identity of the disputed member. Moreover, since the key pairs employed by a user are different in different groups, attackers are not able to track the movement of users with the obtained public keys in a group. Furthermore, performance analysis shows that proposed scheme has less computation cost than existing schemes.

DLL Design and Performance Evaluation in Indoor Wireless DS-CDMA System under the Multipath Fading Effects (실내 무선 DS-CDMA 방식에서 다중경로 페이딩 영향을 고려한 DLL 설계와 성능평가)

  • Im, Sung-Jun;Ryu, Ho-Jin;Ryu, Heung-Gyoon
    • The Journal of the Acoustical Society of Korea
    • /
    • v.16 no.3
    • /
    • pp.99-105
    • /
    • 1997
  • This paper analyzes DLL(Delay lock loop) under the multipath fading effects. The evaluated performance measures include the steady-state timing error probability density function (PDF) and the mean-time-to-lose-lock (MTLL) under multipath fading effects. The discriminator characteristic S(${\epsilon}$) is shown to be zero at the point of timing error ${\epsilon}_{0}$ that is not zero, and the MTLL decreases as the delayed signal power $g_{2}$ and delayed time ${\tau}_{d}$ increase. We approximate the steady-state timing error PDF linearly with these variables and evaluate the steady-state timing error PDF and MTLL. The severe multipath fading effects result lower MTLL, in this case we make MTLL larger by increasing the early-late discriminator offset ${\Delta}$. First, we calculate the timing error point ${\epsilon}_{0}$, and present the performance of DLL under multipath fading. The timing error PDF, MTLL and the performance of DLL with ${\Delta}$ are also investigated. And we conclude that the larger ${\Delta}$ makes a higher MTLL and a better performance of DLL under multipath fading effects.

  • PDF

A Scheme to Support QoS based-on Differentiated Services in MPLS Network (MPLS망에서 Differentiated Services 기반 QoS 지원 방안)

  • 박천관;정원일
    • The Journal of Information Technology
    • /
    • v.4 no.3
    • /
    • pp.87-100
    • /
    • 2001
  • IETF has proposed integrated services model(Int-Serv) and differentiated service(Diff-Serv) to supply IP QoS in Internet[1][2]. Int-Serv model uses state information of each IP flow, so satisfies QoS according to traffic characteristics, but increases the amount of flow state information with increasing flow number. Diff-Serv uses PHP(Per Hop Behaviour) and there are well-defined classes to provide differentiated traffics with different services according to delay and loss sensitivity. Diff-Serv model can provide diverse services in Internet because of having no the state and signal information of each flow. As MPLS uses the packet forwarding technology based on label, it implements the forwarding engine of high performance easily. The MPLS can set up the path having different and variable bandwidth and assign each path to particular CoS (Class of Service). Therefore it is possible to support the Diff-Serv model of well- defined classes that can provide the differentiated traffic with different services according to delay and loss sensitivity in IP QoS models of IETF. In this paper we propose a scheme that can accommodate Diff-Serv model to provide QoS. The system performance has been estimated by scheduling plan according to traffic classes.

  • PDF

An Improved Hierarchical Routing Protocol for Wireless Hybrid Mesh Network (무선 하이브리드 메쉬 네트워크를 위한 개선된 계층구조 라우팅 프로토콜)

  • Ki, Sang-Youl;Yoon, Won-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.5
    • /
    • pp.9-17
    • /
    • 2010
  • In this paper we propose an improved hierarchical routing protocol for wireless hybrid mesh network. The proposed method efficiently manages network topology and reduces overhead traffic for setting routing path by considering link stability. The simulation results show that the proposed method outperforms the HOLSR (hierarchical optimized link state routing) method in aggregate goodput, packet delivery ratio, and end-to-end delay.

$H_\infty$ Controller Design for Discrete-time Linear Systems with Time-varying Delays in States using S-procedure (S-procedure를 이용한 상태에 시변 시간지연을 가지는 이산 선형 시스템에 대한 $H_\infty$ 제어기 설계)

  • Kim, Ki-Tae;Cho, Sang-Hyun;Park, Hong-Bae
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.39 no.2
    • /
    • pp.95-103
    • /
    • 2002
  • This paper deals with the H$_{\infty}$ control problems for discrete-time linear systems with time-varying delays in states. The existence condition and the design method of the H$_{\infty}$ state feedback controller are given. In this paper, the H$_{\infty}$ control law is assumed to be a memoryless state feedback, and the upper-bound of time-varying delay and S-procedure are used. Through some changes of variables and Schur complement, the obtained sufficient condition can be rewritten as an LMI(linear matrix inequality) form in terms of all variables.

Performance Analysis of an Hybrid Switching System for Optical Networks (광 네트워크를 위한 Hybrid 스위칭 시스템의 성능 분석)

  • ;Bartek Wydrowski;Moshe Zukerman;;Chuan Heng Foh
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.10
    • /
    • pp.16-23
    • /
    • 2003
  • In this paper, we propose a new optical hybrid switching system that takes advantage of both Optical Burst Switching (OBS) and Optical Circuit Switching (OCS) technologies. This system classifies incoming IP traffic flows into short-lived and long-lived flows for hybrid switching. For performance analysis, we model the system as a single server queue in a Markovian environment. The burst generation process is assumed to follow a two-state Markov Modulated Poisson Process (MMPP), and the service rate fluctuates based on the number of concurrent OCS sessions. Results of the mean delay and queue size for OBS bursts are derived.

Cooperative Manipulation of a Virtual Object by Multiple Remote Users

  • Choi, Hyouk-Ryeol;Ryew, Sung-Moo
    • Journal of Mechanical Science and Technology
    • /
    • v.14 no.9
    • /
    • pp.956-967
    • /
    • 2000
  • In this paper, we explore the issues of force display in the cooperative virtual environment shared by multiple users distributed over the network with heterogeneous hardware platforms. The proposed method is to cope with the problem of small time delay and the difference of sampling rate in the distributed configuration. In the proposed approach the interaction forces of the participants are just treated as the independent sources of acceleration. Thus the action of a participant simply changes the acceleration of the virtual object and consequently the states of the virtual object will be updated. When the updated states are reported to all the participants, the information on the time of state changes is delivered, too. Employing the discrete state information updated by the other users, each user modifies his own virtual environment and pseudo-realtime simulation can be realized. Excluding the software interface and the communication technique, it is proposed the simulation method for the operation of respective users and the way of calculating the driving input to the display device. For experimental verification we construct a cooperative virtual environment shared by two remote users and outline the results of experiments.

  • PDF

Routing Method based on Prediction of Link State between UAVs in FANET (FANET에서 UAV간 링크 상태 예측에 기반한 라우팅 기법)

  • Hwang, HeeDoo
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.11
    • /
    • pp.1829-1836
    • /
    • 2016
  • Today, the application area and scope of FANET(Flying Ad Hoc Network) has been extended. As a result, FANET related research are actively conducted, but there is no decision yet as the routing protocol for FANET. In this paper, we propose the OLSR-Pds (Prediction with direction and speed) which is added a method to predict status of link for OLSR protocol. The mobility of nodes are modeled using Gauss-Markov algorithm, and relative speed between nodes were calculated by derive equation of movement, and thereby we can predict link status. An experiment for comparing AODV, OLSR and, OLSR-Pds was conducted by three factors such as packet delivery ratio, end to end delay, and routing overhead. In experiment result, we were confirm that OLSR-Pds performance are superior in these three factors. OLSR-Pds has the disadvantage that requires time-consuming calculations for link state and required for computing resources, but we were confirm that OLSR-Pds is suitable for routing to the FANET environment because it has all the characteristics of proactive protocol and reactive protocol.