On elastic traffic via contention resolution diversity slotted aloha satellite access

This paper presents a performance study relative to the coupling of the Transmission Control Protocol (TCP) with the Contention Resolution Diversity slotted aloha (CRDSA) protocol, in the case of greedy TCP connections (also called elephants) on Digital Video Broadcasting‐Return Channel via a geostationary satellite. CRDSA, which takes advantage of interference cancellation algorithms for collision/contention resolution, has already exhibited interesting performance when the power levels of all received bursts are perfectly balanced. In this paper, we extend the study to a more realistic case, where a certain spreading of the bursts' power levels is taken into account. The consequent capture effect even facilitates the collision resolution mechanism and yields an improvement in the overall TCP performance with respect to the balanced case. Furthermore, in certain conditions, the adoption of packet level forward error correction allows achieving even higher peaks of throughput than the expected ones. Copyright © 2014 John Wiley & Sons, Ltd.     

Exploiting capture and interference cancellation for uplink random multiple access in 5G millimeter-wave networks

The forthcoming 5G technology aims to provide massive device connectivity and ultra-high capacity with reduced latency and costs. These features will be enabled by increasing the density of the base stations, using millimeter-wave (mmWave) bands, massive multiple-input multiple-output systems, and non-orthogonal multiple access techniques. The ability to support a large number of terminals in a small area is in fact a great challenge to guarantee massive access. In this context, this paper proposes a new receiver model for the uplink of 5G mmWave cellular networks. The receiver, called Iterative Decoding and Interference Cancellation (IDIC), is based on the Slotted Aloha (SA) protocol and exploits the capture effect alongside the successive IC process to resolve packet collisions. A 5G propagation scenario, modeled according to recent mmWave channel measurements, is used to compare IDIC with the widely adopted Contention Resolution Diversity SA (CRDSA) scheme to show the performance gain of IDIC, when elements of practical relevance, like imperfect cancellation and receive power diversity, are considered. The impact of packet and power diversity is also investigated to derive the preferable uplink random access strategy that maximizes the system throughput according to the offered channel load.

     

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.     

Phase noise impact on the performance of contention resolution slotted random access schemes

Cost‐effective satellite terminals (STs) that are designed for a large scale deployment in the Internet of things (IoT) applications are constrained by consumer‐grade local oscillators (LOs) to lower the costs, on the one hand, and by limited equivalent isotropic radiated power (EIRP) due to limited peak transmit power and/or low antenna gain, on the other hand. To close the link budget with the low EIRP constraint, STs can resort to adopting robust forward error correcting (FEC) schemes and/or limiting the transmission baud rate, hence increasing the link margin with respect to the required receiver threshold. In general, the LOs at the terminal side are responsible for injecting multiplicative phase distortions to the transmitted signal, known as phase noise (PN). The PN caused by low‐cost LOs could be significant, especially for low baud rates, thus affecting the demodulator performance. Random access (RA) techniques are particularly encouraged on the return link in networks with low‐cost terminals and bursty/low‐duty cycle types of traffic. The state‐of‐the‐art time‐slotted RA techniques are often evaluated considering high EIRP at the terminal side and high baud rates. This paper investigates the impact of the PN in time‐slotted RA techniques and optimizes different carrier phase estimation (CPE) algorithms. Furthermore, it evaluates the impact of CPE errors on RA performance for a wide range of baud rates and typical STs phase noise masks.     

Transmit permission control on spread ALOHA packets in LEOsatellite systems

A transmit permission control method for improving the throughput characteristics of a low Earth orbit (LEO) satellite communication system employing spread-slotted ALOHA multiple-access scheme is proposed. Both nonfading and fading satellite links are considered. The basic idea of the proposed scheme is to decrease the level of interference at each satellite and, hence, to increase the probability of packet success, by prohibiting the packet transmission from the users with relatively high propagation loss to their connecting satellites. It is shown that the method has the ability to improve the throughput performance in heavy traffic loads and the peak value of the throughput, significantly. It is also shown that the average delay performance of the system employing the proposed scheme is superior to that of the conventional system at heavy traffic loads     

A congestion reduction mechanism using D2D cooperative relay for M2M communication in the LTE‐A cellular network

The Long Term Evolution‐advanced cellular network is designed for human‐to‐human communication. When a large number of machine‐to‐machine (M2M) devices are trying to access the network simultaneously, it leads to a low random access (RA) successful rate and high congestion problem, which may cause the waste of radio resources, packet loss, latency, extra power consumption, and the worst, M2M service error. There is an urge to propose an efficient method for M2M communication on the LTE‐A network to resolve the congestion problem. In this paper, we propose a congestion reduction mechanism, which can analyze and model the RA procedure on the Long Term Evolution‐advanced network, to find out the collapse point in the RA procedure and then design a scheme named device‐to‐device cooperative relay scheme to relieve the congestion problem. Meanwhile, this work also adds a relay access barring algorithm to improve performance and an RA resource separation mechanism for human‐to‐human communication. The proposed method can effectively reduce the network congestion problem. Simulation results show that the network throughput and the congestion can be significantly improved using the proposed mechanism. Copyright © 2016 John Wiley & Sons, Ltd.     

Random access schemes for satellite networks,from VSAT to M2M: a survey

In this survey paper, we review the random access (RA) techniques with particular emphasis on the issues and the possible solutions applicable to satellite networks. RA dates back to the 1970s when the ALOHA protocol was developed to solve the problem of interconnecting university computers located in different Hawaiian islands. Since then, several evolutions of the ALOHA protocol have been developed. In particular, solutions were devised to mitigate the problem of packet collisions severely degrading the RA protocols performance. The approach followed for many years has been to avoid the occurrence of collisions rather than solving them. More recently, techniques tackling the RA packet collision problem have appeared triggered by the need of improving RA performance in satellite and terrestrial wireless networks. In particular, satellite networks large propagation delay does not allow the adoption of enhanced terrestrial RA techniques based on channel sensing. Adopting conventional demand assignment multiple access protocols is not suitable for supporting a large number of sensors or devices transmitting small‐size low duty cycle packets as required for machine‐to‐machine communications. This provided the stimulus to exploit successive interference cancelation schemes to solve packet collision issues. The use of successive interference cancelation in RA is relatively new and has opened up a promising research area. We provide an extensive review of recent high‐performance RA techniques achieving more than three orders of magnitude throughput increase compared with the original ALOHA at low packet loss rate. In this survey, we cover both slotted and unslotted techniques. Finally, we review the use of RA in satellite systems and related standards including recent proposals for machine‐to‐machine applications. Copyright © 2016 John Wiley & Sons, Ltd.     

Analysis of Priority R‐ALOHA (PR‐ALOHA) protocol

With the exception of required time synchronization, the Reservation‐ALOHA (R‐ALOHA) protocol is simple to implement and suitable for medium access control in ad hoc wireless networks. In this paper, we propose an innovative protocol, referred to as Reservation ALOHA with priority (PR‐ALOHA) that provides differentiated services on the basis of traffic priority. To date, the carrier sense multiple access/collision avoidance (CSMA/CA) protocol has been widely used for this purpose by employing an interframe spacing (IFS) for priority service, that is, nodes ready for packet transmissions are required to wait for an IFS amount of time, where a shorter IFS is used to gain faster access to the radio channel. However, sensing and collision avoidance mechanisms make CSMA/CA unsuitable for delay‐sensitive applications, that is, congested scenarios with high traffic. In contrast, the proposed PR‐ALOHA protocol may be considered a good candidate for such applications. In this paper, the performance of the PR‐ALOHA protocol is investigated analytically and by simulation. Its comparison with regular R‐ALOHA is also carried out. Modeling and simulation results of PR‐ALOHA show that PR‐ALOHA improves the performance of high‐priority traffic with limited effect on normal network traffic. Thus, PR‐ALOHA may be useful in vehicular communications, where traffic may be separated into emergency messages having high priority and multimedia messages having low priority. Copyright © 2013 John Wiley & Sons, Ltd.     

Joint Delay-Power Multiple Packet Capture Scheme for Spread-Spectrum Slotted ALOHA Packet Radio Networks

In this paper, a joint delay-power multiple packet capture scheme, that can collect multiple packets simultaneously from different terminals with both delay and power captures, is presented. The corresponding joint delay-power capture probabilities for a spread-spectrum slotted ALOHA packet radio networks where all terminals use a common spreading code under Rayleigh fading with power control are derived. Throughput and delay performance of the spread-spectrum slotted ALOHA packet radio networks with the joint delay-power multiple packet capture effect are shown by our simulation results to be significantly improved compared with the existing schemes.     

PERFORMANCE OF COMBINED FREE/DEMAND ASSIGNMENT MULTIPLE-ACCESS SCHEMES IN SATELLITE COMMUNICATIONS

By combining free assignment with demand assignment, the combined free/demand assignment multiple-access (CFDAMA) protocol offers a much shorter delay at low and medium traffic loads while maintaining the high channel utility of the demand-assignment multiple-access (DAMA) technique. In these schemes, reservation can be made using pre-assigned (PA) or random-access (RA) request slots, or piggy-backing (PB) the request on a data packet. This paper presents a performance analysis of CFDAMA schemes in packet satellite communications. Illustrative examples are given. They show a good agreement between analytical and simulation results. For low and medium sizes of terminal population, the CFDAMA-PA scheme has an excellent delay-throughput performance. As the terminal population increases, its performance is gradually degraded due to the long waiting time for a request. For a very large number of terminals, the CFDAMA-RA becomes more effective than CFDAMA-PA. This indicates that a CFDAMA scheme using a hybrid PB/RA requesting protocol can provide the best performance for a wide range of terminal population sizes.     

Idle-signal casting multiple access with data slot reservation(ICMA-DR) for packet radio communications

A population of terminals communicating with a central station over a packet-switched multiple access radio channel is investigated with regard to multiple access control schemes. The authors describe the ICMA-DR, which is an advanced idle-signal casting multiple access (ICMA) scheme characterized by data slot reservation. This improved central controlled multiple-access scheme for packet transmission in terrestrial radio communications is evaluated in terms of throughput traffic, throughput delay characteristics, and handling capacity. It is shown that the throughput characteristics of ICMA-DR are superior than those of ICMA or slotted ALOHA when a packet for data slot reservation is relatively short in comparison to that for upward data. Thus, it is shown that ICMA-DR is suitable for the packet radio multiple-access scheme, especially in the case where fading packet error occurs frequently and ordered traffic is heavy. The ICMA-DR scheme has been utilized for the access control channel of NTT's new 800-MHz-band high-capacity land mobile communication system since the Spring of 1988     

On the Dynamic Control of the Urn Scheme for Multiple Access Broadcast Communication Systems

The Urn scheme is known to perform better than optimal ALOHA and TDMA for all ranges of traffic rates. In this paper we discuss the dynamic behavior of the Urn scheme to show that it possesses bistable behavior in a manner similar to ALOHA schemes and that dynamic control procedures can be applied to improve the system performance effectively. In particular, an input control procedure (ICP) is presented that gives a delay-throughput characteristic very close to optimal (perfect scheduling) for a wide range of throughput rates. The improvement is obtained at no extra cost in terms of information acquisition and the complexity introduced is minimal. An analytical method is described to calculate the expected delay, throughput, and the probability of packet rejection. Numerical results are shown for various values of user population and compared with corresponding results for other schemes.     

Contention-based MAC protocols with erasure coding for wireless data networks

Contention-based medium access control (MAC) protocol is a key component for the success of wireless data networks. Conventional random access protocols like ALOHA and Carrier Sense Multiple Access (CSMA) suffer from packet collision which leads to low throughput. Aimed at improving the throughput performance, we propose to integrate erasure coding with contention-based MAC protocols for recovering collided packets. To demonstrate the effectiveness of this approach, we focus on combining erasure coding with slotted ALOHA and slotted non-persistent CSMA in this paper. The performances of the resulting protocols are evaluated by both analytical model and simulation. Simulation results match very well with analytical results and show that the system throughput is increased for low to medium traffic loading. Packet loss ratio is also improved considerably with our scheme when the maximum number of packet retransmission times is limited. However, the delay for our scheme is higher due to the longer waiting time in our scheme for recovering collided packets. It is also shown that delay can be significantly reduced if we choose appropriate coding parameters though throughput will be sacrificed.     

The Spatial Capacity of a Slotted ALOHA Multihop Packet Radio Network with Capture

In this paper we determine throughput equations for a packet radio network where terminals are randomly distributed on the plane, are able to capture transmitted signals, and use slotted ALOHA to access the channel. We find that the throughput of the network is a strictly increasing function of the receiver's ability to capture signals, and depends on the transmission range of the terminals and their probability of transmitting packets. Under ideal circumstances, we show the expected fraction of terminals in the network that are engaged in successful traffic in any slot does not exceed 21 percent.     

Performance Evaluation of an Integrated Access Scheme in a Satellite Communication Channel

A method for realizing a circuit and packet integrated access scheme in a satellite communication channel is considered. Two kinds of terminals are assumed, namely, bursty terminals for handling bursty traffic and heavily loaded terminals for long-holdingtime message traffic. In this method, the channel frame is divided into two subframes: one is for bursty terminals, and the other is for heavily loaded terminals. The subframe for heavily loaded terminals is further divided into two subchannels, a reservation subchannel (consisting of small slots) and a message subchannel. The bursty terminals transmit their packets in their dedicated subframes on the slotted ALOHA protocol. The heavily loaded terminal having a message transmits, first of all, a reservation packet in a randomly selected small slot of the reservation subchannel to reserve slots in the coming message subchannels. One slot in the same position of each of the succeeding message subchannels is reserved for the terminal until the end-of-use flag, transmitted from the terminal, is received by the satellite. Mean transmission delays for both kinds of traffic in this method are analytically obtained. We show that there exists an optimal frame length which minimizes mean transmission delay for one kind of traffic while keeping mean transmission delay for the other kind under some permissible value.     

Simpler and more accurate throughput analysis of a DS CDMA/unslotted ALOHA system with two user classes based on M/M/infinity queueing model

We propose that the throughput performance of the DS CDMA unslotted ALOHA system with two user classes is analyzed by the M/M/infinity queueing model without the death rate approximation. The previous scheme uses the M/D/infinity queueing model with the death rate approximation. The new analysis method is simpler than the previous one because four‐dimensional summation is replaced by two‐dimensional summation in the packet success probability calculation. The speed of new analysis program is 250 times faster than that of the previous one. In the numerical results, we consider the cases when the message arrival rates of the two classes are equal or not equal, and the access control is present or not. It shows that the proposed scheme has more accurate analyzed throughput than the previous one does. Copyright © 2009 John Wiley & Sons, Ltd.     

Performance approximation of a multi-base station slotted ALOHA forwireless LAN's

It has been reported that the capture effect can improve the performance of slotted ALOHA systems. Further improvement can be expected when the number of base stations is increased. The performance of such slotted ALOHA systems with multiple base stations is analyzed with the aid of the equilibrium point analysis. Not only the capture effect but also the packet dropping due to the finite number of retransmission trials are taken into account. The numerical results indicate that the finite number of retransmission trials mainly contributes to the improvement of the packet dropping probability in the range of the light input traffic, while the number of base stations mainly contributes to the improvement of the overall throughput and the average transmission delay in the range of the heavy input traffic     

Diversity ALOHA--A Random Access Scheme for Satellite Communications

A generalization of the slotted ALOHA random access scheme is considered in which a user transmits multiple copies of the same packet. The multiple copies can be either transmitted simultaneously on different frequency channels (frequency diversity) or they may be transmitted on a single high-speed channel but spaced apart by random time intervals (time diversity). In frequency diversity, two schemes employing channel selections with and without replacements have been considered. In time diversity, two schemes employing a fixed number of copies or a random number of copies for each packet have been considered. In frequency diversity, activity factor-throughput tradeoffs and in time diversity, delay-throughput tradeoffs for various diversity orders have been compared. It is found that under light traffic, multiple transmission gives better delay performance. If the probability that a packet fails a certain number or more times is specified not to exceed some time limit (realistic requirement for satellite systems having large round trip propagation delay), then usually multiple transmission gives higher throughput.     

Reliable M2M/IoT data delivery from FANETs via satellite

The use of unmanned aerial vehicles (UAVs) is rising in several application fields. This work deals with the communication challenges in UAV swarms, or flying ad hoc network (FANET), when taking into account non–line‐of‐sight scenarios. The use of satellites is a necessity in such operating conditions; thus, this work provides architectural considerations and performance assessments when several (FANETs) share an uplink random access satellite channel, fed with M2M/IoT traffic generated from on‐board sensors, to be reliably delivered to a remote ground destination.     

Dynamic random access code assignment for prioritized packet data transmission in WCDMA networks

We propose a measurement-based dynamic random access (RA) code assignment procedure for prioritized packet data transmission in wideband code-division multiple access (WCDMA) networks. This dynamic adaptation process is based on analytical performance results derived for random packet access under Rayleigh fading in WCDMA networks. The performance of the proposed measurement-based RA code assignment procedure with three different adaptation methods is evaluated by using computer simulations. The performance of the proposed scheme is compared with those of a retransmission control-based and static channel allocation-based prioritized packet access scheme. An integrated (physical layer and link layer) delay-throughput performance model is presented for finite population RA WCDMA systems. The proposed dynamic RA code assignment procedure can be used in an adaptive quality of service (QoS) framework for dynamically adjusting the QoS of prioritized RA data traffic in the evolving WCDMA-based differentiated services wireless Internet protocol networks.