Opportunistic Spectral Usage: Bounds and a Multi-Band CSMA/CA Protocol

In this paper, we study the gains from opportunistic spectrum usage when neither sender or receiver are aware of the current channel conditions in different frequency bands. Hence to select the best band for sending data, nodes first need to measure the channel in different bands which takes time away from sending actual data. We analyze the gains from opportunistic band selection by deriving an optimal skipping rule, which balances the throughput gain from finding a good quality band with the overhead of measuring multiple bands. We show that opportunistic band skipping is most beneficial in low signal to noise scenarios, which are typically the cases when the node throughput in single-band (no opportunism) system is the minimum. To study the impact of opportunism on network throughput, we devise a CSMA/CA protocol, multi-band opportunistic auto rate (MOAR), which implements the proposed skipping rule on a per node pair basis. The proposed protocol exploits both time and frequency diversity, and is shown to result in typical throughput gains of 20% or more over a protocol which only exploits time diversity, opportunistic auto rate (OAR).

[1]  Tristan Henderson,et al.  The changing usage of a mature campus-wide wireless network , 2008, Comput. Networks.

[2]  L. Kleinrock,et al.  Packet Switching in Radio Channels: Part III - Polling and (Dynamic) Split-Channel Reservation Multiple Access , 1976, IEEE Transactions on Communications.

[3]  Ali Abdi,et al.  The Ricean K factor: estimation and performance analysis , 2003, IEEE Trans. Wirel. Commun..

[4]  R. Prasad,et al.  Propagation measurements in an indoor radio environment at 2.4 GHz, 4.75 GHz and 11.5 GHz , 1992, [1992 Proceedings] Vehicular Technology Society 42nd VTS Conference - Frontiers of Technology.

[5]  V. Bharghavan,et al.  MACAW: A media access protocol for wireless LANs , 1994 .

[6]  J. J. Garcia-Luna-Aceves,et al.  Floor acquisition multiple access (FAMA) in single‐channel wireless networks , 1999, Mob. Networks Appl..

[7]  Rüdiger L. Urbanke,et al.  The renaissance of Gallager's low-density parity-check codes , 2003, IEEE Commun. Mag..

[8]  Pravin Varaiya,et al.  Capacity of fading channels with channel side information , 1997, IEEE Trans. Inf. Theory.

[9]  S. Guha,et al.  Jointly optimal transmission and probing strategies for multichannel wireless systems , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[10]  Ness B. Shroff,et al.  Transmission scheduling for efficient wireless resource utilization with minimum-performance guarantees , 2001, IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211).

[11]  J. J. Garcia-Luna-Aceves,et al.  Collision avoidance and resolution multiple access for multichannel wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[12]  H. Vincent Poor,et al.  Capacity of multiple-antenna systems with both receiver and transmitter channel state information , 2003, IEEE Trans. Inf. Theory.

[13]  Hans-Jurgen Zepernick,et al.  Characterization of the indoor radio propagation channel at 2.4 GHz , 2000 .

[14]  David Tse,et al.  Opportunistic beamforming using dumb antennas , 2002, IEEE Trans. Inf. Theory.

[15]  Edward W. Knightly,et al.  Opportunistic fair scheduling over multiple wireless channels , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[16]  Eldesoky E. Afify.  COMPARISON OF ESTIMATORS OF PARAMETERS FOR THE RAYLEIGH DISTRIBUTION , 2003 .

[17]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[18]  Sem C. Borst,et al.  Dynamic rate control algorithms for HDR throughput optimization , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[19]  J. J. Garcia-Luna-Aceves,et al.  Hop-reservation multiple access (HRMA) for ad-hoc networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[20]  Daniel D. Stancil,et al.  Efficient simulation of Ricean fading within a packet simulator , 2000, Vehicular Technology Conference Fall 2000. IEEE VTS Fall VTC2000. 52nd Vehicular Technology Conference (Cat. No.00CH37152).

[21]  Claude Berrou,et al.  The ten-year-old turbo codes are entering into service , 2003, IEEE Commun. Mag..

[22]  Edward W. Knightly,et al.  MOAR: a multi-channel opportunistic auto-rate media access protocol for ad hoc networks , 2004, First International Conference on Broadband Networks.

[23]  Randall Berry,et al.  Exploiting multiuser diversity for medium access control in wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[24]  Edward W. Knightly,et al.  Opportunistic media access for multirate ad hoc networks , 2002, MobiCom '02.

[25]  Nitin H. Vaidya,et al.  A multi-channel mac protocol for ad hoc wireless networks , 2003 .

[26]  Mohamed-Slim Alouini,et al.  How much feedback is multi-user diversity really worth? , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[27]  H. Hashemi,et al.  Statistical modeling and simulation of the RMS delay spread of indoor radio propagation channels , 1994 .