Constructions of Robust Protocol Sequences for Wireless Sensor and Ad hoc Networks

A class of periodic unipolar binary sequences is investigated for their potential applications in defining new protocols for distributed multiple accessing. Based on linear congruence sequences, one can show that, for any finite subset of these sequences, with the total proportional rate not exceeding a specific threshold, there cannot be enough collisions to completely block any particular sequence, no matter how they are shifted with respect to one another. This property can be exploited in certain applications, such as wireless sensor and ad hoc networks. A further investigation into how to enhance the allowable rate sum is conducted. New protocol sequences with interesting and useful properties are accordingly designed.

[1]  David E. Culler,et al.  System architecture directions for networked sensors , 2000, SIGP.

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

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

[4]  Chung Shue Chen,et al.  A Robust Access Protocol for Wireless Sensor Networks , 2006, MILCOM 2006 - 2006 IEEE Military Communications conference.

[5]  Cristina V. Lopes,et al.  A survey, classification and comparative analysis of medium access control protocols for ad hoc networks , 2004, IEEE Communications Surveys & Tutorials.

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

[7]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[8]  W. S. Wong.  New Protocol Sequences for Random-Access Channels Without Feedback , 2007, IEEE Transactions on Information Theory.

[9]  Alex J. Grant,et al.  The collision channel with recovery , 2005, IEEE Transactions on Information Theory.

[10]  Lawrence G. Roberts,et al.  Dynamic allocation of satellite capacity through packet reservation , 1973, AFIPS National Computer Conference.

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

[12]  J.Y.N. Hui.  Multiple accessing for the collision channel without feedback , 1984 .

[13]  Chung Shue Chen,et al.  The Design and Analysis of Protocol Sequences for Robust Wireless Accessing , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[14]  Simon Haykin,et al.  Communication Systems , 1978 .

[15]  Cem Ersoy,et al.  MAC protocols for wireless sensor networks: a survey , 2006, IEEE Communications Magazine.

[16]  A. A. Shaar,et al.  A survey of one-coincidence sequences for frequency-hopped spread-spectrum systems , 1984 .

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

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

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

[20]  Robert G. Gallager,et al.  A perspective on multiaccess channels , 1984, IEEE Trans. Inf. Theory.

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

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

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

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

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