Performance analysis of IEEE 802.11 DCF and 802.11e EDCA based on queueing networks

The authors propose a new analytical model based on BCMP closed queueing networks in order to evaluate the performance of IEEE 802.11 DCF MAC protocol when all nodes are in the transmission range of each other, that is, a single hop wireless ad hoc network. By the proposed model, some performance metrics such as saturation and non-saturation throughput, distributions of channel access delay and the number of packets in the MAC buffer are derived. An extension of the proposed model is used for the analysis of IEEE 802.11e EDCA and the same performance metrics are evaluated for this protocol. Analytical results on IEEE 802.11e prove that differentiation in service is possible and channel share for each service type may be well assigned by tuning the MAC protocol parameters. Simulation results show consistency with our analytical results.     

Interaction between radio link level truncated ARQ, and TCP in multi-rate wireless networks: a cross-layer performance analysis

A complete queueing model for radio link layer performance analysis is developed assuming adaptive modulation and coding (AMC) at the physical layer and truncated automatic repeat request (ARQ)-based error control at the link layer. From the model, queue length distribution and average queueing delay can be calculated. The average queueing delay is then used to estimate transmission control protocol (TCP) throughput performance using a fixed-point approach. Using the model, we are able to choose signal-to-noise ratio thresholds of different transmission modes for AMC at the physical layer for different persistence levels of ARQ at the link layer so that TCP throughput is maximized. We observe that channel correlation negatively impacts the TCP throughput performance. Also, throughput enhancement of TCP NewReno over TCP Reno is observed to be non-negligible only if no ARQ-based error recovery is employed at the link layer.     

Game-theoretic medium access control protocol for wireless sensor networks

In the traditional medium access control (MAC) protocols for wireless sensor networks (WSNs), energy consumption is traded for throughput and delay. However, in future WSNs, throughput and delay performance had better not be sacrificed for energy conservation. Here first, an incompletely cooperative game-theoretic heuristic-based constraint optimisation framework is introduced to achieve the goals of throughput, delay and energy conservation simultaneously. Then a simplified game-theoretic MAC (G-MAC) protocol is presented, which can be easily implemented in WSNs. Simulation results show that compared with two typical MAC protocols for WSNs, sensor MAC and timeout MAC, G-MAC can increase system throughput, and decrease delay and packet-loss-rate, while maintaining relatively low energy consumption.     

一种基于CSMA/CA的水声网络功率控制MAC协议

水声通信网络在资源勘探、灾害预报、环境监测等方面有广阔的应用前景。由于水声通信环境传播延迟高、带宽窄,TDMA、FDMA等多址接入方式的应用受到了限制,因此在水声网络中一般采用随机接入的方式。CSMA／CA是一种得到广泛应用的多址接入协议。在CSMA／CA协议的基础上,设计了一种适用于水声网络的功率控制MAC协议-PC-CSMA／CA协议。PC-CSMA／CA协议利用CSMA／CA进行RTS／CTS预约的特点,进行数据包传输的自适应功率调整,在不影响CSMA／CA协议的性能的同时节约了能量。仿真结果表明：改进后的协议大大减少了能量消耗,且不影响网络的吞吐量。     

Software architecture design,implementation, and evaluation of DCF-based MAC protocol on a low-power transceiver

The carrier-sensing multiple access with collision avoidance (CSMA/CA) protocol is the most well-known medium access control (MAC) protocol for wireless networks. Both the distributed coordination function (DCF) defined in IEEE 802.11 and the MAC layer defined in IEEE 802.15.4 are based on the CSMA/CA protocol. Nevertheless, these two standards have quite different carrier-sensing mechanisms. Different to continuous carrier sensing in DCF, an IEEE 802.15.4 node only senses the channel once just after a backoff. Sensing-once mechanism can reduce the computation loading on the CPU. However, it significantly increases the probability of failure transmission because a node is not fully aware of channel activity. This paper first proposes a software architecture integrating proper hardware features for designing a DCF-based MAC protocol and then successfully implements it on a low-power transceiver. In addition, this paper conducts experiments in a star topology network to compare the performance of the above DCF-MAC protocol with the IEEE 802.15.4 MAC protocol. Experimental results show that, without continuous sensing, the IEEE 802.15.4 network suffers a high transmission failure probability as the network size increases. Consequently, the proposed DCF-based MAC protocol outperforms the IEEE 802.15.4 MAC protocol in terms of packet loss probability and throughput.     

分簇无线传感器网络的双时槽混合MAC协议

基于事件驱动的无线传感器网络应用,提出了一个基于分簇优化的低时延混合MAC协议--CHMAC.CHMAC采用双时槽传输调度和载波检测多路接入/时分多址接入(CSMA/TDMA)混合模式,采用适合分簇网络的时槽分配,优先保证紧急事件的最小延迟发送,并充分利用分簇网络的数据流特点,精细控制节点的侦听、睡眠以及传输功率,以提高能量有效性和网络吞吐量.理论分析和模拟试验表明,该协议能够以良好的适应性和健壮性在各种流量条件下均表现良好的性能.     

延迟利用的多节点协同预约式水声网络MAC协议

水声网络媒体接入控制(Media Access Control,MAC)层为水声节点提供接入和冲突避免服务。由于水声信道面临着传播延迟高、带宽窄等困难,水声网络MAC协议的性能较低。文章在MACA-U协议的基础上,针对水声网络传播延迟高的特点,对信道预约的长等待时间进行利用,提出了一种RS-MACA协议。该协议在负载较低时与MACA-U协议兼容;在负载较高时,邻近节点可采用"并行发送"的方式发送,显著提高了吞吐量性能。发射节点在信道预约等待时间内,同时接受符合条件的邻节点的发送预约,邻节点不需要消耗额外时间进行信道预约。完成预约的节点按照时隙进行数据发射,避免了数据包的碰撞。NS3软件仿真结果表明,与MACA-U协议相比,改进后的协议吞吐量性能有明显的提升。     

A pinwheel packet scheduling scheme for broadband wireless networks

Abstract

A frame‐based packet scheduling scheme, the pinwheel scheduling (PWS) scheme, is proposed and investigated at the medium access control (MAC) layer in broadband wireless networks. The objective of the proposed scheduling scheme is to provide low delay and low jitter for real‐time traffic. We have demonstrated in this paper that the proposed PWS scheme not only satisfies the packet‐level QoS requirements but also has low implementation cost. The PWS scheme gives the highest priority to CBR connections in a service cycle to minimize their delay and jitter. For ABR traffic, a number of slots are allocated to fit their MCR. The remaining time slots are then allocated to VBR traffic according to their PCR. Thus, the VBR traffic may suffer large delay and jitter when the number of CBR connections increases. The PWS with modular strategy (PWS/MS) is proposed to improve the performance of the VBR traffic. We also introduce three different slot‐reuse strategies named real‐time traffic first (RTF), non‐real‐time traffic first (NRTF) and longest queue first (LQF), respectively, to improve resource utilization. In order to demonstrate the performance of the PWS and PWS/MS schemes, comparisons are made with existing schemes such as the round‐robin (RR) and weighted‐round‐robin (WRR) by using OPNET software. Simulation results show that the proposed schemes are capable of maintaining the lowest delay and jitter for VBR and CBR traffic while not sacrificing the available bit rate (ABR) traffic.     

面向多媒体业务的无线ATM多址接入协议

基于MDR-TDMA（Multi-service Dynamic Reservation-TDMA）的无线ATM多址接入控制协议包括两个主要的过程，即请求报文的信息时隙的分配过程，对于前者，通过基于帧的自适应伪贝叶斯ALOHA算法，在保证请求报文最优吞吐率的条件下，实现了不同优先级的请求报文接入。对于后者，着重分析了以视频会议为模型的VBR业务的带宽分配，提出了一种新的带宽分配方法-Minmax算法，并将它的仿真结果与线性比例算法进行比较。     

Differentiated cooperative multiple access for multimedia communications over fading wireless networks

The quality of service (QoS) support for multimedia communications faces a big challenge in a fading wireless network. On one hand, conventional automatic repeat request (ARQ) schemes are not effective for small-scale fading channels with correlated errors due to consecutive retransmission failures. On the other hand, large-scale fading due to propagation loss or shadowing severely limits transmission range. A novel differentiated cooperative medium access control (MAC) protocol, called DC-MAC, is proposed to enhance the QoS support for multimedia communications while supporting service differentiation based on the IEEE 802.11e architecture. By enabling cooperative ARQ, the retransmission is initiated from an appropriate transmission queue of an appropriate relay node instead of the original source. Since unnecessary and useless retransmissions may intensify the node contention and degrade the system performance contrarily, a novel negative acknowledgement feedback mechanism is introduced for loss distinguishing and channel estimation such that cooperative retransmission will be employed only when necessary and only by competent nodes. Extensive simulations are conducted on the OPNET platform to analyse the performances of DC-MAC under both small-scale and large-scale fading. Simulation results show that the proposed scheme significantly improves the performances of both multimedia applications and best-effort data applications in terms of throughput, delay and coverage with moderate user contention.     

Computer protocol and torus maps

We investigate the dynamics of maps and flows which arise from a class of models of closed queueing networks in computer science theory. The network consists of n+/ servers, one of which is a central server with a queue of size n-1. A protocol or scheduling discipline must be specified in this server to define the queueing network. The standard model gives rise to a flow on an n-torus. We consider the service protocols first in-first out (FIFO) and last in-first out (LIFO) in dimension three, for which the state spaces are modifications of a 3-torus. We present a sufficient condition on the time it takes each call to complete one cycle for the FIFO protocol which guarantees that the set of periodic orbits which involve no waiting in the queue is a global attractorfor the associated semi-flow. We also investigate the dynamics for the LIFO service protocol via a return map derived from the associated area preserving flow.     

Dynamic production control in a serial line with process queue time constraint

This research examines the production control problem in two-station tandem queueing systems under time constraints. In these two-station tandem queueing systems, jobs must first be processed at the upstream station and then the downstream station. For each job, the sum of the waiting and processing time in the downstream queue is limited by an upper bound. This time constraint is called the process queue time constraint. When the process queue time constraint is violated, a significant scrap cost will be accrued. In this research, we develop a Markov decision model to study the production control problem under process queue time constraints. The objective is to minimise the sum of the expected long-run average inventory holding costs and scrap costs. According to the Markov decision model, an interesting exhaustive structure of the optimal production control policy is found. Based on this exhaustive structure, an efficient algorithm is developed to solve the production control problem numerically. The performance of the proposed algorithm is verified by a simulation study. Compared with other heuristics in the literature, the proposed algorithm can significantly reduce production costs while improving system throughput and utilisation.     

Distributed splitting-tree-based medium access control protocol for multiaccess wireless networks with multipacket reception

The conventional medium access control (MAC) protocols assume that only one packet can be received at a given time. However, with the advent of spread spectrum, antenna arrays or sophisticated signal processing techniques, it is possible to achieve multipacket reception (MPR) in wireless communication networks. A distributed splitting-tree-based MAC protocol that can exploit the MPR capability in the networks is proposed. For the MPR MAC protocol, a closed-form expression of the system throughput is derived based on a Markov chain model. The experimental results show that the MPR protocol can considerably increase the spectrum efficiency compared with the splitting-tree algorithm with its conventional collision resolution method.     

Approximate Analysis for the Merge Configuration of an Open Queueing Network with Blocking

A merge configuration of open queueing networks with exponential service times and finite buffers is analysed. We offer an iterative algorithm to approximate the steady-state probabilities for each queue of the system. The procedure decomposes the queueing network into individual queues and analyses each individual queue in isolation. An M/M/l/N or M/G/l/N model is used for the analysis of the merging queues; an M/M/l/N with state dependent arrival rates is used for the receiving queue. The approximation method is easy to implement, requires little memory, is computationally fast and yields very accurate results.     

Transfer coefficients on the shell progressive poisoning model

Abstract

The idle server first (ISF) routing strategy in a finite queueing system with multiple unequal‐rate synchronous servers is studied. This paper extends the work of [4] by considering unequal‐rate servers. The input is assumed to be a batch Poisson distribution. The state transition equations used to describe the queueing behavior of the system are successfully solved. The performance measures, including average message blocking probability, average packet delay, average message delay, and system throughput, are obtained. The results show that ISF routing can have pretty good performance, and its effective measures are almost independent of routing probabilities. Validity of the analysis has also been verified by computer simulations.     

Improved power-saving medium-access protocol for IEEE 802.11e QoS-enabled wireless networks

The performance of a new pointer-based medium-access control protocol that was designed to significantly improve the energy efficiency of user terminals in quality-of-service-enabled wireless local area networks was analysed. The new protocol, pointer- controlled slot allocation and resynchronisation protocol (PCSARe), is based on the hybrid coordination function-controlled channel access mode of the IEEE 802.11e standard. PCSARe reduces energy consumption by removing the need for power-saving stations to remain awake for channel listening. Discrete event network simulations were performed to compare the performance of PCSARe with the non-automatic power save delivery (APSD) and scheduled-APSD power- saving modes of IEEE 802.11e. The simulation results show a demonstrable improvement in energy efficiency without significant reduction in performance when using PCSARe. For a wireless network consisting of an access point and eight stations in power-saving mode, the energy saving was up to 39% when using PCSARe instead of IEEE 802.11e non-APSD. The results also show that PCSARe offers significantly reduced uplink access delay over IEEE 802.11e non-APSD, while modestly improving the uplink throughput. Furthermore, although both had the same energy consumption, PCSARe gave a 25% reduction in downlink access delay compared with IEEE 802.11e S-APSD.     

Performance analysis of multipath transmission over 802.11-based multihop ad hoc networks: a cross-layer perspective

Data transmission in ad hoc networks involves interactions between medium access control (MAC)-layer protocols and data forwarding along network-layer paths. These interactions have been shown to have a significant impact on the performance of a system. This impact on multipath data transmission over multihop IEEE 802.11 MAC-based ad hoc networks is assessed; analysis is from a cross-layer perspective. Both MAC layer protocols and network-layer data forwarding are taken into account in the system models. The frame service time at source in a 802.11 MAC-based multipath data transmission system under unsaturated conditions is studied. Analytical models are developed for two packet generation schemes (round robin and batch) with a Poisson frame arrival process. Moreover, an analytical model is developed to investigate the throughput of a multipath transmission system in 802.11-based multihop wireless networks. Two methods are proposed to estimate the impact of cross-layer interactions on the frame service time in such a system. Two bounds of the system throughput are obtained based on these estimation methods. These models are validated by means of simulation under various scenarios.     

随机丢弃机制下分组丢失重传的缓存性能分析

基于网络随机丢弃(RD)分组机制的缓存管理策略,建立了M/M/1/K排队模型和分组丢弃重传的M1 M2/M/1/K排队模型,以解决被丢弃的分组不重传和实现以一定概率重传的问题.利用生灭过程的极限定理和矩阵几何解方法给出了相应排队系统诸如缓存队列中平均分组数、平均重传分组数、系统利用率、分组丢失率和单位时间内平均进入缓存分组数等稳态性能指标.两类系统性能指标的数值比较结果表明,具有RD机制的缓存管理策略必须充分考虑分组重传对系统性能指标的影响.     

Queueing network model for a class of material-handling systems

A queueing network-based approximation model was developed to evaluate the performance of a fixed-route material-handling system supporting a multiple-workcentre manufacturing facility. The closest transporter allocation scheme was used to assign empty transporters to jobs needing to be moved between various workcentres. This control methodology creates two interesting difficulties that require solving for an accurate approximation model. A model of the distributions of the location of an assigned transporter as a function of the number of available transporters is developed. In addition, it is shown that owing to the strong dependent service time aspect of this situation, the standard queueing network decomposition approach of treating the material-handling systems as a GI/G/c queue can be highly inaccurate. Thus, it is necessary to develop a dependent service-time model for approximating the queueing delay encountered while waiting for an empty transporter assignment.     

Analysis of finite-buffer state-dependent bulk queues

In this paper, we consider a general state-dependent finite-buffer bulk queue in which the rates and batch sizes of arrivals and services are allowed to depend on the number of customers in queue and service batch sizes. Such queueing systems have rich applications in manufacturing, service operations, computer and telecommunication systems. Interesting examples include batch oven processes in the aircraft and semiconductor industry; serving of passengers by elevators, shuttle buses, and ferries; and congestion control mechanisms to regulate transmission rates in packet-switched communication networks. We develop a unifying method to study the performance of this general class of finite-buffer state-dependent bulk queueing systems. For this purpose, we use semi-regenerative analysis to develop a numerically stable method for calculating the limiting probability distribution of the queue length process. Based on the limiting probabilities, we present various performance measures for evaluating admission control and batch service policies, such as the loss probability for an arriving group of customers and for individual customers within a group. We demonstrate our method by means of numerical examples.