447 research outputs found

    Goodbye, ALOHA!

    Get PDF
    ©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.The vision of the Internet of Things (IoT) to interconnect and Internet-connect everyday people, objects, and machines poses new challenges in the design of wireless communication networks. The design of medium access control (MAC) protocols has been traditionally an intense area of research due to their high impact on the overall performance of wireless communications. The majority of research activities in this field deal with different variations of protocols somehow based on ALOHA, either with or without listen before talk, i.e., carrier sensing multiple access. These protocols operate well under low traffic loads and low number of simultaneous devices. However, they suffer from congestion as the traffic load and the number of devices increase. For this reason, unless revisited, the MAC layer can become a bottleneck for the success of the IoT. In this paper, we provide an overview of the existing MAC solutions for the IoT, describing current limitations and envisioned challenges for the near future. Motivated by those, we identify a family of simple algorithms based on distributed queueing (DQ), which can operate for an infinite number of devices generating any traffic load and pattern. A description of the DQ mechanism is provided and most relevant existing studies of DQ applied in different scenarios are described in this paper. In addition, we provide a novel performance evaluation of DQ when applied for the IoT. Finally, a description of the very first demo of DQ for its use in the IoT is also included in this paper.Peer ReviewedPostprint (author's final draft

    A mobile controlled algorithm for improving the throughput in a s-aloha ds-cdma system

    Get PDF
    This paper presents a novel adaptive DS-CDMA slotted-ALOHA packet random access scheme with transmitter-based spreading codes for mobiles. It is aimed at improving the throughput and message delay delivery when traffic load values below the saturation point of the conventional DS-CDMA slotted-ALOHA system are sensed in the channel. For this purpose a mobile assisted algorithm is envisaged to control the change of the transmission rate according to the traffic load. This algorithm revealed that the optimum behavior, obtained using a Markov chain model, may be almost reached at a low complexity cost. Moreover, priorities between mobiles could be easily established. Finally, a traffic model based on a realistic statistical length distribution of the messages illustrates how the delay delivery can be greatly reduced.Peer ReviewedPostprint (published version

    Adaptive schemes for packet data in a ds-cdma environment

    Get PDF
    This paper presents a novel adaptive DS-CDMA slotted-ALOHA packet random access scheme for improving the throughput of the conventional DS-CDMA slotted-ALOHA system. For this purpose a mobile-assisted algorithm is envisaged to control the change of the transmission rate according to the traffic load. This algorithm revealed that the optimum behavior may be almost reached at a low complexity cost. Moreover, the proposed algorithm was found to be robust to intercell interferencePeer ReviewedPostprint (published version

    Adaptive algorithms for improving the throughput in an indoor mobile s-aloha ds-cdma system

    Get PDF
    This paper presents a novel Adaptive DSCDMA Slotted-ALOHA packet random access scheme with transmitter-based spreading codes for mobiles. It is aimed at improving the throughput and message delay delivery when traffic load values below the saturation point of the conventional DS-CDMA Slotted-ALOHA system are sensed in the channel. For this purpose, one Mobile and two Base Station assisted algorithms are envisaged to control the change of the transmission rate according to the traffic load. These algorithms revealed that the optimum behavior, obtained using a Markov Chain model, may be almost reached at a low complexity cost.Peer ReviewedPostprint (published version

    Modern Random Access for Satellite Communications

    Full text link
    The present PhD dissertation focuses on modern random access (RA) techniques. In the first part an slot- and frame-asynchronous RA scheme adopting replicas, successive interference cancellation and combining techniques is presented and its performance analysed. The comparison of both slot-synchronous and asynchronous RA at higher layer, follows. Next, the optimization procedure, for slot-synchronous RA with irregular repetitions, is extended to the Rayleigh block fading channel. Finally, random access with multiple receivers is considered.Comment: PhD Thesis, 196 page

    Carrier Sense Random Packet CDMA Protocol in Dual-Channel Networks

    Get PDF
    Code resource wastage is caused by the reason that many hopping frequency (FH) sequences are unused, which occurs under the condition that the number of the actual subnets needed for the tactical network is far smaller than the networking capacity of code division net¬working. Dual-channel network (DCN), consisting of one single control channel and multiple data channels, can solve the code resource wastage effectively. To improve the anti-jamming capability of the control channel of DCN, code division multiple access (CDMA) technology was introduced, and a carrier sense random packet (CSRP) CDMA protocol based on random packet CDMA (RP-CDMA) was proposed. In CSRP-CDMA, we provide a carrier sensing random packet mechanism and a packet-segment acknowledgement policy. Furthermore, an analytical model was developed to evaluate the performance of CSRP-CDMA networks. In this model, the impacts of multi-access interference from both inter-clusters and intra-clusters were analyzed, and the mathematical expressions of packet transmission success probability, normalized network throughput and signal interference to noise ratio, were also derived. Analytical and simulation results demonstrate that the normalized network throughput of CSRP-CDMA outperforms traditional RP-CDMA by 10%, which can guarantee the resource utilization efficiency of the control channel in DCNs

    Overlapped CDMA system in optical packet networks : resource allocation and performance evalutation

    Get PDF
    Dans cette thèse, la performance du système CDMA à chevauchement optique (OVCDMA) au niveau de la couche de contrôle d'accès au support (MAC) et l'allocation des ressources au niveau de la couche physique (PRY) sont étudiées. Notre but est d'apporter des améliorations pour des applications à débits multiples en répondant aux exigences de délai minimum tout en garantissant la qualité de service (QoS). Nous proposons de combiner les couches PRY et MAC par une nouvelle approche d'optimisation de performance qui consolide l'efficacité potentielle des réseaux optiques. Pour atteindre notre objectif, nous réalisons plusieurs étapes d'analyse. Tout d 'abord, nous suggérons le protocole S-ALOHA/OV-CDMA optique pour sa simplicité de contrôler les transmissions optiques au niveau de la couche liaison. Le débit du réseau, la latence de transmission et la stabilité du protocole sont ensuite évalués. L'évaluation prend en considération les caractéristiques physiques du système OY-CDMA, représentées par la probabilité de paquets bien reçus. Le système classique à traitement variable du gain (YPG) du CDMA, ciblé pour les applications à débits multiples, et le protocole MAC ±round-robin¿ récepteur/émetteur (R31), initialement proposé pour les réseaux par paquets en CDMA optique sont également pris en compte. L'objectif est d ' évaluer comparativement la performance du S-ALOHA/OY-CDMA en termes de l'immunité contre l'interférence d'accès lTIultiple (MAI) et les variations des charges du trafic. Les résultats montrent que les performances peuvent varier en ce qui concerne le choix du taux de transmission et la puissance de transmission optique au niveau de la couche PRY. Ainsi, nous proposons un schéma de répartition optimale des ressources pour allouer des taux de transmission à chevauchement optique et de puissance optique de transmission dans le système OY-CDMA comme des ressources devant être optimalement et équitablement réparties entre les utilisateurs qui sont regroupés dans des classes de différentes qualités de service. La condition d'optimalité est basée sur la maximisation de la capacité par utilisateur de la couche PHY. De ce fait, un choix optimal des ressources physiques est maintenant possible, mais il n'est pas équitable entre les classes. Par conséquent, pour améliorer la performance de la couche liaison tout en éliminant le problème d'absence d'équité, nous proposons comme une approche unifiée un schéma équitable et optimal pour l'allocation des ressources fondé sur la qualité de service pour des multiplexages temporels des réseaux par paquets en CDMA à chevauchement optique. Enfin, nous combinons cette dernière approche avec le protocole MAC dans un problème d'optimisation d'allocation équitable des ressources à contrainte de délai afin de mieux améliorer le débit du réseau et le délai au niveau de la couche liaison avec allocation équitable et optimale des ressources au niveau de la couche PHY

    A novel random wireless packet multiple access method using CDMA

    Full text link
    • …
    corecore