• 제목/요약/키워드: Total delay

검색결과 794건 처리시간 0.025초

Assessing Efficiency of Handoff Techniques for Acquiring Maximum Throughput into WLAN

  • Mohsin Shaikha;Irfan Tunio;Baqir Zardari;Abdul Aziz;Ahmed Ali;Muhammad Abrar Khan
    • International Journal of Computer Science & Network Security
    • /
    • 제23권4호
    • /
    • pp.172-178
    • /
    • 2023
  • When the mobile device moves from the coverage of one access point to the radio coverage of another access point it needs to maintain its connection with the current access point before it successfully discovers the new access point, this process is known as handoff. During handoff the acceptable delay a voice over IP application can bear is of 50ms whereas the delay on medium access control layer is high enough that goes up to 350-500ms. This research provides a suitable methodology on medium access control layer of the IEEE 802.11 network. The medium access control layer comprises of three phases, namely discovery, reauthentication and re-association. The discovery phase on medium access control layer takes up to 90% of the total handoff latency. The objective is to effectively reduce the delay for discovery phase to ensure a seamless handoff. The research proposes a scheme that reduces the handoff latency effectively by scanning channels prior to the actual handoff process starts and scans only the neighboring access points. Further, the proposed scheme enables the mobile device to scan first the channel on which it is currently operating so that the mobile device has to perform minimum number of channel switches. The results show that the mobile device finds out the new potential access point prior to the handoff execution hence the delay during discovery of a new access point is minimized effectively.

Ayres 감각통합 중재가 발달지연 아동의 감각처리능력과 운동발달에 미치는 효과 (The Effect of Ayres Sensory Integration Intervention on Sensory Processing Ability and Motor Development in Children With Developmental Delay)

  • 박하나;김경미
    • 대한감각통합치료학회지
    • /
    • 제17권2호
    • /
    • pp.18-30
    • /
    • 2019
  • 목적 : 발달지연 아동을 대상으로 Ayres 감각통합중재를 적용하여 감각처리능력과 운동발달에 미치는 영향을 알아보고자 하였다. 연구방법 : 만 3-5세의 발달지연 아동을 대상으로 실험군 9명과 대조군 8명이 본 연구에 참여하였고 Short Sensory Profile(SSP), Peabody Developmental Motor Scale-2(PDMS-2)를 사용하였다. 실험군은 Ayres의 중심원리에 따른 개별 감각통합치료를 40분씩, 주 2회, 8주간 총 16회기를 실시하였다. 분석은 SPSS 24.0 의 카이스퀘어 검정, 맨휘트니 U검정, 윌콕슨 부호순위 검정, Cohen's d 검정으로 하였다. 연구결과 : Ayres의 감각통합중재를 실시한 실험군은 중재를 실시하지 않은 대조군에 비해 감각처리능력은 전체 점수와 움직임 민감성, 청각 여과하기, 낮은 에너지/허약함에서 통계적으로 유의한 차이가 나타났다(p<.05). 실험군과 대조군의 운동발달은 대근육운동발달지수, 소근육운동발달지수, 전체운동발달지수 모두 통계적으로 유의한 차이가 나타났다(p<.05). 결론 : Ayres의 감각통합중재는 발달지연 아동의 감각처리능력과 운동발달에 긍정적인 영향을 미쳤다.

NTCM-BC 전리층 모델을 이용한 한반도 내 위치추정 정확도 분석 (A Positioning Accuracy Analysis in Korea by using NTCM-BC Ionosphere Model)

  • 김민규;명재욱;김정래
    • 한국항행학회논문지
    • /
    • 제21권5호
    • /
    • pp.479-484
    • /
    • 2017
  • 독일 DLR (Deutsches Zentrum $f{\ddot{u}}r$ Luft- und Raumfahrt)에서 개발한 NTCM (Neustrelitz TEC model) 전리층 모델은 전리층 지연값을 예측함에 있어서 Klobuchar 모델보다 높은 정확도를 가진다. NTCM 모델은 Galileo의 NeQuick 모델보다 계산 시간이 빠르며, 정확도가 비슷하다. NTCM 모델은 태양 활동 함수의 파라미터로 F10.7을 사용하지만, NTCM-BC (NTCM-Broadcast) 모델은 Klobuchar 모델의 전리층 지연 값을 사용한다. 이러한 이유로 NTCM-BC 모델은 실시간 전리층 지연 보정 모델로 사용할 수 있다. 본 논문에서는 2009년부터 2014년까지 한반도 내에서 NTCM-BC 모델을 적용하였을 때 수직 전리층 지연 오차 및 사용자 위치 오차를 분석하고 Klobuchar 모델의 결과와 비교하였다. 6년간의 통계에서 Klobuchar 모델 사용 대비 NTCM-BC 모델 적용 시 수직 전리층 지연 오차는 17.7 % 감소하였으며, 수평 위치 정확도는 25.6 %, 수직 위치 정확도는 6.7 % 더 향상시킬 수 있는 것으로 나타났다.

Optimal Control Of Two-Hop Routing In Dtns With Time-Varying Selfish Behavior

  • Wu, Yahui;Deng, Su;Huang, Hongbin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권9호
    • /
    • pp.2202-2217
    • /
    • 2012
  • The transmission opportunities between nodes in Delay Tolerant Network (DTNs) are uncertain, and routing algorithms in DTNs often need nodes serving as relays for others to carry and forward messages. Due to selfishness, nodes may ask the source to pay a certain reward, and the reward may be varying with time. Moreover, the reward that the source obtains from the destination may also be varying with time. For example, the sooner the destination gets the message, the more rewards the source may obtain. The goal of this paper is to explore efficient ways for the source to maximize its total reward in such complex applications when it uses the probabilistic two-hop routing policy. We first propose a theoretical framework, which can be used to evaluate the total reward that the source can obtain. Then based on the model, we prove that the optimal forwarding policy confirms to the threshold form by the Pontryagin's Maximum Principle. Simulations based on both synthetic and real motion traces show the accuracy of our theoretical framework. Furthermore, we demonstrate that the performance of the optimal forwarding policy with threshold form is better through extensive numerical results, which conforms to the result obtained by the Maximum Principle.

Analysis of Optimized Aggregation Timing in Wireless Sensor Networks

  • Lee, Dong-Wook;Kim, Jai-Hoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제3권2호
    • /
    • pp.209-218
    • /
    • 2009
  • In a wireless sensor network(WSN) each sensor node deals with numerous sensing data elements. For the sake of energy efficiency and network lifetime, sensing data must be handled effectively. A technique used for this is data aggregation. Sending/receiving data involves numerous steps such as MAC layer control packet handshakes and route path setup, and these steps consume energy. Because these steps are involved in all data communication, the total cost increases are related to the counts of data sent/received. Therefore, many studies have proposed sending combined data, which is known as data aggregation. Very effective methods to aggregate sensing data have been suggested, but there is no means of deciding how long the sensor node should wait for aggregation. This is a very important issue, because the wait time affects the total communication cost and data reliability. There are two types of data aggregation; the data counting method and the time waiting method. However, each has weaknesses in terms of the delay. A hybrid method can be adopted to alleviate these problems. But, it cannot provide an optimal point of aggregation. In this paper, we suggest a stochastic-based data aggregation scheme, which provides the cost(in terms of communication and delay) optimal aggregation point. We present numerical analysis and results.

Optimal Switching Frequency in Limited-Cycle with Multiple Periods

  • Sun, Jing;Yamamoto, Hisashi;Matsui, Masayuki;Kong, Xianda
    • Industrial Engineering and Management Systems
    • /
    • 제11권1호
    • /
    • pp.48-53
    • /
    • 2012
  • Due to the customer needs of reducing cost and delivery date shorting, prompt change in the production plan became more important. In the multi period system (For instance, production line.) where target processing time exists, production, idle and delay risks occur repeatedly for multiple periods. In such situations, delay of one process may influence the delivery date of an entire process. In this paper, we discuss the minimum expected cost of the case mentioned above, where the risk depends on the previous situation and occurs repeatedly for multiple periods. This paper considers the optimal switching frequency to minimize the total expected cost of the production process. In this paper, first, the optimal switching frequency model is proposed. Next, the mathematic formulation of the total expectation is presented. Finally, the policy of optimal switching frequency is investigated by numerical experiments.

KIM을 위한 지상 기반 GNSS 자료 동화 체계 개발 및 효과 (Development of Ground-based GNSS Data Assimilation System for KIM and their Impacts)

  • 한현준;강전호;권인혁
    • 대기
    • /
    • 제32권3호
    • /
    • pp.191-206
    • /
    • 2022
  • Assimilation trials were performed using the Korea Institute of Atmospheric Prediction Systems (KIAPS) Korea Integrated Model (KIM) semi-operational forecast system to assess the impact of ground-based Global Navigation Satellite System (GNSS) Zenith Total Delay (ZTD) on forecast. To use the optimal observation in data assimilation of KIM forecast system, in this study, the ZTD observation were pre-processed. It involves the bias correction using long term background of KIM, the quality control based on background and the thinning of ZTD data. Also, to give the effect of observation directly to data assimilation, the observation operator which include non-linear model, tangent linear model, adjoint model, and jacobian code was developed and verified. As a result, impact of ZTD observation in both analysis and forecast was neutral or slightly positive on most meteorological variables, but positive on geopotential height. In addition, ZTD observations contributed to the improvement on precipitation of KIM forecast, specially over 5 mm/day precipitation intensity.

Performance Evaluation of Ionosphere Modeling Using Spherical Harmonics in the Korean Peninsula

  • Han, Deokhwa;Yun, Ho;Kee, Changdon
    • Journal of Positioning, Navigation, and Timing
    • /
    • 제2권1호
    • /
    • pp.59-65
    • /
    • 2013
  • The signal broadcast from a GPS satellite experiences code delay and carrier phase advance while passing through the ionosphere, which causes a signal error. Many ionosphere models have been studied to correct this ionospheric delay error. In this paper, the ionosphere modeling for the Korean Peninsula was carried out using a spherical harmonics based model. In contrast to the previous studies, we considered a real-time ionospheric delay correction model using fewer number of basis functions. The modeling performance was evaluated by comparing with a grid model. Total number of basis functions was set to be identical to the number of grid points in the grid model. The performance test was conducted using the GPS measurements collected from 5 reference stations during 24 hours. In the test result, the modeling residual error was smaller than that of the existing grid model. However, when the number of measurements was small and the measurements were not evenly distributed, the overall trend was found to be problematic. For improving this problem, we implemented the modeling with additional virtual measurements.

Design of Low-Power and Low-Latency 256-Radix Crossbar Switch Using Hyper-X Network Topology

  • Baek, Seung-Heon;Jung, Sung-Youb;Kim, Jaeha
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제15권1호
    • /
    • pp.77-84
    • /
    • 2015
  • This paper presents the design of a low-power, low area 256-radix 16-bit crossbar switch employing a 2D Hyper-X network topology. The Hyper-X crossbar switch realizes the high radix of 256 by hierarchically combining a set of 4-radix sub-switches and applies three modifications to the basic Hyper-X topology in order to mitigate the adverse scaling of power consumption and propagation delay with the increasing radix. For instance, by restricting the directions in which signals can be routed, by restricting the ports to which signals can be connected, and by replacing the column-wise routes with diagonal routes, the fanout of each circuit node can be substantially reduced from 256 to 4~8. The proposed 256-radix, 16-bit crossbar switch is designed in a 65 nm CMOS and occupies the total area of $0.93{\times}1.25mm^2$. The simulated worst-case delay and power dissipation are 641 ps and 13.01 W when operating at a 1.2 V supply and 1 GHz frequency. In comparison with the state-of-the-art designs, the proposed crossbar switch design achieves the best energy-delay efficiency of $2.203cycle/ns{\cdot}fJ{\cdot}{\lambda}2$.

Energy-efficient Joint Control of Epidemic Routing in Delay Tolerant Networks

  • Wu, Yahui;Deng, Su;Huang, Hongbin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권2호
    • /
    • pp.234-252
    • /
    • 2013
  • Due to the uncertain of connections in Delay Tolerant Networks (DTNs), most routing algorithms in DTNs need nodes to forward the message to others based on the opportunistic contact. The contact is related with the beaconing rate. In particular, nodes have more chances to encounter with each other with bigger beaconing rate, but more energy will be used. On the other hand, if the nodes forward the message to every node all the time, the efficiency of the routing algorithm is better, but it needs more energy, too. This paper tries to exploit the optimal beaconing rate and forwarding rate when the total energy is constraint. First, a theoretical framework is proposed, which can be used to evaluate the performance with different forwarding rate and beaconing rate. Then, this paper formulates a joint optimization problem based on the framework. Through Pontryagin's Maximal Principle, this paper obtains the optimal policy and proves that both the optimal forwarding and beaconing rates conform to threshold form. Simulation results show the accuracy of the theoretical framework. Extensive numerical results show that the optimal policy obtained in this paper is the best.