Opportunistic spectral usage: Bounds and a multi-band CSMA/CA protocol

被引:89
作者
Sabharwal, Ashutosh [1 ]
Khoshnevis, Ahmad [1 ]
Knightly, Edward [1 ]
机构
[1] Rice Univ, Dept Elect & Comp Engn, Houston, TX 77005 USA
基金
美国国家科学基金会;
关键词
capacity bounds; CSMA/CA; multi-channel; opportunistic access; measurement overhead; 802.11;
D O I
10.1109/TNET.2007.893230
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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).
引用
收藏
页码:533 / 545
页数:13
相关论文
共 32 条
  • [1] [Anonymous], P 10 ANN INT C MOB C
  • [2] [Anonymous], 1999, WIRELESS COMMUNICATI
  • [3] [Anonymous], P IEEE INFOCOM 2003
  • [4] The ten-year-old turbo codes are entering into service
    Berrou, C
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2003, 41 (08) : 110 - 116
  • [5] Bharghavan V., 1994, Computer Communication Review, V24, P212, DOI 10.1145/190809.190334
  • [6] BORST S, 2001, P IEEE INFOCOM 2001
  • [7] Casella G. G. C., 2001, STAT INFERENCE
  • [8] Chow Y. S., 1971, Great Expectations: The Theory of Optimal Stopping
  • [9] DAVID HA, 1981, WILEY SERIES PROBABI
  • [10] Garces R., 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), P595, DOI 10.1109/INFCOM.2000.832233