Dual bus MAN's with multiple-priority traffic

A protocol with strictly preemptive priorities that does not admit low-priority traffic if the load from high-priority traffic exceeds the capacity of the transmission channel in a MAN is presented. The protocol guarantees fairness for transmissions at the highest priority level. By introducing a general characterization of bandwidth allocation schemes for dual bus networks, existing priority mechanisms can be categorized according to the provided quality of service. The unique existence of a bandwidth allocation scheme for multiple priority traffic is shown with a full utilization of the channel capacity, with a fair distribution of bandwidth respective to traffic from a particular priority level, and with preemptive priorities. The performance of the presented protocol is compared to existing proposals for multiple priority mechanisms. It is shown that adopting the new protocol results in shorter access delays for high-priority transmissions. The protocol allows the stations of the network to react quickly to load changes. It is shown that the effectiveness of the priority scheme, compared to priority schemes using the bandwidth-balancing mechanism, is less dependent on increasing the transmission speed of the network     

支持话音/数据分组并传的UPMA多址接入协议

本文提出了一种新的、支持数据/话音业务并传的多址接入协议——根据用户数目妥善安排分组传输的多址接入(User-dependent Perfect-scheduling Multiple Access——UPMA)协议,它根据实际需求对上、下行带宽资源实行动态分配.UPMA协议对不同的业务类型赋予不同的优先级,并用轮询方式妥善地安排节点的分组传输;同时,它采用独特的帧结构,使话音业务总是能够得到优先传输.本文还提出了一种高效的竞争接入算法,以保证激活的节点能够快速接入信道.最后,对UPMA协议的性能进行了仿真并与MPRMA协议的性能进行了比较,结果证明UPMA协议有更好的性能.     

Block Reservation Time Division Multiple Access (BRTDMA) Protocol for a High Capacity Wireless Network

Next generation high capacity wireless networks need to support various types of traffic, including voice, video and data, each of which have different Quality of Service (QoS) requirements for successful transmission. This paper presents an advanced reservation packet access protocol BRTDMA (Block Reservation Time Division Multiple Access) that can accommodate voice and data traffic with equal efficiency in a wireless network. The proposed BRTDMA protocol has been designed to operate in a dynamic fashion by allocating resources according to the QoS criteria of voice and data traffic. Most of the existing reservation protocols offers reservation to voice traffic while data packets are transmitted using contention mode. In this paper we propose a block reservation technique to reserve transmission slots for data traffic for a short duration, which minimizes the speech packet loss and reduce the end-to-end delay for wireless data traffic. The optimum block reservation length for data traffic has been studied in a cellular mobile radio environment using a simulation model. Simulation results show that the BRTDMA protocol offers higher traffic capacity than standard PRMA protocol for integrated voice and data traffic and offers flexibility in accommodating multimedia traffic.     

Theoretical analyses of data communications integrated intocordless voice channels

Dynamic integration of data into voice channels of second-generation cordless systems provides effective channel utilization. This paper proposes and theoretically examines an inhibit and random multiple access (IRMA) protocol for data terminals in an integrated voice and data system by assuming that real-time voice traffic has priority over data. Analytical expressions are derived to quantify the effect of data inhibition on data performance, i.e., throughput and delay for both infinite and finite population models for data terminals. In order to find the possible data throughputs with our channel access scheme for data communication using voice channels while not affecting the voice quality, we investigate the data performance under two extreme situations: 1) no voice load and 2) full voice load. The numerical results indicate that IRMA data performance is comparable to that of slotted ALOHA (S-ALOHA) at lighter loads of less than 0.2 while efficiently sharing the network resources between real-time voice and nonreal-time data traffic. For the data loads above 0.2, IRMA pays a price, but an affordable one, in terms of throughput performance for its ability to accommodate data while assuring quality of voice even when all channels are occupied by voice traffic. An optimum number of terminals and the range of data-transmission probabilities have been deduced as 16 and 0.05-0.15, respectively, in order to achieve maximum throughput with minimum delay while maintaining stable data transmission and voice quality in an integrated system     

话音/数据综合的多时隙预约多址协议及其性能分析

本文提出了一种综合话音和数据的多时隙预约多址协议.该协议在保证话音终端的优先权的情况下,允许数据终端在报文的传输期间在连续多个帧中预约多个信息时隙.文中对协议进行了理论分析,并推导出了协议的重要性能指标(如话音分组丢失率、数据报文平均接入时延、系统平均吞吐率等)的解析表达式.研究表明,该协议可以支持比IPRMA、NC-IPRMA更高的等效数据终端速率,而且系统平均吞吐率在很大的负载范围内接近最大值.     

Integrated video and voice transmission using packet reservation multiple access

This paper proposes a new protocol for the integration of voice and video transmission over the packet reservation multiple access (PRMA) system that is a modification of reservation‐ALOHA protocol. We focus on low bit‐rate video applications like video conferencing and visual telephony for wireless communications. The ITU–T H.263 standard provides a solution to the need for low bit‐rate video compression under 64 kbytes/s. The proposed protocol assumes that each voice terminal follows a traffic pattern of talk spurts and silent gaps with fixed permission probability (p=0.3), and each video terminal has the higher permission probability (p=1) to access the available slot based on ITU–T H.263 standard. Again, we present a ‘pseudo‐reservation’ scheme to release slots reserved by video terminals according to the contents of each video transmission buffer, and the active voice terminals can temporarily access the additional slots to improve the performance without sacrificing the video capacity of the system. The packet dropping probability of the active voice terminals and bandwidth utilization of the system are superior to the original PRMA, as indicated in simulation results. Copyright © 2001 John Wiley & Sons, Ltd.     

Multiple-access algorithms for a system with mixed traffic: highand low priority

The author considers a system where a single channel is shared by both high- and low-priority data. He assumes packet transmissions from both data categories and slotted channel. In addition, he assumes binary (collision versus noncollision) feedback per slot, and limited feedback sensing capabilities for all users in the system. He assumes that the high-priority data are generated by a well-defined finite-number user population, while he adopts the limit Poisson user model (infinitely many independent Bernoulli users) for the low-priority traffic. For this system, he proposes and analyzes a transmission algorithm which is a mixture of a deterministic tree search for the high-priority users, and a random-access algorithm for the low-priority traffic. The algorithm is stable for both traffic classes, it guarantees a strict upper bound on the delays of the high-priority packets, and induces good throughput-delay characteristics for the low-priority data     

移动分布式无线网络中具有QoS保证的UPMA协议

该文基于有效竞争预约接入、无冲突轮询传输的思想提出了支持节点移动性、多跳网络结构和服务质量(QoS)的依据用户妥善安排的多址接入(UPMA)协议。它大大提高了信道的使用效率,保证了发送节点能快速接入信道,同时,最大程度地保证所有实时业务的时延和带宽要求。最后,我们考察了它对Internet数据业务的支持性能。     

An investigation of reservation random access algorithms for voice-data integration in microcellular wireless environments

We present the results of a simulation study that explores the performance of two promising reservation random access (RRA) protocols for transmitting voice packets over a common radio broadcast channel in a microcellular radio environment. We examine two inherently stable RRA voice protocols, RRA three cell and RRA two cell, with respect to voice transmissions under ideal and adverse channel conditions. In addition, we investigate the ability of both protocols to support efficient voice-data integration within the system. The RRA two-cell and RRA three-cell algorithms clearly mark the end of the voice contention period, thereby enabling all of the terminals within the microcell to differentiate between available voice and available data slots. Separating the two distinct types of transmissions and resolving the contending voice packets first thus enforces the priority of the voice traffic. In addition, each protocol can be combined with efficient, easy to implement, collision resolution random access protocols for transmitting data packets. Such a voice-data integration mechanism eliminates the potential voice degradation caused by competition between voice and data terminals for available slots. Our results show that the protocols provide stable and robust performance under adverse channel conditions and that they can be employed to sustain voice-data integration under heavy system loading.     

Free access stack algorithms for microcellular radio systems

We evaluate the data traffic performance of a centralized packet access protocol for microcellular radio systems supporting both speech and data users. A time-slotted radio channel is assumed. Speech contention is decoupled from data contention to give speech priority over data. A free access stack algorithm is used for handling data contention. An out-slot access scheme is used in which the slots are divided into user-information transmission slots and contention slots for sending transmission requests. The contention slots are subdivided in minislots to improve the access capacity. The out-slot algorithm performances are compared with the performances of a previously proposed in-slot one in which all slots can be used for sending user information. A memoryless channel, with capture and errors, is considered. The effects of speech traffic on data performance are evaluated. Moreover, the paper presents a method for evaluating the packet error probability of a packet cellular system. This method is used for evaluating the proposed algorithm in a microcellular system. An access technique with coordinated operation among cochannel cells is studied. The effects of sectorization on data performances and protocol unfairness are investigated. Different frequency reuse factors are taken into consideration     

CRDA: a collision resolution and dynamic allocation MAC protocol tointegrate data and voice in wireless networks

One key requirement for radio access in advanced, third generation (3G) mobile communication systems is the ability to accommodate a variety of services via a flexible and efficient medium access control (MAC) protocol. The paper presents and evaluates a new multiple access protocol termed CRDA (collision resolution and dynamic allocation), which has the potential to meet the above requirement. CRDA is basically a slotted packet-reservation multiple access technique with dedicated reservation slots, which allows the main shortcoming of previous PRMA schemes, i.e., contention, to be overcome through the integration in the MAC protocol of a code-division multiple-access (CDMA) transmission mode used to access the reservation slots. This prevents collisions during the reservation phase and enhances channel throughput, notably in the case of mixed voice/data traffic. Our simulations of the CRDA MAC integrate voice channels with data sources, generating what we call advanced data traffic, which has a very similar shape to the actual traffic generated by World Wide Web (WWW) applications. The standard assumption of Poissonian data traffic is also considered. Our conclusion is that the CRDA MAC protocol satisfactorily accommodates both types of traffic     

A packet reservation multiple access (PRMA)-based algorithm for multimedia wireless system

The major issue in the wireless multimedia system design is the selection of a suitable channel sharing media access control (MAC) protocol. The design challenge is to identify a wireless "multimedia capable" MAC protocol that provides a sufficient degree of transparency for many different kinds of services. This protocol should guarantee different quality of service (QoS) parameters for different types of traffic while in the same time achieving high throughput. In this paper a MAC protocol to serve different kinds of traffic, namely voice, data, and, real time variable bit rate (rt-VBR) video is proposed. The transmission time scale is divided into frames. Each frame is subdivided into N time slots. In this protocol, a fixed number of slots M out of 150 time slots are reserved at the beginning of every frame to transmit some of the video packets arriving during the frame interval. The rest of the video packets contend with the voice and data packets for the remaining time slots of this frame as in normal packet reservation multiple access (PRMA). One objective of this paper is to find the optimum value of M allowing the maximum number of voice and data users to share the RF channel with one video user. Another objective is to find the optimum permission probabilities of sending contending voice, data, and video packets allowing the maximum number of users sharing the RF channel. The dropping probability requirement for video is examined.     

A Medium Access Control Protocol for Voice/Data Integrated Wireless CDMA Systems

In this paper, a medium access control protocol is proposed for integrated voice and data services in wireless local networks. Uplink channels for the proposed protocol are composed of time slots with multiple spreading codes per slot based on slotted code division multiple access (CDMA) systems. The proposed protocol uses spreading code sensing and reservation schemes. This protocol gives higher access priority to delay‐sensitive voice traffic than to data traffic. The voice terminal reserves an available spreading code to transmit multiple voice packets during a talkspurt. On the other hand, the data terminal transmits a packet without making a reservation over one of the available spreading codes that are not used by voice terminals. In this protocol, voice packets do not come into collision with data packets. The numerical results show that this protocol can increase the system capacity for voice service by applying the reservation scheme. The performance for data traffic will decrease in the case of high voice traffic load because of its low access priority. But it shows that the data traffic performance can be increased in proportion to the number of spreading codes.     

Packet Voice on a Local Area Network with Round Robin Service

In this paper, we propose a combined voice/data protocol suitable for multiple access broadcast networks that provide round robin service to the stations. Such networks are well suited to the integration of voice and data since they guarantee bounded delay and provide high utilization even for high bandwidth channels. Using one such network proposal-namely Expressnet-as a representative scheme, we examine the characteristics of the service that voice traffic experiences under the voice/data protocol. We show that the access protocol is able to utilize the channel efficiently to support a large population of voice sources while maintaining low packet delay and guaranteeing some prespecified minimum bandwidth for data traffic. In addition, we show the advantages of silence suppression, i.e., discarding speech that constitutes silent periods, and we examine the cost of overloading the network in terms of the amount of speech discarded.     

Expressnet: A High-Performance Integrated-Services Local Area Network

Expressnet is a local area communication network comprising an inbound channel and an outbound channel to which the stations are connected. Stations transmit on the outbound channel and receive on the inbound channel. The inbound channel is connected to the outbound channel so that all signals transmitted on the outbound channel are duplicated on the inbound channel, thus achieving broadcast communication among the stations. In order to transmit on the bus, the stations utilize a distributed access protocol which achieves a conflict-free round-robin scheduling. This protocol is more efficient than existing round-robin Schemes as the time required to switch control from one active user to the next in a round is minimized (on the order of a carrier detection time), and is independent of the end-to-end network propagation delay. This improvement is particularly significant when the channel data rate is so high, or the end-to-end propagation delay is so large, Or the packet size is so small as to render the end-to-end propagation delay a significant fraction of, or larger than, the transmission time of a packet. Moreover, some features of Expressnet make it particularly suitable for voice applications. In view of integrating voice and data, a simple access protocol is described which meets the bandwidth requirement and maximum packet delay constraint for voice communication at all times, while guaranteeing a minimum bandwidth requirement for data traffic. Finally, it is noted that the voice/data access protocol constitutes a highly adaptive allocation scheme of channel bandwidth, which allows data users to recover the bandwidth unused by the voice application. It can be easily extended to accommodate any number of applications, each with its specific requirements.     

On the unfairness in IEEE 802.11e networks: Desynchronization of its medium access mechanism

Since the advent of the first IEEE 802.11 standard, several papers have proposed means of providing QoS to IEEE 802.11 networks and evaluate various traffic-prioritization mechanisms. Nevertheless, studies on the assignment of AIFS times defined in IEEE 802.11e reveal that the various priority levels work in a synchronized manner. The studies show that, under large loads of high-priority traffic, EDCA starves low-priority frames, which is undesirable. We argue that QoS traffic needs to be prioritized, but users sending best-effort frames should also obtain the expected service. High-priority traffic can also suffer performance degradation when using EDCA because of heavy loads of low-priority frames. Thus, we have proposed a mechanism based on desynchronizing the IEEE 802.11e working procedure. It prevents stations that belong to different priority classes from attempting simultaneous transmission, prioritizes independent collision groups and achieves better short-term and long-term channel access fairness. We have evaluated the proposal based on extensive analytical and simulation results. It prevents the strangulation of low-priority traffic, and, moreover, reduces the degradation of high-priority traffic with the increased presence of low-priority frames.     

Analysis of Enhanced Collision Avoidance Scheme Proposed for IEEE 802.11e-Enhanced Distributed Channel Access Protocol

In enhanced distributed channel access (EDCA) protocol, small contention window (CW) sizes are used for frequent channel access by high-priority traffic (such as voice). But these small CW sizes, which may be suboptimal for a given network scenario, can introduce more packet collisions, and thereby, reduce overall throughput. This paper proposes enhanced collision avoidance (ECA) scheme for AC_VO access category queues present in EDCA protocol. The proposed ECA scheme alleviates intensive collisions between AC_VO queues to improve voice throughput under the same suboptimal yet necessary (small size) CW restrictions. The proposed ECA scheme is studied in detail using Markov chain numerical analysis and simulations carried out in NS-2 network simulator. The performance of ECA scheme is compared with original (legacy) EDCA protocol in both voice and multimedia scenarios. Also mixed scenarios containing legacy EDCA and ECA stations are presented to study their coexistence. Comparisons reveal that ECA scheme improves voice throughput performance without seriously degrading the throughput of other traffic types.     

Dynamic Reservation Multiple Access (DRMA): A new multiple access scheme for Personal Communication System (PCS)

To improve the spectrum efficiency of integrated voice and data services in Personal Communication System (PCS), several reservation-type multiple access schemes, such as Packet Reservation Multiple Access (PRMA), Dynamic Time Division Multiple Access (D-TDMA), Resource Auction Multiple Access (RAMA), etc., have been proposed. PRMA uses the data packet itself to make a channel reservation, and is inefficient in that each unsuccessful reservation wastes one slot. However, it does not have a fixed reservation overhead and offers shorter access delay. On the other hand, fixed reservation overhead is unavoidable in both RAMA and D-TDMA. Compared to D-TDMA and PRMA, RAMA is superior in the sense that its slot assignment is independent of the traffic load. But its implementation is difficult. With these observations, a new reservation protocol, called Dynamic Reservation Multiple Access (DRMA), is proposed in this paper. With this new protocol, the success probability of channel access is greatly improved at the expense of slightly increased system complexity. It solves the problem of inefficiency in PRMA, but without introducing the fixed reservation overhead as in D-TDMA and RAMA. In addition, it is more suited to the dynamic behavior of the integrated traffic because there is no fixed boundary between voice and data slots (which is mandatory in D-TDMA and RAMA). Our numerical results indicate that its performance is superior to the existing reservation protocols, especially in the integrated traffic scenario. Moreover, the soft capacity feature is exhibited when the traffic load increases.     

Hybrid time slot allocation algorithm based on LoRa Internet of things

To improve the efficiency and stability of data transmission in the long-range (LoRa) Internet of things (IoT),a hybrid time slot allocation algorithm is proposed, which implements a priority mechanism with high-priority nodes sending data in fixed time slots and low-priority nodes using the carrier sense multiple access (CSMA) algorithm to compete for shared time slots to transmit data. To improve network efficiency, a gateway is used to adjust the time slot allocation policy according to network status and balance the number of fixed and shared time slots. And more, a retransmission time slot is added to the time slot allocation algorithm, which redesigns the time frame structure, and adopts a retransmission mechanism to improve communication reliability. Simulation and measurement results show that the packet loss rate and transmission delay of the proposed hybrid algorithm are smaller than those of the fixed slot allocation algorithm, making the proposed algorithm more suitable for LoRa IoT.     

A USER－DEPENDENT PERFECT－SCHEDULING MULTIPLE ACCESS PROTOCOL FOR VOICE－DATA INTEGRATION IN WIRELESS NETWORKDS

A novel Multiple Access Control(MAC) protocol-User-dependent Perfect-scheduling Multiple Access(UPMA) protocol,which supports joint transmission of voice and data packets,is proposed.By this protocol,the bandwidth can be allocated dynamically to the uplink and downlink traffic with on-demand assignment and the transmission of Mobile Terminals(MTs) can be perfectly scheduled by means of polling.Meanwhile.a unique frame stucture is designed to guarantee Quality of Service(QoS) in voice traffic supporting.An effective colision resolution algorthm is also proposed to guarantee rapid channel access for activated MTs.Finally,performance of UPMA protocol is evaluated by simulation and compared with MPRMA protocol.Simulation results show that UPMA protocol has better performance.