Shift-Invariant Protocol Sequences for the Collision Channel Without Feedback

Shum, Kenneth W.; Chen, Chung Shue; Sung, Chi Wan; Wong, Wing Shing

doi:10.1109/tit.2009.2021335

Cited by 48 publications

(48 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…4 that the control performance of the NCS using protocol sequence based MAC outperforms that of the system with packet drops, where the estimator in (10) and the controller in (11) are deployed for the time-delayed NCSs encountering packet drops. Moreover, the time delay effects on the cost performance of the NCS are also studied.…”

Section: Numerical Examplesmentioning

confidence: 99%

“…It can be shown that the order of L is at least 2 M [10]. For practical considerations many efforts have been spent in finding UI protocol sequences with short common period.…”

Section: Protocol Sequences and Their Application To Ncssmentioning

confidence: 99%

“…Massey first proposed the protocol sequence concept [8] [9]. Recent works by Wong and coworkers have further built on this basic idea [10]- [16]. In our previous work [17], the protocol sequence based MAC was introduced.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Application of protocol sequences in wireless networked control systems

Cheng

Wong

2014

Proceedings of the 33rd Chinese Control Conference

Self Cite

View full text Add to dashboard Cite

In many wireless networked control applications, time-critical messages need to be transmitted among multiple users through a shared wireless channel. Due to user contention, Medium Access Control (MAC) is a key design issue. In this paper, we briefly review MAC schemes based on protocol sequences. Unlike probabilistic protocols, protocol sequences can guarantee that messages are delivered within a bounded delay and hence are suitable choices for time-critical networked control applications. The focus of this paper is to understand how such protocol sequence based communication schemes address time-critical problems such as controlling instability. Using a linear dynamical system as prototype, we present suboptimal control algorithms that take advantage of the unique characteristics of the protocol sequence schemes. Numerical results confirm their performance is superior to those based on traditional probabilistic MAC schemes.

show abstract

Section: Numerical Examplesmentioning

confidence: 99%

“…It can be shown that the order of L is at least 2 M [10]. For practical considerations many efforts have been spent in finding UI protocol sequences with short common period.…”

Section: Protocol Sequences and Their Application To Ncssmentioning

confidence: 99%

See 1 more Smart Citation

Application of protocol sequences in wireless networked control systems

Cheng

Wong

2014

Proceedings of the 33rd Chinese Control Conference

Self Cite

View full text Add to dashboard Cite

show abstract

“…The class of shift invariant (SI) sequences [12] inherently hold user unsuppressibility as they always have positive individual throughput in each sequence period no matter what the relative time offsets are. Besides, there always exists the corresponding sequences.…”

Section: Shift Invariant Sequencesmentioning

confidence: 99%

User unsuppressible protocol sequences for collision channel without feedback

Chen

Shum

Sung

et al. 2008

2008 International Symposium on Information Theory and Its Applications

Self Cite

View full text Add to dashboard Cite

A revisit of the model of collision channel without feedback (CCw/oFD) has motivated some interesting designs on periodic binary sequences. The protocol and system simplicity is particularly favorable for applications in certain wireless sensor and ad hoc networks. User unsuppressibility for individual service guarantee is desirable and emphasized here. We review some protocol sequences that are user unsuppressible (UU). Lower bounds of sequence length are obtained. Some corresponding sequence sets are identified.

show abstract

“…Among them, the specific sub-class of feedback-free RA protocols [17], [18] re-gained attention in the recent past (see e.g. [19]- [21] …”

Section: Introductionmentioning

confidence: 99%

Random access on graphs: A survey and new results

Liva

Chiani

2012

2012 Conference Record of the Forty Sixth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)

View full text Add to dashboard Cite

This paper overviews the recently proposed coded slotted ALOHA (CSA) random access scheme and illustrates some new results in this area. In CSA, a randomly picked linear block code is employed by each user to encode segments of its bursts prior to transmission, where the choice of the code is performed with no coordination with the other users. On the receiver side iterative interference cancellation combined with decoding of the local codes is performed to recover from collisions. This process may be represented as an iterative decoding algorithm over a sparse bipartite graph.

show abstract

Shift-Invariant Protocol Sequences for the Collision Channel Without Feedback

Cited by 48 publications

References 19 publications

Application of protocol sequences in wireless networked control systems

Application of protocol sequences in wireless networked control systems

User unsuppressible protocol sequences for collision channel without feedback

Random access on graphs: A survey and new results

Contact Info

Product

Resources

About