• Title/Summary/Keyword: Network Latency

Search Result 764, Processing Time 0.025 seconds

Experimental Performance Evaluation of Vertical Handover with Virtual Interface in Heterogeneous Mobile Networks (이종 무선네트워크에서 가상인터페이스기반 수직적 핸드오버 실증 성능 평가)

  • Cho, Il-Kwon;Yun, Dong-Geun;Ha, Sang-Yong;Choi, Seong-Gon
    • The KIPS Transactions:PartC
    • /
    • v.19C no.2
    • /
    • pp.127-134
    • /
    • 2012
  • In this paper, we propose a mobility management scheme which has a simple IP emulation method based on virtual interface. This scheme supports prevention of service abortion resulting from RAT (Radio Access Technology) interface switching during vertical handover and provides mobility management convenience according to maintenance of consistency in simple IP mobility management scheme of 3rd generation mobile network. Through the empirical experiments of proposed method, we check out the improvement of handover performance of the proposed scheme based on vertical handover latency comparing with a non-virtual interface system.

Design and Implementation of Precision Time Synchronization in Wireless Networks Using ZigBee (ZigBee를 이용한 무선 네트워크 환경에서의 정밀 시각 동기 기법 설계 및 구현)

  • Cho, Hyun-Tae;Son, Sang-Hyun;Baek, Yun-Ju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.5A
    • /
    • pp.561-570
    • /
    • 2008
  • Time synchronization is essential for a number of network applications such as high speed communication and parallel/distribution processing systems. As the era of ubiquitous computing is ushered in, the high precise time synchronization in wireless networks have been required in. This paper presents the design ana the implementation of the high precision time synchronization in wireless networks using ZigBee. To achieve high precision requirements, we have tried to analyze and reduce error factors such as the latency and jitters of a protocol stack on wireless environments. In addition, this paper includes some experiments and performance evaluations of our system. The result is that we established for nodes in a network to maintain their elects to within a 50 nanosecond offset from the reference clock.

A Study on Latency Time Improvement of Electronic Commerce System Using Local Server and Web Cashing (로컬서버와 웹캐싱을 이용한 전자상거래 시스템의 지연속도 개선에 관한 연구)

  • Yoon,, Yong-Ki;Ko, Il-Seok;Leem, Choon-Seong
    • The KIPS Transactions:PartB
    • /
    • v.9B no.5
    • /
    • pp.555-562
    • /
    • 2002
  • Increasing of electronic commerce users and high-capacity multimedia data is the main causes of increasing of load and network traffic in electronic commerce system. Increasing of load and network traffic brings the delay of service about client's request. And it's becoming factor that decreases customer satisfaction and corporation's competitive ability. So it is needed to research that consider efficient management and response time of electronic commerce system. In this paper, we designed electronic commerce system based on local server with web cashing function in order to solve load problem of electronic commerce system. And we proposed web cashing algorithm for local web server and analyzed performance by an experiment.

Trust-aware secure routing protocol for wireless sensor networks

  • Hu, Huangshui;Han, Youjia;Wang, Hongzhi;Yao, Meiqin;Wang, Chuhang
    • ETRI Journal
    • /
    • v.43 no.4
    • /
    • pp.674-683
    • /
    • 2021
  • A trust-aware secure routing protocol (TSRP) for wireless sensor networks is proposed in this paper to defend against varieties of attacks. First, each node calculates the comprehensive trust values of its neighbors based on direct trust value, indirect trust value, volatilization factor, and residual energy to defend against black hole, selective forwarding, wormhole, hello flood, and sinkhole attacks. Second, any source node that needs to send data forwards a routing request packet to its neighbors in multi-path mode, and this continues until the sink at the end is reached. Finally, the sink finds the optimal path based on the path's comprehensive trust values, transmission distance, and hop count by analyzing the received packets. Simulation results show that TSRP has lower network latency, smaller packet loss rate, and lower average network energy consumption than ad hoc on-demand distance vector routing and trust based secure routing protocol.

Delay Time Analysis of Asynchronous CSL Mode MAC in Wi-SUN (Wi-SUN에서 비동기 CSL모드 MAC의 지연시간 분석)

  • Kim, Dongwon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.3
    • /
    • pp.23-28
    • /
    • 2021
  • In recent years, research on smart factory wireless mobile communication technology that wirelessly remotely controls utilities is being actively conducted. The Wi-SUN(Wireless Smart Utility Network) Alliance proposed Wi-SUN protocol structure suitable for building a platform such as a smart factory as a new wireless communication standardization standard based on EEE802.15.4g/e. It analyzes the performance of the IEEE802.15.4e CSL(Coordinated Sampled Listening) Mode MAC(Media Access Control) in terms of latency and looks at considerations for efficient operation.

Hierarchical Location Mobility Management using MobilityManagement Points in IP networks

  • Park, Chul Ho;Oh, Sang Yeob
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.8
    • /
    • pp.1069-1074
    • /
    • 2022
  • IP mobility can be handled in different layers of the protocol. Mobile IP has been proposed to handle the mobility of Internet hosts in the network layer. Recently, a new method based on the SIGMA mobility architecture has been proposed to support mobility management with reduced packet loss and latency. The location management structure is not suitable for frequent mobile handover due to the high mobility of the user with this transport layer solution. In this paper, we propose a location management optimization method in a mobile communication network by applying hierarchical location management using MMPs(Mobility Management Points) for transport layer mobility management. Therefore, we propose an efficient hierarchical mobility management structure even between heterogeneous wireless networks using MMPs for the probability that a mobile terminal can change multiple location areas between two messages and calls. The proposed method shows reduction in location update cost and data retrieval cost using MMPs, and as opposed to mobility appearing in time intervals with the minimum cost required to reach 90% of the stabilized cost, the mobility location update search, location It was found that the message processing cost per area was reduced.

A Metaheuristic Approach Towards Enhancement of Network Lifetime in Wireless Sensor Networks

  • J. Samuel Manoharan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.4
    • /
    • pp.1276-1295
    • /
    • 2023
  • Sensor networks are now an essential aspect of wireless communication, especially with the introduction of new gadgets and protocols. Their ability to be deployed anywhere, especially where human presence is undesirable, makes them perfect choices for remote observation and control. Despite their vast range of applications from home to hostile territory monitoring, limited battery power remains a limiting factor in their efficacy. To analyze and transmit data, it requires intelligent use of available battery power. Several studies have established effective routing algorithms based on clustering. However, choosing optimal cluster heads and similarity measures for clustering significantly increases computing time and cost. This work proposes and implements a simple two-phase technique of route creation and maintenance to ensure route reliability by employing nature-inspired ant colony optimization followed by the fuzzy decision engine (FDE). Benchmark methods such as PSO, ACO and GWO are compared with the proposed HRCM's performance. The objective has been focused towards establishing the superiority of proposed work amongst existing optimization methods in a standalone configuration. An average of 15% improvement in energy consumption followed by 12% improvement in latency reduction is observed in proposed hybrid model over standalone optimization methods.

Resource allocation algorithm for space-based LEO satellite network based on satellite association

  • Baochao Liu;Lina Wang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.6
    • /
    • pp.1638-1658
    • /
    • 2024
  • As a crucial development direction for the sixth generation of mobile communication networks (6G), Low Earth Orbit (LEO) satellite networks exhibit characteristics such as low latency, seamless coverage, and high bandwidth. However, the frequent changes in the topology of LEO satellite networks complicate communication between satellites, and satellite power resources are limited. To fully utilize resources on satellites, it is essential to determine the association between satellites before power allocation. To effectively address the satellite association problem in LEO satellite networks, this paper proposes a satellite association-based resource allocation algorithm. The algorithm comprehensively considers the throughput of the satellite network and the fairness associated with satellite correlation. It formulates an objective function with logarithmic utility by taking the logarithm and summing the satellite channel capacities. This aims to maximize the sum of logarithmic utility while promoting the selection of fewer associated satellites for forwarding satellites, thereby enhancing the fairness of satellite association. The problems of satellite association and power allocation are solved under constraints on resources and transmission rates, maximizing the logarithmic utility function. The paper employs an improved Kuhn-Munkres (KM) algorithm to solve the satellite association problem and determine the correlation between satellites. Based on the satellite association results, the paper uses the Lagrangian dual method to solve the power allocation problem. Simulation results demonstrate that the proposed algorithm enhances the fairness of satellite association, optimizes resource utilization, and effectively improves the throughput of LEO satellite networks.

Anonymity of Tor Users on Unsecured Applications (비 암호화 프로그램 사용자의 토르망 익명성 보장 분석)

  • Shin, Seok-Joo;Dahal, Saurav;Pudasaini, Amod;Kang, Moon-Soo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.12 no.5
    • /
    • pp.805-816
    • /
    • 2017
  • Tor is a popular, low-latency open network that offers online anonymity to users by concealing their information from anyone conducting traffic analysis. At the same time, a number of conventional passive and active attacking schemes have been proposed to compromise the anonymity provided by the Tor network. In addition to attacks on the network through traffic analysis, interacting with an unsecured application can reveal a Tor user's IP address. Specific traffic from such applications bypasses Tor proxy settings in the user's machine and forms connections outside the Tor network. This paper presents such applications and shows how they can be used to deanonymize Tor users. Extensive test studies performed in the paper show that applications such as Flash and BitTorrent can reveal the IP addresses of Tor users.

Adaptive Multi-level Streaming Service using Fuzzy Similarity in Wireless Mobile Networks (무선 모바일 네트워크상에서 퍼지 유사도를 이용한 적응형 멀티-레벨 스트리밍 서비스)

  • Lee, Chong-Deuk
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.9
    • /
    • pp.3502-3509
    • /
    • 2010
  • Streaming service in the wireless mobile network environment has been a very challenging issue due to the dynamic uncertain nature of the channels. Overhead such as congestion, latency, and jitter lead to the problem of performance degradation of an adaptive multi-streaming service. This paper proposes a AMSS (Adaptive Multi-level Streaming Service) mechanism to reduce the performance degradation due to overhead such as variable network bandwidth, mobility and limited resources of the wireless mobile network. The proposed AMSS optimizes streaming services by: 1) use of fuzzy similarity metric, 2) minimization of packet loss due to buffer overflow and resource waste, and 3) minimization of packet loss due to congestion and delay. The simulation result shows that the proposed method has better performance in congestion control and packet loss ratio than the other existing methods of TCP-based method, UDP-based method and VBM-based method. The proposed method showed improvement of 10% in congestion control ratio and 8% in packet loss ratio compared with VBM-based method which is one of the best method.