• Title/Summary/Keyword: Average control delay

Search Result 252, Processing Time 0.026 seconds

Adaptive OLSR Protocol Based on Average Node Distance in Airdropped Distributed Mobility Model (분산 낙하 이동 모델에서의 평균 노드 거리 기반 적응적 OLSR 프로토콜)

  • Lee, Taekmin;Lee, Jinhae;Wang, Jihyeun;Yoo, Joonhyuk;Yoo, Seong-eun
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.13 no.2
    • /
    • pp.83-91
    • /
    • 2018
  • With the development of IT (Information Technology) technology, embedded system and network technology are combined and used in various environments such as military environment as well as everyday life. In this paper, we propose a new airdropped distributed mobility model (ADMM) modeling the dispersion falling of the direct shot of a cluster bomb, and we compare and analyze some representative MANET routing protocols in ADMM in ns-3 simulator. As a result of the analysis, we show OLSR routing protocol is promising in ADMM environment in the view points of packet delivery ratio (PDR), end to end delay, and jitter. In addition, we propose a new adaptation scheme for OLSR, AND-OLSR (Average Node Distance based adaptive-OLSR) to improve the original OLSR in ADMM environment. The new protocol calculates the average node distance, adapts the period of the control message based on the average node distance increasing rate. Through the simulation study, we show that the proposed AND-OLSR outperforms the original OLSR in PDR and control message overhead.

Design and analytical evaluation of a fuzzy proxy caching for wireless internet

  • Bae, Ihn-Han
    • Journal of the Korean Data and Information Science Society
    • /
    • v.20 no.6
    • /
    • pp.1177-1190
    • /
    • 2009
  • In this paper, we propose a fuzzy proxy cache scheme for caching web documents in mobile base stations. In this scheme, a mobile cache model is used to facilitate data caching and data replication. Using the proposed cache scheme, the individual proxy in the base station makes cache decisions based solely on its local knowledge of the global cache state so that the entire wireless proxy cache system can be effectively managed without centralized control. To improve the performance of proxy caching, the proposed cache scheme predicts the direction of movement of mobile hosts, and uses various cache methods for neighboring proxy servers according to the fuzzy-logic-based control rules based on the membership degree of the mobile host. The performance of our cache scheme is evaluated analytically in terms of average response delay and average energy cost, and is compared with that of other mobile cache schemes.

  • PDF

A Study on the Criteria for an Optimal Traffic Control at an Intersection System (교차로(交叉路)에서의 교통통제방법(交通統制方法) 선정기준(選定基準)에 관(関)한 연구(硏究))

  • Cha, Dong-Wan;Ryu, Chun-Beon;No, Hyeong-Bong;Jang, Seok-Gwon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.8 no.1
    • /
    • pp.29-39
    • /
    • 1982
  • This paper presents a practical guidence for determining an optimal traffic control system at intersections in the urban areas in Korea. Two alternative systems, unsignalized and signalized, are considered. For analyzing the unsignalized system, two kinds of simulation model are developed ; gap acceptance model and first -in -first - out model. For the signalized system the total delay function for general arrival distribution is developed under the assumption that departure time is constant and it is used to find an optimal cycle time. Finally, the results in these two alternative systems are compared under the minimum average delay criterion and an optimal traffic control system is determined. This approach supports the decision making whether to install a traffic signal system in an intersection with given traffic flows and, if installed, determines what is the optimal cycle time and how the traffic signal phases are divided. And it also gives upper bounds of traffic flows to be passed in the unsignalized and the signalized system, which can be effectively used whenever an intersection is designed.

  • PDF

Real-time Overlay Video Multicast System (실시간 동영상 오버레이 멀티캐스트 시스템)

  • Kang, Ho-Jong;Song, Hwang-Jun;Min, Kyung-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.2C
    • /
    • pp.139-147
    • /
    • 2006
  • This paper presents an overlay video multicast system over the Internet. The proposed system consists of two parts, i.e. overlay multicast tree suitable for the real-time video delivery and H.263+ rate control adaptive to overlay multicast tree. Overlay multicast tree is constructed to minimize the average time delay of members, and H.263+ rate control pursues a tradeoff between spatial and temporal qualities to enhance the human visual perceptual quality. Two systems are integrated and tested over the real Internet. And experimental results are provided to show the performance of the proposed system.

Central Control over Distributed Service Function Path

  • Li, Dan;Lan, Julong;Hu, Yuxiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.2
    • /
    • pp.577-594
    • /
    • 2020
  • Service Function Chaining (SFC) supports services through linking an ordered list of functions. There may be multiple instances of the same function, which provides a challenge to select available instances for all the functions in an SFC and generate a specific Service Function Path (SFP). Aiming to solve the problem of SFP selection, we propose an architecture consisting of distributed SFP algorithm and central control mechanism. Nodes generate distributed routings based on the first function and destination node in each service request. Controller supervises all of the distributed routing tables and modifies paths as required. The architecture is scalable, robust and quickly reacts to failures because of distributed routings. Besides, it enables centralized and direct control of the forwarding behavior with the help of central control mechanism. Simulation results show that distributed routing tables can generate efficient SFP and the average cost is acceptable. Compared with other algorithms, our design has a good performance on average cost of paths and load balancing, and the response delay to service requests is much lower.

A Study on Application of TPCLT(Twice Per Cycle Left-Turn) for a Signalized Three-Leg Intersection (3지 교차로의 TPCLT(Twice Per Cycle Left-Turn) 적용 방안 연구)

  • Han, Dajeong;Kim, Eungcheol
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.18 no.2
    • /
    • pp.77-92
    • /
    • 2019
  • TPCLT is a advanced signal system that serves twice left turn phases during the same cycle. TPCLT can be a useful where the left turn traffic volume is high and the length of the left turn lane is short. This study examined the effectiveness of TPCLT in reducing delay for a signalized three-Leg intersection and proposed the application of TPCLT signal system. 108 scenarios with different traffic volumes were created. This study analyzed the control delay of the three-Leg intersection in case TPCLT is operated and non-TPCLT is operated. As a result of analysis, it was shown that TPCLT was effective in most of the scenarios. When traffic volume ratio of the left turn is 30~40%, TPCLT was more effective at reducing the control delay. The study result shows significant delay reduction for the left turning traffic and it is approximately 50 seconds. The opposing movement's average control delay increased 2 seconds. The effect of TPCLT on the length of left turn lane was analyzed. As a result, it is found that TPCLT is effective when the length of left turn lane is 30%~60% compared to that of conventional three leg intersection operations.

Delay Tolerant Information Dissemination via Coded Cooperative Data Exchange

  • Tajbakhsh, Shahriar Etemadi;Sadeghi, Parastoo
    • Journal of Communications and Networks
    • /
    • v.17 no.2
    • /
    • pp.133-144
    • /
    • 2015
  • In this paper, we introduce a system and a set of algorithms for disseminating popular content to a large group of wireless clients spread over a wide area. This area is partitioned into multiple cells and there is a base station in each cell which is able to broadcast to the clients within its radio coverage. Dissemination of information in the proposed system is hybrid in nature: Each base station broadcasts a fraction of information in the form of random linear combinations of data blocks. Then the clients cooperate by exchanging packets to obtain their desired messages while they are moving arbitrarily over the area. In this paper, fundamental trade-offs between the average information delivery completion time at the clients and different parameters of the system such as bandwidth usage by the base stations, average energy consumption by the clients and the popularity of the spread information are studied. Moreover different heuristic algorithms are proposed to control and maintain a balance over these trade-offs. Also, the more complicated case of multiple sessions where each client is interested in an arbitrary subset of sessions is considered and two variants of the basic dissemination algorithm are proposed. The performance of all the proposed algorithms is evaluated via extensive numerical experiments.

Snowball Scheme: An Alternative Admission Control Scheme for 3GPP ARQ (Snowball 방식: 3GPP ARQ를 위한 대체 수락 제어 방식)

  • Shin, Woo-Cheol;Park, Jin-Kyung;Ha, Jun;Choi, Cheon-Won
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.8
    • /
    • pp.51-61
    • /
    • 2007
  • For provisioning reliable data transmission, the 3GPP RLC specification adopted a selective-repeat ARQ scheme assisted by a window-based admission control scheme. In the 3GPP ARQ, which is a member of the selective-repeat ARQ clan, inheres the reordering problem A long and irregular reordering time results in the degradation of throughput and delay performance, and may incur the overflow of the reordering buffer. Furthermore, the reordering time must be regulated to meet the requirements of some services which are loss-sensitive and delay-sensitive as well. Perceiving the reordering hazard, we propose an alternative, identified as snowball scheme, to the original admission control scheme of the 3GPP ARQ with aiming at deflating the occupancy of the reordering buffer. A unique feature of the snowball scheme is to reject a new DATA PDU if it is non-adjacent to any DATA PDU sojourning at the reordering buffer. Such an intentional rejection apparently reduces the occupancy of the reordering buffer while it may deteriorate the throughput and delay performance. Developing an analytical approximation method, we investigate the effect of snowball scheme on the saturated occupancy and throughput. Also, we, using a simulation method, evaluate the peak occupancy, normalized throughput and average delay in the practical environment. From the simulation results, we reveal that the snowball scheme is able to enhance occupancy performance as well as throughput performance compared with the original admission control scheme of the 3GPP ARQ.

Handover Delay Stability Method for Train Control on LTE Railway System (LTE-R 시스템에서 열차제어를 위한 핸드오버 지연 안정화 방안)

  • Oh, Sang-Chul;Yoon, Byung-Sik;Lee, Sook-Jin;Choi, Min-Suk;Kim, Dong-Joon;Sung, Dong-il
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.12
    • /
    • pp.1646-1653
    • /
    • 2020
  • In case that the train driving with diverse high-speeds is manipulates by real-time remote control in long-term evolution-railway (LTE-R) system with frequent handovers, the real-time safe transmission of train control messages is important element. The handover delay time stability method regardless of train speed in order to enhance the real-time remote train control stability in LTE-R system is proposed in the paper. Furthermore, the variable speeds and altitudes of train collected by real measurements are applied for upgrading simulation accuracy. The simulation results inform that not only there are stable and unstable ranges to A3 offset values, but the optimal offset value for average handover delay is in unstable range. However, the late handover with A3 offset values in stable range should be chosen to get the predictable handover delay regardless of train speed rather than the early handover with A3 offset values in unstable range, since the key value of high-speed Korea railway system is the stability.

On-line self-tuning PID power controller using fuzzy logic for CDMA cellular systems (퍼지 논리를 이용한 온라인 자기동조기능을 갖는 CDMA 셀룰러 시스템용 PID 전력제어기)

  • 김상민;한진욱;김성중
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.211-214
    • /
    • 1997
  • This paper applies fuzzy self-tuning PID controller in DS/CDMA cellular system. Power control is essential in DS/CDMA to compensate for the differing received powers due to both the slowly varying long-term and fast varying short-term fading processes and co-channel interference. The controller proposed is adaptable for the variations of the system dynamics and especially for the variable time delay which exists in mobile radio systems. Accordingly the results is the smaller power control error, that is, the smaller average transmitting power of mobile compared with the conventional control schemes. Because interferences to the other mobiles are reduced, the capacity of CDMA can be increased.

  • PDF