• Title/Summary/Keyword: Network Latency

Search Result 764, Processing Time 0.02 seconds

A N-LAR Algorithm for Efficient Routing in MANET with High Mobility (이동성이 큰 MANET에서의 효율적인 라우팅을 위한 N-LAR 알고리즘)

  • Kim, Min-Ho;Park, Sung-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.76-82
    • /
    • 2007
  • Recently, researches related MANET are progressing dynamically in points of view which MANET need no additional infra and guarantee node mobility. Node mobility in MANET is becoming more important, as people interest in using Ad hoc network under a concept of node mobility as fast automobile not walking. when nodes move fast, there are many problems headed by high cost for searching destination and routing. To deal with this problems We propose new routing protocol, No path-Location Aided Routing (N-LAR). Our algorithm has a better performance in terms of end-to-end delay, packet delivery ratio in MANET with High mobility.

A New Multi-objective Evolutionary Algorithm for Inter-Cloud Service Composition

  • Liu, Li;Gu, Shuxian;Fu, Dongmei;Zhang, Miao;Buyya, Rajkumar
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.1-20
    • /
    • 2018
  • Service composition in the Inter-Cloud raises new challenges that are caused by the different Quality of Service (QoS) requirements of the users, which are served by different geo-distributed Cloud providers. This paper aims to explore how to select and compose such services while considering how to reach high efficiency on cost and response time, low network latency, and high reliability across multiple Cloud providers. A new hybrid multi-objective evolutionary algorithm to perform the above task called LS-NSGA-II-DE is proposed, in which the differential evolution (DE) algorithm uses the adaptive mutation operator and crossover operator to replace the those of the Non-dominated Sorting Genetic Algorithm-II (NSGA-II) to get the better convergence and diversity. At the same time, a Local Search (LS) method is performed for the Non-dominated solution set F{1} in each generation to improve the distribution of the F{1}. The simulation results show that our proposed algorithm performs well in terms of the solution distribution and convergence, and in addition, the optimality ability and scalability are better compared with those of the other algorithms.

Seamless and Secure Mobility Management with Location-Aware Service (LAS) Broker for Future Mobile Interworking Networks

  • Lee Minsoo;Kim Gwanyeon;Park Sehyun
    • Journal of Communications and Networks
    • /
    • v.7 no.2
    • /
    • pp.207-221
    • /
    • 2005
  • The proliferation of wireless local area networks (WLANs) offering high data rate in hot spot area have spurred the demand for possible WLANs and third-generation (3G) cellular network integration solutions as the initiative step towards 4G systems. This paper provides a novel architecture for seamless location-aware integration of WLANs into 3G cellular networks and also an analysis for the efficient handover techniques. We introduce location as a key context in secure roaming mechanism for context-aware interworking in 4G systems. The fast secure roaming with location-aware authentication is implemented at an entity called location-aware service (LAS) broker that utilizes the concepts of direction of user and pre-warming zone. The location-ware interworking architecture supports seamless roaming services among heterogeneous wireless networks including WLANs, wireless metropolitan area networks (WMANs), and 3G cellular networks. This paper also includes a description of procedures needed to implement efficient mobility and location management. We show how the LAS broker with pre-warming and context transfer can obtain significant lower latency in the vertical handover.

Physiology of Eye Movements (안구 운동의 생리)

  • Kim, Ji Soo
    • Annals of Clinical Neurophysiology
    • /
    • v.1 no.2
    • /
    • pp.173-181
    • /
    • 1999
  • Eye movements serve vision by placing the image of an object on the fovea of each retina, and by preventing slippage of images on the retina. The brain employs two modes of ocular motor control, fast eye movements (saccades) and smooth eye movements. Saccades bring the fovea to a target, and smooth eye movements prevent retinal image slip. Smooth eye movements comprise smooth pursuit, the optokinetic reflex, the vestibulo-ocular reflex (VOR), vergence, and fixation. Saccades achieve rapid refixation of targets that fall on the extrafoveal retina by moving the eyes at peak velocities that can exceed $700^{\circ}/s$. Various brain lesions can affect saccadic latency, velocity, or accuracy. Smooth pursuit maintains fixation of a slowly moving target. The pursuit system responds to slippage of an image near the fovea in order to accelerate the eyes to a velocity that matches that of the target. When smooth eye movements velocity fails to match target velocity, catch-up saccades are used to compensate for limited smooth pursuit velocities. The VOR subserves vision by generating conjugate eye movements that are equal and opposite to head movements. If the VOR gain (the ratio of eye velocity to head velocity) is too high or too low, the target image is off the fovea, and head motion causes oscillopsia, an illusory to-and-fro movement of the environment.

  • PDF

Design of R=1/2, K=7 Type High Speed Viterbi Decoder with Circularly Connected 2-D Analog Parallel Processing Cell Array (아날로그 2차원 셀의 순환형 배열을 이용한 R=l/2. K=7형 고속 비터비 디코더 설계)

  • 손홍락;김형석
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.52 no.11
    • /
    • pp.650-656
    • /
    • 2003
  • A high speed Viterbi decoder with a circularly connected 2-dimensional analog processing ceil array Is proposed. The proposed Viterbi .decoder has a 2-dimensional parallel processing structure in which an analog processing cell is placed at each node of a trellis diagram, the output column of the analog processing cells is connected to the decoding column, and thus, the output(last) column becomes a column right before the decoding(first) column. The reference input signal given at a decoding column is propagated to the whole network while Its magnitude is reduced by the amount of a error metric on each branch. The circuit-based decoding is done by adding a trigger signals of same magnitudes to disconnect the path corresponding to logic 0 (or 1) and by observing its effect at an output column (the former column of the decoding column). The proposed Viterbi decoder has advantages in that it is operated with better performance of error correction, has a shorter latency and requires no path memories. The performance of error correction with the proposed Viterbi decoder is tested via the software simulation.

Fast Mobility Management Method Using Multi-Casting Tunneling in Heterogeneous Wireless Networks (이기종 무선 네트워크에서 멀티 캐스팅 터널링을 이용한 이동성 관리 방법)

  • Chun, Seung-Man;Park, Jong-Tae
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.12
    • /
    • pp.69-77
    • /
    • 2010
  • This paper presents a fast IP mobility management scheme in heterogeneous networks using the multiple wireless network interlaces. More specifically, in order to minimize the packet loss and handover latency due to handover, the E-HMIPv6, IETF HMIPv6 has been extended, is presented where the multiple tunnels between E-MAP and mobile node are dynamically constructed. E-HMIPv6 is composed of the extension of IETF HMIPv6 MAP, handover procedure, and simultaneous multiple tunnels. In order to demonstrate superior to the proposed method, the NS-2 simulation has done for performance evaluation of TCP and UDP-based application comparison with the existing mobility management method.

Audio-signal Transfer System Design and Evaluation based on Power Line Communication

  • Kim, Kwan-Kyu;Yeom, Keong-Tae;Kim, Yong-Kab
    • Transactions on Electrical and Electronic Materials
    • /
    • v.9 no.3
    • /
    • pp.123-127
    • /
    • 2008
  • The paper is to solve the problem of existing audio signal transfer system which has a difficulties of system organization and the increase of additional install cost and unfriendly interior. To solve the existing system, we drew the new audio signal transfer system based on PLC and evaluated it. A transmitter and a receiver were designed using the PLC chip INT5500CS. An audio signal transfer system was configured with a CD player to which audio signals are sent from the transmitter and a speaker connected to the receiver. For performance evaluation of this system, a USBPre external sound card and Smaart Live 5 which is a PC-based sound measuring program were added. As a result of our experiment, the measured signal level is $2{\sim}3$ dB lower than reference signal, latency is 16.69 ms, and the specific character of coherency is bad in high frequency band. Otherwise, this system transmits and receives signals over 90 % in good condition as a result of measuring pink noise, frequency (1 kHz), and phase, magnitude. In view of the result so far achieved, the system designed this study has excellent performance, it resolves defect of existing audio signal transfer system.

Performance analysis of local exit for distributed deep neural networks over cloud and edge computing

  • Lee, Changsik;Hong, Seungwoo;Hong, Sungback;Kim, Taeyeon
    • ETRI Journal
    • /
    • v.42 no.5
    • /
    • pp.658-668
    • /
    • 2020
  • In edge computing, most procedures, including data collection, data processing, and service provision, are handled at edge nodes and not in the central cloud. This decreases the processing burden on the central cloud, enabling fast responses to end-device service requests in addition to reducing bandwidth consumption. However, edge nodes have restricted computing, storage, and energy resources to support computation-intensive tasks such as processing deep neural network (DNN) inference. In this study, we analyze the effect of models with single and multiple local exits on DNN inference in an edge-computing environment. Our test results show that a single-exit model performs better with respect to the number of local exited samples, inference accuracy, and inference latency than a multi-exit model at all exit points. These results signify that higher accuracy can be achieved with less computation when a single-exit model is adopted. In edge computing infrastructure, it is therefore more efficient to adopt a DNN model with only one or a few exit points to provide a fast and reliable inference service.

A Recovery Scheme of a Cluster Head Failure for Underwater Wireless Sensor Networks (수중 무선 센서 네트워크를 위한 클러스터 헤드 오류 복구 기법)

  • Heo, Jun-Young;Min, Hong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.4
    • /
    • pp.17-22
    • /
    • 2011
  • The underwater environments are quite different from the terrestrial ones in terms of the communication channel and constrains. In underwater wireless sensor network, the probability of node failure is high because sensor nodes are deployed in more harsh environments than the ground based networks and moved by waves and currents. There are researches considering the communication environments of underwater to improve the data transmission throughput. In this paper, we present a checkpointing scheme of the cluster heads that recoveries from a cluster head failure quickly. Experimental results show that the proposed scheme enhances the reliability of the networks and more efficient in terms of the energy consumption and the recovery latency than without checkpointing.

Extension of ReInForM Protocol for (m,k)-firm Real-time Streams in Wireless Sensor Networks

  • Li, Bijun;Kim, Ki-Il
    • Journal of information and communication convergence engineering
    • /
    • v.10 no.3
    • /
    • pp.231-236
    • /
    • 2012
  • For real-time wireless sensor network applications, it is essential to provide different levels of quality of service (QoS) such as reliability, low latency, and fault-tolerant traffic control. To meet these requirements, an (m,k)-firm based real-time routing protocol has been proposed in our prior work, including a novel local transmission status indicator called local DBP (L_DBP). In this paper, a fault recovery scheme for (m,k)-firm real-time streams is proposed to improve the performance of our prior work, by contributing a delay-aware forwarding candidates selection algorithm for providing restricted redundancy of packets on multipath with bounded delay in case of transmission failure. Each node can utilize the evaluated stream DBP (G_DBP) and L_DBP values as well as the deadline information of packets to dynamically define the forwarding candidate set. Simulation results show that for real-time service, it is possible to achieve both reliability and timeliness in the fault recovery process, which consequently avoids dynamic failure and guarantees meeting the end-to-end QoS requirement.