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.     

Performance analysis of Finite-User slotted aloha in wireless networks with multiple packet reception and random traffic

In this paper, we propose an analytical approach for evaluating the performance of finite-user slotted Aloha in wireless networks with multiple packet reception and random traffic. We derive the exact values of the throughput, the average system size, the packet blocking probability, and the average system delay. Our analysis is based on probability theory. We show that our numerical results are identical to simulation results.     

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.     

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.     

Cross-Layer Power Allocation for Packet Transmission Over Fading Channel

In this paper, for packet transmission over flat fading channel in single-input-single-output system, we consider the power control problem in a cross-layer design where adaptive modulation is adopted at physical layer to improve spectral efficiency and the queues are modeled as of finite length at data link layer. The goal is to identify the optimal queuing-aware power allocation algorithm to minimize the overall system packet error rate under the constraint of long-term transmit power. One crucial step which we call `inner?? problem is to find the optimal power vector at a given target packet error rate at physical layer. Rather than attack the multi-dimensional optimization problem directly using conventional methods, we first observe that the `inner?? problem is closely related to an average reward Markov decision process problem, and relax the former to the latter so as to take advantage of its equivalence with linear program which allows efficient solution. Since randomness in the associated Markov decision process is only slight, at most mild, we propose an approximately deterministic policy as suboptimal solution to the `inner?? problem with insignificant performance degradation. We also propose two-parameter power allocation functions to achieve suboptimal results with low complexity. The impacts of system parameters on the overall system performance are also evaluated. The accuracy of the numerical result is verified by Monte Carlo simulations.     

Design and Analysis of a Channel Access Protocol for WDM-Based Single-Hop Optical Networks*

We propose a channel access protocol for single-hop wavelength division multiplexing (WDM) optical networks. Each node is equipped with a fixed-tuned transmitter, a tunable transmitter, a fixed-tuned receiver, and a tunable receiver. The proposed protocol alleviates the drawbacks of a previous protocol [1], e.g., invalid data transmissions that follows receiver collisions and possible acknowledgment packet collisions with header/data packets, while retaining many advantages. As a result, the network performance in terms of throughput and packet delay is improved. Analytical models based on the timing diagram analysis, the continuous-time Markov chain, and the randomization technique are developed to assess the proposed protocol, and are validated through event-driven simulation. The performance is evaluated in terms of channel utilization, mean packet delay, and packet delay distribution with variations in the number of nodes, the offered traffic, the size of data packets, and the network propagation delay. Through numerical results and simulation studies, we show that the proposed protocol achieves better channel utilization and incurs lower packet delays.     

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 the IEEE 802.11 MAC protocol for wireless LANs

Wireless local area networks (WLANs) are extremely popular being almost everywhere including business, office and home deployments. The IEEE 802.11 protocol is the dominating standard for WLANs. The essential medium access control (MAC) mechanism of 802.11 is called distributed co‐ordination function (DCF). This paper provides a simple and accurate analysis using Markov chain modelling to compute IEEE 802.11 DCF performance, in the absence of hidden stations and transmission errors. This mathematical analysis calculates in addition to the throughput efficiency, the average packet delay, the packet drop probability and the average time to drop a packet for both basic access and RTS/CTS medium access schemes. The derived analysis, which takes into account packet retry limits, is validated by comparison with OPNET simulation results. We demonstrate that a Markov chain model presented in the literature, which also calculates throughput and packet delay by introducing an additional transition state to the Markov chain model, does not appear to model IEEE 802.11 correctly, leading to ambiguous conclusions for its performance. We also carry out an extensive and detailed study on the influence on performance of the initial contention window size (CW), maximum CW size and data rate. Performance results are presented to identify the dependence on the backoff procedure parameters and to give insights on the issues affecting IEEE 802.11 DCF performance. Copyright © 2005 John Wiley & Sons, Ltd.     

两级优先级控制轮询系统研究

 本文基于区分业务优先级服务的应用需求,提出了两级优先级控制的轮询系统,采用门限服务和完全服务的不同服务策略方式实现了基于优先级的控制.然后,应用马尔可夫链和概率母函数的方法建立了系统模型,并精确解析了系统的平均排队队长和信息分组的平均等待时间关键特性,理论计算和仿真实验的对比分析说明了理论分析与实验的一致性,新的轮询系统实现了优先级的控制并提高了系统性能.     

Analysis and Optimization of an Adaptive Selective-Repeat Scheme for Time-Varying Channels with Feedback Errors

In this article, an adaptive SR ARQ scheme is analyzed and optimized in a time-varying channel environment with unreliable feedback. Two-state Markov models are assumed for both the forward and the returnchannel.This enables the time behaviour of the entire system to be modelledby a Markov chain. To have an easy-to-implement scheme, we choose the smaller packet size to be half of the bigger one. Thus, there is only oneindependent design parameter related to packet size. The other two parametersare associated with channel sensing. The performance of the adaptive schemeis measured by its average throughput, which is upper-bounded by the throughput of the so-called ideal adaptive scheme. This upper bound is very useful in the optimization of the packet size and other design parameters. From the results, it can be concluded that the selection of the packet size is at least as critical as the optimization of the other parameters. The feedback errors degrade the throughput of the scheme, but their effect on the parameter optimization turns out to be almost negligible.     

VoIP capacity analysis in cognitive radio system

In this letter, we analyze a voice over IP (VoIP) capacity in a cognitive radio system. We formulate the system as a two-dimensional discrete time Markov chain (DTMC). The VoIP traffic and wireless channel in the cognitive radio system are described as a Markov modulated Poisson process (MMPP) model and a Markov channel model, respectively. We demonstrate various numerical and simulation results, such as packet dropping probability and VoIP capacity.     

Stability and throughput analysis of unslotted CDMA‐ALOHA with finite number of users and code sharing

We consider a system comprising a finite number of nodes, with infinite packet buffers, that use unslotted ALOHA with Code Division Multiple Access (CDMA) to share a channel for transmitting packetised data. We propose a simple model for packet transmission and retransmission at each node, and show that saturation throughput in this model yields a sufficient condition for the stability of the packet buffers; we interpret this as the capacity of the access method. We calculate and compare the capacities of CDMA‐ALOHA (with and without code sharing) and TDMA‐ALOHA; we also consider carrier sensing and collision detection versions of these protocols. In each case, saturation throughput can be obtained via analysis of a continuous time Markov chain. Our results show how saturation throughput degrades with code‐sharing. Finally, we also present some simulation results for mean packet delay. Our work is motivated by optical CDMA in which “chips” can be optically generated, and hence the achievable chip rate can exceed the achievable TDMA bit rate which is limited by electronics. Code sharing may be useful in the optical CDMA context as it reduces the number of optical correlators at the receivers. Our throughput results help to quantify by how much the CDMA chip rate should exceed the TDMA bit rate so that CDMA‐ALOHA yields better capacity than TDMA‐ALOHA. This revised version was published online in June 2006 with corrections to the Cover Date.     

Markov analysis of the PRMA protocol for local wireless networks

PRMA (packet reservation multiple access) is a reservation-ALOHA access protocol specifically designed for wireless microcellular networks that handle both real-time and non-real-time traffic. We present a thorough analysis of this protocol, considering real-time traffic only, based on a suitable Markov model. The size of the model is such that it can be directly used for an exact quantitative analysis of the system. In particular, we are able to analyze the packet dropping process, by evaluating both average and distribution measures. The latter are particularly useful to characterize the degradation caused to real-time traffic (e.g., voice) by the loss of consecutive packets. Besides, we also derive from the Markov model a qualitative analysis of the system stability, based on the equilibrium point analysis (EPA) technique. By this technique, we characterize the system stability and analyze the effect on it of several system parameters (e.g., load, permission probability). This revised version was published online in June 2006 with corrections to the Cover Date.     

Cooperative communication for safety message dissemination in unsaturated networks with varying contention windows

Safety message dissemination is crucial in vehicular ad hoc networks (VANETs) for road safety applications. Vehicles regularly transmit safety messages to surrounding vehicles to prevent road accidents. However, changing vehicle mobility and density can cause unstable network conditions in VANETs, making it inappropriate to use a fixed contention window (CW) for different network densities. It has been proposed a 1-D Markov model under unsaturation conditions to analyze the performance of the system with varying CWs under changing vehicle densities. Additionally, it introduces the use of cooperative communication (CoC) to relay failed safety messages. In CoC, two control packets, namely, negative acknowledge (NACK) and enable to cooperate (ETC), are utilized. The proposed analytical model named cooperative communication for safety message dissemination (CoC-SMD) is used to calculate throughput and average packet delay for varying CW and different packet size. The simulation confirms the validity of the analytical results and show significant improvement in the metrics through the use of varying CW sizes and CoC compared with existing techniques.     

Hybrid ARQ with selective combining for fading channels

We propose and analyze a hybrid automatic repeat request (ARQ) with a selective combining scheme using rate-compatible punctured convolutional (RCPC) codes for fading channels. A finite-state Markov channel model is used to represent the Rayleigh fading channels. We show that the hybrid ARQ with selective combining yields better performance than the generalized type-II ARQ scheme for fading channels. Furthermore, simulation results of real-time video time division multiple access (TDMA) transmission system are given. Better video quality can be obtained by our proposed scheme, with a bounded delay. Analytical results of throughput and packet error rate (PER) are compared to the simulated results. Our analysis based on a finite-state Markov channel model, is shown to give good agreement with simulations     

基于CTMC和状态空间模型的宽带无线接入网的QoS性能研究

为了实现同一地域范围内的众多用户在有限带宽条件下提出的高QoS要求,本文对基于IEEE 802.16标准的宽带无线接入网中数据包级QoS（Quality of Service）性能进行了研究.具体做法是,首先采用批马尔可夫到达过程（BMAP,Batch Markov Arrival Process）和连续时间马尔科夫链（CTMC,Continuous Time Markov Chain）对到达过程和流量源进行建模,得到更符合实际和更准确的排队模型;然后基于状态空间,对一个无线接入网络系统进行建模,通过对得到的系统模型并结合前面得到的排队模型的深入分析,从而获得该模型下的各项QoS性能指标,如平均队列长度、丢包率、队列吞吐量和平均包时延.仿真实验结果表明,本文提出的算法模型相比于其他典型的算法模型,能够使得各项QoS性能指标有较大的改善和提高.     

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.     

Optimizing time and space MIMO antenna system for frequencyselective fading channels

Smart or adaptive antennas promise to provide significant increases in system capacity and performance in wireless communication systems. In this paper, we investigate the use of adaptive antennas at the base and mobile stations, operating jointly, to maximize the average signal-to-interference and noise ratio (SINR) of each packet in the system for frequency selective channels with prior knowledge of the channel at the transmitter. Our approach is based on deriving an analytic formula for the average packet SINR and using the Lagrange multiplier method to determine an optimum. We derive necessary conditions for an optimum solution and propose an analytical expression for the optimum. Our analytical expression is not guaranteed to be the global optimum but it does satisfy the derived necessary conditions and, in addition for frequency flat channels, our results reduce to expressions for optimal weights previously published. To demonstrate the potential of the proposed system, we provide Monte Carlo simulation results of the system bit-error rates and make comparisons with other adaptive antenna systems. These show that significant improvements in performance are possible in a wireless communications context     

Location management of correlated mobile users in the UMTS

In this paper, we propose concurrently searching for correlated mobile users in mobile communications networks. Previous work either focuses on locating a single mobile user or assumes that the locations of mobile users are statistically independent. We first propose a mobility model in which the movements of mobile users are statistically correlated. Next, we use the theory of Markov chain to derive the joint probability density function of the locations of mobile users. In addition, we propose a novel approach to discover the correlations among the locations of mobile users without explicitly calculating the joint probability density function. Our simulation results indicate that exploring the correlations among the locations of mobile users could significantly reduce the average paging delay and increase the maximum stable throughput.