• Title/Summary/Keyword: delay interval

Search Result 326, Processing Time 0.024 seconds

Stability of Linear Systems with Interval Time-varying Delay via New Interval Decomposition (새로운 구간 분해 방법을 이용한 구간 시변지연을 갖는 선형시스템의 안정성)

  • Kim, Jin-Hoon
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.9
    • /
    • pp.1748-1753
    • /
    • 2011
  • In this paper, we consider the stability of linear systems with an interval time-varying delay. It is known that the adoption of decomposition of delay improves the stability result. For the interval time-delay case, they applied it to the interval of time-delay and got less conservative results. Our basic idea is to apply the general decomposition to the low limit of delay as well as interval of time-delay. Based on this idea, by using the modified Lyapunov-Krasovskii functional and newly derived Lemma, we present a less conservative stability criterion expressed as in the form of linear matrix inequality(LMI). Finally, we show, by well-known two examples, that our result is less conservative than the recent results.

Reinforcement Learning-based Duty Cycle Interval Control in Wireless Sensor Networks

  • Akter, Shathee;Yoon, Seokhoon
    • International journal of advanced smart convergence
    • /
    • v.7 no.4
    • /
    • pp.19-26
    • /
    • 2018
  • One of the distinct features of Wireless Sensor Networks (WSNs) is duty cycling mechanism, which is used to conserve energy and extend the network lifetime. Large duty cycle interval introduces lower energy consumption, meanwhile longer end-to-end (E2E) delay. In this paper, we introduce an energy consumption minimization problem for duty-cycled WSNs. We have applied Q-learning algorithm to obtain the maximum duty cycle interval which supports various delay requirements and given Delay Success ratio (DSR) i.e. the required probability of packets arriving at the sink before given delay bound. Our approach only requires sink to compute Q-leaning which makes it practical to implement. Nodes in the different group have the different duty cycle interval in our proposed method and nodes don't need to know the information of the neighboring node. Performance metrics show that our proposed scheme outperforms existing algorithms in terms of energy efficiency while assuring the required delay bound and DSR.

New Stability Conditions for Positive Time-Varying Discrete Interval System with Interval Time-Varying Delay Time (구간 시변 지연시간을 갖는 양의 시변 이산 구간 시스템의 새로운 안정 조건)

  • Han, Hyung-Seok
    • Journal of Advanced Navigation Technology
    • /
    • v.18 no.5
    • /
    • pp.501-507
    • /
    • 2014
  • A dynamic system is called positive if any trajectory of the system starting from non-negative initial states remains forever non-negative for non-negative controls. In this paper, new sufficient conditions for asymptotic stability of the interval positive time-varying linear discrete-time systems with time-varying delay in states are considered. The considered time-varying delay time has an interval-like bound which has minimum and maximum delay time. The proposed conditions are established by using a solution bound of the Lyapunov equation and they are expressed by simple inequalities which do not require any complex numerical algorithms. An example is given to illustrate that the new conditions are simple and effective in checking stability for interval positive time-varying discrete systems.

Stability Condition for Discrete Interval System with Time-Varying Delay Time (시변 지연시간을 갖는 이산 구간 시스템의 안정조건)

  • Han, Hyung-seok
    • Journal of Advanced Navigation Technology
    • /
    • v.19 no.6
    • /
    • pp.574-580
    • /
    • 2015
  • The stability condition of linear discrete interval systems with a time-varying delay time is considered. The considered system has interval system matrices for both non-delayed and delayed states with time-varying delay time within given interval values. The proposed condition is derived by using Lyapunov stability theory and expressed by very simple inequality. Compared to previous results, the stability issue on the interval systems is expanded to time-varying delay. Furthermore, the new condition can imply the existing results on the time-invariant case and show the relation between interval time-varying delay time and stability of the system. The proposed condition can be applied to find the stability bound of the discrete interval system. Some numerical examples are given to show the effectiveness of the new condition and comparisons with the previously reported results are also presented.

Design of Energy Efficient MAC Protocol for Delay Sensitive Application over Wireless Sensor Network (무선 센서 네트워크상에서 시간지연에 민감한 데이터 전송을 위한 에너지 효율적인 MAC 프로토콜 설계)

  • Oh, Hyung-Rai;Song, Hwang-Jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.11B
    • /
    • pp.1169-1177
    • /
    • 2009
  • This paper presents an energy efficient MAC protocol for delay-sensitive data transmission over wireless sensor network. In general, energy consumption and delay depend on Channel Monitoring Interval and data sensing period at each sensor node. Based on this fact, we propose a new preamble structure to effectively advertise Channel Monitoring Interval and avoid the overhearing problem. In order to pursue an effective tradeoff between energy consumption and delay, we also develop a Channel Monitoring Interval determining algorithm that searches for a sub-optimal solution with a low computational complexity. Finally, experimental results are provided to compare the proposed MAC protocol with existing sensor MAC protocols.

Novel Results for Global Exponential Stability of Uncertain Systems with Interval Time-varying Delay

  • Liu, Yajuan;Lee, Sang-Moon;Kwon, Oh-Min;Park, Ju H.
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.6
    • /
    • pp.1542-1550
    • /
    • 2013
  • This paper presents new results on delay-dependent global exponential stability for uncertain linear systems with interval time-varying delay. Based on Lyapunov-Krasovskii functional approach, some novel delay-dependent stability criteria are derived in terms of linear matrix inequalities (LMIs) involving the minimum and maximum delay bounds. By using delay-partitioning method and the lower bound lemma, less conservative results are obtained with fewer decision variables than the existing ones. Numerical examples are given to illustrate the usefulness and effectiveness of the proposed method.

Efficient Packet Transmission Method for Fast Data Dissemination in Senor Node (센서노드에서의 빠른 데이터 전달을 위한 효율적 패킷 전송 기법)

  • Lee, Joa-Hyoung;Jung, In-Bum
    • Journal of Industrial Technology
    • /
    • v.27 no.B
    • /
    • pp.235-243
    • /
    • 2007
  • Sensor network is used to obtain sensing data in various area. The interval to sense the events depends on the type of target application and the amounts of data generated by sensor nodes are not constant. Many applications exploit long sensing interval to enhance the life time of network but there are specific applications that requires very short interval to obtain fine-grained, high-precision sensing data. If the number of nodes in the network is increased and the interval to sense data is shortened, the amounts of generated data are greatly increased and this leads to increased amount of packets to transfer to the network. To transfer large amount of packets fast, it is necessary that the delay between successive packet transmissions should be minimized as possible. In Sensor network, since the Operating Systems are worked on the event driven, the Timer Event is used to transfer packets successively. However, since the transferring time of packet completely is varies very much, it is very hard to set appropriate interval. The longer the interval, the higher the delay and the shorter the delay, the larger the fail of transfer request. In this paper, we propose ESTEO which reduces the delay between successive packet transmissions by using SendDone Event which informs that a packet transmission has been completed.In ESTEO, the delay between successive packet transmissions is shortened very much since the transmission of next packet starts at the time when the transmission of previous packet has completed, irrespective of the transmission timee. Therefore ESTEO could provide high packet transmission rate given large amount of packets.

  • PDF

Impact of Cryptographic operations on the QoS of VoIP system (VoIP 보안 시스템의 QoS 측정 및 분석)

  • 홍기훈;정수환;유현경;김도영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.10B
    • /
    • pp.916-926
    • /
    • 2003
  • The encryption of packets increases delay and delay jitter that may degrade the quality of service (QoS) in real-time communications. So, we analyzed the delay jitter, delay, and interval delay between consecutive packets which were encrypted by the DES, 3DES, SEED and AES algorithms in this study. The interval delay and jitter of three algorithms such as the DES, SEED, AES were similar to the results of no encryption. But in the case of 3DES, the encryption of packets increases the variance of interval delay and jitter in comparison with other algorithms. we also analyzed properties of security and an efficiency of RTP security between SRTP and H.235.

Stability Condition for Discrete Interval Time-varying System with Time-varying Delay Time (시변 지연시간을 갖는 이산 구간 시변 시스템의 안정조건)

  • Han, Hyung-seok
    • Journal of Advanced Navigation Technology
    • /
    • v.20 no.5
    • /
    • pp.475-481
    • /
    • 2016
  • In this paper, the new stability condition of linear discrete interval time-varying systems with time-varying delay time is proposed. The considered system has interval time-varying system matrices for both non-delayed and delayed states with time-varying delay time within given interval values. The proposed condition is derived by using Lyapunov stability theory and expressed by very simple inequality. The restricted stability issue on the interval time-invariant system is expanded to interval time-varying system and a powerful stability condition which is more comprehensive than the previous is proposed. As a results, it is possible to avoid the introduction of complex linear matrix inequality (LMI) or upper solution bound of Lyapunov equation in the derivation of sufficient condition. Also, it is shown that the proposed result can include the many existing stability conditions in the previous literatures. A numerical example in the pe revious works is modified to more general interval system and shows the expandability and effectiveness of the new stability condition.

Adaptive Beacon Scheduling Algorithm to Reduce End-to-End Delay in Cluster-tree based LR-WPAN (클러스터-트리 기반 LR-WPAN에서 End-to-End 지연시간을 줄이기 위한 적응적 Beacon 스케줄링 알고리즘)

  • Kang, Jae-Eun;Park, Hak-Rae;Lee, Jong-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.3B
    • /
    • pp.255-263
    • /
    • 2009
  • In this paper, we propose an adaptive beacon scheduling algorithm to control a reception period of actual data according to variation of amount of traffic in IEEE 802.15.4 LR-WPAN(Low Rate-Wireless Personal Area Network) with the cluster-tree topology. If a beacon interval is shortened, the amount of the traffic a node receives can be increased while consumption of the energy can be also increased. In this sense, we can achieve optimal on orgy consumption by controlling the beacon interval when the amount of data to be received is being decreased. The result of simulation using NS-2 shows that the proposed algorithm improves performances in terms of packet loss rate and end-to-end delay compared with algorithm using a fixed beacon interval. For a design of cluster-tree based LR-WPAN managing delay-sensitive services, the proposed algorithm and the associated results can be applied usefully.