Contention-TDMA protocol: performance evaluation

A hybrid access protocol known, as contention time-division multiple access (C-TDMA), is presented and analyzed in a radio cellular multiuser system scenario. C-TDMA shows some features of contention-based (slotted-ALOHA) and reservation-based (packet reservation multiple access, PRMA) protocols. It has been recommended for use in the uplink of future European multimedia distribution systems. A simple Markov model is proposed to describe C-TDMA behavior. A complete statistical analysis of the model has been made in order to evaluate the performance of the protocol. However, due to the long computation time required in the presence of a large number of users, a simpler approach known as equilibrium point analysis (EPA) is used. Moreover, on the basis of the EPA analysis and the C-TDMA design parameters, a fast algorithm has been developed to improve the achievable throughput of C-TDMA. Results in terms of throughput and delay under variable traffic conditions indicate that C-TDMA is able to grant optimum throughput/delay figures for typical multiuser systems. Moreover, for a digital speech scenario, a performance comparison with PRMA demonstrates that C-TDMA yields equivalent performance to PRMA in terms of number of users supported by the system with a limited packet dropping rate     

Voice and data transmissions with a PRMA-like protocol in highpropagation delay cellular systems

Future mobile communication systems will require new medium access control protocols to attain an efficient multiplexing of different traffic sources while guaranteeing their requirements on quality of service. This paper investigates the performance of a modified packet reservation multiple access (PRMA) protocol, called PRMA with hindering states (PRMA-HS), for supporting voice and data transmissions in mobile cellular systems with high propagation delays. A scenario based on low Earth orbit mobile satellite systems (LEO-MSSs) has been considered, but the analytical approach is general. We have obtained that PRMA-HS achieves a high capacity of voice sources in LEO-MSSs also in the presence of data traffic. A performance analysis has been carried out showing good agreement with simulation results. Finally, the PRMA-HS performance has been evaluated in the presence of different data traffic sources     

A Bandwidth Reservation Multiple Access Protocol for Wireless ATM Local Networks

A bandwidth reservation multiple access scheme(BRMA) is proposed to resolve contention and assignbandwidth among multiple users trying to gain access toa common channel such as in mobile users contending for resources in an ATM-based cellular networkor a wireless local area network (LAN) with shortpropagation delays. The protocol is best suited tosupport variable-bit-rate (VBR) traffic that exhibits high temporal fluctuations. Each mobile user isconnected end-to-end to another user over virtualchannels via the base station that is connected to thewired ATM B-ISDN network. The channel capacity is modeled as a time frame with a fixed duration.Each frame starts with minislots, to resolve contentionand reserve bandwidth, followed by data-transmissionslots. Every contending user places a request for data slots in one of the minislots. If therequest is granted by the base station through adownlink broadcast channel, the user then startstransmission in the assigned slot(s). The number ofassigned slots varies according to the required qualityof service (QoS), such as delay and packet lossprobability. A speech activity detector is utilized inorder to indicate the talkspurts to avoid wastingbandwidth. Due to its asynchronous nature, BRMA is ratherinsensitive to the burstiness of the traffic. Since theassignment of the minislots is deterministic, therequest channels are contention-free and the data channels are collision-free. Hence, in spite ofthe overhead (minislots) in each frame, BRMA provideshigher throughput than Packet Reservation MultipleAccess (PRMA) for the same QoS, especially for high-speed systems. A better delay performance is alsoachieved for data traffic compared to Slotted Alohareservation-type protocol PRMA. In addition, BRMAperforms better in terms of bandwidth efficiency thanthe conventional TDMA or the Dynamic TDMA, wherespeech activity detectors are very difficult toimplement.     

Virtual Time CSMA: Why Two Clocks Are Better than One

A new carrier sense multiple access (CSMA) algorithm, called virtual time CSMA, is described and analyzed. This algorithm uses a novel approach to granting access to the shared broadcast channel based on variable-rate clocks. Unlike other CSMA algorithms, the operation of virtual time CSMA reduces to the ideal case in the zero propagation time limit: a work-conserving, first-come first-servedM/G/1queueing system. The algorithm does not appear to be difficult to implement, but offers better throughput-delay performance than existing CSMA algorithms. A simple closed form technique for estimating the mean message delay is presented. This technique is of independent interest because of its applicability to certain "sliding window" tree conflict resolution algorithms. Extensive numerical results for the algorithm are presented, including comparisons with simulation and with other CSMA algorithms.     

Output and delay process analysis for slotted CDMA wirelesscommunication networks with integrated voice/data transmission

This paper presents the output and delay process analysis of integrated voice/data slotted code division multiple access (CDMA) network systems with random access protocol for packet radio communications. The system model consists of a finite number of users, and each user can be a source of both voice traffic and data traffic. The allocation of codes to voice calls is given priority over that to data packets, while an admission control, which restricts the maximum number of codes available to voice sources, is considered for voice traffic so as not to monopolize the resource. Such codes allocated exclusively to voice calls are called voice codes. In addition, the system monitoring can distinguish between silent and talkspurt periods of voice sources, so that users with data packets can use the voice codes for transmission if the voice sources are silent. A discrete-time Markov process is used to model the system operation, and an exact analysis is presented to derive the moment generating functions of the probability distributions for packet departures of both voice and data traffic and for the data packet delay. For some cases with different numbers of voice codes, numerical results display the correlation coefficient of the voice and data packet departures and the coefficient of variation of the data packet delay as well as average performance measures, such as the throughput, the average delay of data packets, and the average blocking probability of voice calls     

Traffic Adaptive PRMA Techniques for ATM Wireless Networks

High-speed asynchronous transfer mode (ATM)wireless networks are assuming a growing interest in thepersonal communication area. This paper proposes anaccess technique for such networks, which is being implemented in the MEDIAN project belonging tothe European Community (EC) Advanced CommunicationsTechnologies and Services (ACTS) program. The proposedaccess technique aims at providing a simple, efficient, and transparent transport for ATM cells from abase station (BS) interfaced with the ATM network, toATM portable stations (PSs) and vice versa. Atime-division duplex (TDD) scheme is adopted in whichuplink and downlink frame durations can be variedframe-by-frame, in order to fit the presentuplink/downlink traffic mix. In the uplink, anappropriate packet reservation multiple access(PRMA)-based technique is considered.     

Voice/Data Integrated Wireless Channel Access in Third Generation Digital Cellular Networks: The Performance of Bursty Data Generated by Interactive Applications

Mobile wireless communications, which includecellular telephones, land mobile radio, and personalcommunications systems, have experienced enormous growthover the last decade. Data services represent a critical component of future wirelesscommunications, but have received little attention sofar. While some attention has been given to specializedmobile data networks, less has been directed at the ongoing design of data services in evolvingthird generation digital cellular wireless networks. Inthis work we present the results of a simulation studythat explores the performance of a Reservation Random Access (RRA) scheme for transmittingdata packets over a common radio broadcast channel in acellular radio environment. In addition to voicetraffic, we consider data packet traffic generated by interactive applications. It is expected thatsuch applications will be very important in thirdgeneration wireless access mobile communication systems.Through an extensive simulation study of the data message delay distribution, we show that theproposed RRA scheme, originally designed under thePoisson data message arrival process assumption, canalso efficiently operate and be optimized under theextremely bursty data message arrival processcharacterized by independent, identically distributed,Pareto message interarrival times.     

Modeling and simulation of mixed traffic on a prioritized shared medium

Network access systems (NAS) such as digital loop carriers (DLC) are increasingly utilizing a shared medium, such as Hybrid Fiber Coax (HFC) to provide point‐to‐multi‐point access from the public switched telephone network (PSTN) to the end user (consumer). New services, such as direct access to the packet switched network (PSN, WWW) have been added to DLC equipment in such a way as to provide for a prioritized set of services over a shared medium in an effort to take advantage of otherwise unused bandwidth. The introduction of such services requires the modeling and analysis of these network access systems. This becomes complex when considering the variability in different service type traffic characteristics. This work identifies a traffic engineering problem of prioritized circuit switched and packet switched (PSTN/PSN) traffic over the same shared medium as it may relate to “perceived” quality of service (QoS). Copyright © 2002 John Wiley & Sons, Ltd.     

Packet CDMA versus dynamic TDMA for multiple access in anintegrated voice/data PCN

A comparative evaluation of dynamic time-division multiple access (TDMA) and spread-spectrum packet code-division multiple access (CDMA) approaches to multiple access in an integrated voice/data personal communications network (PCN) environment are presented. After briefly outlining a cellular packet-switching architecture for voice/data PCN systems, dynamic TDMA and packet CDMA protocols appropriate for such traffic scenarios are described. Simulation-based network models which have been developed for performance evaluation of these competing access techniques are then outlined. These models are exercised with example integrated voice/data traffic models to obtain comparative system performance measures such as channel utilization, voice blocking probability, and data delay. Operating points based on typical performance constraints such as voice blocking probability 0.01 (for TDMA), voice packet loss rate 10^-3 (for CDMA), and data delay 250 ms are obtained, and results are presented     

一种用于水声传感网的MAC层协议

针对分簇的水声传感网,提出了一种基于时分多址（TDMA）的MAC层协议——Cluster-TDMA。该协议主要由规划阶段和传输阶段组成。规划阶段,首先由网关节点规划能造成簇间干扰的子节点的传输,其次由各簇头节点分别规划本簇内其他子节点的传输;传输阶段,子节点根据规划表周期性地向簇头节点发送数据,这些数据最终汇聚到网关节点。该协议简单有效地解决了引起簇间干扰子结点的传输规划问题。C++仿真实验表明,该协议具有良好的吞吐率和能量效率性能。     

A slotted CDMA protocol with BER scheduling for wireless multimedianetworks

In future wireless multimedia networks, there will be a mixture of different traffic classes which have their own maximum tolerable bit error rate (BER) requirements. In this paper, a novel medium access control (MAC) protocol called wireless multimedia access control protocol with BER scheduling (in short form, WISPER) for CDMA-based systems is proposed. WISPER utilizes the novel idea of scheduling the transmission of multimedia packets according to their BER requirements. The scheduler assigns priorities to the packets, and performs an iterative procedure to determine a good accommodation of the highest-priority packets in the slots of a frame so that packets with equal or similar BER requirements are transmitted in the same slots. The proposed WISPER protocol has been validated using a software emulator on the cellular environment. Performance evaluation results based on the implementation are also included     

Fuzzy/neural congestion control for integrated voice and dataDS-CDMA/FRMA cellular networks

The paper proposes congestion control using fuzzy/neural techniques for integrated voice and data direct-sequence code division multiple access/frame reservation multiple access (DS-CDMA/FRMA) cellular networks. The fuzzy/neural congestion controller is constituted by a pipeline recurrent neural network (PRNN) interference predictor, a fuzzy performance indicator, and a fuzzy/neural access probability controller. It regulates the traffic input to the integrated voice and data DS-CDMA/FRMA cellular system by determining proper access probabilities for users so that congestion can be avoided and the throughput can be maximized. Simulation results show that the DS-CDMA/FRMA fuzzy/neural congestion controllers perform better than conventional DS-CDMA/PRMA with channel access function in terms of voice packet dropping ratio, corruption ratio, and utilization. In addition, the neural congestion controller outperforms the fuzzy congestion controller     

Performance of a Dynamic TDMA System for Mobile Wireless Access

A dynamic TDMA system can utilize voice activityand allow the integration of voice and data traffic.This can be achieved by allocating frequency channelsand time slots on demand. In this approach, upon the arrival of a talkspurt or a data packet,the base station is requested to assign a time slot foreach transmission. Message requests and assignments ofmobile users are carried over a Control channel, while the voice and traffic are transmittedover a Traffic channel. Time slot assignments are madefrom a pool of Traffic channels. A numberof slots in the pool will be shared by voice and data, with voice having priority over data, andthe remaining will be used by data only. Voice slots arereserved for the duration of the talkspurt whereas datapackets are assigned on a per-slot basis. Data packets can be buffered whereas voicetraffic can only tolerate limited delay beyond whichtalkspurts will be clipped off. The Control channeluplink access is based on Slotted Aloha so that mobile users have autonomous access to base stations.This paper presents the performance of the dynamic TDMAsystem outlined here. The analysis aims at assessing thecapacity gained by using voice activity and voice/data integration, in terms of theimpairments introduced to voice quality (e.g., speechclipping and/or delay) and the delays to data packets.The analysis has been based on a discrete time Markov model operating on a frame-by-frame basis thatprovides the joint distribution of the number of activevoice and data users in the system. The analysis alsoevaluates the delays of message requests via the uplink control channel. In evaluating theclipping probability, we combine the impact of both theaccess delays at the control channel as well as theunavailability of time slots in the pool. Performance results indicate that the capacity gain mayexceed 80% and the speech clipping can be kept below 1%.Also, data packets may be transmitted with limiteddelays even when all capacity is allocated for voice users. The proposed approach may be used toenhance the capacity of the existing TDMA cellularsystems and to provide integration of voice and dataservices.     

Increasing the Link Utilization in IP over WDM Networks Using Availability as QoS

In this paper, we solve a mapping problem related to supporting two service classes that are differentiated based on their level of protection. The first class of service, called Fully Protected (FP), offers end-users a guarantee of survivability in the case of a single failure; all FP traffic is protected using either a 1:1 or 1 + 1 protection scheme at the WDM layer. The second class of service, called Best-Effort Protected (BEP), is not protected; instead restoration at the IP layer is provided. When a failure occurs, the network restores as much BEP traffic as possible, and thus BEP traffic does not receive any specific guarantees. The FP service class mimics what Internet users receive today. The BEP traffic is designed to run over the large amounts of unused bandwidth that exist in todays Internet. The motivation of this approach is to give carriers a mechanism for increasing the load carried on backbone networks without reducing the QoS received by existing customers. In order to support two such services, the logical links at the IP layer need to be carefully mapped onto primary and backup paths at the optical layer. We incorporate into our mapping problem a number of practical requirements that reflect constraints that carriers face and policies they want to enforce. For example, we allow the FP demand to be specified via a traffic matrix at the IP layer, we include an overprovisioning factor that specifies the portion of each link that must be left unused, and we incorporate a minimal fairness requirement on how the BEP traffic is allocated among connections. Our goal is to quantify how much BEP traffic can be carried in addition to the FP traffic, without impacting the protection quality of the FP traffic even in the case of failure, and without impacting the FP load. We provide two solutions, one is an optimal solution using an Integer Linear Program (ILP) model, and the other is an algorithm based on the Tabu Search (TS) methodology. Our heuristic algorithm allows us to solve this problem for large networks such as those spanning the continental US. We show that by having two such classes of service, the load on a network can be increased by a factor of 4–7 (depending upon the network). We illustrate that even with overprovisioning and fairness requirements (both of which reduce the total possible BEP load carried), we can still typically triple the total network load. We show that the location of the bottleneck can affect whether or not we see a difference in performance between 1:1 or 1 + 1 protection schemes. Our results illustrate the gain in terms of additional BEP load carried that can be obtained simply due to the upgrade of a single link. Our proposal provides carriers a new vehicle for generating revenue by extracting benefit from all the sources of unused bandwidth in networks.     

自相似业务合成流的建模及排队性能分析

近期起初网络流量分析表明很多信息源会产生在多时间尺度下具有自相似特性的信息流,据此人们采用模拟及分析的方法对此种业务流对ＡＴＭ交换机／复用器性能的进行了研究,发现了与传统短打关模型完全不同的排除生但是到２为止对于自相关信息流的复用问题尚未发现有要进行研究。而这个问题的解决对自相似业务流条件下的ＡＴＭ交换机／复用器性能分析,接入控制（ＣＡＣ）等都具有很重要的意义。本文基于临界时间尺度的概念对这个问题     

Power consumption modeling and optimization for NB-IoT eDRX

To extend the battery life of massive machine type devices (MTD),narrow-band Internet of things (NB-IoT) system extended discontinuous reception (eDRX) mechanism of LTE to the maximum as well as introduced a lower power state named as power saving mode (PSM).Three Markov models were established for three typical NB-IoT traffic scenarios,which called mobile autonomous reporting periodic report (MAR-P),mobile autonomous reporting exception report (MAR-E),software update/reconfiguration (SUR).The states of each Markov model were the working status of MTDs,including connected,idle and PSM state,in which the connected state was divided into random access state and data translating/receiving state to further evaluate the additional power consumption caused by collisions from massive MTDs concurrent access.Thereby,the power consumption and delay models with respect to each traffic scenarios were derived.Since the frequency of MAR-P traffic was far greater than the other two,the battery life of this traffic case with its optimal design choice was comprehensively analyzed.Numerical results show that,the battery life is mostly influenced by transmission period,maximum number of random access attempts,maximum number of data transmissions and traffic load,which can be maximized by appropriate parameters setting up.These works provide good references for NB-IoT device behavior modeling and optimization design.     

Reciprocal circular-polarization-selective surface

This paper presents the concept of an electromagnetic surface called the circular-polarization-selective surface (CPSS). Few papers have dealt with the CPSS, and it has even been argued that the ideal CPSS belongs to the category of impossible polarizers. We present herein a theoretical proof for the existence of the ideal CPSS, review the prior art in this area, identify some geometrical constraints inherent to such a device, and present the results of numerical computations     

A design of macro-micro CDMA cellular overlays in the existing bigurban areas

We focus on delivering radio engineers a practical design of macro-micro code division multiple access (CDMA) cellular overlays. First, we review our algorithmic approach to jointly deploy macrocells and microcells over today's big urban areas having spatially nonuniform traffic distributions. Next, we identify several further issues related to the optimal design of macro-micro cellular overlays and enhance the cell-deploying algorithm to reflect these issues. The numerical results by extensive event-driven simulations show that the resulting macro-micro cellular overlays successfully cope with the existing conditions of today's big urban areas, such as spatial and temporal traffic distributions and user mobility characteristics. Finally, we discuss the practical guidelines for designing macro-micro cellular overlays in the existing big urban areas