Average Packet Loss Probability Research Articles

Radio Access Mechanism for Massive Internet of Things Services Over White Spaces

This paper proposes a novel radio access mechanism for massive Internet of Things (IoT) services over TV White Spaces (TVWS). The proposal considers TVWS as the suitable frequency bands for facing the limited-spectrum problem in massive IoT services. The radio access mechanism is based on regulatory policies by interacting with a TVWS Geolocation Database through the Protocol to Access White-Space (PAWS) and using several Master Devices (MD)s. With this approach, IoT devices require neither geolocation receiver in the deployments, nor different frequency bands for initialization process within PAWS. Regarding the evaluation of the radio access mechanism, we explore different types of deployments and coverage areas. This paper also describes the optimization process to obtain the maximum service area, while maintaining an outage probability below a given objective. Moreover, we evaluate the performance of a loaded network with the maximum service area, with respect to a reference case with one MD. We evidence that the average packet loss probability is reduced by 26% when the load is equal to 80% in our proposal.

Self-configuration and self-optimization process with taguchi method in hybrid optical wireless network

<p>In this paper, an alternative improvement is proposed which is the adaptive wireless access networks-based optical backhaul convergence that will greatly promote to use the existing resource of MANET (mobile ad hoc network). However, these characteristics itself acts as a drawback to the MANET applications such as the random distribution of nodes and continuously changing topology. MiNiTab statistical software was used to model the effect of the parameter variation to predict the field quality through the design of experiments while OMNeT++ network simulation was created to visualize the effect of QoS performance study in response with varying speed scenario. The result shows that the proposed ESCMDR scheme can obtain robustness and outperformed compared to the non-Taguchi previous study when it is used in random waypoint mobility model in any speed of sources. The work is based on Packet Delivery Ratio (PDR) and Packet Loss Probability (PLP) metric under the varying speed scenario. It results in better QoS network PDR of 28.9% improvement, with 83.56% improvement on average PLP. The paper shows that the MANET QoS performance constrained can be addressed with the self-configured data rate of integrated optimization with Taguchi method on AODV-UU (Adhoc On Demand Distance Vector-Uppsala University) routing technique.</p>

A robust fractional-order PID controller design based on active queue management for TCP network

ABSTRACTIn this paper, a robust fractional-order controller is designed to control the congestion in transmission control protocol (TCP) networks with time-varying parameters. Fractional controllers can increase the stability and robustness. Regardless of advantages of fractional controllers, they are still not common in congestion control in TCP networks. The network parameters are time-varying, so the robust stability is important in congestion controller design. Therefore, we focused on the robust controller design. The fractional PID controller is developed based on active queue management (AQM). D-partition technique is used. The most important property of designed controller is the robustness to the time-varying parameters of the TCP network. The vertex quasi-polynomials of the closed-loop characteristic equation are obtained, and the stability boundaries are calculated for each vertex quasi-polynomial. The intersection of all stability regions is insensitive to network parameter variations, and results in robust stability of TCP/AQM system. NS-2 simulations show that the proposed algorithm provides a stable queue length. Moreover, simulations show smaller oscillations of the queue length and less packet drop probability for FPID compared to PI and PID controllers. We can conclude from NS-2 simulations that the average packet loss probability variations are negligible when the network parameters change.

Probabilistic QOS Aware Congestion Control in Wireless Multimedia Sensor Networks

The general problem faced in the field of Wireless Multimedia Sensor Networks (WMSNs) is congestion. The most common method in the area of WMSNs to minimize congestion is traffic control. Quality Of Service (QOS) is widely used in WMSNs to guarantee preferential service for critical applications by controlling end-to-end delay, reducing data loss and by providing adequate bandwidth. The present work is on Probabilistic QOS Aware Congestion Control (PQACC) which employs probabilistic method based congestion prediction and priority based data transmission rate adjustment, where inelastic real-time traffic and elastic non-real-time traffic are treated separately. Using the present PQACC approach, average throughput, average source-to-sink delay and average packet loss probability are improved by 9%, 10.33% and 16.03% compared to EWPBRC and achieved 5.97%, 7.05% and 11.69% improvement compared to FEWPBRC. Simulation result reveals that, congestion is effectively predicted, controlled and provides necessary level of QOS in terms of delay, throughput and packet loss, hence making this approach possible in mission critical applications.

Using Two-Dimensional Markov Models and the Effective-Capacity Approach for Cross-Layer Design in AMC/ARQ-Based Wireless Networks

This paper proposes a novel framework for the cross-layer analysis and design of wireless networks combining adaptive modulation and coding (AMC) at the physical layer with an automatic repeat request (ARQ) protocol at the data-link layer. Most previous works rely on first-order amplitude-based finite-state Markov chains (AFSMCs) to model the physical layer. It is shown that these models present several deficiencies that could compromise the design of higher layer protocols. Thus, a physical-layer first-order 2-D Markov model using both the amplitude and the rate of change of the fading envelope is presented. Based on this multidimensional physical-layer Markov model, the quality-of-service (QoS) performance at the data-link layer is investigated through the use of two different approaches. The first one relies on an analytical framework based on a discrete-time Markov chain (DTMC) that jointly describes the statistical behavior of the arrival process, the queueing system, and the physical layer. The second one is based on the effective-bandwidth and effective-capacity theories. Both the DTMC-based and the effective-bandwidth/capacity-based approaches are analyzed and compared in combination with our proposed physical-layer first-order 2-D Markov model in a cross-layer design aiming to satisfy the required average packet loss probability constraint by maximizing the average throughput of the system. Numerical results show that our proposed framework represents a significant improvement over previous models.

A Scheduling Algorithm for Minimizing the Packet Error Probability in Clusterized TDMA Networks

We consider clustered wireless networks, where transceivers in a cluster use a time-slotted mechanism (TDMA) to access a wireless channel that is shared among several clusters. An approximate expression for the packet-loss probability is derived for networks with one or more mutually interfering clusters in Rayleigh fading environments, and the approximation is shown to be good for relevant scenarios. We then present a scheduling algorithm, based on Lagrangian duality, that exploits the derived packet-loss model in an attempt to minimize the average packet-loss probability in the network. Computer simulations of the proposed scheduling algorithm show that a significant increase in network throughput can be achieved compared to uncoordinated scheduling. Empirical trials also indicate that the proposed optimization algorithm almost always converges to an optimal schedule with a reasonable number of iterations. Thus, the proposed algorithm can also be used for bench-marking suboptimal scheduling algorithms.

QoS-sensitive admission policy for non-real-time data packets in voice/data integrated CDMA systems

In this paper, we propose the QoS-sensitive admission threshold method for the transmission of the non-real-time data packet in voice/data mixed CDMA systems while guaranteeing the QoS requirements. The proposed admission scheme fully utilizes the remaining resources after serving the voice users for transmitting non-real-time data packet while meeting the QoS requirements for both services. The system performance of the proposed scheme is measured in terms of the average data throughput, the average delay and the average packet loss probability of data traffic while the outage probability of voice is maintained to be less than the predetermined value. In addition, we investigate the effect of the admission threshold level on the system performances.