Abstract
A revisit of the model of collision channel without feedback (CCw/oFB) 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.
| Original language | English |
|---|---|
| Title of host publication | 2008 International Symposium on Information Theory and its Applications, ISITA2008 |
| DOIs | |
| Publication status | Published - 2008 |
| Event | 2008 International Symposium on Information Theory and its Applications, ISITA2008 - Auckland, New Zealand Duration: 7 Dec 2008 → 10 Dec 2008 |
Conference
| Conference | 2008 International Symposium on Information Theory and its Applications, ISITA2008 |
|---|---|
| Place | New Zealand |
| City | Auckland |
| Period | 7/12/08 → 10/12/08 |