Effect Of Packet Loss Research Articles

A Cognitive Control Approach for Networked Control Systems with Random Packet Losses

AbstractThis paper presents a novel hybrid cognitive control method inspired by human brain mechanism for networked control systems (NCSs) with random packet dropouts. The random packet losses are assumed to occur in both channels from sensor to controller and from controller to actuator. Different from most of the existing studies, the information entropy is utilized to characterize the uncertainties of the random packet dropouts. A hybrid cognitive control model is designed for NCSs subject to random packet losses. More specifically, the proposed hybrid cognitive control algorithm is constructed by using the Q‐learning and backstepping control simultaneously. That is, the Q‐learning is employed for the cognitive controller to regulate the backstepping controller and meantime act on the control object. In addition, the information gap is defined based on the information entropy, and used for depicting the uncertainties of the random packet dropouts. Simulation results are performed to validate the designed hybrid cognitive control method, demonstrating that it can eliminate the effects of packet losses and thus performs better than the traditional backstepping or proportional‐integral‐derivative (PID) controllers.

D-OLIA: A Hybrid MPTCP Congestion Control Algorithm with Network Delay Estimation.

With the recent evolution of mobile technology, modern devices equipped with multiple communication interfaces have become popular. The multipath transmission control protocol (MPTCP) has evolved to facilitate multiple communication interfaces through a single TCP connection for faster Internet access. MPTCP congestion control algorithms (MPTCP-CCAs) control data flow by fulfilling three design goals, i.e., ensuring improvement over single-path flows, ensuring fairness, and balancing congestion. Current MPTCP-CCAs cannot fulfill these design goals. For example, the opportunistic-linked increase algorithm (OLIA), a well-known MPTCP-CCA in load balancing, often results in low throughput because it cannot properly utilize the underlying network. In addition, the current Internet has a rapidly changing characteristic due to a large amount of short-lived traffic, making it difficult for MPTCP-CCAs to cope. An awareness of prevailing network delay conditions might help MPTCP-CCAs to utilize the network capacity fully. Therefore, we propose dynamic OLIA (D-OLIA), a hybrid MPTCP-CCA that enhances the performance of OLIA by integrating an awareness of the current network delay condition for deciding the congestion window (CWND) decrease factor. We estimate the current network delay condition, i.e., less-congested or congested, by observing the changes in the round-trip-time (RTT). Based on the estimated network delay condition, we decide the CWND decrease factor in real-time for reducing the CWND during packet loss events. We implemented D-OLIA in the Linux kernel and experimented using the Mininet emulator. The emulation results demonstrate that D-OLIA successfully estimates current network delay conditions and results in approximately a 20% increased throughput compared to the original OLIA. Compared to certain MPTCP-CCAs, it also yields a highly improved performance in terms of throughput, RTT, packet retransmissions, and fairness among the MPTCP sub-flows.

Application Layer ARQ Algorithm for Real-Time Multi-Source Data Streaming in UAV Networks.

Because of the specific characteristics of Unmanned Aerial Vehicle (UAV) networks and real-time applications, the trade-off between delay and reliability imposes problems for streaming video. Buffer management and drop packets policies play a critical role in the final quality of the video received by the end station. In this paper, we present a reactive buffer management algorithm, called Multi-Source Application Layer Automatic Repeat Request (MS-AL-ARQ), for a real-time non-interactive video streaming system installed on a standalone UAV network. This algorithm implements a selective-repeat ARQ model for a multi-source download scenario using a shared buffer for packet reordering, packet recovery, and measurement of Quality of Service (QoS) metrics (packet loss rate, delay and, delay jitter). The proposed algorithm MS-AL-ARQ will be injected on the application layer to alleviate packet loss due to wireless interference and collision while the destination node (base station) receives video data in real-time from different transmitters at the same time. Moreover, it will identify and detect packet loss events for each data flow and send Negative-Acknowledgments (NACKs) if packets were lost. Additionally, the one-way packet delay, jitter, and packet loss ratio will be calculated for each data flow to investigate the performances of the algorithm for different numbers of nodes under different network conditions. We show that the presented algorithm improves the QoS of the video data received under the worst network connection conditions. Furthermore, some congestion issues during deep analyses of the algorithm’s performances have been identified and explained.

Resolving Persistent Packet Collisions through Broadcast Feedback in Cellular V2X Communication

The Third Generation Partnership Project (3GPP) Release 16 defines the sensing-based semi-persistent scheduling (SPS) as the resource allocation scheme for Sidelink Mode 2 in New Radio (NR)-based vehicle-to-everything (V2X) communication. A well-known issue in Mode 2 is the persistent packet collision that results from two or more vehicles repeatedly using the same resource for transmission. It may create serious safety problems when the vehicles are in a situation where only the broadcast safety beacons can assist in driving. To resolve this issue, a solution that relies on the feedback from neighboring vehicles is proposed, through which the vehicles suffering from persistent packet collisions can quickly part and select other resources. Extensive simulations show that the proposed broadcast feedback scheme reduces persistent packet collisions by an order of magnitude compared to SPS, and it is achieved without sacrificing the average packet reception ratio (PRR). Namely, it is the quality aspect (i.e., burstiness) of the packet collisions that the proposed scheme addresses rather than the quantity (i.e., total number of collision losses). By preventing extended packet loss events, the proposed scheme is expected to serve NR V2X better, which requires stringent QoS in terms of the information update delay thereby helping to reduce the chances of vehicle crashes.

Effect of Backhaul Technologies on 3G Network Performance: A Case Study of Ado-Ekiti

In the past years, when wireless network improvement occurs from 1G/2G to third generation (3G), the rate in the use of real-time traffic oriented applications for voice, video and data increases. Consequently, the bandwidth to be backhauled from the cell site to the mobile switching center increases rapidly. 3G network is most prevalent in Nigeria with wide area of coverage. However, in recent times, poor subscribers’ mobile broadband experience is still the major challenge faced by many GSM operators. One of the major causes of this challenge is the use of wrong backhaul for radio access network (RAN). This lead to poor traffic throughput, high packet loss or frame loss at the cell edge. To overcome this challenge, the use of appropriate backhaul technology is crucial. Third Generation Partnership Program (3GPP) recommends the use of either asynchronous transfer mode (ATM) or internet protocol (IP) as the backhaul technologies for its RAN. This paper presents the performance analysis and the comparison of the ATM RAN and IP RAN backhaul technologies using six different 3G sites (with 3G base stations) located at Ado local government area of Ekiti State, Nigeria. The performance of each base station with different backhaul technology was evaluated in term of average maximum throughput per day. The effect of frame loss (for ATM RAN network) and packet loss (for IP RAN network) on traffic throughput were also analyzed. The comparison of the overall result analysis shows that the 3G base stations with IP-based RAN backhaul has better performance than the base station with ATM-based RAN backhaul.

SRv6-PM: A Cloud-Native Architecture for Performance Monitoring of SRv6 Networks

Segment Routing over IPv6 (SRv6 in short) is a networking architecture suitable for both IP backbones and datacenters. The research, standardization and implementation of this architecture are actively progressing and SRv6 is already adopted in a number of large scale deployments. Effective solutions for Performance Monitoring (PM) of SRv6 networks are strongly needed and there is a lot of activity in this area. A full blown Performance Monitoring solution needs to include: i) Data Plane (as needed to measure metrics such as packet loss and delay); ii) Control Plane (to send commands to the monitoring entities in the nodes); iii) Management Plane (e.g., to collect the measured metrics). Moreover, Big-Data tools and solutions can be applied inside or above the traditional Management Plane boundaries to store and analyze the collected data. In this article we describe SRv6-PM, a solution for Performance Monitoring of SRv6 networks that deals with all the aspects discussed above. SRv6-PM features a cloud-native architecture that supports: i) the ingestion, processing, storage and visualization of PM data using Big-Data tools; ii) the SDN-based control of network routers to drive the performance monitoring operations. In particular, we focus on Loss Monitoring and consider a solution capable of tracking single packet loss events operating in near-real time (e.g., with a time granularity in the order of 10-20 seconds). SRv6-PM is released as open source. We offer a re-usable and extensible platform that can be automatically deployed in different environments, from a single host to multiple servers on private/public clouds and includes a set of Big-Data tools and the SDN control plane. We also provide a reproducible Data Plane environment for PM experiments in SRv6 networks based on the Mininet emulator.

Modeling and analyzing RFID Generation-2 under unreliable channels

EPCglobal Class-1 Generation-2 (RFID Generation-2) is a wireless communication system in Internet of Things. The models and analyses of RFID Generation-2 are important and have been reported. However, for usefulness and validity, existing models and analyses are mainly based on the assumptions that RFID runs in ideal wireless channels (no packet loss, no error code, and no capture effect). However, there are three co-existing these bad results (packet loss, error code, and capture effect) in the realistic channels, which means that the channels are unreliable. For obtaining comprehensive understanding of RFID Generation-2 performance to conduct relevant important researches, some models are developed for RFID Generation-2 under the unreliable channels. Meanwhile, four feasible methods for calculating the probabilities of those bad results (as models parameters) are given. After validating accuracy of the models through extensive simulation experiments and their fitness for an instance, these models are used to analyze impacts of the parameters on time efficiency, and obtain some key sensitivity factors promoting efficiency. Furthermore, analytical results demonstrate that the analyses considering those co-existing bad results are basis for the researches of some fields such as the general tag identification, the blocked tags identification, the missing tag identification, and the effective hardware design.

Output Tracking Control of Single-Input-Multioutput Systems Over an Erasure Channel.

The output tracking control problem is investigated in this article. First, a new tradeoff performance index is presented for single-input-multioutput (SIMO) systems. Based on the frequency-domain method, the tracking performance limitations under time delay, packet loss, and channel noise effects are derived. We use a bivariate stochastic process to model the packet loss, and assume that channel noise is additive white Gaussian noise (AWGN). Two explicit expressions of the best tradeoff performance are given with the single-degree-of-freedom (SDOF) and two-degree-of-freedom (TDOF) control structures. It is shown that the tracking control performance has a close relation with the intrinsic characteristic of the plant, as well as the time delay, packet-dropouts rate, and power spectral density of AWGN. We also demonstrate that compared with the SDOF control structure, the TDOF control structure can improve the systems' attainable performance. A simulation example is finally discussed to validate the conclusions.

Simulation and field testing of multiple vehicles collision avoidance algorithms

A global planning algorithm for intelligent vehicles is designed based on the A&#x002A algorithm, which provides intelligent vehicles with a global path towards their destinations. A distributed real-time multiple vehicle collision avoidance &#x0028 MVCA &#x0029 algorithm is proposed by extending the reciprocal n-body collision avoidance method. MVCA enables the intelligent vehicles to choose their destinations and control inputs independently, without needing to negotiate with each other or with the coordinator. Compared to the centralized trajectory-planning algorithm, MVCA reduces computation costs and greatly improves the robustness of the system. Because the destination of each intelligent vehicle can be regarded as private, which can be protected by MVCA, at the same time MVCA can provide a real-time trajectory planning for intelligent vehicles. Therefore, MVCA can better improve the safety of intelligent vehicles. The simulation was conducted in MATLAB, including crossroads scene simulation and circular exchange position simulation. The results show that MVCA behaves safely and reliably. The effects of latency and packet loss on MVCA are also statistically investigated through theoretically formulating broadcasting process based on one-dimensional Markov chain. The results uncover that the tolerant delay should not exceed the half of deciding cycle of trajectory planning, and shortening the sending interval could alleviate the negative effects caused by the packet loss to an extent. The cases of short delay &#x0028 less than 100 ms &#x0029 and low packet loss &#x0028 less than 5&#x0025 &#x0029 can bring little influence to those trajectory planning algorithms that only depend on V2V to sense the context, but the unpredictable collision may occur if the delay and packet loss are further worsened. The MVCA was also tested by a real intelligent vehicle, the test results prove the operability of MVCA.

Fading Channel Signal-to-Noise Ratio Limitation for Closed-Loop Stabilizability

Explicit communication channels in the feedback loop introduce new key elements such as channel input power, channel variable gain, channel bandwidth, additive channel noise, transmission rate, quantization, packet losses, etc. In this article, we propose a stationary signal-to-noise ratio (SNR) analysis for the fading channel model. The channel SNR can be connected with most communication issues such as channel input power, additive channel noise, and quantization noise. Recently, a power analysis has also been used to characterize for every instant the effect of packet losses and channel fading. Here, we propose an equivalent average channel model that preserves the first and second moments of a fading channel output in steady state. The proposed equivalency is stated initially in an open loop, and then, with the assumption of a plant model with a relative degree greater or equal to one, extended to the closed-loop feedback allowing a stationary SNR analysis. As a result, we can compute the fading channel SNR for closed-loop stabilizability limitation, and then consider the presence of disturbance and setpoint signals.

Feature Extraction to Identify Network Traffic with Considering Packet Loss Effects

Feature Extraction to Identify Network Traffic with Considering Packet Loss Effects

Influence and Optimization of Packet Loss on the Internet-Based Geographically Distributed Test Platform for Fuel Cell Electric Vehicle Powertrain Systems

In view of recent developments in fuel cell electric vehicle powertrain systems, Internet-based geographically distributed test platforms for fuel cell electric vehicle powertrain systems become a development and validation trend. Due to the involvement of remote connection and the Internet, simulation with connected models can suffer great uncertainty because of packet loss. Such a test platform, including packet loss characteristics, was built using MATLAB/Simulink for use in this paper. The simulation analysis results show that packet loss affects the stability of the whole test system. The impact on vehicle speed is mainly concentrated in the later stage of simulation. Aiming at reducing the effect of packet loss caused by Internet, a robust model predictive compensator was designed. Under this compensator, the stability of the system is greatly improved compared to the system without a compensator.

Observer-based sliding mode control for discrete nonlinear systems with packet losses: an event-triggered method

In this paper, the observer-based output feedback sliding mode control (SMC) problem is investigated for discrete delayed nonlinear systems subject to packet losses under the event-triggered strategy. It is assumed that the packet losses may occur in the control channel from the sensor to the observer. A suitable compensation strategy via the Bernoulli distributed random variable is used to reduce the effects of packet losses. In order to avoid the phenomenon of network congestion during the networked transmission, an event-triggered mechanism is introduced to determine if the last released measurement needs to be updated. Based on the zero-order-hold (ZOH) measurement, an output feedback observer is designed to reconstruct the system state. This method can facilitate the design of the discrete-time sliding surface. A sufficient condition is proposed to guarantee the stochastic stability of sliding mode dynamics systems by using linear matrix inequality (LMI) method, and a novel observer-based sliding mode controller is synthesized to force the trajectories of the error systems onto the pre-designed sliding mode surface within finite time. Finally, an example is given to illustrate the validity of the proposed theoretical result.

Adaptive Transmission for Network-Coded All-to-All Broadcast in Multi-Hop Ad Hoc Wireless Networks

We describe and evaluate a new suite of protocols for the delivery of information from each node to every other node in a multi-hop ad hoc wireless network. The protocol suite is integrated with random linear network coding to mitigate the effects of packet losses due to noise and time-varying fading on the radio links. The suite includes a practical three-mode protocol for packet-by-packet selection of the channel code and modulation based on control information from statistics derived by the nodes themselves. Our performance metric is energy efficiency, and our emphasis is on robust performance in practical networks for which optimization is not feasible.

Enhanced Intersystem Handover Algorithm for Heterogeneous Wireless Networks

Current and future wireless network architectures consist of several access technologies to support numerous traffic types and enable mobile devices to be connected anytime, anywhere. However, providing a rapid seamless connectivity and service continuity between such various access technologies remains a challenge. This is mainly because the previously proposed handover algorithms have failed to predict the future values of the measured received signal strength needed for rapid handover process. In addition, existing handover algorithms are not adaptable to the changes of the network conditions and user preferences. This leads to erroneous network selection, packet loss, and ping-pong effect due to high-ranking abnormality. In this study, an intersystem handover (IH) algorithm has been designed by integrating grey prediction theory, multiple-attribute decision making, fuzzy analytic hierarchy process, and multi-objective optimization ratio analysis. Network Simulator 2 has been applied to evaluate the performance of the proposed IH algorithm when compared to the fuzzy logic-based vertical handover (FLBVH) algorithm and the adaptive neuro-fuzzy inference system (ANFIS) algorithm. On average, the proposed IH algorithm has shown 1.1 s handover delay, 5% packet loss, 1.6% probability of ping-pong effect, and 97.8% better throughput performance than the ANFIS algorithm and FLBVH algorithm, respectively, for a 100-s time interval.

Quantized event‐triggered H∞ control of linear networked systems with time‐varying delays and packet losses

SummaryThis paper studies the event‐triggered (ET) H∞ control of linear networked systems based on static output‐feedback. An emulation‐based stabilization of the networked system is investigated under the constraints such as (i) quantizations, (ii) network‐induced delays, (iii) external disturbances, and (iv) packet losses. In particular, output measurement and control input quantizations, lower and upper bounds of the network‐induced delays, bounded external disturbances, and packet losses are carefully taken into account. The process of stability analysis has three steps. In the first step, a quantized ET control is defined, and then three sector‐bound methods for logarithmic quantization are formulated. In the second step, the ET‐mechanism is described with an input delay model. Based on the model, for two approaches, namely, switching‐ET and periodic‐ET, the criteria for the exponential stability and L2‐gain analysis of perturbed networked system are established, respectively. In the third step, a constraint for packet loss effect is provided. In summary, the stability analysis is based on linear matrix inequalities (LMIs) through a Lyapunov‐Krasovskii functional method. Finally, the simulation results are given to evaluate the validation of the analysis using two benchmark examples.

Output‐feedback‐based sliding mode control for networked control systems subject to packet loss and quantization

AbstractIn this paper, observer‐based sliding mode control is considered for networked control systems subject to quantization, in which packet dropout may happen when the measurement output is transmitted from the sensor to the controller. Firstly, a compensating scheme is proposed to deal with the effect of packet loss modelled as a Bernoulli process. Then, by means of available output information and state observer, the desirable sliding mode controller is designed. Furthermore, both the reachability and the stochastic stability of sliding mode dynamics can be attained and the corresponding sufficient conditions are derived. Finally, numerical simulation results are provided to illustrate the proposed control law.

Robust Consensus-Based Distributed Energy Management for Microgrids With Packet Losses Tolerance

The well-developed consensus algorithm provides an elegant distributed way for solving the energy management problem. The convergence of the consensus-based distributed approach depends on the reliable exchange of the information with neighbors. This assumption might be violated in practice due to inevitable and random packet losses. In this paper, the impact of packet losses on the consensus-based distributed approach is analyzed. We show the iterative calculation converges to an incorrect solution in the presence of packet losses, where the power supply could not meet with the demand. More importantly, we find the error in the final result is accumulated over every packet loss event, and we identify the critical information that cause the error. Based on the analysis, a corrective method is proposed to assure convergence to the right schedule. The corrective method has two features: 1) it uses the original consensus network, and no communication reconfiguration is needed; and 2) no retransmissions for the lost packets are needed, instead, the errors are compensated by a new variable introduced in the update rule. We show that the proposed algorithm could achieve the optimal solution in the presence of packet losses. Numerical simulation results are used to validate the proposed algorithm.

Unequal loss protection scheme using a quality prediction model in a Wi-Fi broadcasting system

Wireless local area network–based broadcasting techniques are a type of mobile Internet Protocol television technology that simultaneously transmits multimedia content to local users. Contrary to the existing wireless local area network–based multimedia transmission systems, which transmit multimedia data to users using unicast packets, a wireless local area network–based broadcasting system is able to transmit multimedia data to many users in a single broadcast packet. Consequently, network resources do not increase with the increase in the number of users. However, IEEE 802.11 does not provide a packet loss recovery algorithm for broadcast packet loss, which is unavoidable. Therefore, the forward error correction technique is required to address the issue of broadcast packet loss. The broadcast packet loss rate of a wireless local area network–based broadcasting system that transmits compressed multimedia data is not proportional to the quality deterioration of the received video signals; therefore, it is difficult to predict the quality of the received video while also considering the effect of broadcast packet loss. In this scenario, allocating equal forward error correction packets to compressed frames is not an effective method for recovering broadcast packet loss. Thus, several studies on unequal loss protection have been conducted. This study proposes an effective, prediction-based unequal loss protection algorithm that can be applied to wireless local area network–based broadcasting systems. The proposed unequal loss protection algorithm adopts a novel approach by adding forward error correction packets to every transmission frame while considering frame loss. This algorithm was used as a new metric to predict video quality deterioration, and an unequal loss protection structure was designed, implemented, and verified. The effectiveness of the quality deterioration model and the validity of the unequal loss protection algorithm were demonstrated through experiments.

A Survey of Delay-Based and Hybrid TCP Congestion Control Algorithms

Congestion control (CC) has a significant influence on the performance of transmission control protocol (TCP) connections. Over the last three decades, many researchers have extensively studied and proposed a multitude of enhancements to standard TCP CC. However, this topic still inspires both academic and industrial research communities due to the change in Internet application requirements and the evolution of Internet technologies. The standard TCP CC infers network congestion based on packet loss events which leads to long queuing delay when bottleneck buffer size is large. A promising solution to this problem is to use the delay signal (RTT or one-way delay measurements) to infer congestion earlier and react to the congestion before the queuing delay reaches a high value. In this survey paper, we describe the delay signal and the algorithms that completely or partially utilize this type of signal. Additionally, we illustrate standard CC and modern active queue management (AQM) principles and discus the interaction between AQM and the delay signal.