Time-Dependent Analysis of the Multiple-Route Packet Combining Scheme in Wireless Multihop Networks

In this paper, we apply the multiple-route packet combining scheme (In Proceedings of the 1st International Symposium on Wireless Communication Systems, pp. 183–187, Mauritius, 2004) to wireless multihop networks in order to support delay-sensitive applications. The performance of the system is time-dependent and is greatly affected by network-level performance. Therefore, it is necessary to develop an analytical framework to evaluate the performance of the system with taking into account its time-dependency. We use queuing theory to analyze the performance of the system. From numerical results, it is shown that the performance degradation of the system is mainly caused by the increase of packet delay, which is due to the increase of the traffic intensity. To prevent the increase of traffic, we propose a packet discarding scheme. We analyze the average packet error probability of the proposed system with the equilibrium point analysis (EPA). Numerical results show that the packet discarding scheme can improve the average packet error probability under heavy traffic conditions.     

Performance analysis of wireless multi-user VoIP system with adaptive modulation and coding

In this paper, we propose a new framework to analyze performance considering finite-length queuing and adaptive modulation and coding for multi-user Voice over IP (VoIP) services in wireless communication systems. We formulate an uplink VoIP system as a two-dimensional discrete-time Markov chain (DTMC) based on a Markov modulated Poisson process traffic model for VoIP services and modulation and coding scheme (MCS)-level set transition reflecting users’ channel variations. We extend the transition modeling of the MCS-level for a single-user to the transition modeling of the MCS-level set for multiple users. Since the users can have various MCS combinations in the case of a multi-user system, the MCS-level set transitions are more complicated than the MCS-level transitions of the single-user case. Throughout our DTMC formulation, we present various performance metrics, such as average queue-length, average throughput, packet dropping probability, packet loss probability, and so on. By using the results of the packet loss probability, we can find an optimum packet error rate value that minimizes the total packet loss probability.     

Predictive multicast polling for wireless networks with multipacket reception and queuing

In this paper, we propose the predictive multicast polling scheme for medium access control in wireless networks with multipacket reception capability. We concentrate on the case in which the packet arrival process is general and the maximum queue size is finite but larger than one. We derive both analytical results and simulation results. We use the theory of discrete-time Markov chain to analyze the evolution of the system state. In addition, we propose to use Markov reward processes to calculate the exact value of the network throughput. Furthermore, we obtain the average system size, the packet blocking probability, and the average packet delay. We show that our numerical results are consistent with simulation results. We also use simulation results to justify the usage of the proposed approach. Our study shows that the system performance can be significantly improved with a few additional buffers in the queues.     

Packet-error probability analysis for FH-CDMA unslotted packet networks

This letter is concerned with the interference analysis in time-unslotted frequency-hopping code-division multiple-access packet networks with error control coding. We derive, under the conditional independence assumption, a new exact closed-form expression for the packet error probability of a reference packet in the presence of other K interfering packets. In contrast to the previously known results, the computational complexity of the new result is independent of K. We also develop a new tight upper bound on packet error probability relying on mapping the unslotted system into an equivalent slotted one experiencing the same level of short-term average interference. The accuracy of the proposed approximation is demonstrated by some numerical examples and is shown to be tighter than the previously used results.     

Dynamic Behavior of a CSMA-CD System with a Finite Population of Buffered Users

In packet broadcast networks with buffered users, queues of packets at the users interfere with each other through a shared broadcast channel. Therefore, it is difficult to analyze the performance of such Systems by classical queueing theory. This paper provides an approximate performance analysis of a slotted nonpersistent CSMA-CD system with a finite number of users, each having a buffer of finite capacity. We develop an approximate Markovian model of the system with a multidimensional state vector. To analyze the model, We utilize an approximate analytical technique called equilibrium point analysis (EPA). Then, the throughput and average packet delay characteristics are obtained and the system stability behavior is demonstrated. An approximate expression is also derived for the probability distribution of the number of packets in a buffer. Numerical results from both analysis and simulation are given to illustrate the accuracy of those analytic results. Using the analytic results, we examine the effect of the collision detection capability on the system performance. Furthermore, we consider how to select both the rescheduling probability and the buffer size that guarantee the system stability, keep the probability of buffer overflow sufficiently small, and at the same time minimize the average packet delay.     

Power levels and packet lengths in random multiple access with multiple-packet reception capability

This paper extends our earlier results. We assume that the receiver has the capability of capturing multiple packets so long as the signal-to-interference-plus-noise ratio (SINR) of each packet is above a designed threshold T throughout its transmission period. We prove that, compared with a multiple-power-level system, the single-power-level system in which all nodes transmit at the maximum allowable power level achieves optimal throughput, under a condition that T exceeds the value 3.33. Given a minimum throughput requirement, under the same condition on T, the single-power-level system also achieves the maximum average packet capture probability as well as the optimum energy usage efficiency. If the multiple-power-level systems are constrained such that higher power levels always have shorter packet lengths, then the above results hold for T greater than 2.     

Probability Models for the Splitting Algorithm in Wireless Access Networks with Multipacket Reception and Finite Nodes

In this paper, we propose an analytical approach for performance evaluation of the classic tree/stack splitting algorithm in an interference-dominating wireless access network with random traffic and finite nodes. In an interference-dominating wireless access network, a receiver could simultaneously receive multiple packets from a variety of transmitters, as long as the signal-to-interference-plus-noise ratio exceeds a predetermined threshold. We use discrete-time Markov chains and regenerative processes to derive the throughput curve, the packet blocking probability, the average system size, and the average packet delay. We show that the exact performance of the splitting algorithm depends on the total number of nodes in the network. We verify our numerical results by rigorous mathematical proof and computer simulations.     

宽带实时VBR业务与尽力而为业务复用系统的性能研究

该文以宽带实时VBR业务与尽力而为业务复用系统且对实时业务采取完全共享接纳策略为背景,以系统平均剩余容量、实时业务丢包率和尽力而为业务平均延时为主要研究对象,通过对多业务排队模型深入分析,导出了几个主要性能指标的计算公式,得出了实时VBR业务丢包率随呼叫级负荷增加并非单调增加的新结论。仿真验证了公式的正确性。     

Performance analysis of IEEE 802.15.4 non-beacon mode with the unslotted CSMA/CA

We provide a simple mathematical model of IEEE 802.15.4 unslotted CSMA/CA by busy cycle of M/G/l queueing system to obtain several performance measures. Our performance measures can be used for determining the optimal number of devices while supporting the required QoS constraints on the average packet delay and the packet loss probability, and also for calculating battery lifetime.     

Bit-to-bit error dependence in slotted DS/SSMA packet systems withrandom signature sequences

A technique is developed to find an accurate approximation to the probability of data bit error and the probability of packet success in a direct-sequence spread-spectrum multiple-access (DS/SSMA) packet radio system with random signature sequences. An improved Gaussian approximation to the probability of data bit error is performed. Packet performance is analyzed by using the theory of moment spaces to gain insight into the effect of bit-to-bit error dependence caused by interfering signal relative delays and phases which are assumed constant over the duration of a desired packet. Numerical results show that if no error control exists in the desired packet or if block error control is used when multiple-access interference is high, the error dependence increases the average probability of packet success beyond that predicted by models which use independent bit errors. However, when block error control is used and the multiple-access interference is low, the bit error dependencies cause a reduction in packet error performance     

Packet loss performance of selective cell discard schemes in ATMswitches

In transport-layer protocols such as TCP over ATM networks, a packet is discarded when one or more cells of that packet are lost, and the destination node then requires its source to retransmit the corrupted packet. Therefore, once one of the cells constituting a packet is lost, its subsequent cells of the corrupted packet waste network resources. Thus, discarding those cells will enable us to efficiently utilize network resources, and will improve the packet loss probability. We focus on tail dropping (TD) and early packet discard (EPD) as selective cell discard schemes which enforce the switches to discard some of the arriving cells instead of relaying them. We exactly analyze the packet loss probability in a system applying these schemes. Their advantages and limits are then discussed based on numerical results derived through the analysis     

Admission policies for integrated voice and data traffic in CDMApacket radio networks

The authors derive optimal admission policies for integrated voice and data traffic in packet radio networks employing code division multiple access (CDMA) with direct-sequence spread spectrum (DS/SS) signaling. The network performance is measured in terms of the average blocking probability of voice calls and the average delay and packet loss probability of data messages. The admission scheme determines the number of newly arrived voice users that are accepted in the network so that the long-term blocking probability of voice calls is minimized. In addition, new data arrivals are rejected if the mean delay or the packet loss probability of data exceeds a desirable prespecified level. A semi-Markov decision process (SMDP) is used to model the system operation. Then, a value iteration algorithm is used to derive the optimal admission control. Two models for the other-user interference of the CDMA system are considered: one based on thresholds and another based on the graceful degradation of the CDMA system performance, and their performance is compared. These admission policies find application in emerging commercial CDMA packet radio networks including cellular networks, personal communication networks, and networks of LEO satellites for global communications     

Packet Delay Metrics for IEEE 802.11 Distributed Coordination Function

In this paper, we introduce a comprehensive packet delay analysis for wireless networks based on IEEE 802.11 Distributed Coordination Function (DCF). We develop mathematical models that calculate a set of packet delay metrics, namely a) the average packet delay for successfully transmitted packets, b) the average packet delay of successfully transmitted packets experiencing a specific number of collisions, c) the average packet drop time, d) the delay jitter and e) the delay distribution by computing the probability of a packet to be successfully transmitted experiencing delay time lower than a given value. All the developed models are based on calculating station’s delay time at the transmission slot(s) plus the average time that station defers at backoff slots before successful transmission. The mathematical models are simple, computationally fast and can be used to build admission control algorithms. Simulation results show that our proposed mathematical analysis is highly accurate.     

Energy-Efficient Wireless Packet Scheduling with Quality of Service Control

In this paper, we study the problem of packet scheduling in a wireless environment with the objective of minimizing the average transmission energy expenditure under individual packet delay constraints. Most past studies assumed that the input arrivals followed a Poisson process or were statistically independent. However, traffic from a real source typically has strong time correlation. We model a packet scheduling and queuing system for a general input process in linear time-invariant systems. We propose an energy-efficient packet scheduling policy that takes the correlation into account. Meanwhile, a slower transmission rate implies that packets stay in the transmitter for a longer time, which may result in unexpected transmitter overload and buffer overflow. We derive the upper bounds of the maximum transmission rate under an overload probability and the upper bounds of the required buffer size under a packet drop rate. Simulation results show that the proposed scheduler improves up to 15 percent in energy savings compared with the policies that assume statistically independent input. Evaluation of the bounds in providing QoS control shows that both deadline misses and packet drops can be effectively bounded by a predefined constraint.     

On the effects of the packet size distribution on the packet loss process

Real-time multimedia applications have to use forward error correction (FEC) anderror concealment techniques to cope with losses in today’s best-effort Internet. The efficiency of these solutions is known however to depend on the correlation between losses in the media stream. In this paper we investigate how the packet size distribution affects the packet loss process, that is, the distribution of the number of lost packets in a block, the related FEC performance and the average loss run length. We present mathematical models for the loss process of the MMPP+M/D/1/K and the MMPP+M/M/1/K queues; we validate the models via simulations, and compare the results to simulation results with an MPEG-4 coded video trace. We conclude that the deterministic packet size distribution (PSD) not only results in lower stationary loss probability than the exponential one, but also gives a less correlated loss process, both at a particular average link load and at a particular stationary loss probability as seen by the media stream.Our results show that for applications that can only measure the packet loss probability, the effects of the PSD on FEC performance are higher in access networks, where a single multimedia stream might affect the multiplexing behavior. Our results show that the effects of the PSD on FEC performance are higher in access networks, where a single multimedia stream might affect the multiplexing behavior and thus can improve the queuing performance by decreasing the variance of its PSD.     

A simulation study of delay in multichannel CSMA/CD protocols

Simulation is used to estimate the performance of media access control (MAC) protocols derived from carrier-sense multiple access with collision detection (CSMA/CD), and operating in local area networks comprising several parallel broadcast channels. The influence of possible protocol and system alternatives on the network performance is discussed, based on results of the packet delay average, variance, mean square, coefficient of variation, and histogram, as well as the packet rejection probability due to lack of buffer space. The delay incurred by multipacket messages is estimated, comparing the single channel to the multichannel option. Numerical results indicate that the multichannel option provides reductions in both the packet delay average and variance, even when stations are only able to simultaneously receive from a subset of channels     

New cross-Layer design approach to ad hoc networks under Rayleigh fading

We propose a new cross-layer design employing the predictability of Rayleigh channels to improve the performance of ad hoc networks. In addition, we propose a Markov model for Rayleigh channels and an innovative Markov model for IEEE 802.11 distributed coordination function. By combining these two models, we derive the theoretical expressions for network throughput, packet processing rate, packet loss probability, and average packet delay under Rayleigh channels. The simulation of the proposed cross-layer design is also carried out. It is shown that the new approach improves the network throughput, reduces unnecessary packet transmissions and therefore reduces packets lost. We also show that there is a close match between the analytical and the simulation results which confirms the validity of the analytical models.     

An analytical model for all-optical packet switching networks with finite FDL buffers

Signal loss and noise accumulation can cause fading in optical buffers implemented by fiber delay lines (FDLs). Optical packets that excessively recirculate through FDLs are easily dropped from their routing paths. Therefore, analytical models and packet scheduling schemes require additional considerations for FDL buffers. This work proposes an analytical model for all-optical packet switching networks with finite FDL buffers and a general class of scheduling schemes including many basic scheduling schemes. We intend to minimize the packet loss probability by ranking packets to achieve an optimal balance between latency and residual lifetime in the general class of scheduling schemes. The analytical model is based on a non-homogeneous Markovian analysis to study the effects of various scheduling schemes on packet loss probability and average latency. Analytical results show how various network parameters affect the optimal balance, and illustrate how properly balancing latency and residual distance can significantly improve network performance.     

Performance improvement of a frequency hopping-CDMA systemutilizing memorized prior data

An algorithm for improving the stability and throughput of a frequency hopping code-division multiple-access system (FH-CDMA) is presented. The algorithm includes a multiple block transmission with error-detection block(s) and a logical AND-operation between previously received (erroneous but saved) data, and retransmitted data. The packet success probability of the new algorithm is formulated and the improvement in stability is shown in terms of the proportion of retransmission users in the system under various conditions, including the new packet generation probability, retransmission probability, different signal-to-noise ratio in the channel, and the number of blocks in a packet. The average drift of retransmission users and the analysis of the expected number of retransmissions were used to evaluate the stability performance of the retransmission strategy     

Channel Allocation for GPRS with Buffering Mechanisms

General Packet Radio Service (GPRS) provides mobile users end-to-end packet-switched services by sharing the radio channels with voice and circuit-switched services. In such a system, radio resource allocation for circuit-switched and packet-switched services is an important issue, which may affect the QoS for both services significantly. In this paper, we propose two algorithms: Dynamic Resource Allocation with Voice and Packet queues (DRAVP) and Dynamic Resource Allocation with Packet and Voice queues (DRAPV) for channel allocation of the voice calls and packets. We propose analytic and simulation models to investigate the performance of DRAVP and DRAPV in terms of voice call incompletion probability, packet dropping probability, average voice call waiting time, and average packet waiting time. Our study indicates that the buffering mechanism for GPRS packets significantly increase the acceptance rate of GPRS packets at the cost of slightly degrading the performance of voice calls.