Compressive sensing based asynchronous random access for wireless networks

The theory of compressive sensing has shown that with a small number of samples from random projections of a sparse signal, one can recover the original signal under certain conditions. In this paper, we use compressive sensing to design a random access protocol for requesting uplink data channels. A wireless node transmits a pseudo-random sequence to an access point (AP) when it requires an uplink channel. The AP receives multiple sequences in a random access shared channel. Due to different propagation delays, the received signals from different wireless nodes are not synchronized at the receiver. Assume that the number of sequence transmissions is substantially less than the number of wireless nodes in the system. Under such circumstances, we design an asynchronous compressive sensing based decoder to recover the original signals in a random access setting. The key difference between our proposed decoder and those presented in the literature is that we do not require any synchronization before sequence transmission which makes our approach practical. Simulation results show the throughput improvement of our proposed scheme compared to two other random access protocols.

[1]  Robert D. Nowak,et al.  Compressive wireless sensing , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[2]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[3]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[4]  Richard G. Baraniuk,et al.  Compressive Sensing , 2008, Computer Vision, A Reference Guide.

[5]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[6]  Lei Zhang,et al.  Neighbor discovery for wireless networks via compressed sensing , 2010, Perform. Evaluation.

[7]  R. Gold,et al.  Optimal binary sequences for spread spectrum multiplexing (Corresp.) , 1967, IEEE Trans. Inf. Theory.

[8]  Yi Shen,et al.  A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit , 2012, IEEE Transactions on Information Theory.

[9]  Michael B. Wakin,et al.  Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property , 2009, IEEE Transactions on Information Theory.

[10]  Milica Stojanovic,et al.  Random access compressed sensing in underwater sensor networks , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[11]  H. T. Kung,et al.  Compressive sensing medium access control for wireless LANs , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[12]  R. Nowak,et al.  Compressed Sensing for Networked Data , 2008, IEEE Signal Processing Magazine.

[13]  Sundeep Rangan,et al.  On-Off Random Access Channels: A Compressed Sensing Framework , 2009, ArXiv.

[14]  R.G. Baraniuk,et al.  Compressive Sensing [Lecture Notes] , 2007, IEEE Signal Processing Magazine.