CSMA/CA在CSMA/TDMA混合网络中的性能分析

CSMA/CA机制与TDMA在同频段共存时会存在相互干扰,为评估混合网络中CSMA/CA的性能表现,将TDMA视为周期性的干扰提出改进的二维Markov分析模型,能够计算不同条件下的CSMA/CA饱和吞吐量,并通过仿真实验证明了模型的有效性。同时讨论了TDMA时隙分配方式对系统性能产生的影响,仿真结果表明时隙均匀分配方式能保证较低的时延和时延抖动,而连续分配方式能使CSMA/CA获得较高的吞吐量。提出将基于最低信道需求时间的阈值计算方法与吞吐量分析模型相结合,用于在不同应用场景下进行时隙分配方式的选择。     

一种M2M网络中的能量有效媒体访问控制协议

为了减小M2M网络中MAC(媒体访问控制)层接入冲突,提高数据传输效率和节点能量利用效率,提出了一种新的混合分组协议HG-MAC(Hybrid and Grouping MAC);HG-MAC混合利用基于调度与基于竞争的两种接入方式;对节点进行分组分层管理,减少冲突和提供QoS保障;采用休眠机制提高能量利用效率;引入动态调整机制和可变帧长度提高协议灵活性;通过建立二维马尔可夫链,对竞争时长与数据传输速率之间的关系进行了理论分析;利用OPNET仿真工具,将HG-MAC与CSMA/CA和TDMA的性能进行了仿真比较;结果表明HG-MAC在数据传输速率、能量效率和信道利用率上具有一定的优势。     

大型M/P/C/C排队系统仿真研究

理论上推测Erlang B 公式对服务时问为任意分布的M/G/C/C系统的呼叫损失概率是有效的但缺乏严格证明.据此,对服务时间呈 Pareto 分布的M/P/C/C排队系统的仿真问题进行了研究,特别是对排队系统中服务装置数目很大的情况进行了研究.采用一种名为红黑树的数据结构较好地解决了超长序列、超大C值所造成的计算时间问题,并采用基于事件驱动的时间调度法进行排队仿真,结果与 Erlang-B 公式相符.表明Erlang B公式对M/P/C/C系统的呼叫损失概率是有效的.为采用仿真方法对自相似流下的网络性能进行深入研究打下了基础.     

基于Java的排队系统仿真研究

在概述排队系统的基础上,分析了常见排队系统的数学特性,构建了新的事件驱动的仿真算法,应用Java对M/M/c,M/M/c/N, G/G/c/∞/K,G/G/c/N/K等排队系统进行仿真。最后对仿真结果进行了评估,发现基于Java用新算法仿真排队系统有速度快、精度高、应用面广等优点。     

MS/TP总线网络延迟性能分析与仿真

研究了BACnet总线通信,针对MS/TP网络中的节点和报文传输性能进行了分析。运用有限状态机理论,在仿真环境下建立了混合型MS/TP网络的随机通信模型。针对应用层服务如读属性报文的传输等进行了仿真运行,评估了MS/TP网络传输的平均服务延迟特性,给出了楼宇控制器网络通信中的网络数据帧数、传输速率、延迟三者之间的关系。研究表明,当报文产生时间平均间隔一定,随着最大数据帧数增加,总线利用率变大,网络平均延迟变大。运用该方法可针对实际的网络结构和节点数量,评估出该网络的数据传输最大平均延迟和最大数据帧数,为总线网络的设计及优化提供了依据。     

基于M/M/n/n+r排队模型的云计算中心服务性能分析

针对需要精确地评估分析云数据中心服务性能以保证服务质量(QoS)和避免违反服务水平协议(SLA)的问题,提出了一个基于M/M/n/n+r排队系统云计算中心近似分析模型。通过求解该模型获得用户请求响应时间的分布函数以及其他重要的QoS性能指标,同时通过仿真实验验证和获得服务器数量、队列缓冲区大小与响应时间、请求阻塞概率以及请求立即服务概率之间的关系。实验结果表明,提高服务器服务速率比增加服务器数量更利于提高服务性能。     

Ad hoc网络中TDMA/CSMA融合的多址接入协议

为了解决在网络规模庞大、节点数量众多及数据业务负载极高的Adhoc网络中网络延迟和接入延时过大的问题,提出了以TDMA为基本多址接入方式,且采用固定与动态结合的调度算法。在固定分配时采用基本的TDMA接入方式,在进行动态分配时,采用基于竞争的CSMA方案,且对原有的TDMA协议和CSMA协议进行了改进,提出了更加适合这种新的多址接入方式的时隙与帧结构。实例仿真结果表明,该算法减小了网络时延,并改善了Ad hoc网络的性能。     

并发PL/M语言

本文介绍并发程序设计语言CPL/M(concurrent PL/M).CPL/M程序设计语言是在顺序语言PL/M中加入并发成分而实现的,对PL/M语言本身没有进行任何修改。文中重点讨论了并发成分:进程、管程和SHARED类型。最后对CPL/M语言的实现情况作了简单介绍。     

一种新的竞争与分配相结合的MAC协议

针对IEEE 802.11在高竞争下吞吐量低,以及TDMA协议在低负载下吞吐量低的问题,提出了一种新的TDMA MAC协议：Q-TDMA。结合TDMA协议可以保证节点在每个周期内有一个发送机会,而同步CSMA/CA机制可以解决隐藏终端和暴露终端的问题,Q-TDMA协议要求节点根据本身的队列长度来竞争复用时隙。仿真实验结果表明,Q-TDMA提高了网络吞吐量,降低了端到端的延迟。     

利用发送和接收时隙分配策略改善无线传感器网络MAC协议能效

摘　要 针对无线传感器网络中存在数据冲突和串音而影响MAC协议能量效率的问题,提出了基于接收和基于发送的TDMA-MAC协议时隙分配策略。通过考虑各种无线收发器模式(即发送、接收、休眠和空闲)花费的不同时间段来计算WSN能耗,假设聚类中WN数据包时间间隔为指数分布,采用两级TDMA方法实现对多步聚类的评估。利用OPNET Modeler软件执行仿真实验验证了本文模型的有效性,仿真结果表明,基于接收的SAS的能效是基于发送的SAS的5倍,相比基于分簇的TDMA/CDMA混合HCT-MAC协议,本文协议可节省4.3%的能量,减少了0.35ms的端到端延迟,相比倍增超周期多信道MAC协议,可节省10.8%的能量,减少了1ms的端到端延迟。     

Calculation and Simulation of Message Delay on TDMA Short-wave Communication Network

TDMA protocol is a main channel access method of wireless networks used in military fields, which works by dividing a radio frequency into time slots and allocating slots to multiple calls. Two mathematical models are proposed to calculate the message delay. Based on analysis, the message delay in the queue of TDMA is composed of two parts, one can be calculated on M/M/1 theory, in which the waiting time is from the message coming into being to it being the header of the queue, the other can be modeled by the uniform distribution and Erlang distribution, in which the message waiting time is caused by the header waiting for its turn to be sent. Simulation results are compared with two methods, and Erlang distribution is closer to the simulation results than uniform distribution.     

Note on the article: Maximum entropy analysis of the M/M/1 queueing system with multiple vacations and server breakdowns

Wang et al. [Wang, K. H., Chan, M. C., & Ke, J. C. (2007). Maximum entropy analysis of the M^[x]/M/1 queueing system with multiple vacations and server breakdowns. Computers & Industrial Engineering, 52, 192–202] elaborate on an interesting approach to estimate the equilibrium distribution for the number of customers in the M^[x]/M/1 queueing model with multiple vacations and server breakdowns. Their approach consists of maximizing an entropy function subject to constraints, where the constraints are formed by some known exact results. By a comparison between the exact expression for the expected delay time and an approximate expected delay time based on the maximum entropy estimate, they argue that their maximum entropy estimate is sufficiently accurate for practical purposes. In this note, we show that their maximum entropy estimate is easily rejected by simulation. We propose a minor modification of their maximum entropy method that significantly improves the quality of the estimate.     

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.     

Optimal Measurement-based Pricing for an M/M/1 Queue

In this paper, we consider a system modelled as an M/M/1 queue. Jobs corresponding to different classes are sent to the queue and are characterized by a delay cost per unit of time and a demand function. Our goal is to design an optimal pricing scheme for the queue, where the total charge depends on both the mean delay at the queue and arrival rate of each customer. We also assume that those two values have to be (statistically) measured, introducing errors on the total charge that might avert jobs from using the system, and then decrease demand. This model can be applied in telecommunication networks, where pricing can be used to control congestion, and the network can be characterized by a single bottleneck queue; the throughput of each class would be determined through passive measurements while the delay would be determined through active measurements.     

认知车载网中基于TDMA/CSMA的混合多信道MAC协议研究

在传统车载自组网(Vehicular Ad Hoc Network, VANET)中采用认知无线电(Cognitive Radio, CR)技术可以解决无线电频谱资源短缺的问题,该技术形成了新兴的认知车载网络(CR-VANET),其关键技术之一是设计高效可靠的介质访问控制(Medium Access Control, MAC)协议。MAC协议在很大程度上影响着车载移动环境的吞吐量,丢包率和传输时延等性能,基于认知车载网中MAC协议的要求,提出了一种TDMA与CSMA相结合的多信道MAC协议(CRTC-MAC)。在固定时隙分配时采用基于无竞争的TDMA访问策略,在动态时隙分配时采用基于竞争的CSMA接入方案,并在此基础之上对传统的TDMA和CSMA访问方式进行了改进。性能分析和仿真结果表明,所提出的MAC协议能有效降低节点间数据包传输时所产生的碰撞,改善网络性能。     

基于反向平衡聚合树的无线传感器网络分布式TDMA调度算法*

讨论了已有的TDMA算法在端到端延时上的弊端,在优化时隙数的基础上引入链路的使用顺序与数据流向的相关性,提出了分布式TDMA调度算法,利用反向平衡聚合树的生成过程分配时隙,通过控制链路染色顺序分布式优化延时与避免冲突。仿真结果验证了算法在端到端延迟和通信开销上的性能提升。     

一种H2H和M2M混合场景下的前导码资源动态分配机制

在H2H和M2M混合场景下,随着大规模M2M(Machine-to-Machine)设备接入网络,受限于有限的接入前导码资源,H2H(Human-to-Human)用户的接入成功率会大幅降低。针对此问题,提出了一种H2H和M2M混合场景下的前导码资源动态分配机制。在满足H2H平均接入时延要求的情况下,动态调整分配给M2M设备的前导码资源数量,然后根据分配的资源数量,自适应调整每个随机接入子帧内参与竞争的M2M设备数量,最大化M2M设备的接入效率。对M2M设备接入成功率及H2H平均接入时延进行仿真,结果表明所提方法相比固定资源分配机制,在H2H平均访问时延较低的情况下,明显提高了M2M设备的接入成功率。