Journal articles: 'Delay constraint'

1

Tan, Onur, Deniz Gündüz, and Vilardebó Jesús Gómez. "Linear Transmission of Composite Gaussian Measurements over a Fading Channel under Delay Constraints." IEEE Transactions on Wireless Communications 15, no. 6 (2016): 4335–47. https://doi.org/10.1109/TWC.2016.2539961.

Full text

Abstract:

Delay constrained linear transmission (LT) strategies are considered for the transmission of composite Gaussian measurements over an additive white Gaussian noise fading channel under an average power constraint. If the channel state information (CSI) is known by both the encoder and decoder, the optimal LT scheme in terms of the average mean-square error distortion is characterized under a strict delay constraint, and a graphical interpretation of the optimal power allocation strategy is presented. Then, for general delay constraints, two LT strategies are proposed based on the solution to a particular multiple measurements-parallel channels scenario. It is shown that the distortion decreases as the delay constraint is relaxed, and when the delay constraint is completely removed, both strategies achieve the optimal performance under certain matching conditions. If the CSI is known only by the decoder, the optimal LT strategy is derived under a strict delay constraint. The extension to general delay constraints is elusive. As a first step toward understanding the structure of the optimal scheme in this case, it is shown that for the multiple measurements-parallel channels scenario, any LT scheme that uses only a one-to-one linear mapping between measurements and channels is suboptimal in general.

APA, Harvard, Vancouver, ISO, and other styles

2

Li, Yuan Chen, and Wei Qun Liu. "Delay and Delay-Variation Constrained Multicast Routing Algorithm Based on Core Selection." Applied Mechanics and Materials 373-375 (August 2013): 1182–87. http://dx.doi.org/10.4028/www.scientific.net/amm.373-375.1182.

Full text

Abstract:

With the development of multimedia network, more and more real-time multimedia applications require a network capable of satisfying QoS constraints such as delay and delay-variation bound so that the messages reach each destination node at almost the same time within a certain specified time limit, and certain application also demand that different streams for each different destination node should reach with minimum cost under the constraints. Therefore, the delay and delay-variation constraint multicast routing problem is studied and a new strategy in core selection methods is proposed. The algorithm we propose guarantees that the delay from the source to any destination does not exceed a real-time constraint satisfying the delay-variation constraint under cost minimization. In addition, this core selection methods achieve a balance of optimizing cost and delay of the multicast tree. Simulation results show that the algorithm has low complexity and balances between the computational complexity and performance, it can also meet the requirements of real-time network communication.

APA, Harvard, Vancouver, ISO, and other styles

3

Gomer, Matthew R. "Accounting for population-level systematic effects using a hierarchical strategy." Proceedings of the International Astronomical Union 18, S381 (2022): 125–30. http://dx.doi.org/10.1017/s174392132300426x.

Full text

Abstract:

AbstractOne of the largest sources of systematics in time-delay cosmography arises from Mass Sheet Transformation (MST). The degeneracy associated with this transformation is often broken by an assumed profile shape, such as a power-law. A hierarchical strategy has been developed which constrains the global profile shape on a population level, constrained collectively by the kinematics measurements of the lenses. This framework allows one to include non-time-delay lenses to provide constraints to the global profile, improving the H0 constraints. This work tests the hierarchical framework using analytical profiles, and additionally tests the capacity to combine two populations which come from the same profiles but probe different radii due to a change in source redshift. We find that the hierarchical framework is able to compensate for this effect, and the addition of non-time-delay lenses improves the H0 constraint, even though these lenses have different Einstein radii than their time-delay counterparts.

APA, Harvard, Vancouver, ISO, and other styles

4

Cho, Seung-Myeong, Rina Yoon, Ilpyeong Yoon, Jihwan Moon, Seokjin Oh, and Kyeong-Sik Min. "Optimization of Memristor Crossbar’s Mapping Using Lagrange Multiplier Method and Genetic Algorithm for Reducing Crossbar’s Area and Delay Time." Information 15, no. 7 (2024): 409. http://dx.doi.org/10.3390/info15070409.

Full text

Abstract:

Memristor crossbars offer promising low-power and parallel processing capabilities, making them efficient for implementing convolutional neural networks (CNNs) in terms of delay time, area, etc. However, mapping large CNN models like ResNet-18, ResNet-34, VGG-Net, etc., onto memristor crossbars is challenging due to the line resistance problem limiting crossbar size. This necessitates partitioning full-image convolution into sub-image convolution. To do so, an optimized mapping of memristor crossbars should be considered to divide full-image convolution into multiple crossbars. With limited crossbar resources, especially in edge devices, it is crucial to optimize the crossbar allocation per layer to minimize the hardware resource in term of crossbar area, delay time, and area–delay product. This paper explores three optimization scenarios: (1) optimizing total delay time under a crossbar’s area constraint, (2) optimizing total crossbar area with a crossbar’s delay time constraint, and (3) optimizing a crossbar’s area–delay-time product without constraints. The Lagrange multiplier method is employed for the constrained cases 1 and 2. For the unconstrained case 3, a genetic algorithm (GA) is used to optimize the area–delay-time product. Simulation results demonstrate that the optimization can have significant improvements over the unoptimized results. When VGG-Net is simulated, the optimization can show about 20% reduction in delay time for case 1 and 22% area reduction for case 2. Case 3 highlights the benefits of optimizing the crossbar utilization ratio for minimizing the area–delay-time product. The proposed optimization strategies can substantially enhance the neural network’s performance of memristor crossbar-based processing-in-memory architectures, especially for resource-constrained edge computing platforms.

APA, Harvard, Vancouver, ISO, and other styles

5

Li, Yang, and Ting Yang. "Adaptive Finite-Time Constrained Attitude Stabilization for an Unmanned Helicopter System under Input Delay and Saturation." Processes 12, no. 9 (2024): 1787. http://dx.doi.org/10.3390/pr12091787.

Full text

Abstract:

This study focuses on addressing the constrained attitude stabilization problem for an unmanned helicopter (UH) system subject to disturbances, input delay and actuator saturation. A constrained memory sliding mode is first presented to constrain the flight attitude while handling the input delay. On this basis, an adaptive finite-time nonlinear observer is proposed to estimate the lumped disturbance with unknown upper bound. Moreover, based on the hyperbolic tangent function, a saturated attitude controller is designed to tackle the input saturation problem via the adaptive laws. The finite-time stability of the closed-loop constrained attitude system is proved by Lyapunov synthesis. Finally, the developed scheme can accomplish attitude stabilization and overcome the influence of disturbances, attitude constraint, input delay and actuator saturation in an easy way. Numerical simulations are carried out to demonstrate the effectiveness of the proposed control scheme.

APA, Harvard, Vancouver, ISO, and other styles

6

Ros, E., J. M. Marcaide, J. C. Guirado, et al. "High Precision Astrometry over Large Angular Scales with Closure Constraints: the Triplet 1803+784/1928+738/2007+777." Symposium - International Astronomical Union 175 (1996): 120–21. http://dx.doi.org/10.1017/s0074180900080268.

Full text

Abstract:

The technique of differential astrometry using the phase-delay VLBI observable promises fractional precisions of ≃2 × 10–9 in the determination of the separation of sources 5° or 6° apart on the sky (Guirado et al. 1995a; Lara et al. 1996). In our present research we seek further improvement in this technique through using triplets of radio sources, which provide a closure constraint in the determination of relative angular positions. This constraint not only eases the resolution of the phase-cycle ambiguities (a major problem in the least-squares approach to astrometry with phase delays), but it also strongly constrains the space of allowable parameter values.

APA, Harvard, Vancouver, ISO, and other styles

7

Zhang, Man, Ru Chang, and Ying Wang. "Prescribed Performance Tracking Control for Nonlinear Stochastic Time-Delay Systems with Multiple Constraints." Actuators 14, no. 1 (2025): 19. https://doi.org/10.3390/act14010019.

Full text

Abstract:

This paper proposes a prescribed performance tracking control scheme for a category of nonlinear stochastic time-delay systems with input saturation and state asymmetric time-varying constraints. First, to solve the non-differentiable problem caused by input saturation, a smooth nonlinear function was utilized to approximate the saturation function. A nonlinear mapping technique was employed to transform the constrained problem into a bounded convergence problem. The time-delay problem was then solved by constructing the corresponding Lyapunov–Krasovskii function. The error feedback controller was constructed by combining the backstepping technique, the dynamic surface technique, the neural network approximation technique, and the adaptive control method. Based on stochastic mean-square stability theory, all signals in the closed-loop system are proven to be bounded under the designed control scheme. Also, this scheme ensures that the system states always stay within the constraint range, and the tracking error meets the prescribed performance constraint. Finally, the feasibility and superiority of the proposed control scheme were validated through simulation.

APA, Harvard, Vancouver, ISO, and other styles

8

Witayakiattilerd, Wichai. "Nonlinear Fuzzy Differential Equation with Time Delay and Optimal Control Problem." Abstract and Applied Analysis 2015 (2015): 1–14. http://dx.doi.org/10.1155/2015/659072.

Full text

Abstract:

The existence and uniqueness of a mild solution to nonlinear fuzzy differential equation constrained by initial value were proven. Initial value constraint was then replaced by delay function constraint and the existence of a solution to this type of problem was also proven. Furthermore, the existence of a solution to optimal control problem of the latter type of equation was proven.

APA, Harvard, Vancouver, ISO, and other styles

9

BERETTA, E., P. FERGOLA, and C. TENNERIELLO. "CHEMOSTAT EQUATIONS FOR A PREDATOR-PREY CHAIN WITH DELAYED NUTRIENT RECYCLING." Journal of Biological Systems 03, no. 02 (1995): 483–94. http://dx.doi.org/10.1142/s0218339095000459.

Full text

Abstract:

The problem of the equilibrium stability for the chemostat equation is considered in the special case of a biotic species feeding on one limiting nutrient and predated by another biotic species. Both the biotic species through the decomposition process can return with delay to the chemostat fraction of dead biomass as new nutrient. The delay kernels of nutrient recycling are assumed to be general L2(0, +∞) non-negative functions which admit up to second order finite moments. Two approaches are adopted: the first one applies when both the biotic species have a self-regulating term in their evolution equations and can be worked out without linearizing the equations. This approach does not require any further constraint on delay kernels, whereas it introduces constraints on the remaining parameters of the model. The second approach applies to the linearized equations when the predator self-regulating term is set equal to zero. In this case the stability condition requires a constraint on the average time delays in the recycling processes. Both the approaches are performed by constructing suitable Krasovskii-Lyapunov functionals for the related functional retarded differential equations.

APA, Harvard, Vancouver, ISO, and other styles

10

Wang, Ren, Jingxiang Gao, Nanshan Zheng, et al. "Research on Accelerating Single-Frequency Precise Point Positioning Convergence with Atmospheric Constraint." Applied Sciences 9, no. 24 (2019): 5407. http://dx.doi.org/10.3390/app9245407.

Full text

Abstract:

An increasing number of researchers have conducted in-depth research on the advantages of low-cost single-frequency (SF) receivers, which can effectively use ionospheric information when compared to dual-frequency ionospheric-free combination. However, SF observations are bound to increase the unknown parameters and prolong the convergence time. It is desirable if the convergence time can be reduced by external information constraints, for example atmospheric constraints, which include ionosphere- or troposphere constraints. In this study, ionospheric delay constraints, tropospheric delay constraints, and their dual constraints were considered. Additionally, a total of 18,720 test experiments were performed. First, the nearest-neighbor extrapolation (NENE), bilinear- (BILI), bicubic- (BICU), and Junkins weighted-interpolation (JUNK) method of Global Ionospheric Map (GIM) grid products were analyzed. The statistically verified BILI in the percentage of convergence time, average convergence time, and computation time consumption of them shows a good advantage. Next, the influences of global troposphere- and ionosphere-constrained on the convergence time of SF Precise Point Positioning (PPP) were analyzed. It is verified that the ionosphere-constrained (TIC2) has significant influence on the convergence time in the horizontal and vertical components, while the troposphere-constrained (TIC1) has better effect on the convergence time in the vertical components within some thresholds. Of course, the dual constraint (TIC3) has the shortest average convergence time, which is at least 46.5% shorter in static mode and 5.4% in kinematic mode than standard SF PPP (TIC0).

APA, Harvard, Vancouver, ISO, and other styles

11

Verle, A., X. Michel, P. Maurine, N. Azémard, and D. Auvergne. "Delay bounds based constraint distribution method." IEE Proceedings - Computers and Digital Techniques 152, no. 6 (2005): 765. http://dx.doi.org/10.1049/ip-cdt:20050026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Bonami, Pierre, Dorian Mazauric, and Yann Vaxès. "Maximum flow under proportional delay constraint." Theoretical Computer Science 689 (August 2017): 58–66. http://dx.doi.org/10.1016/j.tcs.2017.05.034.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Li, Hongliang, Xiaohui Wei, Qingwu Fu, and Yuan Luo. "MapReduce delay scheduling with deadline constraint." Concurrency and Computation: Practice and Experience 26, no. 3 (2013): 766–78. http://dx.doi.org/10.1002/cpe.3050.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Xu, Yanli. "A Device-to-Device Multicast Scheme for Delay-Constraint Content Delivery." Mobile Information Systems 2017 (2017): 1–12. http://dx.doi.org/10.1155/2017/8012517.

Full text

Abstract:

Motivated by the explosive increase of mobile traffic, study on the device-to-device (D2D) communication is kicked off for content delivery through proximal transmission among users. D2D multicast has advantage on serving multiple users simultaneously with less resource cost. However, when D2D multicast is appropriate for content delivery and how to make it serve delay-constraint traffic are still unclear. In this paper, parameters impacting on D2D multicast content delivery is investigated to find good chances for utilizing D2D multicast. Furthermore, some rules to be obeyed are proposed for the content caching and delivery of D2D multicast to satisfy delay constraints. Based on these analyses, a delay-aware multicast scheme is proposed to maximize the network performance utility while satisfying delay constraints of contents. Simulations results verify our analyses and show that the proposed scheme can significantly improve multicast efficiency with guaranteed delay.

APA, Harvard, Vancouver, ISO, and other styles

15

Jia, Xiaohua, Niki Pissinou, and Kia Makki. "Modeling and Simulations of Multicast Routing Algorithms for Advanced Network Applications." SIMULATION 68, no. 1 (1997): 44–55. http://dx.doi.org/10.1177/003754979706800107.

Full text

Abstract:

Multicast has become an important service in modern network applications. Multicast routing is a difficult issue, particularly under delay or bandwidth constraints. This paper discusses Steiner trees in the modeling of multicast routings and various routing constraints required by applications. It also discusses the existing multicast routing algorithms, especially the routings under constraints, such as delay constraint, limited available bandwidth, and traffic load balancing. Extensive simulations have been conducted to reveal the relationships between the network cost of the routing and each of the discussed constraints.

APA, Harvard, Vancouver, ISO, and other styles

16

Yang, Zhou, Wenqian Jiang, and Gang Li. "Resource Allocation for Green Cognitive Radios: Energy Efficiency Maximization." Wireless Communications and Mobile Computing 2018 (July 5, 2018): 1–16. http://dx.doi.org/10.1155/2018/1327030.

Full text

Abstract:

Green cognitive radios are promising in future wireless communications due to high energy efficiency. Energy efficiency maximization problems are formulated in delay-insensitive green cognitive radio and delay-sensitive green cognitive radio. The optimal resource allocation strategies for delay-insensitive green cognitive radio and delay-sensitive green cognitive radio are designed to maximize the energy efficiency of the secondary user. The peak interference power and the average/peak transmit power constraints are considered. Two algorithms based on the proposed resource allocation strategies are proposed to solve the formulated problems. Simulation results show that the maximum energy efficiency of the secondary user achieved under the average transmit power constraint is higher than that achieved under the peak transmit power constraint. It is shown that the design of green cognitive radio should take the tradeoff between its complexity and its achievable maximum energy efficiency into consideration.

APA, Harvard, Vancouver, ISO, and other styles

17

Li, Lijun, Yuanda Wang, Chao Xiong, and Wei Shang. "Rendezvous of Nonholonomic Unmanned Ground Vehicles with Ultra-Wide-Angle Cameras." World Electric Vehicle Journal 15, no. 8 (2024): 370. http://dx.doi.org/10.3390/wevj15080370.

Full text

Abstract:

In this paper, a time-varying delay output feedback control method based on the potential barrier function is proposed, which can solve the communication delay and field-of-view (FOV) constraints of Unmanned Ground Vehicle (UGV) clusters when communicating with ultra-wide-angle cameras. First, a second-order oscillator and an output feedback controller are utilized to feed back the position and direction of neighboring vehicles by exchanging control quantities and to solve the time-varying delay in the position computation of the ultra-wide-angle camera. Due to the limited target radiation range perceived by the camera, an FOV-constrained potential function is adopted to optimize the design of the sliding mode surface. The stability of the closed-loop control system is analyzed by applying the Lyapunov method. Finally, simulation experiments are conducted to verify the effectiveness of the consensus scheme in addressing the communication delay and FOV constraint problem under two different initial conditions.

APA, Harvard, Vancouver, ISO, and other styles

18

G, Shyamala, and G. R. Prasad. "Obstacle aware delay optimized rectilinear steiner minimum tree routing." Indonesian Journal of Electrical Engineering and Computer Science 16, no. 2 (2019): 640. http://dx.doi.org/10.11591/ijeecs.v16.i2.pp640-652.

Full text

Abstract:

This work presents a method to solve the problem of constructing Rectilinear Steiner Minimum Tree (RSMT) for a group of pins in the presence of obstacles. In modern very large-scale integrated circuit (VLSI) designs, the obstacles, generally blocks the metal and the device layer. Therefore routing on top of blockage is a possible solution but buffers cannot be placed over the obstacle. Modern VLSI design OARSMT construction has long wire length, which results in signal violation. To address this issue a slew constraint interconnect need to be considered in routing over obstacle. This is called the Obstacle-Avoiding Rectilinear Steiner minimum trees (OARSMT) problem with slew constraints over obstacles. The drawback of traditional OARSMT is that they only consider slew constraint, and delay constraints are neglected. It induces high routing resources overhead due to buffer insertion and does not solve global routing solution. This work presents an Obstacle Aware Delay Optimized Rectilinear Steiner Minimum Tree (OADORSMT) Routing to address the delay, slew constraint and reduce the routing resources. Experiments are conduced to evaluate the performance of proposed approach over existing approach in term of wire length and worst negative slack. The experiments are conducted for small and large nets considering fixed and varied obstacles and outcome shows the proposed efficiency over existing approaches. The OADORSMT is designed in such a way where it can be parallelized to obtain better efficiency.

APA, Harvard, Vancouver, ISO, and other styles

19

Zhang, Lei, and Yan Bo Zhang. "Energy Efficient Protocol Based on Orient Constraint Factor in UWASNs." Applied Mechanics and Materials 380-384 (August 2013): 2827–30. http://dx.doi.org/10.4028/www.scientific.net/amm.380-384.2827.

Full text

Abstract:

UWASNs are deployed in environments of sea and shallow water, which are composed of many nodes that communicate through acoustic wave. The preliminary problem in UWASNs different with on land WSNs is the severe demand of delay time constrain. It becomes a crucial problem that how to reduce unnecessary path that waste time. In this proposed paper, we present an energy efficient protocol with low delay time. Orient constraint factor is a constitute element of this proposed protocol, which instructs node how to select the next hop from neighbor nodes. The orient constrain factor is composed of the distances of source node, neighbor nodes and destination node (commonly pointed to sink node). Simulations show that this protocol can efficiently reduce the delay time and hold a high level of energy efficient.

APA, Harvard, Vancouver, ISO, and other styles

20

Zhang, Cheng, and Wu Ma. "Core Selection to Solve Multicast Routing with Delay and Delay-Variation Constraints." Applied Mechanics and Materials 556-562 (May 2014): 5343–47. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.5343.

Full text

Abstract:

The basis of multicast data transmission is to construct a multicast tree. The main problem concerning the construction of a multicast tree is the selection of the root of the shared tree or the core point. Therefore, the algorithm we propose guarantees that the delay from the source to any destination does not exceed a real-time constraint satisfying the delay-variation constraint under cost minimization. The core selection function in this algorithm achieves a balance of optimizing cost and delay of the multicast tree. Simulation results show that the algorithm has low complexity and balances between the computational complexity and performance.

APA, Harvard, Vancouver, ISO, and other styles

21

Zhang, Pengfei, Rui Tu, Yuping Gao, Na Liu, and Rui Zhang. "Improving Galileo's Carrier-Phase Time Transfer Based on Prior Constraint Information." Journal of Navigation 72, no. 1 (2018): 121–39. http://dx.doi.org/10.1017/s0373463318000486.

Full text

Abstract:

The Carrier-Phase (CP) technique used in the Global Positioning System (GPS) has proved to be a useful spatial tool for remote precise time transfer. Galileo is a Global Navigation Satellite System like GPS. However, currently, given the low number of satellites at any one observation epoch, Galileo's accuracy and continuity of time transfer leave much to be desired. To achieve better performance of time transfer for Galileo, this study has developed a new approach for Galileo CP time transfer, using prior constraint information such as precise coordinates and troposphere zenith delay constraints. The new approach was applied for precise time transfer in real-time mode and post-processed mode for short baseline and long baseline observations. For the short baseline time link in real-time mode, compared with the standard Galileo CP, the standard deviation improved by 51·4% for the troposphere zenith delay constraint, 47·6% for the station coordinates constraint, and 49·5% when considering both constraints simultaneously. At a 10,000 s time interval, in comparison to the standard CP, the three constraint approaches show stable results as well as improvements of nearly an order of magnitude. In post-processed mode, the constraint approach for Galileo time transfer showed little improvement compared to the standard CP technique for both the short baseline and long baseline time links.

APA, Harvard, Vancouver, ISO, and other styles

22

Lu, Austin, Yongjie Zhuang, Ryan M. Corey, and Andrew C. Singer. "Delay-constrained hearing aid speech enhancement using a wireless remote microphone." Journal of the Acoustical Society of America 155, no. 3_Supplement (2024): A42. http://dx.doi.org/10.1121/10.0026738.

Full text

Abstract:

Hearing aids have been shown in literature to offer better noise reduction and spatial cue preservation when used alongside a remote microphone. Oftentimes, this is in ideal conditions where both devices are synchronized and can transmit data losslessly and instantaneously. In practice, hearing aids tend to receive remote microphone data via wireless link, which incurs a slew of adverse effects. Among these, transmission delay is of particular importance, as hearing aids already have tight constraints on allowable end-to-end delay. Typically, this delay constraint is under 10 ms for perceptual reasons. In this work, we study a filter designed for hearing aids with a network-delayed remote microphone. Originally, the filter is derived and analyzed in the time frequency domain without explicit consideration of the delay constraints. We rederive the filter to address this gap, and seek to measure the effect of the network delay and delay constraints on overall performance.

APA, Harvard, Vancouver, ISO, and other styles

23

Khalil, Karim, O. Ozan Koyluoglu, Hesham El Gamal, and Moustafa Youssef. "Opportunistic Secrecy with a Strict Delay Constraint." IEEE Transactions on Communications 61, no. 11 (2013): 4700–4709. http://dx.doi.org/10.1109/tcomm.2013.101113.130356.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Aven, Terje, and I. T. Castro. "A delay-time model with safety constraint." Reliability Engineering & System Safety 94, no. 2 (2009): 261–67. http://dx.doi.org/10.1016/j.ress.2008.03.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Kiruthika, S., N. Iswarya, A. Sartiha, K. Kalaivani, and K. Ulaga Priya. "Interference-based topology control algorithm for noise removal and delay-constrained mobile ad hoc networks using clustering technology." International Journal of Engineering & Technology 7, no. 2.21 (2018): 342. http://dx.doi.org/10.14419/ijet.v7i2.21.12400.

Full text

Abstract:

MANET is ad hoc network which is in the top layer of the network. This ad hoc network are connected by mobile devices with flexible topology network to control the delay constrain in the mobile ad hoc network for noise removal in network. The transmission power is managed to minimize the interference taking into account the topology control algorithm also accounts the delay constraint and finds the duplicate data.

APA, Harvard, Vancouver, ISO, and other styles

26

Li, Zhao, Geng, and Zhang. "Distributed Rate-Control and Delay-Guaranteed Scheduling in MR-MC Wireless Mesh Networks." Sensors 19, no. 22 (2019): 5005. http://dx.doi.org/10.3390/s19225005.

Full text

Abstract:

Wireless mesh networks (WMNs) can provide flexible wireless connections in smart city, Internet of Things (IoT), and device-to-device (D2D) communications. The performance of WMNs can be greatly enhanced by adopting the multi-radio multi-channel (MR-MC) technique, which enables a node to communicate with more nodes simultaneously. However, increasing the number of data flows will result in network congestion and longer end-to-end delays. In this paper, a distributed rate-control and delay-aware (DRDA) scheduling algorithm is proposed based on a multidimensional conflict graph. To satisfy the arrival rate and delay constraints of a flow, two virtual queues are constructed. All the actual and virtual queues are stabilized by the Lyapunov drift optimization method. The scheduling policy of each flow is optimized only based on the local information. The simulation results show that our proposed algorithm can maintain the stability of all the queues and strictly satisfy the arrival rate and delay constraint of each flow in the network as well.

APA, Harvard, Vancouver, ISO, and other styles

27

Aghayeva, Charkaz. "Stochastic optimal control problem of constrained switching system with delay." Filomat 30, no. 3 (2016): 711–20. http://dx.doi.org/10.2298/fil1603711a.

Full text

Abstract:

This paper concerns the stochastic optimal control problem of switching systems with delay. The evolution of the system is governed by the collection of stochastic delay differential equations with initial conditions that depend on its previous state. The restriction on the system is defined by the functional constraint that contains state and time parameters. First, maximum principle for stochastic control problem of delay switching system without constraint is established. Finally, using Ekeland?s variational principle, the necessary condition of optimality for control system with constraint is obtained.

APA, Harvard, Vancouver, ISO, and other styles

28

Hou, Shaoqi, Xi-Long Fan, and Zong-Hong Zhu. "Constraining cosmological parameters from strong lensing with DECIGO and B-DECIGO sources." Monthly Notices of the Royal Astronomical Society 507, no. 1 (2021): 761–71. http://dx.doi.org/10.1093/mnras/stab2221.

Full text

Abstract:

ABSTRACT Gravitational lensing has long been used to measure or constrain cosmology models. Although the lensing effect of gravitational waves has not been observed by LIGO/Virgo, it is expected that there can be a few to a few hundred lensed events to be detected by the future Japanese space-borne interferometers DECIGO and B-DECIGO, if they are running for 4 years. Given the predicted lensed gravitational wave events, one can estimate the constraints on the cosmological parameters via the lensing statistics and the time delay methods. With the lensing statistics method, the knowledge of the lens redshifts, even with the moderate uncertainties, will set the tight bound on the energy density parameter ΩM for matter, that is, 0.288 ≲ ΩM ≲ 0.314 at best. The constraint on the Hubble constant H0 can be determined using the time delay method. It is found out that at 5σ, |δH0|/H0 ranges from $3{{\ \rm per\ cent}}$ to $11{{\ \rm per\ cent}}$ for DECIGO, and B-DECIGO will give less constrained results, $8{{\ \rm per\ cent}}\ \mathrm{ to}\ 15{{\ \rm per\ cent}}$. In this work, the uncertainties on the luminosity distance and the time delay distance are set to be $10{{\ \rm per\ cent}}$ and $20{{\ \rm per\ cent}}$, respectively. The improvement on measuring these distances will tighten the bounds.

APA, Harvard, Vancouver, ISO, and other styles

29

Weera, W., and P. Niamsup. "Robust Stability Criteria for Uncertain Neutral Systems with Interval Nondifferentiable Time-Varying Delay and Nonlinear Perturbations." Journal of Applied Mathematics 2011 (2011): 1–20. http://dx.doi.org/10.1155/2011/138912.

Full text

Abstract:

We study the robust stability criteria for uncertain neutral systems with interval time-varying delays and time-varying nonlinear perturbations simultaneously. The constraint on the derivative of the time-varying delay is not required, which allows the time-delay to be a fast time-varying function. Based on the Lyapunov-Krasovskii theory, we derive new delay-dependent stability conditions in terms of linear matrix inequalities (LMIs) which can be solved by various available algorithms. Numerical examples are given to demonstrate that the derived conditions are much less conservative than those given in the literature.

APA, Harvard, Vancouver, ISO, and other styles

30

Luo, Gao Yong, and Yu Pei Liu. "Wavelet Audio Coding by Fixed-Point Short Block Processing for Real-Time Wireless Applications." Applied Mechanics and Materials 239-240 (December 2012): 1118–24. http://dx.doi.org/10.4028/www.scientific.net/amm.239-240.1118.

Full text

Abstract:

Digital audio coding delays have become increasingly critical in real-time wireless applications. In live productions, a codec with ultra low delay is required within the constraints of the available channel bandwidth. However, such a threshold can hardly be reached by means of standard audio coding schemes. To achieve low delay as well as to satisfy cost and power consumption constraints, this paper presents an ultra low delay audio coder by very short block processing and embedded coding implemented in fixed-point DSP. The short block two dimensional (2D) spatial-frequency processing of audio input signal fully exploits the correlation for better compression performance. Lifting wavelet transform with boundary effects minimized by changing wavelet shape is developed using bit shifts and additions to replace multiplications in a fixed-point specification under accuracy constraint. The embedded coding offers the error resilience feature so that joint source-channel coding scheme for unequal error protection can be easily designed by varying both source coding bit rate and channel coding redundancy. Experimental results demonstrate that the proposed coder is efficient and requires less memory in fixed-point computation which guarantees no overflow.

APA, Harvard, Vancouver, ISO, and other styles

31

Wang, Jungang, Junping Chen, and Yize Zhang. "Empirical modeling of tropospheric delays with uncertainty." Geoscientific Model Development 18, no. 5 (2025): 1487–504. https://doi.org/10.5194/gmd-18-1487-2025.

Full text

Abstract:

Abstract. Accurate modeling of tropospheric delay is important for high-precision data analysis of space geodetic techniques, such as the Global Navigation Satellite System (GNSS). Empirical tropospheric delay models provide zenith delays with an accuracy of 3 to 4 cm globally and do not rely on external meteorological input. They are thus important for providing a priori delays and serving as constraint information to improve the convergence of real-time GNSS positioning, and in the latter case proper weighting is critical. Currently, empirical tropospheric delay models only provide delay values but not the uncertainty of delays. For the first time, we present a global empirical tropospheric delay model, which provides both the zenith delay and the corresponding uncertainty, based on 10 years of tropospheric delays from numerical weather models (NWMs). The model is based on a global grid and, at each grid point, a set of parameters that describes the delay and uncertainty in the constant, annual, and semiannual terms. The empirically modeled zenith delay has agreements of 36 and 38 mm compared to 3-year delay values from the NWM and 4-year estimates from GNSS stations, which is comparable to previous models such as Global Pressure and Temperature 3 (GPT3). The modeled zenith tropospheric delay (ZTD) uncertainty shows a correlation of 96 % with the accuracy of the empirical ZTD model over 380 GNSS stations over the 4 years. For GNSS stations where the uncertainty annual amplitude is larger than 20 mm, the temporal correlation between the formal error and smoothed accuracy reaches 85 %. Using GPS observations from ∼ 200 globally distributed IGS stations processed in kinematic precise point positioning (PPP) mode over 4 months in 2020, we demonstrate that using proper constraints can improve the convergence speed. The formal error modeling is based on a similar dataset to that of the GPT series, and thus it is also applicable for these empirical models.

APA, Harvard, Vancouver, ISO, and other styles

32

Huang, Huifen, Zhihong Wu, Jin Ge, and Lu Wang. "Toward Building Video Multicast Tree with Congestion Avoidance Capability in Software-Defined Networks." International Arab Journal of Information Technology 17, no. 2 (2019): 162–69. http://dx.doi.org/10.34028/iajit/17/2/3.

Full text

Abstract:

Network congestion is an obstacle to a Quality of Service (QoS) guarantee for online video applications, because it leads to a high packet loss rate and long transmission delay. In the Software-Defined Network (SDN), the controller can conveniently obtain the network topology and link bandwidth use situation. Based on the above advantages, an SDN-based video multicast routing solution, called Congestion Avoidance Video Multicast (CAVM), is proposed in this paper. CAVM obtains overall network topology, monitors available bandwidth resource and measures the link delays based on the OpenFlow, a popular SDN southbound interface. We introduce a novel multicast routing problem, named the Delay-Constrained and Minimum Congestion-Cost Multicast Routing (DCMCCMR) problem, which finds the multicast tree with the lowest congestion cost and a source-destination delay constraint in the SDN environment. The DCMCCMR problem is NP-hard. CAVM uses an algorithm to solve it in polynomial time. Our experimental results confirm that the proposed algorithm can build multicast trees with good congestion avoidance capability

APA, Harvard, Vancouver, ISO, and other styles

33

Huang, Wei, Wei Chen, and H. Vincent Poor. "Energy Efficient Wireless Pushing With Request Delay Information and Delivery Delay Constraint." IEEE Access 5 (2017): 15428–41. http://dx.doi.org/10.1109/access.2017.2696024.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Sen, Kaustubha, Tetsuya Hashimoto, Tomotsugu Goto, et al. "Constraining violations of the weak equivalence principle Using CHIME FRBs." Monthly Notices of the Royal Astronomical Society 509, no. 4 (2021): 5636–40. http://dx.doi.org/10.1093/mnras/stab3344.

Full text

Abstract:

ABSTRACT Einstein’s General relativity (GR) is the basis of modern astronomy and astrophysics. Testing the validity of basic assumptions of GR is important. In this work, we test a possible violation of the weak equivalence principle (WEP), i.e. there might be a time lag between photons of different frequencies caused by the effect of gravitational fields if the speeds of photons are slightly different at different frequencies. We use Fast radio bursts (FRBs), which are astronomical transients with millisecond time-scales detected in the radio frequency range. Being at cosmological distances, accumulated time delay of FRBs can be caused by the plasma in between an FRB source and an observer, and by gravitational fields in the path of the signal. We segregate the delay due to dispersion and gravitational field using the post-Newtonian formalism (PPN) parameter Δγ, which defines the space curvature due to gravity by a unit test mass. We did not detect any time delay from FRBs but obtained tight constraints on the upper limit of Δγ. For FRB20181117C with z = 1.83 ± 0.28 and νobs = $676.5\, {\rm MHz}$, the best possible constraint is obtained at log(Δγ) = $-21.58 ^{+0.10}_{-0.12}$ and log(Δγ/rE) = $-21.75 ^{+0.10}_{-0.14}$, respectively, where rE is the energy ratio of two photons of the same FRB signal. This constraint is about one order of magnitude better than the previous constraint obtained with FRBs, and five orders tighter than any constraint obtained using other cosmological sources.

APA, Harvard, Vancouver, ISO, and other styles

35

Li, Jie, Xing Wei Wang, and Min Huang. "A Shared Path Protection Mechanism Based on Delay Constraint in the Optical Network." Applied Mechanics and Materials 427-429 (September 2013): 2237–44. http://dx.doi.org/10.4028/www.scientific.net/amm.427-429.2237.

Full text

Abstract:

Survivability is an important concern in the optical network. In order to offer an effective and efficient protection mechanism that meeting both delay constraint and availability guarantees for real-time services in the optical network, a shared path protection mechanism based on delay constraint is proposed in this paper. Thinking of the processing delay and the propagation delay as main factors which have great effect on the delay of real-time services, the mechanism designs the routing and wavelength assignment schemes for the working path and the protection path. Simulation results show that the proposed mechanism is both feasible and effective.

APA, Harvard, Vancouver, ISO, and other styles

36

Hu, Hang, Hang Zhang, and Hong Yu. "Throughput-Delay Trade-Off for Cognitive Radio Networks: A Convex Optimization Perspective." Abstract and Applied Analysis 2014 (2014): 1–8. http://dx.doi.org/10.1155/2014/430696.

Full text

Abstract:

The throughput-delay trade-off problem for cooperative spectrum sensing (CSS) is investigated. It is proved that the maximum achievable throughput and the minimum transmission delay cannot be obtained simultaneously. An efficient algorithm is proposed to optimize the sensing bandwidth and the final decision threshold jointly such that the throughput is maximized while the delay is constrained. It is demonstrated that convex optimization plays an essential role in solving the problem in an efficient way. Simulation results show that the proposed optimal scheme can significantly improve the throughput of the secondary users (SUs) under the constraint that the delay Quality of Service (QoS) requirements of the SUs are satisfied.

APA, Harvard, Vancouver, ISO, and other styles

37

Brudner, Samuel N., Nikhit Kethidi, Damaris Graeupner, Richard B. Ivry, and Jordan A. Taylor. "Delayed feedback during sensorimotor learning selectively disrupts adaptation but not strategy use." Journal of Neurophysiology 115, no. 3 (2016): 1499–511. http://dx.doi.org/10.1152/jn.00066.2015.

Full text

Abstract:

In sensorimotor adaptation tasks, feedback delays can cause significant reductions in the rate of learning. This constraint is puzzling given that many skilled behaviors have inherently long delays (e.g., hitting a golf ball). One difference in these task domains is that adaptation is primarily driven by error-based feedback, whereas skilled performance may also rely to a large extent on outcome-based feedback. This difference suggests that error- and outcome-based feedback may engage different learning processes, and these processes may be associated with different temporal constraints. We tested this hypothesis in a visuomotor adaptation task. Error feedback was indicated by the terminal position of a cursor, while outcome feedback was indicated by points. In separate groups of participants, the two feedback signals were presented immediately at the end of the movement, after a delay, or with just the error feedback delayed. Participants learned to counter the rotation in a similar manner regardless of feedback delay. However, the aftereffect, an indicator of implicit motor adaptation, was attenuated with delayed error feedback, consistent with the hypothesis that a different learning process supports performance under delay. We tested this by employing a task that dissociates the contribution of explicit strategies and implicit adaptation. We find that explicit aiming strategies contribute to the majority of the learning curve, regardless of delay; however, implicit learning, measured over the course of learning and by aftereffects, was significantly attenuated with delayed error-based feedback. These experiments offer new insight into the temporal constraints associated with different motor learning processes.

APA, Harvard, Vancouver, ISO, and other styles

38

Yan, Zheping, Lidong Yue, Jiajia Zhou, Xiaoli Pan, and Chao Zhang. "Formation Coordination Control of Leaderless Multi-AUV System with Double Independent Communication Topology and Nonconvex Control Input Constraints." Journal of Marine Science and Engineering 11, no. 1 (2023): 107. http://dx.doi.org/10.3390/jmse11010107.

Full text

Abstract:

In this paper, the formation coordination control of discrete-time distributed leaderless multiple autonomous underwater vehicle (AUV) system with double independent position–velocity communication topology and control inputs on a nonconvex set is studied. Firstly, the problem of formation coordination control of multi-AUV system is transformed into the problem of formation consensus of multi-AUV system, and the consistent state of leaderless multi-AUV system formation was defined. Secondly, considering the existence of bounded communication delay and nonconvex control input constraints for multi-AUV system formation under weak communication conditions, a formation consistent constraint controller algorithm for discrete-time leaderless multi-AUV system with double independent communication topology is proposed by introducing constraint operators. By using the properties of graph theory, random matrix and SIA matrix, and selecting appropriate controller parameters, the multi-AUV system formation can reach the defined consensus state. Furthermore, the unbounded communication delay of multi-AUV system formation is studied. Finally, the simulation results show that the proposed controller constraint algorithm is effective.

APA, Harvard, Vancouver, ISO, and other styles

39

Sun, Baoyan, Jun Hu, and Yan Gao. "Variance-constrained robust $ H_{\infty} $ state estimation for discrete time-varying uncertain neural networks with uniform quantization." AIMS Mathematics 7, no. 8 (2022): 14227–48. http://dx.doi.org/10.3934/math.2022784.

Full text

Abstract:

<abstract>In this paper, we consider the robust $ H_{\infty} $ state estimation (SE) problem for a class of discrete time-varying uncertain neural networks (DTVUNNs) with uniform quantization and time-delay under variance constraints. In order to reflect the actual situation for the dynamic system, the constant time-delay is considered. In addition, the measurement output is first quantized by a uniform quantizer and then transmitted through a communication channel. The main purpose is to design a time-varying finite-horizon state estimator such that, for both the uniform quantization and time-delay, some sufficient criteria are obtained for the estimation error (EE) system to satisfy the error variance boundedness and the $ H_{\infty} $ performance constraint. With the help of stochastic analysis technique, a new $ H_{\infty} $ SE algorithm without resorting the augmentation method is proposed for DTVUNNs with uniform quantization. Finally, a simulation example is given to illustrate the feasibility and validity of the proposed variance-constrained robust $ H_{\infty} $ SE method.</abstract>

APA, Harvard, Vancouver, ISO, and other styles

40

Guan, Wei, and K. J. Ray Liu. "Two-Way Network-Coded Relaying With Delay Constraint." IEEE Transactions on Wireless Communications 14, no. 1 (2015): 191–204. http://dx.doi.org/10.1109/twc.2014.2335202.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Prasad, S. C., and K. Roy. "Transistor reordering for power minimization under delay constraint." ACM Transactions on Design Automation of Electronic Systems 1, no. 2 (1996): 280–300. http://dx.doi.org/10.1145/233539.233543.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Wu, Yuxiang, Tian Xu, and Hongqiang Mo. "Adaptive tracking control for nonlinear time-delay systems with time-varying full state constraints." Transactions of the Institute of Measurement and Control 42, no. 12 (2020): 2178–90. http://dx.doi.org/10.1177/0142331220908987.

Full text

Abstract:

This paper presents an adaptive tracking control approach for a class of uncertain nonlinear strict-feedback systems subject to time-varying full state constraints and time-delays. To stabilize such systems, an adaptive tracking controller is structured by combining the neural networks and the backstepping technique. To guarantee all states do not violate the time-varying constraint sets, the appropriate time-varying Barrier Lyapunov functions are employed at each stage of the backstepping procedure. By using the Lyapunov-Krasovskii functionals, the effect of time delay is eliminated. It is proved that the output follows the desired signal well without violating any constraints, and all the signals in the closed-loop system are semiglobal uniformly ultimately bounded by using the Lyapunov analysis. Finally, a comparison study simulation is provided to illustrate the effectiveness of the proposed control strategy.

APA, Harvard, Vancouver, ISO, and other styles

43

Yotha, N., T. Botmart, and T. Mouktonglang. "Exponential Stability for a Class of Switched Nonlinear Systems with Mixed Time-Varying Delays via an Average Dwell-Time Method." ISRN Mathematical Analysis 2012 (September 29, 2012): 1–18. http://dx.doi.org/10.5402/2012/528259.

Full text

Abstract:

The problem of exponential stability for a class of switched nonlinear systems with discrete and distributed time-varying delays is studied. The constraint on the derivative of the time-varying delay is not required which allows the time delay to be a fast time-varying function. We study the stability properties of switched nonlinear systems consisting of both stable and unstable subsystems. Average dwell-time approached and improved piecewise Lyapunov functional combined with Leibniz-Newton are formulated. New delay-dependent sufficient conditions for the exponential stabilization of the switched systems are first established in terms of LMIs. A numerical example is also given to illustrate the effectiveness of the proposed method.

APA, Harvard, Vancouver, ISO, and other styles

44

Daniar, Sabah, Mojtaba Shiroei, and Rahmat Aazami. "Multivariable predictive control considering time delay for load-frequency control in multi-area power systems." Archives of Control Sciences 26, no. 4 (2016): 527–49. http://dx.doi.org/10.1515/acsc-2016-0029.

Full text

Abstract:

Abstract In this paper, a multivariable model based predictive control (MPC) is proposed for the solution of load frequency control (LFC) in a multi-area interconnected power system. The proposed controller is designed to consider time delay, generation rate constraint and multivariable nature of the LFC system, simultaneously. A new formulation of the MPC is presented to compensate time delay. The generation rate constraint is considered by employing a constrained MPC and economic allocation of the generation is further guaranteed by an innovative modification in the predictive control objective function. The effectiveness of proposed scheme is verified through time-based simulations on the standard 39-bus test system and the responses are then compared with the proportional-integral controller. The evaluation of the results reveals that the proposed control scheme offers satisfactory performance with fast responses.

APA, Harvard, Vancouver, ISO, and other styles

45

Huang, Mingfeng, Anfeng Liu, Tian Wang, and Changqin Huang. "Green Data Gathering under Delay Differentiated Services Constraint for Internet of Things." Wireless Communications and Mobile Computing 2018 (2018): 1–23. http://dx.doi.org/10.1155/2018/9715428.

Full text

Abstract:

Energy-efficient data gathering techniques play a crucial role in promoting the development of smart portable devices as well as smart sensor devices based Internet of Things (IoT). For data gathering, different applications require different delay constraints; therefore, a delay Differentiated Services based Data Routing (DSDR) scheme is creatively proposed to improve the delay differentiated services constraint that is missed from previous data gathering studies. The DSDR scheme has three advantages: first, DSDR greatly reduces transmission delay by establishing energy-efficient routing paths (E2RPs). Multiple E2RPs are established in different locations of the network to forward data, and the duty cycles of nodes on E2RPs are increased to 1, so the data is forwarded by E2RPs without the existence of sleeping delay, which greatly reduces transmission latency. Secondly, DSDR intelligently chooses transmission method according to data urgency: the direct-forwarding strategy is adopted for delay-sensitive data to ensure minimum end-to-end delay, while wait-forwarding method is adopted for delay-tolerant data to perform data fusion for reducing energy consumption. Finally, DSDR make full use of the residual energy and improve the effective energy utilization. The E2RPs are built in the region with adequate residual energy and they are periodically rotated to equalize the energy consumption of the network. A comprehensive performance analysis demonstrates that the DSDR scheme has obvious advantages in improving network performance compared to previous studies: it reduces transmission latency of delay-sensitive data by 44.31%, reduces transmission latency of delay-tolerant data by 25.65%, and improves network energy utilization by 30.61%, while also guaranteeing the network lifetime is not lower than previous studies.

APA, Harvard, Vancouver, ISO, and other styles

46

Harris, Ian G., and Alex Orailoglu. "Module Selection in Microarchitectural Synthesis for Multiple Critical Constraint Satisfaction." VLSI Design 5, no. 2 (1997): 167–82. http://dx.doi.org/10.1155/1997/81902.

Full text

Abstract:

Accurate design descriptions during synthesis allow efficient use of resources. The appropriate use of distinct implementations of RTL operators helps generate optimal VLSI designs. The system presented here utilizes libraries composed of multiple modules with identical functionality, but distinct performance and area characteristics. Such libraries allow the generation of an accurate estimate of the area and delay of the final design during synthesis. Full use of the module selection capability is possible by allowing the user to specify a total area limit rather than a detailed allocation. Consequently, tradeoffs between different allocations can be fully explored. Scheduling, module selection, and allocation are performed simultaneously to achieve optimal use of area and delay, and to facilitate the incorporation of lower level design considerations into behavioral synthesis. Synthesis decisions are made in a time-constrained and area-constrained fashion, by using both constraints to identify and avoid infeasible design possibilities. Module selection, scheduling, and allocation for pipelined designs is also implemented. Experimental results show that the use of module selection and time-and-area-constrained synthesis results in an area/delay design curve which is superior to the results of traditional systems.

APA, Harvard, Vancouver, ISO, and other styles

47

Rosa, Muhammad Ridho, Erwin Susanto, and Mohd Fadzil Hassan. "Networked control system stability analysis of pipeline system with networked-induced delay." EUREKA: Physics and Engineering, no. 6 (November 29, 2022): 74–83. http://dx.doi.org/10.21303/2461-4262.2022.002469.

Full text

Abstract:

This paper presents the design of Networked Control Systems (NCS) for pipeline systems. NCS plays an important role in controlling and monitoring large-scale systems such as pipeline systems. To implement the NCS, one must derive the pipe model and consider the network communication constraints. Here, the pipeline model is divided into two sections for simplicity. For example, in a long pipeline system, one can use a higher number of sections in order to give a better result for the analysis. Then let’s consider a networked-induced delay as the network communication constraint. The discretize pipe dynamics model is derived to support the NCS scheme in the pipeline system. The stability analysis of the proposed NCS is derived by taking into account the small and the large networked-induced delay. Then the optimal LQR control is designed for both stabilizing and tracking. The stability region of the pipeline system in the NCS scheme with networked-induced delay is derived and depicted to provide stability information. The design of the proposed controller under network constraint (networked-induced delay) must consider the stability plot that is divided into the stable region and unstable region. In this research, let’s assume that it is possible to measure the exact time delay and then consider the allowable sampling time for the controller. The proposed controller is designed by considering the NCS scheme with time delay both for regulator and tracking problems. By using the proposed controller, the pipeline system can be controlled in the presence of network-induced delay, which commonly occurs in a distributed system. The simulation verifies the stability analysis of the proposed optimal control for the pipeline systems with the NCS scheme under networked induced delay

APA, Harvard, Vancouver, ISO, and other styles

48

Rosa, Muhammad Ridho, Erwin Susanto, and Mohd Fadzil Hassan. "Networked control system stability analysis of pipeline system with networked-induced delay." EUREKA: Physics and Engineering, no. 6 (November 29, 2022): 74–83. https://doi.org/10.21303/2461-4262.2022.002469.

Full text

Abstract:

This paper presents the design of Networked Control Systems (NCS) for pipeline systems. NCS plays an important role in controlling and monitoring large-scale systems such as pipeline systems. To implement the NCS, one must derive the pipe model and consider the network communication constraints. Here, the pipeline model is divided into two sections for simplicity. For example, in a long pipeline system, one can use a higher number of sections in order to give a better result for the analysis. Then let's consider a networked-induced delay as the network communication constraint. The discretize pipe dynamics model is derived to support the NCS scheme in the pipeline system. The stability analysis of the proposed NCS is derived by taking into account the small and the large networked-induced delay. Then the optimal LQR control is designed for both stabilizing and tracking. The stability region of the pipeline system in the NCS scheme with networked-induced delay is derived and depicted to provide stability information. The design of the proposed controller under network constraint (networked-induced delay) must consider the stability plot that is divided into the stable region and unstable region. In this research, let's assume that it is possible to measure the exact time delay and then consider the allowable sampling time for the controller. The proposed controller is designed by considering the NCS scheme with time delay both for regulator and tracking problems. By using the proposed controller, the pipeline system can be controlled in the presence of network-induced delay, which commonly occurs in a distributed system. The simulation verifies the stability analysis of the proposed optimal control for the pipeline systems with the NCS scheme under networked induced delay

APA, Harvard, Vancouver, ISO, and other styles

49

Harko, Tiberiu, Zoltan Kovács, and Francisco S. N. Lobo. "Solar System tests of Hořava–Lifshitz gravity." Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 467, no. 2129 (2010): 1390–407. http://dx.doi.org/10.1098/rspa.2010.0477.

Full text

Abstract:

In the present paper, we consider the possibility of observationally constraining Hořava gravity at the scale of the Solar System, by considering the classical tests of general relativity (perihelion precession of the planet Mercury, deflection of light by the Sun and the radar echo delay) for the spherically symmetric black hole Kehagias–Sfetsos solution of Hořava–Lifshitz gravity. All these gravitational effects can be fully explained in the framework of the vacuum solution of Hořava gravity. Moreover, the study of the classical general relativistic tests also constrains the free parameter of the solution. From the analysis of the perihelion precession of the planet Mercury, we obtain for the free parameter ω of the Kehagias–Sfetsos solution the constraint ω ≥3.212×10 −26 cm −2 , the deflection of light by the Sun gives ω ≥4.589×10 −26 cm −2 , while the radar echo delay observations can be explained if the value of ω satisfies the constraint ω ≥9.179×10 −26 cm −2 .

APA, Harvard, Vancouver, ISO, and other styles

50

Németh, Balázs, and Balázs Sonkoly. "Advanced Computation Capacity Modeling for Delay-Constrained Placement of IoT Services." Sensors 20, no. 14 (2020): 3830. http://dx.doi.org/10.3390/s20143830.

Full text

Abstract:

A vast range of sensors gather data about our environment, industries and homes. The great profit hidden in this data can only be exploited if it is integrated with relevant services for analysis and usage. A core concept of the Internet of Things targets this business opportunity through various applications. The virtualized and software-controlled 5G networks are expected to achieve the scale and dynamicity of communication networks required by Internet of Things (IoT). As the computation and communication infrastructure rapidly evolves, the corresponding substrate models of service placement algorithms lag behind, failing to appropriately describe resource abstraction and dynamic features. Our paper provides an extension to existing IoT service placement algorithms to enable them to keep up with the latest infrastructure evolution, while maintaining their existing attributes, such as end-to-end delay constraints and the cost minimization objective. We complement our recent work on 5G service placement algorithms by theoretical foundation for resource abstraction, elasticity and delay constraint. We propose efficient solutions for the problems of aggregating computation resource capacities and behavior prediction of dynamic Kubernetes infrastructure in a delay-constrained service embedding framework. Our results are supported by mathematical theorems whose proofs are presented in detail.

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Delay constraint'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles