Prime sequences: quasi-optimal sequences for OR channel code division multiplexing

This paper introduces a family of periodic binary sequences with interesting cross-correlation properties for potential applications in distributed wireless accessing. Following Masseys model of collision channel without feedback, a simple and robust multiple access protocol that does not require complicated processing such as back-off algorithms or random number generation is proposed for wireless sensor and ad hoc networks. In addition, energy-ef cient data reception is achievable by the protocol while continuous channel listening can be eliminated. Besides, a simple predictive collision avoidance scheme is presented for the enhancement of system throughput. Simulation studies are carried out to show its effectiveness.

show abstract

“…The sequence has a period of l. When l is prime, the above sequence is also known as a prime sequence [9]. One may de ne the sub-sequence…”

Section: A Linear Congruence Sequencesmentioning

confidence: 99%

A Robust Access Protocol for Wireless Sensor Networks

Chen

Wong

2006

Milcom 2006

View full text Add to dashboard Cite

show abstract

“…Let d = p, by (4), there exists p wobbling sequences with r = d/l = 1/p and N = p 4 . Note that the construction is limited to prime p. Throughout this paper, we will use p to denote prime number.…”

Section: Wobbling Sequencesmentioning

confidence: 99%

“…A prime sequence [4], S b,p , can be represented by indexing the positions where its n-th entry of 1's appears, denoted by I S (n):…”

Section: Subset Of Prime Sequencesmentioning

confidence: 99%

See 1 more Smart Citation

User unsuppressible protocol sequences for collision channel without feedback

Chen

Shum

Sung

et al. 2008

2008 International Symposium on Information Theory and Its Applications

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

“…Out-of-phase autocorrelation and cross-correlation of 2-D code families are equal to 0 and 1, respectively. The generalized algebraic algorithms of the 2-D code construction are the prime code [5], [6], [15] and the Reed-Solomon code [9], [10], [15], and both wavelength/time code and space/time code can be constructed by either of those algorithms. Besides the algebraic unipolar 2-D code-based OCDMA scheme, recently, the demonstration of the OCDMA system based on the periodic spectrum encoding has been reported [16].…”

Section: Introductionmentioning

confidence: 99%