On colliding first messages in slotted ALOHA

Bettstetter, Christian; Brandner, Günther; Vilzmann, Robert

doi:10.1109/pimrc.2008.4699897

Cited by 7 publications

(9 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Usually, the backoff time is picked according to a uniform distribution which, as per [23] and [24], is not the optimum choice. CSMA/CA and MACA aim at reducing collisions by equally trying to protect all packets.…”

Section: ) Canonical Solutionsmentioning

confidence: 99%

MAC Essentials for Wireless Sensor Networks

Bachir

Döhler

Watteyne

et al. 2010

IEEE Commun. Surv. Tutorials

437

283

View full text Add to dashboard Cite

Abstract-The wireless medium being inherently broadcast in nature and hence prone to interferences requires highly optimized medium access control (MAC) protocols. This holds particularly true for wireless sensor networks (WSNs) consisting of a large amount of miniaturized battery-powered wireless networked sensors required to operate for years with no human intervention. There has hence been a growing interest on understanding and optimizing WSN MAC protocols in recent years, where the limited and constrained resources have driven research towards primarily reducing energy consumption of MAC functionalities.In this paper, we provide a comprehensive state-of-the-art study in which we thoroughly expose the prime focus of WSN MAC protocols, design guidelines that inspired these protocols, as well as drawbacks and shortcomings of the existing solutions and how existing and emerging technology will influence future solutions.In contrast to previous surveys that focused on classifying MAC protocols according to the technique being used, we provide a thematic taxonomy in which protocols are classified according to the problems dealt with. We also show that a key element in selecting a suitable solution for a particular situation is mainly driven by the statistical properties of the generated traffic.

show abstract

Section: ) Canonical Solutionsmentioning

confidence: 99%

MAC Essentials for Wireless Sensor Networks

Bachir

Döhler

Watteyne

et al. 2010

IEEE Commun. Surv. Tutorials

437

283

View full text Add to dashboard Cite

show abstract

“…Appendix C in Additional file 1 proves that the nodedependent access probabilities are properly bounded, when applying f (·) on the node-independent probabilities for uniform access (8) and slow-start access (10). It also proves the third property, i.e., If a node cannot estimate the metrics of the other nodes, the denominator of (12) is set to…”

Section: Metric-based Selectionmentioning

confidence: 84%

“…Parts of this article, including some equations and results, were previously published in [10] and [11]. Those papers presented some first ideas and results of Section 2.…”

Section: Introductionmentioning

confidence: 99%

Contention-based node selection with applications to relay communications and load balancing

Brandner

Bettstetter

Schilcher

2013

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

This article proposes and analyzes a distributed probabilistic selection protocol in which several nodes perform a random access competition on a shared slotted channel. Nodes that are better suited according to some metric are preferred in the random access and are thus selected with high likelihood. Analytical performance studies are made in terms of reliability, message complexity, and delay. The protocol is applied in two case studies: relay communications and load balancing in wireless networks. In relay communications, a node is selected based on its channel state to serve as relay. In load balancing, a node is selected based on its battery charge state to perform a task. Results indicate that selecting nodes based on the observed metric contributes to better performance and longer network lifetime.

show abstract

“…Thus, if we assume that all nodes behave statistically the same, the probability that within s slots occurs a first message that does not collide is [5] Φ(n, s, p ) =…”

Section: Probability Of a Non-colliding First Messagementioning

confidence: 99%

“…In a previous paper [5], we performed a theoretical analysis on the occurrence of a non-colliding first message. Given a slotted shared medium, each of n nodes may transmit in a slot using ALOHA without carrier sensing.…”

Section: Introductionmentioning

confidence: 99%

Non-Colliding First Messages in Slotted ALOHA: Further Insights Toward a Practical Solution

Brandner

Schilcher

Gyarmati

et al. 2009

VTC Spring 2009 - IEEE 69th Vehicular Technology Conference

Self Cite

View full text Add to dashboard Cite

Consider n nodes competing for access on a channel using slotted ALOHA. Our aim is to maximize the probability Φ that the first message within s slots does not collide. We derive an expression for the transmit probabilities in each slot, maximizing Φ. As opposed to previous work, the expression is non-recursive, thus easier to calculate and more convenient for practical implementations. Furthermore, we address the problem that, in practical applications, the number of competing nodes n is likely to be unknown and has to be estimated by each node. We study the sensitivity of channel access scheme with respect to deviations from the actual n via simulations. It is shown that overestimation of n is a better strategy than underestimation.

show abstract

On colliding first messages in slotted ALOHA

Cited by 7 publications

References 9 publications

MAC Essentials for Wireless Sensor Networks

MAC Essentials for Wireless Sensor Networks

Contention-based node selection with applications to relay communications and load balancing

Non-Colliding First Messages in Slotted ALOHA: Further Insights Toward a Practical Solution

Contact Info

Product

Resources

About