Relevant bibliographies by topics / Random communication delay

Academic literature on the topic 'Random communication delay'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Random communication delay.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Random communication delay"

1

Ge, Yuan, Qigong Chen, Ming Jiang, and Yiqing Huang. "Modeling of Random Delays in Networked Control Systems." Journal of Control Science and Engineering 2013 (2013): 1–9. http://dx.doi.org/10.1155/2013/383415.

Full text
Abstract:
In networked control systems (NCSs), the presence of communication networks in control loops causes many imperfections such as random delays, packet losses, multipacket transmission, and packet disordering. In fact, random delays are usually the most important problems and challenges in NCSs because, to some extent, other problems are often caused by random delays. In order to compensate for random delays which may lead to performance degradation and instability of NCSs, it is necessary to establish the mathematical model of random delays before compensation. In this paper, four major delay models are surveyed including constant delay model, mutually independent stochastic delay model, Markov chain model, and hidden Markov model. In each delay model, some promising compensation methods of delays are also addressed.
APA, Harvard, Vancouver, ISO, and other styles
2

Pang, Zhong-Hua, Zhen-Yi Liu, Zhe Dong, and Tong Mu. "An Event-Triggered Networked Predictive Control Method Using an Allowable Time Delay." Journal of Advanced Computational Intelligence and Intelligent Informatics 26, no. 5 (September 20, 2022): 768–75. http://dx.doi.org/10.20965/jaciii.2022.p0768.

Full text
Abstract:
An event-triggered network predictive control method, which uses allowable time delays, was developed for networked control systems with random network delays, packet disorders, and packet dropouts in the feedback and forward channels. In this method, random communication constraints are uniformly treated as a time delay at each time instant. Subsequently, based on a time-delay state feedback control law, the proposed method is used to actively compensate for the time delay that exceeds the allowable. In addition, the introduction of an event-triggered mechanism reduces communication loads and saves network resources. A necessary and sufficient stability condition for the closed-loop system is provided, which is independent of random time delays and is related to the allowable delay. Finally, the simulation results of the two systems verified the effectiveness of the proposed method.
APA, Harvard, Vancouver, ISO, and other styles
3

Malak, Derya, Howard Huang, and Jeffrey G. Andrews. "Throughput Maximization for Delay-Sensitive Random Access Communication." IEEE Transactions on Wireless Communications 18, no. 1 (January 2019): 709–23. http://dx.doi.org/10.1109/twc.2018.2885295.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zhang, Wen. "Application of Random Walk Model in Mobile Communication Data Optimization." Journal of Physics: Conference Series 2074, no. 1 (November 1, 2021): 012060. http://dx.doi.org/10.1088/1742-6596/2074/1/012060.

Full text
Abstract:
Abstract With the continuous development of society and economy, the development and application of mobile communications have become more and more popular, and more people have begun to use mobile devices for office, study and life. The quality of mobile communications network signals directly affects people’s experience of use. The scope of actual application has gradually increased with the renewal of the technology itself. Based on the random walk model, this paper constructs a mobile communication data optimization plan. Through data storage, transmission delay, and information total control, the optimization form of wireless network mobile communication data transmission performance is studied. Practice shows that this scheme can effectively improve communication quality and transmission efficiency.
APA, Harvard, Vancouver, ISO, and other styles
5

Seshadhri, S., and R. Ayyagari. "Dynamic controller for Network Control Systems with random communication delay." International Journal of Systems, Control and Communications 3, no. 2 (2011): 178. http://dx.doi.org/10.1504/ijscc.2011.039867.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Yan, and Junlin Xiong. "Optimal Decentralized Output-Feedback LQG Control With Random Communication Delay." IEEE Transactions on Cybernetics 50, no. 1 (January 2020): 338–50. http://dx.doi.org/10.1109/tcyb.2018.2868968.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chae, S., F. Rasool, S. K. Nguang, and A. Swain. "Robust mode delay-dependent ℋ∞ control of discrete-time systems with random communication delays." IET Control Theory & Applications 4, no. 6 (June 1, 2010): 936–44. http://dx.doi.org/10.1049/iet-cta.2009.0096.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Burkov, Artem, Seva Shneer, and Andrey Turlikov. "Lower bound for average delay in unblocked random access algorithm with orthogonal preambles." Information and Control Systems, no. 3 (June 15, 2020): 79–85. http://dx.doi.org/10.31799/1684-8853-2020-3-79-85.

Full text
Abstract:
Introduction: Currently, the first versions of 5G communication standard networks are being deployed and discussions are underway on the further development of cellular networks and the transition to the 6G standard. The work of the currently popular idea of ​​the Internet of Things (IoT) is supposed to be in the framework of a Massive Machine-Type Communications scenario, which has a number of requirements for operation characteristics: very high energy efficiency, relatively low delay and fairly reliable communication. It is assumed that random multiple access procedures are used, since, due to the nature of the traffic, it is impossible to develop a channel resource sharing policy. To increase the efficiency of random access, a class of unblocked algorithms using orthogonal preambles can be used. Purpose: to calculate the lower bound of the average delay for the class of unblocked random multiple access algorithms using orthogonal preambles. Methods: system analysis, a theory of random processes, queuing theory, and simulation. Results: A model of a system with a potentially unlimited number of users who use random unblocked access to transmit data over a common communication channel using orthogonal preambles is proposed. A closed expression is obtained for calculating the lower bound of the average delay in such a system depending on the intensity of the input arrival rate. The limit value of the intensity of the input arrival rate to which the system operates stably is determined. Shown are the results of simulation with respect to the obtained bound. Practical relevance: the obtained boundary allows us to estimate the lower average delay in the described class of algorithms. Its application allows us to determine the possibility of using the considered class of algorithms from the point of view of limitations on the average delay at the stage of designing random multiple access systems.
APA, Harvard, Vancouver, ISO, and other styles
9

D. Gangadhar, Nandyala, and Govind R. Kadambi. "Delay Distributions in Discrete Time Multiclass Tandem Communication Network Models." International journal of electrical and computer engineering systems 13, no. 6 (September 1, 2022): 417–25. http://dx.doi.org/10.32985/ijeces.13.6.1.

Full text
Abstract:
An exact computational algorithm for the solution of a discrete time multiclass tandem network with a primary class and cross-traffic at each queue is developed. A sequence of truncated Lindley recursions is defined at each queue relating the delays experienced by the first packet from consecutive batches of a class at that queue. Using this sequence of recursions, a convolve-and-sweep algorithm is developed to compute the stationary distributions of the delay and inter-departure processes of each class at a queue, delays experienced by a typical packet from the primary class along its path as well as the mean end-to-end delay of such a packet. The proposed approach is designed to handle the non-renewal arrival processes arising in the network. The algorithmic solution is implemented as an abstract class which permits its easy adaptation to analyze different network configurations and sizes. The delays of a packet at different queues are shown to be associated random variables from which it follows that the variance of total delay is lower bounded by the sum of variances of delays at the queues along the path. The developed algorithm and the proposed lower bound on the variance of total delay are validated against simulation for a tandem network of two queues with three classes under different batch size distributions.
APA, Harvard, Vancouver, ISO, and other styles
10

Yan, Ruixia, Zhong Wu, and Jinliang Liu. "Network-BasedH∞Filter Design for Linear System with Random Delays." Mathematical Problems in Engineering 2013 (2013): 1–9. http://dx.doi.org/10.1155/2013/340890.

Full text
Abstract:
This paper investigates the filtering problem for a class of network-based systems with random network-induced delays. The considered random delay between the sensor and the filter is assumed to be satisfying a certain stochastic characteristic. Considering the probability of the delay taking value in different intervals, a stochastic variable satisfying Bernoulli random binary distribution is introduced and a new system model is established by employing the information of the probability distribution. By using a properly constructed Lyapunov function, sufficient conditions for the existence of theH∞filters are presented in terms of linear matrix inequalities, which are dependent on the occurrence probability of both the random communication delays. The filter parameter is then characterized by the solution to a set of LMIs. A simulation example is employed to show the effectiveness of the proposed method.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Random communication delay"

1

Nuckols, John Eric. "Implementation of Geometrically Based Single-Bounce Models for Simulation of Angle-of-Arrival of Multipath Delay Components in the Wireless Channel Simulation Tools, SMRCIM and SIRCIM." Thesis, Virginia Tech, 1999. http://hdl.handle.net/10919/35989.

Full text
Abstract:
As the demand for wireless communication systems has exploded over the past few years, many researchers have taken on the challenge to model wireless channels more accurately. These models are very useful for enhancing the design of all aspects of wireless communications. Smart antennas and systems used in position location are among the most popular new studies that require signal information such as the amplitude, phase, and angle-of-arrival (AOA) of multipath delay spreads. For proper and efficient implementation of future systems, emerging wireless systems must be able to exploit processing of spatial information. The goal of the work presented in this thesis is to further improve two channel modeling tools, SMRCIM and SIRCIM, by implementing new geometrical models that provide users with angle-of-arrival information as well as amplitude and phase data for wideband wireless communication channels. The new angle-of-arrival models are explained and pseudo code is provided to demonstrate the software implementation of the models. Likewise, the channel models are explained and the usage and results of the simulation tools are described. The SMRCIM and SIRCIM tools are currently being used by researchers throughout the world.

[Vita removed March 5, 2012. GMc]
Master of Science

APA, Harvard, Vancouver, ISO, and other styles
2

Raghvendra, Potnis Varada. "Modelling and Performance Analysis of New Coolstreaming for P2P IPTV." Thesis, 2012. http://hdl.handle.net/2005/3175.

Full text
Abstract:
Peer to peer networks are becoming increasingly popular among Internet users as the downloading peers share the storage and upload bandwidth load of the system. This makes it possible for a large number of users to share a data file available at a server without the server upload bandwidth becoming a bottleneck. The P2P technology is being widely used not only for file sharing but also for video on demand, live streaming and IPTV. The delay deadlines are more stringent in live streaming and IPTV than those in file sharing as the traffic is real time. The performance perceived by a user depends upon whether the video stream is being downloaded at the streaming rate. Coolstreaming is the first large scale P2P IPTV system. We model the multi-channel Coolstreaming system via an open queueing network. The peer dynamics at a channel is modelled by a closed queueing network working at a faster rate. We compute the expected number of substreams in the overlay of New Coolstreaming which are not being received at the proper rate. The computation of the Markov chain with a very large state space is handled using the two time scale decomposition. Further we characterize the end to end delay encountered by a video stream originating from the server and received at a user of New Coolstreaming. Three factors contribute towards the delay. The first factor is the mean path length in terms of overlay hops of the partnership graph. The second factor is the mean number of routers between any two overlay peers in the network layer and the third factor is the queueing delay at a router in the Internet. The mean shortest path length in terms of overlay peers in the New Coolstreaming graph is shown to be O(logn)where nis the number of peers in the overlay. This is done by modelling the overlay by a random graph. The mean shortest path in terms of routers in the Internet’s router level topology is seen to be at most O(logNI)where NIis the number of routers in the Internet. We also discuss a method by which we can get the mean delay at a router in the Internet. Thus, the mean end to end delay in New Coolstreaming is shown to be upper bounded by O(lognlogNIE[W])where E[W]is the mean delay at a router in the Internet.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Random communication delay"

1

Srinivasan, Seshadhri, G. Saravanakumar, B. Subathra, N. Sundarajan, Ülle Kotta, Srini Ramasamy, and Valentina Emilia Balas. "Adaptive Controller for Networked Control Systems Subjected to Random Communication Delays." In Soft Computing Applications, 78–94. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-62521-8_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ingemarsson, Ingemar. "Delay Estimation for Truly Random Binary Sequences or How to Measure the Length of Rip van Winkle’s Sleep." In Communications and Cryptography, 179–86. Boston, MA: Springer US, 1994. http://dx.doi.org/10.1007/978-1-4615-2694-0_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cheng, Xue, and Li-Ying Zhao. "Observer-Based Controller Design for a Discrete Networked Control System with Random Delays." In Electronics, Communications and Networks V, 289–96. Singapore: Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-10-0740-8_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tan, Yushun, Jinliang Liu, and Yuanyuan Zhang. "Event-Triggered State Estimation for Complex Systems with Randomly Nonlinearities and Time-Varying Delay." In Communications in Computer and Information Science, 407–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-45261-5_43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Liang, Jinling, Zidong Wang, and Fan Wang. "Robust Finite-Horizon Filtering for 2-D Systems with Randomly Varying Sensor Delays." In Recursive Filtering for 2-D Shift-Varying Systems with Communication Constraints, 73–94. Boca Raton: CRC Press, 2021. http://dx.doi.org/10.1201/9781003189213-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Wei, Shuyi, Lei Zhu, Jingyi Guo, Shaobo Wei, Zhulin Shao, and Xiuxia Zhang. "Random Access Mechanism Based on Priority Discrimination in Internet of Things." In Advances in Transdisciplinary Engineering. IOS Press, 2022. http://dx.doi.org/10.3233/atde221019.

Full text
Abstract:
The prioritized random access mechanism has been researched in this paper. The current situation of large-scale node multiple access in the Internet of Things leaded to channel congestion and increased blocking rate. In M2M communication, there were a large number of nodes trying to RA. In this case, serious physical random access channel overload would occur, making it even difficult to access the network. Nodes spent a lot of time accessing the network, and even given resource management schemes could not guarantee acceptable end-to-end latency meet QoS guarantees. So, the traditional method has greater limitations in supporting different QoS in M2M communication, It would also have an unimaginable impact on the web, Therefore, it was necessary to propose a scheme to reduce the access delay while ensuring the success rate, The current priority-differentiated random access mechanism needed to consider how to match with the new features of M2M services. The reasonable random access scheme and efficiently manage the resource and allocated the channel were designed in the system where the traditional H2H service and the new M2M service coexist. The weights of different services were obtained by modeling and simulation. Therefore, by setting different threshold detecting preamble index matching service type and calling different back-off indexes to reduce the access collision, so as to optimize the random access mechanism. This study could make the node indicate its priority in the access process, and reduced the conflict and access delay. Under 5G communication technology, this solution would be widely used.
APA, Harvard, Vancouver, ISO, and other styles
7

Lokshina, Izabella. "Modeling and Simulation of Traffic with Integrated Services at Media Getaway Nodes in Next Generation Networks." In Advancements and Innovations in Wireless Communications and Network Technologies, 152–65. IGI Global, 2013. http://dx.doi.org/10.4018/978-1-4666-2154-1.ch012.

Full text
Abstract:
This paper is devoted to modeling and simulation of traffic with integrated services at media gateway nodes in the next generation networks, based on Markov reward models (MRM). The bandwidth sharing policy with the partial overlapped transmission link is considered. Calls arriving to the link that belong to VBR and ABR traffic classes, are presented as independent Poisson processes and Markov processes with constant intensity and/or random input stream, and exponential service delay time that is defined according to MRM. Traffic compression is calculated using clustering and learning vector quantification (e.g., self-organizing neural map). Numerical examples and simulation results are provided for communication networks of various sizes. Compared with the other methods for traffic compression calculations, the suggested approach shows substantial reduction in numerical complexity.
APA, Harvard, Vancouver, ISO, and other styles
8

Ambika M, Asifa Refasi A, Atchaya Devi S, Dhivya B, Leelarani KP, and Raghuraman G. "Intelligent Framework for Number Plate Detection and Recognition in Toll Using Image Processing Techniques." In Advances in Parallel Computing Technologies and Applications. IOS Press, 2021. http://dx.doi.org/10.3233/apc210139.

Full text
Abstract:
The revolution in communication and embedded systems Electronic Toll Collection, the new era of intelligent transportation systems enables the automatic collection of Toll fees from the prepaid account through RFID. Yet there is lack of security in the existing system, number plate detection and recognition can be made. In the existing system detection is made with condition random field algorithm. Recognition method is implemented by optical character recognition. A system can be designed to extract the number plate from vehicle automatically using image processing technique, match with database automatically and generate the One Time Password(OTP) and bill without any delay and identify the theft vehicles. This is done by using Image processing and motion capturing technology
APA, Harvard, Vancouver, ISO, and other styles
9

Manaseer, Saher S., Mohamed Ould-Khaoua, and Lewis M. Mackenzie. "On the Logarithmic Backoff Algorithm for MAC Protocol in MANETs." In Integrated Approaches in Information Technology and Web Engineering, 174–84. IGI Global, 2009. http://dx.doi.org/10.4018/978-1-60566-418-7.ch012.

Full text
Abstract:
In wireless communication environments, backoff is traditionally based on the IEEE binary exponential backoff (BEB). Using BEB results in a high delay in message transmission, collisions and ultimately wasting the limited available bandwidth. As each node has to obtain medium access before transmitting a message, in dense networks, the collision probability in the MAC layer becomes very high when a poor backoff algorithm is used. The Logarithmic algorithm proposes some improvements to the backoff algorithms that aim to efficiently use the channel and to reduce collisions. The algorithm under study is based on changing the incremental behavior of the backoff value. The Binary Exponential Backoff (BEB) is used by the Local Area Networks standards, IEEE 802.11, Medium Access Control (MAC). BEB uses a uniform random distribution to choose the backoff value; this often leads to reducing the effect of window size increment. This paper carries out a deeper study and analysis of the logarithmic backoff algorithm that uses logarithmic increment instead of exponential extension of window size to eliminate the degrading effect of random number distribution. Results from simulation experiments reveal that the algorithm subject to study achieves higher throughput and less packet loss when in a mobile ad hoc environment.
APA, Harvard, Vancouver, ISO, and other styles
10

Jia, Yunyi. "Design and Implementation for Controlling Multiple Robotic Systems by a Single Operator Under Random Communication Delays." In Rapid Automation, 337–51. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-8060-7.ch015.

Full text
Abstract:
Multiple robots can be tele-operated by a single operator to accomplish complicated tasks such as formation and co-transportation. Such systems are challenging because one operator needs to simultaneously tele-control multiple homogeneous and even heterogeneous robots. Besides, the communication between the operator and multi-robot system and the communication among the multiple robots are always subject to some communication constraints such as time delays. This chapter introduces a novel non-time based method to realize the single-operator-multi-robot (SOMR) teleoperation system with random communication delays. The problem is divided into a typical teleoperation problem and a multi-robot coordination problem. A non-time variable is taken as the system reference instead of the time to model and drive the system such that the random communication delays and some expected events could be automatically handled. Experiments implemented on a multi-robot system illustrate the effectiveness and advantages of the method.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Random communication delay"

1

Bengtsson, Fredrik, Babak Hassibi, and Torsten Wik. "LQG control for systems with random unbounded communication delay." In 2016 IEEE 55th Conference on Decision and Control (CDC). IEEE, 2016. http://dx.doi.org/10.1109/cdc.2016.7798406.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yasodharan, Sarath, Vineeth Bala Sukumaran, and Chandramani Singh. "Stability and delay analysis of delay tolerant networks with random message arrivals." In 2017 9th International Conference on Communication Systems and Networks (COMSNETS). IEEE, 2017. http://dx.doi.org/10.1109/comsnets.2017.7945399.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Szwaykowska, K., L. Mier-y-Teran-Romero, and I. B. Schwartz. "Patterned dynamics of delay-coupled swarms with random communication graphs." In 2015 54th IEEE Conference on Decision and Control (CDC). IEEE, 2015. http://dx.doi.org/10.1109/cdc.2015.7403243.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Choi, Hoesang, and Hichan Moon. "Simulation on Delay of Several Random Access Schemes." In 2019 International Conference on Artificial Intelligence in Information and Communication (ICAIIC). IEEE, 2019. http://dx.doi.org/10.1109/icaiic.2019.8669030.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Karzand, Mohammad, and Douglas J. Leith. "Low delay random linear coding over a stream." In 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 2014. http://dx.doi.org/10.1109/allerton.2014.7028499.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Han, Cunwu, Dehui Sun, and Zhijun Li. "Adaptive predictive power control for wireless communication systems with random delay." In 2010 International Symposium on Computer, Communication, Control and Automation (3CA). IEEE, 2010. http://dx.doi.org/10.1109/3ca.2010.5533834.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gao, Shengnan, Gang Chen, Hai Li, and Ling Zhuo. "Random access delay optimization of PDT digital trunking system." In 2017 7th IEEE International Conference on Electronics Information and Emergency Communication (ICEIEC). IEEE, 2017. http://dx.doi.org/10.1109/iceiec.2017.8076524.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ting, Liu, Jiang Shun, and Pan Feng. "Analysis and design of the time-delay compensation for networked control systems with random communication delay." In 2016 35th Chinese Control Conference (CCC). IEEE, 2016. http://dx.doi.org/10.1109/chicc.2016.7554502.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Qiao, Wei, and Rifat Sipahi. "Responsible Eigenvalue Approach for Stability Analysis and Control Design of a Single-Delay Large-Scale System With Random Coupling Strengths." In ASME 2010 Dynamic Systems and Control Conference. ASMEDC, 2010. http://dx.doi.org/10.1115/dscc2010-4082.

Full text
Abstract:
A class of linear time-invariant (LTI) consensus system with multiple agents and communication delays among the agents is studied. The delay margin of this MIMO system, that is, the largest amount of the delay that the system can withstand without loosing stability, can be studied by the authors’ Responsible Eigenvalue (RE) concept. RE is able to compress the considered stability problem into the stability problem of a single agent system, from which RE captures the delay margin of the entire MIMO system. RE is used here to design controllers for the MIMO system for the objective of increasing the delay margin. Case studies demonstrate connections between coupling strengths, graph Laplacian, the delay margin of a large-scale consensus system, and control synthesis.
APA, Harvard, Vancouver, ISO, and other styles
10

Abadi, Nastaran, Amin Aminzadeh Gohari, Mahtab Mirmohseni, and Masoumeh Nasiri-Kenari. "Zero-error codes for multi-type molecular communication in random delay channel." In 2018 Iran Workshop on Communication and Information Theory (IWCIT). IEEE, 2018. http://dx.doi.org/10.1109/iwcit.2018.8405050.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Random communication delay' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography