On multiple access random medium access control

Abstract

Abstract-In this paper, we develop a new class of medium access control protocol, which allows each user to transmit at different data rates chosen randomly from an appropriately determined set of rates. By using successive interference cancellation, multiple packets can be received sim ultaneously. In slotted Aloha type Gaussian networks, we show that the achievable total throughput of the proposed protocol is at least a constant fraction of the mac sum rate when the number of transmission rates at each node is equal to the number of users in the network. We also study the case when only a limited number of transmission rates is available at each node. Extension to rate splitting is discussed. Sim ulation results show that the proposed protocol can achieve a significant throughput gain over the conventional Aloha.

Carrier Sense Multiple Access Tuning Parameters Using Game Theory

“…Convexity feature is necessary for designing an optimal distributed algorithm and each node has a global convex utility function [15,34,35]. In [2,21,23,36] there are examples of how utility functions are designed and also it includes determination of contention criterion through reverse engineering from existing protocols and from desirable performance points (according to throughput and fairness) and through forward engineering in a heuristic manner as the following.…”

“…(5) (6) In [22] service differentiation has been provided through defining different utility functions according to traffic classes with different weights as a non cooperative game. In most researches including [2,21,23,36] only cellular wireless local networks have been taken into account in which each node hears transmissions of other nodes. Also it is assumed that all nodes are saturated, channel is free from error and packet drop occurs only in a result of collision.…”

NCSA: A New Protocol for Random Multiple Access Based on Physical Layer Network Coding

“…Amongst related work, several studies have shown that interference cancellation techniques bring out benefits in the context of random multiple access. As an example, in [10] the authors study successive interference cancellations applied to each time slot. In network coding area, the joint use of classical network coding (i.e.…”

On the design of PN codes in decentralized networks

“…Let each corner point of R be an n-tuple whose elements are among the numbers R 1 , · · · , R L−1 and R L . With no cooperation among the users, the authors in [22] propose that each user selects a codebook of rate R l with probability p l ∈ (0, 1) for 1 ≤ l ≤ L. Assuming the receiver is aware of the rate selection of all users, the average sum rate of the network isR = l 1 ,··· ,ln∈{1,··· ,L} p l 1 · · · p ln (R l 1 + · · · + R ln )1 (R l 1 ,··· ,R ln )∈R where 1 (R l 1 ,··· ,R ln )∈R is 1 if (R l 1 , · · · , R ln ) ∈ R and 0 otherwise. Finally, the numbers p 1 , · · · , p L−1 and p L are derived to maximizeR.…”