时隙ALOHA协议下的网络化控制系统协同设计

针对网络化控制系统中信道容量有限的问题,本文提出一种基于时隙ALOHA通信协议的控制与通信协同设计方法.将控制系统的采样周期划分为若干等长度的时隙,在每个时隙中,系统的分布式传感器通过时隙ALOHA协议来随机竞争接入网络.由于在不同的采样周期各个传感器的接入状态不同,整个状态反馈控制系统将在若干子系统之间进行切换.据此,本文建立了离散的切换系统模型,并利用分段李雅普诺夫函数方法和平均驻留时间技术得到了能够保证系统指数稳定的充分条件.然后,给出能够保证控制系统稳定所需的信道吞吐率的界限,进而得到了时隙ALOHA协议中的最大重传次数与控制系统衰减率的定量关系.通过上述方法,本文建立了控制-通信协同设计的框架结构,可将控制器的增益矩阵和时隙ALOHA通信协议进行协同设计.最后,通过仿真验证了本文所提出的协同设计方法的有效性.     

Power level selection schemes to improve throughput and stability of slotted ALOHA under heavy load

We propose and analyse three different power selection schemes for slotted ALOHA random access protocol operating under multiple power levels. Through analysis and numerical examples we demonstrate that these schemes can significantly improve the performance of slotted ALOHA, in terms of throughput and stability, under heavy load. The proposed schemes are truly distributive in nature and can be easily implemented in wireless access systems without requiring any centralised control.     

Queueing analysis of buffered slotted multiple access protocols

Much of the literature on the performance evaluation of multiple access protocols has assumed a buffer capacity of one unit. This assumption is not realistic. In practice the buffer capacities used are larger than one unit in order to reduce the probability of packet rejection. This is more crucial for multiple access protocols, which allow moderate to high values of the expected throughput (URN, Random TDMA etc.).In this paper, a model appropriate for the analysis of buffered slotted multiple access schemes is proposed. The method can be applied to several multiple access protocols such as the URN protocol, the ALOHA protocol, Random TDMA etc. The cases of infinite and finite buffer capacity are examined separately but under the same basic assumptions. The analysis is based on the assumption that each user process can be modelled as an M/G/1 queueing system. The proposed method requires a small amount of computation and is characterized by a high speed, a fact that simplifies the buffer's design as well. The solution obtained is extremely accurate and exhibits excellent agreement with simulation results, which corroborate the accuracy of the model. The special case when the buffer capacity is equal to 1 is examined. In that case, the present approach also allows for computation of the packet delay distribution.     

Throughput analysis of slotted ALOHA with cooperative transmission using successive interference cancellation

With a cross-layer design approach, a novel random access protocol is proposed in this paper, which is based on conventional slotted ALOHA (S-ALOHA) using successive interference cancellation (SIC) technique to separate collided packets and cooperative transmission to exploit the physical layer advantages. And a general theoretic analysis model is presented to obtain its throughput, which is also suitable for analyzing the performance of other protocols (such as S-ALOHA and S-ALOHA with cooperative transmission (C-ALOHA)) and is shown to be right and effective. Numerical results demonstrate that the proposed protocol can improve the maximal throughput by 190% and 132% over a Rayleigh fading channel, respectively, as compared with S-ALOHA and C-ALOHA. And the results show that our protocol can provide an effective random access method with high throughput for wireless transmission.     

一种超宽带MAC层信道时间分配的改进方法

针对超宽带媒体访问控制(MAC)层的信道资源分配在可变比特率业务和不定比特率业务中可能存在的丢帧或带宽利用率低的问题,提出了一种基于开槽ALOHA协议即时抢占信道时间分配的改进方法,为数据流分配空闲的信道时间。仿真结果表明,与IEEE802.15.3建议的分配方式相比,这种改进方法能够在一定程度上降低任务失败率和延迟抖动,提高有效吞吐量,从而有效地支持高QoS要求的传输。     

P坚持时隙ALOHA稳定性

动态频谱共享无线通信系统使用时隙ALOHA协议完成对数据信道的竞争,稳定性问题是时隙ALOHA协议的固有特性。通过建立p坚持时隙ALOHA的系统模型,分析了在重传概率确定情况下,新包的生成率对系统稳定性的影响,以及新包的生成率已知情况时,重传概率对系统稳定的影响;通过数值计算与仿真,给出了两种情况下系统稳定的条件。     

基于分组的动态时隙ALOHA算法

详细介绍了基本ALOHA算法、时隙ALOHA算法、帧时隙ALOHA算法和动态帧时隙ALOHA算法基本原理和系统效能, 分析了上述4种算法各自特点. 提出了基于分组的动态帧时隙ALOHA算法, 该算法根据标签数量对标签进行分组, 并动态匹配最佳帧长. 仿真结果表明, 改进后算法系统具有吞吐率高、不受标签数量限制、节约帧时隙等优势.     

Hierarchy sustains partial cooperation and induces a Braess-like paradox in slotted aloha-based networks

This paper studies a hierarchical distributed choice of retransmission probabilities in slotted aloha. In particular, we consider a wireless system composed of one central receiver and several selfish mobile users communicating via the slotted aloha protocol. The set of mobile users is split into two classes: leaders and followers. We then study the induced non-cooperative hierarchical game based on the Stackelberg equilibrium concept. Using a 4D Markovian model, we compute the steady state of the system and derive the average throughput and the expected delay as well. We start by discussing the protocol design and propose a controlled slotted aloha using a virtual controller. The virtual controller can sustain partial cooperation among concurrent mobile users when accessing the channel by making the channel lossy. This leads us to identify a Braess-like paradox in which reducing capacity to the system may improve the performance of all mobile users. We then investigate the impact of hierarchy among mobile users in such a random access protocol and discuss how to distribute leader/follower roles. We show that the global performance of the system is improved compared to standard slotted aloha system. However, slight performances slow-down may be observed for the followers group when the total number of mobile users is relatively small.     

无源RFID系统中多目标识别的估计算法

研究被动射频识别（RFID）系统中多目标识别环境下被识别目标数量的估计算法和最大吞吐率的获取方法。通过对时隙ALOHA方法的分析,建立了读写器和标签通信的二项式分布模型,得到了获取最大吞吐率的条件：在已知被识别目标数量的前提下,使时隙数与目标数量相等。提出一种被识别目标数量的估计算法——二次式分布估计（BDE）算法。BDE算法估计误差抖动小,平均误差为2.1%。仿真结果表明BED算法在识别目标数量少时,能将识别时间缩短至50%,当识别目标增加时,识别时间呈线性增长;系统吞吐率接近理论最大值,达到34%;空白时隙和碰撞时隙占时控制在16%附近。同时,识别时间成分分析指出：优化读写器命令、提高读写器传输数据率能够进一步缩短识别时间。     

On the instability of slotted ALOHA multiaccess algorithm

The slotted ALOHA multiaccess algorithm for the infinite user model is shown to be unstable via a martingale method of independent interest. Consequently, the hypothesis of statistical equilibrium used to calculate the maximum throughput is not valid.     

Performance analysis of some random access systems having an intelligent central node

We consider a computer communication network in which users communicate with each other via a central node. The available channel is divided into the up- and downlink subchannels. Users contend for the uplink according to the pure ALOHA protocol. The central node is capable of recognizing erroneous packets, rejecting duplicate packets, and storing error-free packets. Given that the total available channel capacity is the limiting resource, the system throughput and the average packet delay are derived. Aiming at the improvement of system performance, we found the channel capacity divisions that maximize the throughput and minimize the average packet delay (numerically). In order to obtain the above-mentioned performance characteristics, we have assumed the infinite users' population model.     

Asynchronous transmission protocols for WDM LANs using multichannel control architecture

In this paper we study a single-hop WDM network for passive star topology, based on a new network architecture which uses several wavelengths as control channels with an appropriate Network Interface Unit at each station for coordination of packet transmissions on the data channels referred to as Multichannel Control Architecture (MCA). With MCA, control informations are distributed over the total control channels and in conjunction with the suitable NIU reduces the headers electronic processing bottleneck at each end station. We propose a multiple access protocol which operates asynchronously, i.e data channels are not slotted. The proposed scheme adopts the ALOHA protocol for the access to MCA and data channels. Analytic model is developed and analysed for performance measures evaluation based on Poisson approximations statistics of both the infinite and finite population. Numerical results are discussed for various number of control and data channels. The effect of receiver collisions is analysed and estimated by the average rejection probabilities at destination.     

Controlled ALOHA with geometric capture probabilities

An infinite user, slotted ALOHA system operating over a capture channel is studied. In a capture channel, differences in the levels of received power and the times of arrival allow the receiver to successfully receive a packet even when two or more have been transmitted simultaneously. The slotted ALOHA system operating over a capture channel is known to be unstable unless a control policy is used. The authors stabilize the system by using a retransmission control algorithm and derive the throughput as a function of the capture parameter     

几种随机接入协议的仿真性能比较分析

本文对纯ALOHA（P-ALOHA）、时隙ALOHA（S-AIDHA）和载波监听多路访问（CSMA）等三种随机接入协议的工作原理进行了介绍。对三种协议进行了理论分析,采用OPNET对协议进行了仿真性能比较,得出了相关重要结论,为提高随机接入协议性能提供了新的参考。     

EPC Gen2标准防碰撞方案的研究与改进

EPC Gen2标准中对防碰撞算法的规定比较灵活,因此设计合理的算法可以较大程度地提高系统的性能。在EPC Gen2标准防碰撞机制的基础上,针对其在附录中推荐的Q值调整算法及多标签读取过程中的一些不足,提出了新的Q值调整算法及改进的时隙随机Aloha算法。仿真结果显示,改进后的算法可增加系统吞吐率,降低标签识别延时,表现出良好的性能。     

Slotted Aloha as a game with partial information

This paper studies distributed choice of retransmission probabilities in slotted ALOHA. Both the cooperative team problem as well as the noncooperative game problem are considered. Unlike some previous work, we assume that mobiles do not know the number of backlogged packets at other nodes. A Markov chain analysis is used to obtain optimal and equilibrium retransmission probabilities and throughput. We then investigate the impact of adding retransmission costs (which may represent the disutility for power consumption) on the equilibrium and show how this pricing can be used to make the equilibrium throughput coincide with the optimal team throughput.     

On time-triggered and event-based control of integrator systems over a shared communication system

When analyzing networked control systems, where the control loop is closed over a communication system, it is crucial to take the communication system into account. Hence, time-triggered and event-based control of an integrator system with noise over a shared communication system is analyzed. Thereby, analytical models of different communication systems are used and the analysis is focused on the effect of the communication system on the performance, as well as the interaction between control and communication. For time-triggered control, where the event times are known in advance, a deterministic communication protocol can be used. Hence, time-triggered control with the two most well-known deterministic communication protocols, time division multiple access (TDMA) and frequency division multiple access (FDMA), is analyzed. For event-based control, where the events appear at random times, a contention-based communication protocol should be used. Hence, event-based control is analyzed with different contention-based communication protocols: pure ALOHA, slotted ALOHA, a queueing system, and Erlang’s loss model. It turns out that time-triggered control with either TDMA or FDMA outperforms event-based control with pure or slotted ALOHA. However, event-based control with a properly designed queueing system gives an even better performance. Thus, we conclude that it is crucial to take the details of the communication system into account.     

一种基于捕获效应的防碰撞算法设计

捕获效应在无线通信系统中非常普遍.在无源射频识别系统(RFID)中,由于捕获效应的存在,即使读写器范围内多个标签在同一时间反向散射信号给读写器,总有一个标签能够被成功识别.提出了一种新颖的防碰撞算法来提高RFID系统的吞吐量.该算法在帧时隙ALOHA协议的基础上考虑了捕获效应.在捕获模型下,提供了待识别标签数的概率性估计方法和捕获效应敏感的最佳帧长度的推导.理论分析和仿真结果显示,提出的算法性能超过了现有的算法,而且降低了计算复杂度.     

An Accurate Tag Estimate Method for Improving the Performance of an RFID Anticollision Algorithm Based on Dynamic Frame Length ALOHA

In a radio-frequency identification (RFID) system, the dynamic frame length ALOHA protocol is widely adopted to solve the anticollision problem. Analysis for the anticollision problem can be divided into two primary parts. The concern of the first part is how to precisely estimate the number of tags. The other part involves determination of dynamic frame length to achieve maximum throughput or channel usage efficiency. In this paper, we present an accurate method for estimating tag quantity. This method is based on the maximum a posteriori probability decision. We also derive the optimal frame length using radio channel efficiency. Simulation results indicate the tag estimate error of the proposed method is less than 4%. Use of our proposed tag estimate method together with optimal frame length can achieve close to the theoretical maximum throughput of the framed ALOHA algorithm.     

基于自供电的无线传感器网络MAC层协议研究

针对自供电的无线传感器网络,提出了一种新的MAC层协议DFSA（动态帧时隙ALOHA）,该协议对能量进行系统管理。仿真结果表明在具有能量收集能力的传感器网络中,DFSA能够充分利用节点的能量收集能力,实现网络能量充分利用,在保证较高的传输效率下获得最高的信道利用率,同时提高了数据传输的可靠性。