62,313 research outputs found
Broadcast Coded Slotted ALOHA: A Finite Frame Length Analysis
We propose an uncoordinated medium access control (MAC) protocol, called
all-to-all broadcast coded slotted ALOHA (B-CSA) for reliable all-to-all
broadcast with strict latency constraints. In B-CSA, each user acts as both
transmitter and receiver in a half-duplex mode. The half-duplex mode gives rise
to a double unequal error protection (DUEP) phenomenon: the more a user repeats
its packet, the higher the probability that this packet is decoded by other
users, but the lower the probability for this user to decode packets from
others. We analyze the performance of B-CSA over the packet erasure channel for
a finite frame length. In particular, we provide a general analysis of stopping
sets for B-CSA and derive an analytical approximation of the performance in the
error floor (EF) region, which captures the DUEP feature of B-CSA. Simulation
results reveal that the proposed approximation predicts very well the
performance of B-CSA in the EF region. Finally, we consider the application of
B-CSA to vehicular communications and compare its performance with that of
carrier sense multiple access (CSMA), the current MAC protocol in vehicular
networks. The results show that B-CSA is able to support a much larger number
of users than CSMA with the same reliability.Comment: arXiv admin note: text overlap with arXiv:1501.0338
Design and analysis of movable boundary allocation protocol
The increasing digital communications traffic will require very high speed networks. The use of high communication speed increases the ratio between end to end propagation delay and the packet transmission time. This increase causes rapid performance deterioration and restricts the utilization of the high system bandwidth in broadcast channel based systems. Using several parallel channels in place of a single channel improves this ratio. For a given system bandwidth the total system capacity is increased by bandwidth division and parallel communication. FTDMA protocols have been suggested for the parallel channel network and these protocols are suitable for different loads. In this thesis, the movable boundary allocation protocol has been suggested for the parallel communication architecture. This protocol is suitable for varying loads and yields a better throughput versus delay characteristics. The analysis demonstrates the potential for improvement in the system capacity and the average message delay when compared to conventional single channel system
Recommended from our members
Design implementation and measurement of a collision avoidance multiple broadcast tree network
Packet collisions and their resolution create a performance bottleneck in random access LANs. Collision avoidance switches are a hardware solution to this problem [1, 2]. Collision avoidance switches allow the implementation of random access protocols without the penalty of collisions among packets.In this paper, we describe a design and implementation of a local area network architecture based on collision avoidance, called the Collision Avoidance Multiple Broadcast (CAMB) tree network. Our implementation follows the protocol layering architecture of the IEEE 802 local area networks, and includes CAMB tree switches, station/network interface boards, and support of transport protocols. We also present the performance measurements of our experimental CAMB tree network
Opportunistic Relaying in Time Division Broadcast Protocol with Incremental Relaying
In this paper, we investigate the performance of time division broadcast protocol (TDBC) with incremental relaying (IR) when there are multiple available relays. Opportunistic relaying (OR), i.e., the “best” relay is select for transmission to minimize the system’s outage probability, is proposed. Two OR schemes are presented. The first scheme, termed TDBC-OIR-I, selects the “best” relay from the set of relays that can decode both flows of signal from the two sources successfully. The second one, termed TDBC-OIR-II, selects two “best” relays from two respective sets of relays that can decode successfully each flow of signal. The performance, in terms of outage probability, expected rate (ER), and diversity-multiplexing tradeoff (DMT), of the two schemes are analyzed and compared with two TDBC schemes that have no IR but OR (termed TDBC-OR-I and TDBC-OR-II accordingly) and two other benchmark OR schemes that have no direct link transmission between the two sources
- …