• Title/Summary/Keyword: 종단 지연

Search Result 308, Processing Time 0.025 seconds

The Longitudinal Reciprocal Relationship between Self-rated Health Status and Depression in the Elderly : Testing the Autoregressive Cross-lagged Model (노년기 주관적 건강상태와 우울 간의 종단적 상호인과관계: 자기회귀교차지연모형의 검증)

  • Sohn, Keunho;Kim, Kyoungho
    • The Journal of the Korea Contents Association
    • /
    • v.22 no.9
    • /
    • pp.473-484
    • /
    • 2022
  • This study aimed to verify the reciprocal casual relationship between self-rated health status and depression in the elderly through longitudinal analysis. An autoregressive cross-lagged model was identified. This study analyzed 3,363 elderly people aged 65 or older using the 5th, 6th, and 7th wave data from Korean Longitudinal Study of Ageing(KLoSA). The results are as follows. First, self-rated health status had a positive(+) autoregressive effect. Second, depression had a positive(+) autoregressive effect. Third, self-rated health status had a negative(-) cross-lagged effect on depression, but depression was not a casual predictor of self-rated health status. Based on these findings, it was suggested that there is a need for systematic policies to improve basic fitness in the early stages of old age, as well as the need to expand health promotion programs and implement integrated depression management programs.

An Efficient Distributed Delay-Constrained Unicast Routing Algorithm (지연시간을 고려한 효율적인 분산 유니캐스트 라우팅 알고리즘)

  • Shin, Min-Woo;Lim, Hyeong-Seok
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.4
    • /
    • pp.397-404
    • /
    • 2002
  • We propose a heuristic distributed unicast routing algorithm for minimizing the total cost of the path in a point to point network with do]ay constraint. The algorithm maintains a delay vector and a cost vector about the network states and finds the path using this information. In this paper, we show that our algorithm always finds a delay-constrained path if such a path exists and has O(│E│) message complexity(│E│is the number of links in the network). Also, simulation results show that the proposed algorithm has better cost performance than other delay-constrained routing algorithms.

A mechanism for end-to-end secure communication in heterogeneous tactical networks (이기종 전술통신망 종단간 암호화 통신을 위한 메커니즘)

  • Park, Cheol-Yong;Kim, Ki-Hong;Ryou, Jae-Cheol
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.24 no.4
    • /
    • pp.625-634
    • /
    • 2014
  • Tactical networks is being operated in configuration that consisting of a variety of characteristics communication equipments and heterogeneous networks. In this configurations, end-to-end communication can be achieved using interworking gateway for converting the data format of the network and using encryption algorithm of the networks. The use of mechanism results in a problem that secure data cannot be transferred directly, reprocessing and processing delay of communication in heterogeneous tactical networks. That is, for encoding and decoding of data, the decryption of encrypted data and re-encryption processing must be required at the gateway between different networks. In this paper proposes to mechanism for end-to-end secure communication in heterogeneous tactical networks. Using the proposed method, end-to-end secure communication between heterogeneous tactical networks(PSTN-UHF networks) which removes the necessity of a gateway for converting data into data formats suitable for network to remove a transmission delay factor and enable real-time voice and data communication and achieve end-to-end security for heterogeneous tactical networks. we propose a novel mechanism for end-to-end secure communication over PSTN and UHF networks and evaluate against the performance of conventional mechanism. Our proposal is confirmed removal of security vulnerabilities, end-to-end secure communication in heterogeneous tactical networks.

Longitudinal Analysis on the Reciprocal Relationship between Depression and Marital Satisfaction among Older Couples (노년기 부부의 우울과 부부관계만족도 간의 종단적 관계)

  • Heo, Sun-Young;Ha, Jung-Hwa
    • 한국노년학
    • /
    • v.41 no.3
    • /
    • pp.421-444
    • /
    • 2021
  • The purpose of this research is to examine the reciprocal relationships between depression and marital satisfaction among older couples. For longitudinal dyadic analysis, this study sets up a research model based on the Actor-Partner Interdependence Model, the Common Fate Model, and Autoregressive Cross-Lagged Model. Data came from four annual waves from the 10th year (2015) to the 13th year (2018) of the Korean Welfare Panel Survey and the final sample comprised a total of 1,383 married couples over 60 years of age in 2015. Structural Equation Modeling identified the reciprocal relationship between depression and marital satisfaction among older couples, with higher marital satisfaction of older couples leading to lower depression of husbands' and wives', and with higher depression of husbands' and wives' inducing lower marital satisfaction of the couples. Thus, this study suggested that longitudinal interplay between depression and marital satisfaction can lead to a vicious cycle. Based on these findings, the need to intervene at both the individual level and the couple level was discussed in order to reduce depression and improve marital satisfaction.

Multi-Channel Pipelining for Energy Efficiency and Delay Reduction in Wireless Sensor Network (무선 센서 네트워크에서 에너지 효율성과 지연 감소를 위한 다중 채널 파리프라인 기법)

  • Lee, Yoh-Han;Kim, Daeyoung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.11
    • /
    • pp.11-18
    • /
    • 2014
  • Most of the energy efficient MAC protocols for wireless sensor networks (WSNs) are based on duty cycling in a single channel and show competitive performances in a small number of traffic flows; however, under concurrent multiple flows, they result in significant performance degradation due to contention and collision. We propose a multi-channel pipelining (MCP) method for convergecast WSN in order to address these problems. In MCP, a staggered dynamic phase shift (SDPS) algorithms devised to minimize end-to-end latency by dynamically staggering wake-up schedule of nodes on a multi-hop path. Also, a phase-locking identification (PLI) algorithm is proposed to optimize energy efficiency. Based on these algorithms, multiple flows can be dynamically pipelined in one of multiple channels and successively handled by sink switched to each channel. We present an analytical model to compute the duty cycle and the latency of MCP and validate the model by simulation. Simulation evaluation shows that our proposal is superior to existing protocols: X-MAC and DPS-MAC in terms of duty cycle, end-to-end latency, delivery ratio, and aggregate throughput.

Reliable Hybrid Multicast using Multi-layer Transmission Path (다계층 전송경로를 이용한 신뢰성 있는 하이브리드 멀티캐스트)

  • Gu, Myeong-Mo;Kim, Bong-Gi
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.1
    • /
    • pp.35-40
    • /
    • 2019
  • It is important to constantly provide service in real-time multimedia applications using multicast. Transmission path reconstruction occurs in hybrid multicast using Internet Protocol (IP) multicast and ALM in order to adapt the network status to things like congestion. So, there is a problem in which real-time QoS is reduced, caused by an increase in end-to-end delay. In this paper, we want to solve this problem through multi-layer transmission path construction. In the proposed method, we deploy the control server and application layer overlay host (ALOH) in each multicast domain (MD) for hybrid multicast construction. After the control server receives the control information from an ALOH that joins the MD, it makes a group based on the hop count and sends it to the ALOH in each MD. The ALOH in the MD performs the role of sending the packet to another ALOH and constructs the multi-layered transmission path in order of priority by using control information that is received from the control server and based on the delay between neighboring ALOHs. When congestion occurs in, or is absent from, the ALOH in the upper MD, the ALOH selects the path with the highest priority in order to reduce end-to-end delay. Simulation results show that the proposed method could reduce the end-to-end delay to less than 289 ms, on average, under congestion status.

Performance Analysis of AAL2 Packet Dropping Algorithm using PDV on Virtual Buffer (PDV를 이용한 가상 버퍼상의 AAL2 패킷 폐기 알고리즘과 성능분석)

  • Jeong, Da-Wi;Jo, Yeong-Jong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.1
    • /
    • pp.20-33
    • /
    • 2002
  • Usage of ATM AAL2 packets becomes dominant to increase transmission efficiency of voice traffic in the backbone network. In case of voice service that uses AAL2 mechanism, if resources of network are enough, connection of new call is accepted. However, due to packets generated by the new call, transmission delay of packets from old calls can increase sharply. To control this behavior, in this paper we present an AAL2 buffer management scheme that allocates a virtual buffer to each call and after calculating its propagation delay variation(PDV), decides to drop packets coming from each call according to the PDV value. We show that this packet dropping algorithm can effectively prevent abrupt QoS degradation of old calls. To do this, we analyze AAL2 packet composition process to find a critical factor in the process that influences the end-to-end delay behavior and model the process by K-policy M/D/1 queueing system and MIN(K, Tc)-policy M/D/1 queueing system. From the mathematical model, we derive the probability generating function of AAL2 packets in the buffer and mean waiting time of packets in the AAL2 buffer. Analytical results show that the AAL2 packet dropping algorithm can provide stable AAL2 packetization delay and ATM cell generation time even if the number of voice sources increases dramatically. Finally we compare the analytical result to simulation data obtained by using the COMNET Ⅲ package.

Modeling TCP Loss Recovery Latency for the Number of Retransmissions (재전송 개수를 고려한 TCP 손실 복구 과정의 지연 모델링 및 분석)

  • 김동민;김범준;이재용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.12B
    • /
    • pp.1106-1114
    • /
    • 2003
  • Several analytic models describe transmission control protocol (TCP) performance such as steady-state throughput as an averaged ratio of number of transmissions to latency. For more detailed analysis of TCP latency, the latency during packet losses are recovered should be considered. In this paper, we derive the expected duration of loss recovery latency considering the number of packet losses recovered by retransmissions. Based on the numerical results verified by simulations, TCP using selective acknowledgement (SACK) option is more effective than TCP NewReno from the aspect of loss recovery latency.

End-to-End Performance of Packet Aggregation Transmission over MANETs under Blackhole Attacks (블랙홀 공격이 있는 MANET에서 패킷취합전송의 종단간 성능)

  • Kim, Young-Dong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.1
    • /
    • pp.71-76
    • /
    • 2013
  • In this paper, end-to-end performances for some VoIP traffics are measured and analyzed over MANET(Mobile Ad-hoc Networks) with packet aggregation transmission under blackhole attacks. A VoIP simulator based on NS-2 is used for performance measure. In the simulation, MOS, call connection ratio, network delay and packet loss rate are measured for end-to-end transmission performance. With analysis of measured data, characteristics of each traffics for performance parameters of packet aggregation transmission is showed on MANET under blackhole attack, As a results of this paper, some considerations be required for packet aggregation transmission are suggested to implement VoIP services on MANET under blackhole attacks.

An End-to-End QoS Control Method for Heterogeneous Networks (이종 망을 위한 종단간 QoS 제어 방안)

  • Lee, Jong-Chan;Lee, Gi-Sung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.10
    • /
    • pp.2715-2720
    • /
    • 2009
  • Supporting Quality of Service (QoS) for multimedia services in heterogeneous mobile networks is a part of key issue for Three Generation Evolution (3GE) development. A QoS management structure needs to guarantee the QoS of moving users based on an end-to-end negotiation to support the seamless service when MT is moving between the heterogeneous networks. We propose an end-to-end negotiation method based on SLA(Service Level Agreement). For this aim, the SLA control and algorithm for supporting MT's QoS is considered. Simulation is focused on the average delay and packet loss rate, and the results show that our proposed method provides mobile terminals with the optimal performance.