NOMAD: Deterministic collision-free channel access with channel reuse in wireless networks

Garcia-Luna-Aceves, J.J.; Masilamani, Ashok N.

doi:10.1109/sahcn.2011.5984899

Cited by 8 publications

(5 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A number of prior methods eliminate the need of fixed-length transmission frames by using lexicographic ordering of the identifiers of transmitting nodes, geographical or virtual coordinates related to the connectivity of nodes [7], or a common tree of periodic schedules of variable periods [14]. However, all these approaches must use time slotting supported at the physical layer.…”

Section: Related Workmentioning

confidence: 99%

Making CSMA Collision-Free and Stable Using Collaborative Indexing

Garcia-Luna-Aceves

Cirimelli-Low²

2022

Networked Systems

Self Cite

View full text Add to dashboard Cite

CSMA with collaborative indexing (CSMA/CI) is introduced, in which nodes collaborate with one another using carrier sensing and short signaling packets to establish collision-free schedules without the need for time slotting or the definition of transmission frames as in TDMA. The throughput of CSMA/CI is compared with the throughput of TDMA with a fixed transmission schedule, ALOHA, CSMA, and CSMA/CA analytically and with simulation experiments.

show abstract

Section: Related Workmentioning

confidence: 99%

Making CSMA Collision-Free and Stable Using Collaborative Indexing

Garcia-Luna-Aceves

Cirimelli-Low²

2022

Networked Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…Some approaches allow the use of variable-length transmission frames by using lexicographic ordering of the identifiers of transmitting nodes, geographical or virtual coordinates related to the connectivity of nodes [8,9,16], or a common tree of periodic schedules of variable periods that are powers of two [13].…”

Section: Related Workmentioning

confidence: 99%

An Adaptive Tree Algorithm to Approach Collision-Free Transmission in Slotted ALOHA

Zhang

Alfaro

Garcia-Luna-Aceves

2020

Proceedings of the Workshop on Network Meets AI &Amp; ML

Self Cite

View full text Add to dashboard Cite

A new reinforcement-learning approach is introduced to improve the performance of the slotted ALOHA protocol. Nodes use known periodic schedules as base policies with which they can collaboratively learn how to transmit periodically in different time slots to limit packet collisions. The Adaptive Tree (AT) algorithm is introduced for this purpose, which results in AT-ALOHA. It is shown that nodes using AT-ALOHA quickly converge to transmission schedules that are virtually collision-free, and that the throughput of AT-ALOHA resembles that of TDMA, but without the need to define transmission frames with a given number of time slots. AT-ALOHA is shown to attain better throughput and fairness than slotted ALOHA with exponential back offs and ALOHA-Q (framed slotted ALOHA with Q learning). CCS CONCEPTS • Networks → Network protocol design; • Computing methodologies → Reinforcement learning.

show abstract

“…Protocol NOMAD [21] provides a deterministic scheduling by exchanging detailed lists of transmissions in next period between the nodes. Implementing these protocols needs continuous communication with specific neighbor to coordinate the nodes thus causing large amounts of data load, which is not affordable for compact RFID-sensor module with simple transponder and limited memory.…”

Section: Preliminarymentioning

confidence: 99%

A Self-Adaptive Data Balance Protocol For Distributed Radio Frequency Identification Sensor Network

Liew¹,

Shaw²,

Zhang³

2014

International Journal on Smart Sensing and Intelligent Systems

View full text Add to dashboard Cite

Abstract-In this paper, we share our recent work related to Radio Frequency Identification (RFID) sensor network with readers. The work mainly focus on the protocol for network system to perform the task of autonomous decentralized data distribution with consideration of economic and low-power RFID-sensor module scheme. We analyzed data pitfall in distributed RFID-sensor network, revealing the reason lies in the phenomenon. A distributed solution to tackle the problem has been designed in a simple way. The test results show that the system with proposed approach provides an efficient and more balanced in data distribution which proves the protocol is feasible for the application scenario.Index terms: RFID Sensor network, equal probability scheduling, stochastic switching, Galton effect.

show abstract

NOMAD: Deterministic collision-free channel access with channel reuse in wireless networks

Cited by 8 publications

References 18 publications

Making CSMA Collision-Free and Stable Using Collaborative Indexing

Making CSMA Collision-Free and Stable Using Collaborative Indexing

An Adaptive Tree Algorithm to Approach Collision-Free Transmission in Slotted ALOHA

A Self-Adaptive Data Balance Protocol For Distributed Radio Frequency Identification Sensor Network

Contact Info

Product

Resources

About