扩频时隙ALOHA及其在CDMA通信中的应用

文章在分析传统ALOHA随机多址协议不足的基础上对扩频时隙ALOHA的基本原理及其性能进行了研究,并对其在第三代CDMA移动通信系统中的应用作了探讨。     

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

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

P坚持时隙ALOHA稳定性

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

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

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

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系统稳定性分析*

研究了基于非对称多包接收模型的时隙ALOHA随机接入系统的稳定性。引入了非对称多包接收(MPR)模型,计算了媒体接入控制(MAC)容量区域,得到了两用户系统ALOHA稳定区域的详细特征。结果表明,随着MPR容量的提高,稳定区域从凹形区域变化到凸形区域,ALOHA稳定区域与MAC容量区域是一致的,而且当发送概率为1时,系统不需要传输控制,即对于两用户捕获信道而言,发送概率为1的ALOHA系统稳定性是最优的。     

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

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

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.     

Asymptotic analysis of queues in multiple-access computer networks

The paper considers local-area computer networks with a protocol that supports carrier-sense multiple access with instantaneous conflict detection and is a generalization of slotted ALOHA. An approach based on recurrent processes is applied to analyze the asymptotic behavior of the number of waiting calls under conditions of low retrial rate.Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 54–61, July–August, 1991.     

一种改进的ALOHA防碰撞算法

针对现有动态帧时隙ALOHA防碰撞算法在射频识别系统中的标签识别效率最高只能达36.8%的问题,利用标签码元序列的唯一性,改进经典的动态帧时隙ALOHA防碰撞算法中随机选择时隙的方式,提出一种基于标签码元的碰撞序列进行时隙选择的方法,有效降低了标签碰撞的概率,从而提高系统识别效率。仿真结果表明改进的ALOHA标签防碰撞算法识别效率最低为37.5%,随着实际标签数目与碰撞位序列所能确定的标签数目越接近,识别效率越高,最高能达到100%,明显优于现有的动态帧时隙ALOHA算法。     

伪贝叶斯稳定性算法性能研究*

针对时隙ALOHA的稳定性控制问题,建立了时隙ALOHA系统模型,研究了伪贝叶斯稳定性调整算法的原理。研究了实际负荷与估计负荷的差异对调整过程的影响。结果表明,该算法能够保证系统的稳定性,其调整时间随系统总体输入负载的变化增大而变长。为减小调节时间,需要对该算法进行改进。     

A framework for fast RFID tag reading in static and mobile environments

A framework for reducing the average reading time of passive RFID tags in dense environments is introduced. The proposed framework termed Accelerated Frame Slotted ALOHA (AFSA) can be used in conjunction with almost all RFID tag reading protocols that are based on frame slotted ALOHA. It is shown that AFSA reduces the tag reading time by avoiding the wastage in bit times due to collisions and idle slots. The implementation of AFSA in conjunction with two different ALOHA protocols – one with unlimited frame sizes and the other with limited frame sizes is discussed. For both these protocols, extensions of AFSA to read passive tags in a mobile setting are described. Simulation results show that AFSA reduces the average tag reading time by up to 40% with respect to the stand alone ALOHA protocols under both static and mobile settings.     

自适应动态时隙ALOHA防碰撞算法的研究

时隙ALOHA算法是射频识别系统中通过分时复用方式的一种防碰撞算法,应答器在分配到的时隙中与阅读器进行数据交互.提出一种改进的自适应帧时隙ALOHA防碰撞算法,能够使得时隙到优化分配,进一步提高应答器的识别效率.     

A multiwavelength control architecture for electronic processing bottleneck reduction in WDMA lightwave networks

In this paper we propose a new network architecture which uses several wavelengths as control channels for coordination of packet transmissions on data channels for single-hop WDMA networks and passive star topology. The distribution of control information over a number of control channels in conjunction with a suitable network interface reduces the electronic processing bottleneck at one of the end stations. Time is divided into fixed size cycles. The proposed schemes adopt the slotted ALOHA protocol for the access to control and data multichannel systems and differ in the adopted policy for data packet transmission. Analytic model is developed and analyzed for performance measures evaluation based on Poisson approximation statistics of both the infinite and finite population. Numerical results are discussed for various numbers of control and data channels. The effect of receiver collisions is analyzed and estimated by the average rejection probabilities at destination. Also simulation results are presented for comparison with the results obtained by performance analysis.     

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.     

一种新的RFID标签数目估算方法

动态帧时隙ALOHA反碰撞算法中帧长度调整的关键在于对阅读器读写范围内标签数目的估算。通过模拟帧时隙ALOHA算法得到了不同帧长度时标签数目与碰撞时隙数目的关系曲线。创建了碰撞时隙中的平均标签数目e和碰撞时隙所占比例P_C之间关系的数学表达式,该表达式对所有的帧长度都适用。在此基础上提出了一种新的RFID标签数目估算方法。该方法计算量小,不需要预先建立和存储查找表,有利于提高RFID系统的实时响应速度和降低硬件成本。 MATLAB仿真表明,提出的标签数目估算方法比现有的方法估算准确度有较大提高。     

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.     

自适应p坚持时隙ALOHA近似算法性能分析

动态频谱共享通信系统(DSSCS)的分布式网络中使用p坚持时隙ALOHA作为媒体接入控制协议,MAC驱动不支持浮点运算。分析了动态自适应p坚持算法的工作原理,并针对该算法中需要进行对数运算的问题,提出了二进制移位和泰勒级数展开两种近似处理算法。对近似算法对系统性能的影响进行了数值计算和仿真测试,结果表明,该近似算法在降低了运算复杂度的基础上,能获得接近于p坚持理论算法相近的性能。     

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.     

Enhanced frameless slotted ALOHA protocol with Markov chains analysis

In this paper, we propose a novel approach to enhance the performance of frameless slotted ALOHA (SA) protocol. We employ signature codes to help the receiver identify the packets contained in collisions, and use successive interference cancellation (SIC) for packet recovery. We model the proposed scheme as a two-state Markov model represented by a uni-partite graph. We evaluate the throughput, expected delay and average memory size of the proposed scheme, and optimize the proposed scheme to maximize the throughput. We show that the theoretical analysis matches well with simulation results. The throughput and expected delay of the proposed protocol outperform the conventional slotted ALOHA protocol significantly.