A cross-layer adaptive transmission scheme combined with SR-ARQ over correlated fading channels

Current adaptive transmission schemes all assume independent block fading. However, in slow fading channels, it is highly possible for consecutive block transmissions to be correlated. In this paper, we propose a cross-layer adaptive transmission scheme, which is an optimum combination of modulation format and packet size, combined with selective repeat automatic repeat request (SR-ARQ) to improve the throughput in correlated slow fading channels. We apply a multi-state Markov system model to analyze the system performance and to optimize the selection of modulation levels at the physical layer and packet sizes at the data link layer in a correlated slow fading channel, which is also described by a finite-state Markov chain. A general closed-form expression of the average throughput for this cross-layer adaptive transmission scheme is presented. Simulation results show that our adaptive transmission scheme combined with SR-ARQ can obtain a good performance in correlated slow fading channels.     

Try-once-discard scheduling for stochastic networked control systems

In practical networked control systems (NCS), such as smart grids, cooperative robotics, and sensor networks, often multiple control applications share a communication infrastructure, requiring a smart and efficient scheduling mechanism to coordinate the access to the capacity-limited communication medium. In this article we consider the problem of event-based scheduling design for NCSs consisting of multiple control loops over a shared communication medium. We extend the notion of Try-Once-Discard (TOD), which is one of the basic deterministic event-based scheduling protocols for resource constrained NCSs, to the case of multiple stochastic control systems coupled via a shared communication medium subject to capacity limitation and stochastic packet delivery failure. Showing that the overall network-induced error is a homogeneous Markov chain in our stochastic set-up, we first study stability properties of such networked systems under the TOD scheduling scheme employing the concepts of stochastic stability. Then, we derive sufficient stability conditions under the TOD rule assuming that the communication channel is not ideal, i.e. a scheduled data packet for transmission might be lost in the communication channel with a non-zero probability. Furthermore, we derive analytic performance bounds by finding uniform upper-bounds for an average quadratic cost function. The numerical simulations are performed for variety of system parameters and NCS set-ups to strengthen our stability claim as well as illustrating performance bounds. Additionally, we show that the TOD scheduling rule outperforms the conventional time-triggered, and uniform and non-uniform random channel access arbitration mechanisms, in terms of efficient coordination of channel access in stochastic NCSs.     

功率受限和自动重传请求条件下系统吞吐量最大化的研究

本文研究了具有ARQ功能的基于衰落信道和数据链路层缓冲区队列状态的资源最优分配问题，目标是通过自适应调整功率分配和调制方式，在系统平均功率的限制下，使系统的吞吐量达到最大。在这个系统中并不限制ARQ的重发次数，所以最大化系统的吞吐量等效于使链路层的缓冲区溢出的数据包最小。本文把这样一个优化问题构造为马尔可夫决策过程，并提出了用动态规划解决该问题的方法。出于实用性的考虑，本文还提出了一种简单的次优资源分配方法，仿真结果显示这种方法与最优的调度方法性能非常接近。     

Mean square detectability of LTI systems over finite-state digital block-fading channels

This paper studies the mean square quadratic (MSQ) detectability for multi-output networked systems over finite-state digital block-fading channels. The packet-loss rate of each digital fading channel depends on the channel power gain, as well as packet length and power level used for transmission. A finite-state random process is introduced to model time-varying fading channels, which characterizes various configurations of physical communication environment and/or different channel fading amplitudes. Necessary and sufficient conditions for MSQ detectability over finite-state Markov digital block-fading channels are given in the form of algebraic Riccati equations or linear matrix inequalities (LMIs). The estimation gain is given as a function of estimated/observed channel state. In addition, explicit conditions on network for MSQ detectability over finite-state independent identically distributed (i.i.d.) digital block-fading channels are presented in terms of the unstable poles of the multi-output plant. Finally, an application to Gilbert-Elliott channels (GECs) is provided to demonstrate the derived results.     

Performance analysis of the general packet radio service

This paper presents an efficient and accurate analytical model for the radio interface of the general packet radio service (GPRS) in a GSM network. The model is utilized for investigating how many packet data channels should be allocated for GPRS under a given amount of traffic in order to guarantee appropriate quality of service. The presented model constitutes a continuous-time Markov chain. The Markov model represents the sharing of radio channels by circuit switched GSM connections and packet switched GPRS sessions under a dynamic channel allocation scheme. In contrast to previous work, the Markov model explicitly represents the mobility of users by taking into account arrivals of new GSM and GPRS users as well as handovers from neighboring cells. Furthermore, we take into account TCP flow control for the GPRS data packets. To validate the simplifications necessary for making the Markov model amenable to numerical solution, we provide a comparison of the results of the Markov model with a detailed simulator on the network level.     

Quantised feedback stabilisation of LTI systems over partly unknown Markov fading channels

This paper is concerned with the quantised feedback stabilisation of a class of linear systems over partly unknown Markov fading channels. A set of channel state process with partly unknown transition probabilities is introduced to model time-varying fading channels, which characterises various configurations in physical communication environment and/or different channel fading amplitudes. Partly unknown Markov fading channels are more general than completely known Markov fading channels. Sufficient condition for mean square quadratic (MSQ) stabilisation over partly unknown Markov fading channels is given in the paper. Besides, necessary and sufficient conditions for MSQ stabilisation in two special cases, i.e. completely known Markov fading channels and independent identically distributed (i.i.d.) fading channels, are also given, respectively. Finally, two examples are given to demonstrate the effectiveness of the proposed results.     

信息物理环境下不确定系统的随机分布式预测控制

针对信息物理系统环境下可能发生的信息丢包问题,提出一种随机分布式预测控制的分析与设计方法.考虑控制器端到执行器端的传输丢包,采用马尔科夫过程对这一丢包过程进行描述.通过对马尔科夫跳变的线性模型进行增广,研究一种具有随机丢包不确定系统的分布式预测控制方法;将系统分解成多个子系统进行描述,研究基于最小最大化优化的分布式预测控制器设计方法,并提出基于迭代交互的子控制器协调算法.将随机分布式预测控制算法在实际电机系统中进行仿真测试,以验证所提出方法的有效性.     

Stochastic control of two partially observed competing queues

We consider the dynamic control of two queues competing for the services of one server. The problem is to design a server time allocation strategy, when the sizes of the queues are not observable. The performance criterion used is total expected aggregate delay. The server is assumed to observe arrivals but not departures. This problem is formulated as a stochastic optimal control problem with partial observations. The framework we adopt is that of stochastic control in discrete time and countable "state space." The observations are modeled as discrete time, 0-1 point processes with rates that are influenced by a Markov chain. Examples from computer control of urban traffic are given, to illustrate the practical motivation behind the present work, and to relate to earlier work by us on the subject. A particular feature of the formulation is that the observations are influenced by transitions of the state of the Markov chain. The classical tools of simple Bayes rule and dynamic programming suffice for the analysis. In particular, we show that the "one step" predicted density for the state of the Markov chain, given the point process observations is a sufficient statistic for control. This framework is then applied to the specific problem of two queues competing for the services of one server. We obtain explicit solutions for the finite time expected aggregate delay problem. The implications of these results for practical applications as well as implementation aspects of the resulting optimal control laws are discussed.     

基于吞吐量最大化的自适应传输控制

研究了具有ARQ功能的基于衰落信道和数据链路层缓冲区队列状态的资源最优分配问题，为了通过自适应调整功率分配和调制方式，在系统平均功率的限制下，使系统的吞吐量达到最大，该文把这个优化问题构造为马尔可夫决策过程，并提出了用动态规划解决该问题的方法。     

具有数据包丢失及转移概率部分未知的网络控制系统H∞控制

研究一类具有数据包丢失及状态转移概率部分未知的网络控制系统随机稳定性及H∞控制问题．传感器与控制器之间、控制器与执行器之间存在数据包丢失的网络控制系统被建模成具有4个子系统的跳变系统,4个子系统之间的跳变遵行Markov跳变过程,并具有部分未知的跳变概率．利用Lyapunov稳定性定理及线性矩阵不等式的求解方法得到该类系统随机稳定的充分条件,并给出了相应的∞状态反馈控制器的设计方法．数值仿真结果验证了本文方法的正确性和有效性．     

衰落信道下V2V通信系统性能分析

针对V2V通信的连接性能问题,将衰落引起的信道随机性纳入分析,提出了一种在衰落信道中对V2V连接性能的分析算法,并将物理层和MAC层相结合,分析了不同衰落模型下V2V通信系统性能,包括对包丢失率、吞吐量、平均延时等通信性能指标,并通过仿真验证。仿真结果表明,瑞利信道的连接性能比Nakagami-m信道高,但信号的传输性能Nakagami-m信道全面优于Rayleigh信道。     

Optimal codesign of industrial networked control systems with state‐dependent correlated fading channels

This paper examines a codesign problem in industrial networked control systems (NCS) whereby physical systems are controlled over wireless fading channels. The considered wireless channels are assumed to be stochastically dependent on the physical states of moving machineries in the industrial working space. In this paper, the moving machineries are modeled as Markov decision processes whereas the characteristics of the correlated fading channels are modeled as a binary random process whose probability measure depends on both the physical states of moving machineries and the transmission power of communication channels. Under such a state‐dependent fading channel model, sufficient conditions to ensure the stochastic safety of the NCS are first derived. Using the derived safety conditions, a codesign problem is then formulated as a constrained joint optimization problem that seeks for optimal control and transmission power policies which simultaneously minimize an infinite time cost on both communication resource and control effort. This paper shows that such optimal policies can be obtained in a computationally efficient manner using convex programming methods. Simulation results of an autonomous forklift truck and a networked DC motor system are presented to illustrate the advantage and efficacy of the proposed codesign framework for industrial NCS.     

State Feedback Stabilization Over Finite‐State Fading Channels

This paper studies state feedback stabilization over finite‐state fading channels, where the stochastic characteristic of time‐varying fading channels is assumed to be driven by a finite‐state random process. The finite‐state process is used to represent different channel fading amplitudes and/or to model different configurations of the overall physical environment. A series of necessary and sufficient conditions are given for stabilization over finite‐state Markov fading channels. In the case of finite‐state independent and identially distributed fading channels, explicit network requirements for stabilization are presented for both single‐input case and multi‐input case. It is shown that our results cover some existing results as special cases. Finally, the results are applied to stabilization of a single‐input plant over a Gilbert‐Elliott channel demonstrated by numerical simulations.     

具有数据包丢失的网络控制系统保性能控制

本文研究了一类具有数据包丢失的网络控制系统(NCSs)的建模和保性能控制问题.通过用两个马尔可夫链分别来描述前向通道和反馈通道的丢包过程,将闭环网络控制系统建模成具有两个模式的马尔可夫随机切换系统.基于线性矩阵不等式技术和李亚普诺夫方法得到了闭环系统随机稳定的充分条件,并给出了状态反馈保性能控制器的设计方法.最后通过数值算例验证本文结果的有效性.     

Markov调制服务时间的单服务台排队近似分析

研究一种具有马尔科夫调制服务时间的单服务台排队系统。顾客到达服从参数为λ的泊松过程,服务时间为连续时间马尔科夫链调制,若马尔科夫链处于状态i（i=1,2,...N）,则服务时间服从参数为μi的负指数分布。为优化排队系统采用仿真无线通信中信道衰减导致的信道速率变化问题非常有意义。区别于以往的数值计算方法（如矩阵几何分析）,提出了一种离散时间马尔科夫链模型来分析服务台状态的变化过程,导出一组闭合公式来计算排队系统的各性能指标。此外,还开发出一种递推过程来计算队列长度的任意阶矩。数值计算结果显示出近似分析具有良好的精确性。     

Remote stabilization over fading channels

In this paper, we study the problem of remote mean square stabilization of a MIMO system when independent fading channels are dedicated to each actuator and sensor. We show that the stochastic variables responsible for the fading can be seen as a source of model uncertainty. This view leads to robust control analysis and synthesis problems with a deterministic nominal system and a stochastic, structured, model uncertainty. As a special case, we consider the stabilization over Erasure or drop-out channels. We show that the largest probability of erasure tolerable by the closed loop is obtained from solving a robust control synthesis problem. In more general terms, we establish that the set of plants which can be stabilized by linear controllers over fading channels is fundamentally limited by the channel generated uncertainty. We show that, the notion of mean square capacity, defined for a single channel in the loop, captures this limitation precisely and characterizes equivalence classes of channels within the class of memoryless fading channels.     

基于Watterson模型的短波信道马氏性研究

在短波Watterson模型中,时变抽头增益为复随机过程,存在较难估计的问题.为此,通过研究信道的马氏性对其进行简化.将连续时变的信道增益离散化为有限状态值,建立一阶有限状态马尔可夫(FSM)模型,给出FSM模型的状态空间、平稳状态概率、状态转移概率等参数,研究FSM模型的状态平均错误概率、状态平均停留时间和状态停留时间的分布等特性.仿真结果验证了马尔可夫模型描述短波信道的准确性.     

Filtering a Markov Modulated Random Measure

We develop a new exact filter when a hidden Markov chain influences both the sizes and times of a marked point process. An example would be an insurance claims process, where we assume that both the stochastic intensity of the claim arrivals and the distribution of the claim sizes depend on the states of an economy. We also develop the robust filter-based and smoother-based EM algorithms for the on-line recursive estimates of the unknown parameters in the Markov-modulated random measure. Our development is in the framework of modern theory of stochastic processes.      

OFDM超分辨率联合TOA/AOA定位

对无线信号到达时间（TOA）和到达角度（AOA）的精确估计是室内无线定位的关键。正交频分复用（OFDM）是适合多径衰落环境的一种高速传输技术。提出一种联合TOA和DOA的二维定位方法用于OFDM信号定位。算法首先通过信道估计得到信道的频率响应（CFR）,对CFR采用超分辨率算法估计信道时延。首径（first arrival path,FAP）的时延估计就是接收信号的TOA估计。将天线阵列接收信号通过DFT变换到频域,利用同样的算法估计信号各径的AOA/DOA。最后联合TOA和AOA在二维平面上确定目标位置。由于信号是多径、多载波信号,对各载波的DOA/AOA估计在载波间进行处理,再结合各径脉冲响应的幅值,选出属于首径的DOA/AOA估计。在多径环境下仿真表明算法有效且定位精度能够满足实际需要,尤其适合环境中只有一个基站或接入点的情况。     

Packet delay analysis on IEEE 802.11 DCF under finite load traffic in multi-hop ad hoc networks

In this paper, the average packet delay on IEEE 802.11 DCF under finite load traffic in multi-hop ad hoc networks is analyzed. We employ a Markov chain model to analyze the probability of transmission at each node in an arbitrary slot and derive the channel access delay. We model each node using an M/G/1 queue and derive the queueing delay. The model is extended from analyzing the single-hop average packet delay to evaluating the end-to-end packet delay in multi-hop ad hoc networks without assuming the traffic to be in a saturation state. To validate our analytic results, we have done extensive simulation. The analytic and the simulation results match very well.