Slotted Aloha with Priorities and Random Power

Altman, Eitan; Barman, Dhiman; Benslimane, Abderrahim; Azouzi, Rachid El

doi:10.1007/11422778_49

Cited by 23 publications

(25 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are various game theoretic models of slotted ALOHA that have been studied in the literature, apart from the ones mentioned in the introduction; see for example [2,17,3]. However, in most of these models only transmission protocols that always transmit with the same probability are considered.…”

Section: Other Related Workmentioning

confidence: 99%

A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback

Christodoulou

Gairing

Nikoletseas

et al. 2017

Algorithmic Game Theory

View full text Add to dashboard Cite

In this paper, we study contention resolution protocols from a game-theoretic perspective. In a recent work [7], we considered acknowledgment-based protocols, where a user gets feedback from the channel only when she attempts transmission. In this case she will learn whether her transmission was successful or not. One of the main results of [7] was that no acknowledgment-based protocol can be in equilibrium. In fact, it seems that many natural acknowledgment-based protocols fail to prevent users from unilaterally switching to persistent protocols that always transmit with probability 1. It is therefore natural to ask how powerful a protocol must be so that it can beat persistent deviators. In this paper we consider age-based protocols, which can be described by a sequence of probabilities of transmitting in each time step. Those probabilities are given beforehand and do not change based on the transmission history. We present a 3-player age-based protocol that can prevent users from unilaterally deviating to a persistent protocol in order to decrease their expected transmission time. It is worth noting that the answer to this question does not follow from the results and proof ideas of [7]. Our protocol is non-trivial, in the sense that, when all players use it, finite expected transmission time is guaranteed. In fact, we show that this protocol is preferable to any deadline protocol in which, after some fixed time, attempt transmission with probability 1 in every subsequent step. An advantage of our protocol is that it is very simple to describe, and users only need a counter to keep track of time. Whether there exist n-player age-based protocols that do not use counters and can prevent persistence is left as an open problem for future research.

show abstract

Section: Other Related Workmentioning

confidence: 99%

A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback

Christodoulou

Gairing

Nikoletseas

et al. 2017

Algorithmic Game Theory

View full text Add to dashboard Cite

show abstract

“…Lamaire et al [3] derive the optimal transmit power distribution under three models: perfect capture model, signalto-interference threshold with and without Rayleigh fading model. Altman et al [4] propose to differentiate transmission priority by using different transmit power and convert it as a game problem. Both [3] [4] ignore the impact of power control error for the transmit power distribution.…”

Section: Introductionmentioning

confidence: 99%

“…Altman et al [4] propose to differentiate transmission priority by using different transmit power and convert it as a game problem. Both [3] [4] ignore the impact of power control error for the transmit power distribution. Yang et al [5] analyze backoff algorithms for LTE Random Access Channel (RACH), which employ ALOHA-like protocol.…”

Section: Introductionmentioning

confidence: 99%

An analytical model for S-ALOHA performance evaluation in M2M networks

Song¹,

Lagrange²,

Nuaymi³

2017

2017 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

Abstract-The S-ALOHA (i.e. slotted-ALOHA) protocol is recently regaining interest in Lower Power Wide Area Networks (LPWAN) handling M2M traffic. Despite intensive studies since the birth of S-ALOHA, the special features of M2M traffic and requirements highlight the importance of analytical models taking into account performance-affecting factors and giving a thorough performance evaluation. Fulfilling this necessity is the main focus of this paper: we jointly consider the impact of capture effect, diversity of transmit power levels with imperfect power control. We propose a low-complexity but still accurate analytical model capable of evaluating S-ALOHA in terms of packet loss rate, throughput, energy-efficiency and average number of transmissions. The proposed model is able to facilitate dimensioning and design of S-ALOHA based LPWAN. The comparison between simulation and analytical results confirms the accuracy of our proposed model. The design guides about S-ALOHA based LPWAN deduced from our model are: the imperfect power control can be positive with capture effect and and appropriate transmit power diversity strategy. The transmit power diversity strategy should be determined by jointly considering network charges level, power control precision and capture ratio to achieve optimal performance of S-ALOHA.

show abstract

“…Some hybrid schemes have also been discussed in literature. In [15], the authors have studied throughputdelay characteristics by considering several scenarios in which different strategies have been used for new and backlogged (i.e., collided at least once) packets. For example in one case, new packets use some random power levels, while backlogged packets use a predetermined power level which is greater than the power levels used by new packets.…”

Section: Introductionmentioning

confidence: 99%

Analysis of a deterministic power level selection algorithm with small and large power steps for Aloha networks under saturation

Khoshnevis

Khalaj

2007

Wireless Netw

View full text Add to dashboard Cite

Standard power control techniques are not deployable in Aloha networks due to lack of central controlling entity and/or inefficiency of such algorithms in large networks with bursty traffic. To handle this problem in practice, simple transmission power selection algorithms are used for ranging and/or combating harsh channel conditions. In such algorithms, the transmission power is steadily increased by an amount called power step, until the packet is successfully transmitted. Noting that ranging is the major concern of this approach, small power steps are ideal for its operation. However, as we will show in this paper, using small power steps with this algorithm causes a throughput collapse in large networks, when capture effect is considered in the analysis. In the asymptotic case, the throughput of this algorithm will be less than the throughput of the Binary Exponential Backoff (BEB) scheme which only uses a single power level. To show these results, we will present an asymptotic analysis of this algorithm with small power steps in an ideal communication channel where BEB is used as the retransmission scheme. In order to strengthen the results, we will prove the existence of better choices for power steps by extending the analysis for large power steps and we will show that properly chosen large power steps guarantee higher throughputs and require approximately the same average powers as small power steps. Our analysis and simulation results show that small power steps should be avoided with the mentioned power selection algorithm except probably for ranging and once the ranging process is complete, larger power steps should be used to exploit the capture effect.

show abstract

Slotted Aloha with Priorities and Random Power

Cited by 23 publications

References 10 publications

A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback

A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback

An analytical model for S-ALOHA performance evaluation in M2M networks

Analysis of a deterministic power level selection algorithm with small and large power steps for Aloha networks under saturation

Contact Info

Product

Resources

About