• Title/Summary/Keyword: long delay networks

Search Result 140, Processing Time 0.03 seconds

Design and Performance Evaluation of Hierarchical Protocol for Underwater Acoustic Sensor Networks (수중음파 센서네트워크를 위한 계층별 프로토콜의 설계 및 성능 평가)

  • Kim, Ji-Eon;Yun, Nam-Yeol;Kim, Yung-Pyo;Shin, Soo-Young;Park, Soo-Hyun;Jeon, Jun-Ho;Park, Sung-Joon;Kim, Sang-Kyung;Kim, Chang-Hwa
    • Journal of the Korea Society for Simulation
    • /
    • v.20 no.4
    • /
    • pp.157-166
    • /
    • 2011
  • As underwater environment monitoring system's interest has increased, the research is proceeding about underwater acoustic sensor network. Underwater sensor network can be applicable to many fields, such as underwater environment monitoring, underwater resource exploration, oceanic data collection, military purposes, etc. It is essential to define the PHY-MAC protocol for revitalization of the underwater acoustic sensor network which is available utilization in a variety of fields. However, underwater acoustic sensor network has to implement by consideration of underwater environmental characteristics, such as limited bandwidth, multi-path, fading, long propagation delay caused by low acoustic speed. In this paper, we define frequency of adjusted PHY protocol, network topology, MAC protocol, PHY-MAC interface, data frame format by consideration of underwater environmental characteristics. We also present system configuration of our implementation and evaluate performance based on our implementation with test in real underwater field.

Real-Time Classification, Visualization, and QoS Control of Elephant Flows in SDN (SDN에서 엘리펀트 플로우의 실시간 분류, 시각화 및 QoS 제어)

  • Muhammad, Afaq;Song, Wang-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.3
    • /
    • pp.612-622
    • /
    • 2017
  • Long-lived flowed termed as elephant flows in data center networks have a tendency to consume a lot of bandwidth, leaving delay-sensitive short-lived flows referred to as mice flows choked behind them. This results in non-trivial delays for mice flows, eventually degrading application performance running on the network. Therefore, a datacenter network should be able to classify, detect, and visualize elephant flows as well as provide QoS guarantees in real-time. In this paper we aim to focus on: 1) a proposed framework for real-time detection and visualization of elephant flows in SDN using sFlow. This allows to examine elephant flows traversing a switch by double-clicking the switch node in the topology visualization UI; 2) an approach to guarantee QoS that is defined and administered by a SDN controller and specifications offered by OpenFlow. In the scope of this paper, we will focus on the use of rate-limiting (traffic-shaping) classification technique within an SDN network.

An Efficient AMC Schemes for Mobile Satellite Communication Systems based on LTE (LTE 기반 이동 위성통신 시스템에서의 효율적인 AMC 방식)

  • Yeo, Sung-Moon;Hong, Tae-Chul;Kim, Soo-Young;Ku, Bon-Jun
    • Journal of Satellite, Information and Communications
    • /
    • v.5 no.1
    • /
    • pp.43-47
    • /
    • 2010
  • In future mobile networks, hybrid/integrated satellite and terrestrial systems will play an important role. Most of the mobile communication systems are focused on the terrestrial systems, in this case, compatibilities between the satellite and terrestrial systems are very important for efficiency of the systems. Terrestrial systems of all the 4G mobile communication adopted the adaptive modulation and coding (AMC) schemes for efficient usage of resources, and the updating interval of resource allocation in an order of msec. However, because of the long round trip delay of satellite systems, we cannot employ the same AMC scheme specified for the terrestrial system, and thus it cannot effectively counteract to short term fadings. In the paper, we propose the method to apply AMC to mobile satellite systems. In addition, in order to effectively counteract to short term fadings, we present the simulation results of the AMC combined with an interleaver.

A Comparative Study on 3D Data Performance in Mobile Web Browsers in 4G and 5G Environments

  • Nam, Duckkyoun;Lee, Daehyeon;Lee, Seunghyun;Kwon, Soonchul
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.11 no.3
    • /
    • pp.8-19
    • /
    • 2019
  • Since their emergence in 2007, smart phones have advanced up to the point that 5G mobile communication in 2019 started to be commercialized. Accordingly, now it is possible to share 3D modeling files and collaborate by means of a mobile web. As the recently commercialized 5G mobile communication network is so useful in sharing 3D modeling files and collaborating that even large-size geometry files can be transmitted at ultra high speed with ultra low transfer delay. We examines characteristics of major 3D file formats such as STL, OBJ, FBX, and glTF and compares the existing 4G LTE (Long Term Evolution) network with the 5G NR (New Radio) mobile communication network. The loading time and packets of each format were measured depending on the mobile web browser environments. We shows that in comparison with 4G LTE, the loading time of STL and OBJ file formats were reduced as much as 6.55 sec and 9.41 sec, respectively in the 5G NR and Chrome browsers. The glTF file format showed the most efficient performance in all of the 4G/5G mobile communication networks, Chrome, and Edge browsers. In the case of STL and OBJ, the traffic was relatively excessive in 5G NR and Edge browsers. The findings of this study are expected to be utilized to develop a 3D file format that reduces the loading time in a mobile web environment.

Reduction of Authentication Cost Based on Key Caching for Inter-MME Handover Support (MME 도메인간 핸드오버 지원을 위한 키캐싱 기반 인증비용의 감소기법)

  • Hwang, Hakseon;Jeong, Jongpil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.5
    • /
    • pp.209-220
    • /
    • 2013
  • Handover is the technology to minimize data lose of mobile devices and make continuous communication possible even if the device could be moved from one digital cell site to another one. That is, it is a function that enables the mobile user to avoid the disconnection of phone conversations when moving from a specific mobile communication area to another. Today, there are a lot of ongoing researches for fast and efficient hand-over, in order to address phone call's delay and disconnection which are believed to be the mobile network's biggest problems, and these should essentially be resolved in all mobile networks. Thanks to recent technology development in mobile network, the LTE network has been commercialized today and it has finally opened a new era that makes it possible for mobile phones to process data at high speed. In LTE network environment, however, a new authentication key must be generated for the hand-over. In this case, there can be a problem that the authentication process conducted by the hand-over incurs its authentication cost and delay time. This essay suggests an efficient key caching hand-over method which simplifies the authentication process: when UE makes hand-over from oMME to nMME, the oMME keeps the authentication key for a period of time, and if it returns to the previous MME within the key's lifetime, the saved key can be re-used.

An Efficient and Secure Handover Mechanism for MVPN Services (MVPN 서비스 제공을 위한 효율적이고 안전한 핸드오버 메커니즘)

  • Woo, Hyun-Je;Kim, Kyoung-Min;Lee, Mee-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.1
    • /
    • pp.62-72
    • /
    • 2007
  • Mobile Virtual Private Network (MVPN) provides VPN services without geographical restriction to mobile workers using mobile devices. Coexistence of Mobile IP (MIP) protocol for mobility and IPsec-based VPN technology are necessary in order to provide continuous VPN service to mobile users. However, Problems like registration failure or frequent IPsec tunnel re-negotiation occur when IPsec-based VPN Gateway (GW) and MIP are used together. In order to solve these problems, IETF proposes a mechanism which uses external home agent (x-HA) located external to the corporate VPN GW. In addition, based on the IETF proposal, a mechanism that assigns x-HA dynamically in the networks where MN is currently located was also proposed with the purpose to reduce handover latency as well as end-to-end delay. However, this mechanism has problems such as exposure of a session key for dynamic Mobility Security Association (MSA) or a long latency in case of the handover between different networks. In this paper, we propose a new MVPN protocol in order to minimize handover latency, enhance the security in key exchange, and to reduce data losses cause by handover. Through a course of simulation, the performance of proposed protocol is compared with the existing mechanism.

Fault free Shortest Path routing on the de Bruijin network (드브르젼 네트워크에서 고장 노드를 포함하지 않는 최단 경로 라우팅)

  • Ngoc Nguyen Chi;Nhat Vo Dinh Minh;Zhung Yonil;Lee Sungyoung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.11B
    • /
    • pp.946-955
    • /
    • 2004
  • It is shown that the do Bruijn graph (dBG) can be used as an architecture for interconnection network and a suitable structure for parallel computation. Recent works have classified dBG based routing algorithms into shortest path routing and fault tolerant routing but investigation into fault free shortest path (FFSP) on dBG has been non-existent. In addition, as the size of the network increase, more faults are to be expected and therefore shortest path dBG algorithms in fault free mode may not be suitable routing algorithms for real interconnection networks, which contain several failures. Furthermore, long fault free path may lead to high traffic, high delay time and low throughput. In this paper we investigate routing algorithms in the condition of existing failure, based on the Bidirectional do Bruijn graph (BdBG). Two FFSP routing algorithms are proposed. Then, the performances of the two algorithms are analyzed in terms of mean path lengths and discrete set mean sizes. Our study shows that the proposed algorithms can be one of the candidates for routing in real interconnection networks based on dBG.

A Tunable Transmitter - Tunable Receiver Algorithm for Accessing the Multichannel Slotted-Ring WDM Metropolitan Network under Self-Similar Traffic

  • Sombatsakulkit, Ekanun;Sa-Ngiamsak, Wisitsak;Sittichevapak, Suvepol
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.777-781
    • /
    • 2004
  • This paper presents an algorithm for multichannel slotted-ring topology medium access protocol (MAC) using in wavelength division multiplexing (WDM) networks. In multichannel ring, there are two main previously proposed architectures: Tunable Transmitter - Fixed Receiver (TTFR) and Fixed Transmitter - Tunable Receivers (FTTR). With TTFR, nodes can only receive packets on a fixed wavelength and can send packets on any wavelengths related to destination of packets. Disadvantage of this architecture is required as many wavelengths as there are nodes in the network. This is clearly a scalability limitation. In contrast, FTTR architecture has advantage that the number of nodes can be much larger than the number of wavelength. Source nodes send packet on a fixed channel (or wavelength) and destination nodes can received packets on any wavelength. If there are fewer wavelengths than there are nodes in the network, the nodes will also have to share all the wavelengths available for transmission. However the fixed wavelength approach of TTFR and FTTR bring low network utilization. Because source node with waiting data have to wait for an incoming empty slot on corresponding wavelength. Therefore this paper presents Tunable Transmitter - Tunable Receiver (TTTR) approach, in which the transmitting node can send a packet over any wavelengths and the receiving node can receive a packet from any wavelengths. Moreover, the self-similar distributed input traffic is used for evaluation of the performance of the proposed algorithm. The self-similar traffic performs better performance over long duration than short duration of the Poison distribution. In order to increase bandwidth efficiency, the Destination Stripping approach is used to mark the slot which has already reached the desired destination as an empty slot immediately at the destination node, so the slot does not need to go back to the source node to be marked as an empty slot as in the Source Stripping approach. MATLAB simulator is used to evaluate performance of FTTR, TTFR, and TTTR over 4 and 16 nodes ring network. From the simulation result, it is clear that the proposed algorithm overcomes higher network utilization and average throughput per node, and reduces the average queuing delay. With future works, mathematical analysis of those algorithms will be the main research topic.

  • PDF

Monitoring-based Coordination of Network-adaptive FEC for Wireless Multi-hop Video Streaming (무선 멀티 홉 비디오 스트리밍을 위한 모니터링 기반의 네트워크 적응적 FEC 코디네이션)

  • Choi, Koh;Yoo, Jae-Yong;Kim, Jong-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.2A
    • /
    • pp.114-126
    • /
    • 2011
  • Video streaming over wireless multi-hop networks(WMNs) contains the following challenges from channel fading and variable bandwidth of wireless channel, and it cause degradation of video streaming performance. To overcome the challenges, currently, WMNs can use Forward Error Correction (FEC) mechanism. In WMNs, traditional FEC schemes, E2E-FEC and HbH-FEC, for video streaming are applied, but it has long transmission delay, high computational complexity and inefficient usage of resource. Also, to distinguish network status in streaming path, it has limitation. In this paper, we propose monitoring-based coordination of network-adaptive hop-to-end(H2E) FEC scheme. To enable proposed scheme, we apply a centralized coordinator. The coordinator has observing overall monitoring information and coordinating H2E-FEC mechanism. Main points of H2E-FEC is distinguishing operation range as well as selecting FEC starting node and redundancy from monitored results in coordination. To verify the proposed scheme, we perform extensive experiment over the OMF(Orbit Measurement Framework) and IEEE 802.1la-based multi-hop WMN testbed, and we carry out performance improvement, 17%, from performance comparison by existing FEC scheme.

A Study on the Data Driven Neural Network Model for the Prediction of Time Series Data: Application of Water Surface Elevation Forecasting in Hangang River Bridge (시계열 자료의 예측을 위한 자료 기반 신경망 모델에 관한 연구: 한강대교 수위예측 적용)

  • Yoo, Hyungju;Lee, Seung Oh;Choi, Seohye;Park, Moonhyung
    • Journal of Korean Society of Disaster and Security
    • /
    • v.12 no.2
    • /
    • pp.73-82
    • /
    • 2019
  • Recently, as the occurrence frequency of sudden floods due to climate change increased, the flood damage on riverside social infrastructures was extended so that there has been a threat of overflow. Therefore, a rapid prediction of potential flooding in riverside social infrastructure is necessary for administrators. However, most current flood forecasting models including hydraulic model have limitations which are the high accuracy of numerical results but longer simulation time. To alleviate such limitation, data driven models using artificial neural network have been widely used. However, there is a limitation that the existing models can not consider the time-series parameters. In this study the water surface elevation of the Hangang River bridge was predicted using the NARX model considering the time-series parameter. And the results of the ANN and RNN models are compared with the NARX model to determine the suitability of NARX model. Using the 10-year hydrological data from 2009 to 2018, 70% of the hydrological data were used for learning and 15% was used for testing and evaluation respectively. As a result of predicting the water surface elevation after 3 hours from the Hangang River bridge in 2018, the ANN, RNN and NARX models for RMSE were 0.20 m, 0.11 m, and 0.09 m, respectively, and 0.12 m, 0.06 m, and 0.05 m for MAE, and 1.56 m, 0.55 m and 0.10 m for peak errors respectively. By analyzing the error of the prediction results considering the time-series parameters, the NARX model is most suitable for predicting water surface elevation. This is because the NARX model can learn the trend of the time series data and also can derive the accurate prediction value even in the high water surface elevation prediction by using the hyperbolic tangent and Rectified Linear Unit function as an activation function. However, the NARX model has a limit to generate a vanishing gradient as the sequence length becomes longer. In the future, the accuracy of the water surface elevation prediction will be examined by using the LSTM model.