• Title/Summary/Keyword: round-trip time

Search Result 193, Processing Time 0.023 seconds

A Resource Scheduling Based on Iterative Sorting for Long-Distance Airborne Tactical Communication in Hub Network (허브 네트워크에서의 장거리 공중 전술 통신을 위한 반복 정렬 기반의 자원 스케줄링 기법)

  • Lee, Kyunghoon;Lee, Dong Hun;Lee, Dae-Hong;Jung, Sung-Jin;Choi, Hyung-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.12
    • /
    • pp.1250-1260
    • /
    • 2014
  • In this paper, a novel resource scheduling, which is used for hub network based long distance airborne tactical communication, is proposed. Recently, some countries of the world has concentrated on developing data rate and networking performance of CDL, striving to keep pace with modern warfare, which is changed into NCW. And our government has also developed the next generation high capacity CDL. In hub network, a typical communication structure of CDL, hybrid FDMA/TDMA can be considered to exchange high rate data among multiple UAVs simultaneously, within limited bandwidth. However, due to different RTT and traffic size of UAV, idle time resource and unnecessary packet transmission delay can occur. And these losses can reduce entire efficiency of hub network in long distance communication. Therefore, in this paper, we propose RTT and data traffic size based UAV scheduling, which selects time/frequency resource of UAVs by using iterative sorting algorithm. The simulation results verified that the proposed scheme improves data rate and packet delay performance in low complexity.

Composting Effectiveness of A Sundry System with A Bin-type Composter for Recyle of Animal Wastes (축분뇨처리를 위한 Bin형 부숙조- Sundry 시스템의 퇴비화효율 평가)

  • 최홍림;김현태;정영윤
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.35 no.2
    • /
    • pp.92-103
    • /
    • 1993
  • A sunday system with a horizontal bin-type composter was constructed and operated to evaluate its composting performance for four days for each test in October, 1992. A sundry system is one of popular systems for composting livestock manure, of which main benefit is to utilize unlimited, clean, and free solar radiation. A rectangular concrete bin(composter) with dimension of 300cm(length) X90cm(width) X60cm(height) was bedded alternatively with four lanes of aeration pipes and heating pipes, and was insulated at three walls with 50mm styrofoam. Each aeration pipe of a diameter of 25mm had 4mm perforated holes at every 15cm longitudinally, and supplied air of about 2m$^3$/min to the composter to maintain aerobic condition . A stirrer rotating at 1 rpm made one round trip every 20 minutes on the conveying chain along the the length of the composter. Five tests (Test 1~Test 5) were implemented to evaluate the composting effectiveness of a sundry system with a horizontal bin-type composter. Treatments of two levels of the mixture ratio of swine manure and paper sludge cakes(manure : paper sludge cakes= 1 : 4 and 1 : 2) and two levels of the water content(W/C ; 70% and 50%) were made to test the significance of the physicochemical properties for decomposition of the mixture materials. Temperature, C/N ratio, water content, microbial activity of the composting materials were taken measurements to evaluate its performance with the lapse of composting time for tests. A small-scale sundry system with a bin-type composter did not appear to be an appropriate system for composting livestock manure. Since heat generation by the composting materials could not overcome heat loss due to areation in a small-scale composter, a proper thermal enviroment could not be maintained to propagate massively thermopilic microorganism relatively in a short period of time. Different from the result of Chol et al.(1992) 6), a temperature variation of the composting materials did not show the peak clearly and C/N ratio didn't lower with time as expected. Mesophilic microoragnism seemed to play an important role for decomposition of the mixture materials. A sundry system with a bin-type composter may be good for a large-scale livestock farm household which may produce enough animal manure. Therefore a decision should be made very carefully to choose a system for composting livestock waste.

  • PDF

Edge to Edge Model and Delay Performance Evaluation for Autonomous Driving (자율 주행을 위한 Edge to Edge 모델 및 지연 성능 평가)

  • Cho, Moon Ki;Bae, Kyoung Yul
    • Journal of Intelligence and Information Systems
    • /
    • v.27 no.1
    • /
    • pp.191-207
    • /
    • 2021
  • Up to this day, mobile communications have evolved rapidly over the decades, mainly focusing on speed-up to meet the growing data demands of 2G to 5G. And with the start of the 5G era, efforts are being made to provide such various services to customers, as IoT, V2X, robots, artificial intelligence, augmented virtual reality, and smart cities, which are expected to change the environment of our lives and industries as a whole. In a bid to provide those services, on top of high speed data, reduced latency and reliability are critical for real-time services. Thus, 5G has paved the way for service delivery through maximum speed of 20Gbps, a delay of 1ms, and a connecting device of 106/㎢ In particular, in intelligent traffic control systems and services using various vehicle-based Vehicle to X (V2X), such as traffic control, in addition to high-speed data speed, reduction of delay and reliability for real-time services are very important. 5G communication uses high frequencies of 3.5Ghz and 28Ghz. These high-frequency waves can go with high-speed thanks to their straightness while their short wavelength and small diffraction angle limit their reach to distance and prevent them from penetrating walls, causing restrictions on their use indoors. Therefore, under existing networks it's difficult to overcome these constraints. The underlying centralized SDN also has a limited capability in offering delay-sensitive services because communication with many nodes creates overload in its processing. Basically, SDN, which means a structure that separates signals from the control plane from packets in the data plane, requires control of the delay-related tree structure available in the event of an emergency during autonomous driving. In these scenarios, the network architecture that handles in-vehicle information is a major variable of delay. Since SDNs in general centralized structures are difficult to meet the desired delay level, studies on the optimal size of SDNs for information processing should be conducted. Thus, SDNs need to be separated on a certain scale and construct a new type of network, which can efficiently respond to dynamically changing traffic and provide high-quality, flexible services. Moreover, the structure of these networks is closely related to ultra-low latency, high confidence, and hyper-connectivity and should be based on a new form of split SDN rather than an existing centralized SDN structure, even in the case of the worst condition. And in these SDN structural networks, where automobiles pass through small 5G cells very quickly, the information change cycle, round trip delay (RTD), and the data processing time of SDN are highly correlated with the delay. Of these, RDT is not a significant factor because it has sufficient speed and less than 1 ms of delay, but the information change cycle and data processing time of SDN are factors that greatly affect the delay. Especially, in an emergency of self-driving environment linked to an ITS(Intelligent Traffic System) that requires low latency and high reliability, information should be transmitted and processed very quickly. That is a case in point where delay plays a very sensitive role. In this paper, we study the SDN architecture in emergencies during autonomous driving and conduct analysis through simulation of the correlation with the cell layer in which the vehicle should request relevant information according to the information flow. For simulation: As the Data Rate of 5G is high enough, we can assume the information for neighbor vehicle support to the car without errors. Furthermore, we assumed 5G small cells within 50 ~ 250 m in cell radius, and the maximum speed of the vehicle was considered as a 30km ~ 200 km/hour in order to examine the network architecture to minimize the delay.

Analysis Method for Full-length LiDAR Waveforms (라이다 파장 분석 방법론에 대한 연구)

  • Jung, Myung-Hee;Yun, Eui-Jung;Kim, Cheon-Shik
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.44 no.4 s.316
    • /
    • pp.28-35
    • /
    • 2007
  • Airbone laser altimeters have been utilized for 3D topographic mapping of the earth, moon, and planets with high resolution and accuracy, which is a rapidly growing remote sensing technique that measures the round-trip time emitted laser pulse to determine the topography. The traveling time from the laser scanner to the Earth's surface and back is directly related to the distance of the sensor to the ground. When there are several objects within the travel path of the laser pulse, the reflected laser pluses are distorted by surface variation within the footprint, generating multiple echoes because each target transforms the emitted pulse. The shapes of the received waveforms also contain important information about surface roughness, slope and reflectivity. Waveform processing algorithms parameterize and model the return signal resulting from the interaction of the transmitted laser pulse with the surface. Each of the multiple targets within the footprint can be identified. Assuming each response is gaussian, returns are modeled as a mixture gaussian distribution. Then, the parameters of the model are estimated by LMS Method or EM algorithm However, each response actually shows the skewness in the right side with the slowly decaying tail. For the application to require more accurate analysis, the tail information is to be quantified by an approach to decompose the tail. One method to handle with this problem is proposed in this study.

South Korean Society and Disciplined Travel Fantasy in the 1960s -Focusing on Kim Chan-Sam's 『世界一周無錢旅行記』(1962) (규율된 여행 판타지의 60년대적 구성 -김찬삼의 『세계일주무전여행기(世界一周無錢旅行記)』(1962)를 중심으로)

  • Lim, Tae-Hun
    • Journal of Popular Narrative
    • /
    • v.25 no.4
    • /
    • pp.289-319
    • /
    • 2019
  • Kim Chan-sam's 『世界一周無錢旅行記』 was released in 1962. This was a time when the general public was strongly restricted from traveling abroad. Most of the people lived in 'domestic'. Low development and political upheaval continued. The readership wanted a fantasy, which came out of a desire to escape from the peninsula. So was to become more popular around the popular characters called 'Kim Chan-sam'. Kim Chan-sam had to be a pushover to the public. This figure had to be secular and de-politicized. Above all, ideological bias had to be removed. The book's imaginary geography is the "world as a non-communist state" with a high purity. The Cold War ideology was prevalent throughout South Korean society. Kim Chan-sam knew exactly what he could and could not tell the South Korean reader. He couldn't tell you the reality of my readers not being able to travel abroad. Not to mention a society locked up 'domestic' on the Korean reality. The study analyzes Kim Chan-sam's storytelling strategy. Looking at the meaning of the travel fantasy,agenre of the 1960s, I would like to ask why travel writing in our time is still bound by its past limitations.

Double Queue CBOKe Mechanism for Congestion Control (이중 큐 CHOKe 방식을 사용한 혼잡제어)

  • 최기현;신호진;신동렬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.11A
    • /
    • pp.867-875
    • /
    • 2003
  • Current end-to-end congestion control depends only on the information of end points (using three duplicate ACK packets) and generally responds slowly to the network congestion. This mechanism can't avoid TCP global synchronization in which TCP congestion window size is fluctuated during congestion period. Furthermore, if RTT(Round Trip Time) is increased, three duplicate ACK packets are not correct congestion signals because congestion might already disappear and the host may send more packets until it receives three duplicate ACK packets. Recently there are increasing interests in solving end-to-end congestion control using AQM(Active Queue Management) to improve the performance of TCP protocols. AQM is a variation of RED-based congestion control. In this paper, we first evaluate the effectiveness of the current AQM schemes such as RED, CHOKe, ARED, FRED and SRED, over traffic with different rates and over traffic with mixed responsive and non-responsive flows, respectively. In particular, CHOKe mechanism shows greater unfairness, especially when more unresponsive flows exist in a shared link. We then propose a new AQM scheme using CHOKe mechanism, called DQC(Double Queue CHOKe), which uses two FIFO queues before applying CHOKe mechanism to adaptive congestion control. Simulation shows that it works well in protecting congestion-sensitive flows from congestion-causing flows and exhibits better performances than other AQM schemes. Also we use partial state information, proposed in LRURED, to improve our mechanism.

A Light-Weight RFID Distance Bounding Protocol (경량 RFID 경계 결정 프로토콜)

  • Ahn, Hae-Soon;Bu, Ki-Dong;Yoon, Eun-Jun;Nam, In-Gil
    • The KIPS Transactions:PartC
    • /
    • v.17C no.4
    • /
    • pp.307-314
    • /
    • 2010
  • Recently, it is proved that contactless smart-card based RFID tags, which is used for proximity authentication, are vulnerable to relay attacks with various location-based attacks such as distance fraud, mafia fraud and terrorist fraud attacks. Moreover, distance bounding protocols have been researched to prevent these relay attacks that can measure the message transmitted round-trip time between the reader and the tag. In 2005, Hancke and Kuhn first proposed an RFID distance bounding protocol based on secure hash function. However, the Hancke-Kuhn protocol cannot completely prevent the relay attacks because an adversary has (3/4)$^n$ attack success probability. Thus, this paper proposes a new distance-bounding protocol for light-weight RFID systems that can reduce to (5/8)$^n$ for the adversary's attack success probability. As a result, the proposed protocol not only can provide high-space efficient based on a secure hash function and XOR operation, but also can provide strong security against the relay attacks because the adversary's attack success probability is optimized to (5/8)$^n$.

An Aggregate Fairness Marker without Per Flow Management for Fairness Improvement of Assured Service in DiffServ (DiffServ 방식의 Assured Service 에서 플로별 관리 없이 Fairness향상을 위한 Aggregate Fairness Marker)

  • Park, Ji-Hoon;Hur, Kyeong;Eom, Doo-Seop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7B
    • /
    • pp.613-627
    • /
    • 2004
  • In this paper, we propose an Aggregate Fairness Maker (ARM) required for an Edge router to improve fairness of throughput among the flows of Assured Service in DiffServ with different round trip time (RTT) and we propose a user flow Three Color Marker (uf-TCM) as a flow marker that marks packets from the flow as green, yellow, or red. A yellow packet is the packet that consumes loss token in uf-TCM as well as that is demoted green packet in AM due to disobey the aggregate traffic profile. The proposed AFH promotes yellow packet to green packet or demotes green packet to yellow packet through the fair method without per-flow management, and it improves the feirness of throughput among the flows as well as link utilization. A yellow packet and a red packet have the same drop precedence at Core Router in our scheme. So we can use the RIO buffer management scheme. We evaluated the performance of our proposed AFM and the REDP Marker that was proposed to improve fairness without per-flow management. Simulation results show that, compared with the REDP marker, proposed AFM can improve performance of throughput fairness among the flows with different RTT and link utilization under the over-provisioning, exact-provisioning, and under-provisioning network environments at Multiple DiffServ domains as well as at Single DiffServ domain.

Kilohertz Gain-Switched Ti:sapphire Laser Operation and Femtosecond Chirped-Pulse Regenerative Amplification (KHz 반복률에서의 Ti:sapphire 이득 스위칭 레이저 발진과 펨토초 처프펄스 재생 증폭)

  • Lee, Yong-In;Ahn, Yeong-Hwan;Lee, Sang-Min;Seo, Min-Ah;Kim, Dai-Sik;Rotermund, Fabian
    • Korean Journal of Optics and Photonics
    • /
    • v.17 no.6
    • /
    • pp.556-563
    • /
    • 2006
  • We present a comprehensive study of a chirped pulse Ti:sapphire regenerative amplifier system operating at 1 kHz. Main constituents of the system are described in detail. The amplifier stage was first converted to a repetition rate-tunable kHz gain-switched nanosecond Ti:sapphire laser. Operation characteristics at different repetition rates such as build-up times of laser pulses, pump power-dependent output powers and pulse durations, damage thresholds, and tunability ranges were studied. Based on the results achieved, the switching time of the Pocket's cell used and the round trip numbers in the regenerative amplifier were optimized at 1 kHz. The output pulses with a pulse width of 50fs from a home-made Ken lens mode-locked Ti:sapphire oscillator were used as seed pulses. The pulses were expanded to 120ps in a grating stretcher prior to coupling into the 3-mirror amplifier cavity. After amplification and recompression, a stable 1kHz Ti:sapphire regenerative amplifier system, which delivers 85-fs, $320-{\mu}J$ pulses, was fully constructed.

A Storage and Computation Efficient RFID Distance Bounding Protocol (저장 공간 및 연산 효율적인 RFID 경계 결정 프로토콜)

  • Ahn, Hae-Soon;Yoon, Eun-Jun;Bu, Ki-Dong;Nam, In-Gil
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9B
    • /
    • pp.1350-1359
    • /
    • 2010
  • Recently many researchers have been proved that general RFID system for proximity authentication is vulnerable to various location-based relay attacks such as distance fraud, mafia fraud and terrorist fraud attacks. The distance-bounding protocol is used to prevent the relay attacks by measuring the round trip time of single challenge-response bit. In 2008, Munilla and Peinado proposed an improved distance-bounding protocol applying void-challenge technique based on Hancke-Kuhn's protocol. Compare with Hancke-Kuhn's protocol, Munilla and Peinado's protocol is more secure because the success probability of an adversary has (5/8)n. However, Munilla and Peinado's protocol is inefficient for low-cost passive RFID tags because it requires large storage space and many hash function computations. Thus, this paper proposes a new RFID distance-bounding protocol for low-cost passive RFID tags that can be reduced the storage space and hash function computations. As a result, the proposed distance-bounding protocol not only can provide both storage space efficiency and computational efficiency, but also can provide strong security against the relay attacks because the adversary's success probability can be reduced by $(5/8)^n$.