A MAC Layer Protocol for Priority-based Reliable Multicast in Wireless Ad Hoc Networks

Demirbaş, Murat; Hussain, Muzammil

doi:10.1109/wowmom.2006.12

“…The results presented in [7,13] do not consider the time it takes the algorithm to converge, as we do. We mention a number of MAC algorithms that consider onboard hardware support, such as receiver-side collision detection [4,5,7,26,29]. We consider merely basic radio technology that is commonly used in wireless ad hoc networks.…”

Section: Introductionmentioning

confidence: 91%

Self-stabilizing TDMA Algorithms for Wireless Ad-Hoc Networks without External Reference

Petig

¹

,

Schiller

²

,

Tsigas

³

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Time division multiple access (TDMA) is a method for sharing communication media. In wireless communications, TDMA algorithms often divide the radio time into timeslots of uniform size, ξ, and then combine them into frames of uniform size, τ . We consider TDMA algorithms that allocate at least one timeslot in every frame to every node. Given a maximal node degree, δ, and no access to external references for collision detection, time or position, we consider the problem of collision-free self-stabilizing TDMA algorithms that use constant frame size.We demonstrate that this problem has no solution when the frame size is τ < max{2δ, χ2}, where χ2 is the chromatic number for distance-2 vertex coloring. As a complement to this lower bound, we focus on proving the existence of collision-free self-stabilizing TDMA algorithms that use constant frame size of τ . We consider basic settings (no hardware support for collision detection and no prior clock synchronization), and the collision of concurrent transmissions from transmitters that are at most two hops apart. In the context of self-stabilizing systems that have no external reference, we are the first to study this problem (to the best of our knowledge), and use simulations to show convergence even with computation time uncertainties.

show abstract

“…We provide analytical proofs and consider basic radio settings. The results presented in [7,13] do not consider the time it takes the algorithm to converge, as we do. We mention a number of MAC algorithms that consider onboard hardware support, such as receiver-side collision detection [4,5,7,26,29].…”

Section: Introductionmentioning

confidence: 91%

Self-stabilizing TDMA algorithms for wireless ad-hoc networks without external reference

Petig

¹

,

Schiller

²

,

Tsigas

³

2014

2014 13th Annual Mediterranean Ad Hoc Networking Workshop (MED-HOC-NET)

2

0

View full text Add to dashboard Cite

Time division multiple access (TDMA) is a method for sharing communication media. In wireless communications, TDMA algorithms often divide the radio time into timeslots of uniform size, ξ, and then combine them into frames of uniform size, τ . We consider TDMA algorithms that allocate at least one timeslot in every frame to every node. Given a maximal node degree, δ, and no access to external references for collision detection, time or position, we consider the problem of collision-free self-stabilizing TDMA algorithms that use constant frame size.We demonstrate that this problem has no solution when the frame size is τ < max{2δ, χ2}, where χ2 is the chromatic number for distance-2 vertex coloring. As a complement to this lower bound, we focus on proving the existence of collision-free self-stabilizing TDMA algorithms that use constant frame size of τ . We consider basic settings (no hardware support for collision detection and no prior clock synchronization), and the collision of concurrent transmissions from transmitters that are at most two hops apart. In the context of self-stabilizing systems that have no external reference, we are the first to study this problem (to the best of our knowledge), and use simulations to show convergence even with computation time uncertainties. MAC algorithms that provide bounded communication delay, often assume access to synchronized clocks, e.g. [10]. We propose a bootstrapping solution to the causality dilemma of "which came first, synchronization or communication", and discover convergence criteria that depend on τ /δ.The converge-to-the-max synchronization principle assumes that nodes periodically transmit their clock value, ownClock. Whenever they receive clock values, receivedClock > ownClock, that are greater than their own, they adjust their clocks accordingly, i.e., ownClock ← receivedClock. Herman and Zhang [11] assume constant bounds on the communication delay and demonstrate convergence. Basic radio settings do not include constant bounds on the communication delay. We show that the converge-to-the-max principle works when given bounds on the expected communication delay, rather than constant delay bounds, as in [11].The proposal in [9] considers shared variable emulation. Several selfstabilizing algorithms adopt this abstraction, e.g., a generalized version of the dining philosophers problem for wireless networks in [6], topology discovery in anonymous networks [19], random distance-k vertex coloring [20], deterministic distance-2 vertex coloring [3], two-hop conflict resolution [25], a transformation from central demon models to distributed scheduler ones [27], to name a few. The aforementioned algorithms assume that if a node transmits infinitely many

show abstract

“…The proposed algorithm does not consider collision detection mechanisms that are based on signal processing or hardware support, as in [26]. Rather, it employs a variation of a well-known strategy for eventually avoiding concurrent transmissions among neighbors.…”

Section: Related Workmentioning

confidence: 99%

Self-Stabilizing TDMA Algorithms for Dynamic Wireless Ad Hoc Networks

Leone

¹

,

Schiller

²

2013

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In dynamic wireless ad hoc networks (DynWANs), autonomous computing devices set up a network for the communication needs of the moment. These networks require the implementation of a medium access control (MAC) layer. We consider MAC protocols for DynWANs that need to be autonomous and robust as well as have high bandwidth utilization, high predictability degree of bandwidth allocation, and low communication delay in the presence of frequent topological changes to the communication network. Recent studies have shown that existing implementations cannot guarantee the necessary satisfaction of these timing requirements. We propose a self-stabilizing MAC algorithm for DynWANs that guarantees a short convergence period, and by that, it can facilitate the satisfaction of severe timing requirements, such as the above. Besides the contribution in the algorithmic front of research, we expect that our proposal can enable quicker adoption by practitioners and faster deployment of DynWANs that are subject changes in the network topology.

show abstract

A MAC Layer Protocol for Priority-based Reliable Multicast in Wireless Ad Hoc Networks

Cited by 6 publications

References 31 publications

Self-stabilizing TDMA Algorithms for Wireless Ad-Hoc Networks without External Reference

Self-stabilizing TDMA Algorithms for Wireless Ad-Hoc Networks without External Reference

Self-stabilizing TDMA algorithms for wireless ad-hoc networks without external reference

Self-Stabilizing TDMA Algorithms for Dynamic Wireless Ad Hoc Networks

Contact Info

Product

Resources

About