New Protocol Sequences for Random-Access Channels Without Feedback

With recent developments in ad hoc networks and sensor networks, random-access protocol without feedback is a technique that deserves a closer look. This paper is based on Massey's model on random-access channel without feedback. A central concept of this model is the idea of protocol sequences. For these sequences, it is desirable that their cross correlation should be as low as possible and that the length of their period should not be too long, even if there is a large number of active users. Another useful feature is to be able to support multirate communication. Based on these considerations, a new family of protocol sequences is proposed in this paper. These new protocol sequences are built on the concept of prime sequences. It is shown that these sequences possess properties that make them suitable candidates for designing random access protocols for certain ad hoc or sensor networks

[1]  László Györfi,et al.  Constructions of binary constant-weight cyclic codes and cyclically permutable codes , 1992, IEEE Trans. Inf. Theory.

[2]  M. Gharib,et al.  Collision resolution in contention access local area networks using concatenated prime sequences , 2002 .

[3]  László Györfi,et al.  Constructions of protocol sequences for multiple access collision channel without feedback , 1993, IEEE Trans. Inf. Theory.

[4]  George Thomas.  Capacity of the wireless packet collision channel without feedback , 2000, IEEE Trans. Inf. Theory.

[5]  Wing C. Kwong,et al.  Performance comparison of asynchronous and synchronous code-division multiple-access techniques for fiber-optic local area networks , 1991, IEEE Trans. Commun..

[6]  A. A. Shaar,et al.  Prime sequences: quasi-optimal sequences for OR channel code division multiplexing , 1983 .

[7]  James L. Massey,et al.  The collision channel without feedback , 1985, IEEE Trans. Inf. Theory.

[8]  Robert Szewczyk,et al.  System architecture directions for networked sensors , 2000, ASPLOS IX.

[9]  V. C. da Rocha.  Protocol sequences for collision channel without feedback , 2000 .

[10]  Bruce E. Hajek,et al.  Extremal Splittings of Point Processes , 1985, Math. Oper. Res..

[11]  Nael B. Abu-Ghazaleh,et al.  A taxonomy of wireless micro-sensor network models , 2002, MOCO.

[12]  Wing C. Kwong,et al.  Prime Codes with Applications to CDMA Optical and Wireless Networks , 2002 .

[13]  Paul R. Prucnal,et al.  Spread spectrum fiber-optic local area network using optical processing , 1986 .

[14]  Jan M. Rabaey,et al.  PicoRadio Supports Ad Hoc Ultra-Low Power Wireless Networking , 2000, Computer.

[15]  A. M. Abdullah,et al.  Wireless lan medium access control (mac) and physical layer (phy) specifications , 1997 .

[16]  W. Kwong,et al.  Performance analysis of optical CDMA with prime codes , 1995 .

[17]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[18]  M.B. Pursley,et al.  Crosscorrelation properties of pseudorandom and related sequences , 1980, Proceedings of the IEEE.

[19]  Chung Shue Chen,et al.  Bandwidth allocation for wireless multimedia systems with most regular sequences , 2005, IEEE Transactions on Wireless Communications.

[20]  E. Titlebaum.  Time-Frequency HOP Signals Part I: Coding Based upon the Theory of Linear Congruences , 1981, IEEE Transactions on Aerospace and Electronic Systems.

[21]  Melvyn B. Nathanson,et al.  Elementary Methods in Number Theory , 1999 .

[22]  Edward L. Titlebaum,et al.  A new family of optical code sequences for use in spread-spectrum fiber-optic local area networks , 1993, IEEE Trans. Commun..

[23]  Joseph Y. N. Hui.  Multiple accessing for the collision channel without feedback , 1984, IEEE Transactions on Vehicular Technology.

[24]  Pingzhi Fan,et al.  SEQUENCE DESIGN FOR COMMUNICATIONS APPLICATIONS , 1996 .