• Title/Summary/Keyword: Delay Constraints

Search Result 240, Processing Time 0.024 seconds

Study on Timing Failures in Cyber-Physical Systems

  • Kong, Joon-Ik
    • International journal of advanced smart convergence
    • /
    • v.11 no.3
    • /
    • pp.56-63
    • /
    • 2022
  • Cyber-physical systems (CPSs) can solve real problems by utilizing closely connected resources in the cyber world. Most problems arise because the physical world is uncertain and unpredictable. To address this uncertainty, information pouring from numerous devices must be collected in real-time, and each interconnected device must share the information. At this time, CPS must meet timing-related techniques and strict timing constraints that can deliver accurate information within predefined deadlines in order to interact closely beyond simply connecting the cyber and physical worlds. Timing errors in safety-critical systems, such as automobiles, aviation, and medical systems, can lead to catastrophic disasters. In this paper, we classify timing problems into two types: real-time delay and synchronization problems. The results of this study can be used in the entire process of CPS system design, implementation, operation, verification, and maintenance. As a result, it can contribute to securing the safety and reliability of CPS.

HYERS-ULAM STABILITY OF FRACTIONAL STOCHASTIC DIFFERENTIAL EQUATIONS WITH RANDOM IMPULSE

  • Dumitru Baleanu;Banupriya Kandasamy;Ramkumar Kasinathan;Ravikumar Kasinathan;Varshini Sandrasekaran
    • Communications of the Korean Mathematical Society
    • /
    • v.38 no.3
    • /
    • pp.967-982
    • /
    • 2023
  • The goal of this study is to derive a class of random impulsive non-local fractional stochastic differential equations with finite delay that are of Caputo-type. Through certain constraints, the existence of the mild solution of the aforementioned system are acquired by Kransnoselskii's fixed point theorem. Furthermore through Ito isometry and Gronwall's inequality, the Hyers-Ulam stability of the reckoned system is evaluated using Lipschitz condition.

Optimization Routing Model for Installation of Clustered Engineering Obstacles with Precedence Constraint (선행제약을 고려한 권역단위 공병장애물 설치경로 최적화 모형)

  • Dongkeun Yoo;Suhwan Kim
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.47 no.2
    • /
    • pp.65-73
    • /
    • 2024
  • This paper presents a path planning optimization model for the engineering units to install obstacles in the shortest time during wartime. In a rapidly changing battlefield environment, engineering units operate various engineering obstacles to fix, bypass, and delay enemy maneuvers, and the success of the operation lies in efficiently planning the obstacle installation path in the shortest time. Existing studies have not reflected the existence of obstacle material storage that should be visited precedence before installing obstacles, and there is a problem that does not fit the reality of the operation in which the installation is continuously carried out on a regional basis. By presenting a Mixed Integrer Programming optimization model reflecting various constraints suitable for the battlefield environment, this study attempted to promote the efficient mission performance of the engineering unit during wartime.

Estimation of the Relative GPS/Galileo Satellite and Receiver IFBs using a Kalman Filter in a Regional Receiver Network (지역적 수신기 네트워크에서 Kalman 필터를 사용한 상대적인 GPS/Galileo 위성 및 수신기 IFB 추정)

  • Heesung Kim;Minhyuk Son
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.13 no.3
    • /
    • pp.309-317
    • /
    • 2024
  • Satellite and receiver Inter-Frequency Biases (IFBs) should be estimated or calibrated by pre-defined values for generating precise navigation messages and augmentation data in satellite navigation systems or the augmentation system. In this paper, a Kalman filter is designed and implemented to estimate the ionospheric delay and satellite/receiver IFBs using a regional receiver network. First, an ionospheric model and its filter parameter is defined based on previous studies. Second, a measurement model for estimating the relative satellite/receiver IFBs without any constraints is proposed. Third, a procedure for ensuring the continuity of estimation is proposed in this paper. To verify the performance of the designed filter, six Continuously Operating Reference Stations (CORSs) are selected. Finally, the stability and accuracy of satellite/receiver IFB estimation are analyzed.

FPGA Mapping Incorporated with Multiplexer Tree Synthesis (멀티플렉서 트리 합성이 통합된 FPGA 매핑)

  • Kim, Kyosun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.4
    • /
    • pp.37-47
    • /
    • 2016
  • The practical constraints on the commercial FPGAs which contain dedicated wide function multiplexers in their slice structure are incorporated with one of the most advanced FPGA mapping algorithms based on the AIG (And-Inverter Graph), one of the best logic representations in academia. As the first step of the mapping process, cuts are enumerated as intermediate structures. And then, the cuts which can be mapped to the multiplexers are recognized. Without any increased complexity, the delay and area of multiplexers as well as LUTs are calculated after checking the requirements for the tree construction such as symmetry and depth limit against dynamically changing mapping of neighboring nodes. Besides, the root positions of multiplexer trees are identified from the RTL code, and annotated to the AIG as AOs (Auxiliary Outputs). A new AIG embedding the multiplexer tree structures which are intentionally synthesized by Shannon expansion at the AOs, is overlapped with the optimized AIG. The lossless synthesis technique which employs FRAIG (Functionally Reduced AIG) is applied to this approach. The proposed approach and techniques are validated by implementing and applying them to two RISC processor examples, which yielded 13~30% area reduction, and up to 32% delay reduction. The research will be extended to take into account the constraints on the dedicated hardware for carry chains.

Performance Measurement and Analysis of RTI in the HLA-based Real-time Distributed M-SAM Simulation (HLA 기반 실시간 분산 M-SAM 시뮬레이션에서 RTI성능 측정 및 분석)

  • Choi Sang-Yeong;Cho Byung-Kyu;Lee Kil-Sup
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.11 no.2
    • /
    • pp.149-156
    • /
    • 2005
  • The HLA is the simulation architecture standard that the civilian and military simulation communities are deeply interested in. We can find various successful practices applying HLA to constructive simulations such as war games in domestics and overseas. However, any case of real-time distributed simulations has not been reported. The reason is that a message transmission period via RTI in a network layer varies according to computing power, simulation nodes, transmission types, and packet size; further a message processing time in an application layer depends on its processing methods, thus too difficult to set up real-time constraints for the enhancement of a real-time resolution. Hence, in this paper we have studied the real-time constraints of RTI for the development of the M-SAM simulator. Thus we have developed a HLA based pilot simulator using 6 PC's in LAN and then measured and analysed the performance of the RTI. As the results of our work, we could obtain the quantitative values for message delay, RTI overhead and RTI packet transmission ratio by a real operation scenario and loads, which are not shown in the previous works. We also expect that the results can be used as a guideline to set up the number of targets, transmission frequency and message processing method in the development of the M-SAM simulator and similar applications.

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.

Flexible, Extensible, and Efficient VANET Authentication

  • Studer, Ahren;Bai, Fan;Bellur, Bhargav;Perrig, Adrian
    • Journal of Communications and Networks
    • /
    • v.11 no.6
    • /
    • pp.574-588
    • /
    • 2009
  • Although much research has been conducted in the area of authentication in wireless networks, vehicular ad-hoc networks (VANETs) pose unique challenges, such as real-time constraints, processing limitations, memory constraints, frequently changing senders, requirements for interoperability with existing standards, extensibility and flexibility for future requirements, etc. No currently proposed technique addresses all of the requirements for message and entity authentication in VANETs. After analyzing the requirements for viable VANET message authentication, we propose a modified version of TESLA, TESLA++, which provides the same computationally efficient broadcast authentication as TESLA with reduced memory requirements. To address the range of needs within VANETs we propose a new hybrid authentication mechanism, VANET authentication using signatures and TESLA++ (VAST), that combines the advantages of ECDSA signatures and TESLA++. Elliptic curve digital signature algorithm (ECDSA) signatures provide fast authentication and non-repudiation, but are computationally expensive. TESLA++ prevents memory and computation-based denial of service attacks. We analyze the security of our mechanism and simulate VAST in realistic highway conditions under varying network and vehicular traffic scenarios. Simulation results show that VAST outperforms either signatures or TESLA on its own. Even under heavy loads VAST is able to authenticate 100% of the received messages within 107ms. VANETs use certificates to achieve entity authentication (i.e., validate senders). To reduce certificate bandwidth usage, we use Hu et al.'s strategy of broadcasting certificates at fixed intervals, independent of the arrival of new entities. We propose a new certificate verification strategy that prevents denial of service attacks while requiring zero additional sender overhead. Our analysis shows that these solutions introduce a small delay, but still allow drivers in a worst case scenario over 3 seconds to respond to a dangerous situation.

A QoS Based Multiple Access Scheme for the Wireless ATM Services (무선 ATM 서비스를 위한 QoS 기준 다중 접속 방법)

  • Yae, Byung-Ho;Lee, Sung-Chang
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.6
    • /
    • pp.36-45
    • /
    • 1998
  • This paper discusses multiple access control aspects for a wireless extension of high-speed asynchronous transfer mode(ATM) networks. One challenging requirement is that mobile systems convey of diverse types of information including voice, computer data, facsimile, and video data that have different quality of service constraints. Basically, a centralized control scheme for a coordinated multiple access is required in order to efficiently accommodate multimedia traffic on wireless links. The proposed scheme dynamically scheduling the mobile terminal, which has data to transfer according to the service, types at base station. In this scheme, the scheduling algorithm is performed on the basis of traffic descriptors and QoS parameters, which required in the connection set up phase. As a consequence, the transmission scheduling is very flexible and can account for the different traffic rate and delay constraints that emerge from voice and data integration. The simulation result shows that the proposed scheme has better performance over other scheduling algorithms.

  • PDF

Distributed CSMA/CA Medium Access Control for Incomplete Medium Sharing Systems with General Channel Access Constraints (불완전매체공유 환경을 위한 CSMA/CA기반 분산방식 매체접근제어기법)

  • Lee Byoung-Seok;Jeon Byoung-Wook;Choe Jin-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5B
    • /
    • pp.365-377
    • /
    • 2006
  • We define the incomplete medium sharing system as a multi-channel shared medium communication system where any types of constraints are imposed to the set of channels that may be allocated to any transmitter-receiver node pair. A set of distributed MAC schemes are proposed, all of which are based on the CSMA/CA scheme employed in IEEE 802. 11 WLAN standards. Distributed MAC schemes are proposed in three different forms, which can be differentiated by the number and the location of back-off timers; that is, (1) one timer for all queues destined for different receiver nodes, (2) multiple timers at individual transmission queues, (3) multiple timers for individual channels. Through an extensive set of computer simulations, the performances of the proposed MAC schemes show that the MAC scheme with timers at individual transmission queues outperform the others in terms of throughput and delay for most cases considered. The complexity of the proposed schemes is also compared, and the first scheme obviously turned out to be the simplest, and the complexity of the second and third schemes depends on the number of receiver nodes and the number of channels, respectively.