WO2010088578A2

WO2010088578A2 - Distributed prioritized contention for spectrum sharing

Info

Publication number: WO2010088578A2
Application number: PCT/US2010/022681
Authority: WO
Inventors: Ahmed K. Sadek; Stephen J. Shellhammer
Original assignee: Qualcomm Incorporated
Priority date: 2009-02-01
Filing date: 2010-01-31
Publication date: 2010-08-05
Also published as: KR20110114694A; US20100195572A1; TW201108814A; JP2012517146A; KR101454718B1; KR20130069882A; US8675623B2; WO2010088578A3; CN102301636A; EP2392093A2

Abstract

Techniques for use in contending for a portion of a television channel spectrum are disclosed. In some instances, a back-off value is used to decide whether a contender's contention number will be transmitted when the contention channel is free, and the back-off value is determined based on the contention number. In some instances, a contender monitors the contention channel and withdraws from contention if it detects from the contention channel that a higher priority contender is in contention.

Description

DISTRIBUTED PRIORITIZED CONTENTION FOR SPECTRUM

SHARING

Claim of Priority under 35 U.S.C. §119

[0001] The present Application for Patent claims priority to

Provisional Application No. 61 / 148,968 entitled "Distributed Prioritized Contention for Spectrum Sharing" filed February 1 , 2009, and assigned to the assignee hereof and hereby expressly incorporated by reference herein.

BACKGROUND

Field

[0002] The present work relates generally to wireless communications and, more particularly, to contention for access to portions of a wireless communication spectrum.

Background

[0003] The four documents identified below are incorporated herein by reference. They are referred to herein by the corresponding bracketed numerals below.

[1] Federal Communications Commission Spectrum Policy Task Force, 'Report of the Spectrum Efficiency Group', Technical Report 02- 135.

[2] Federal Communication Commission, Second Report and Order on Unlicensed Operation in the TV Broadcast Bands, November 2008, FCC 08-260. [3] Shared Spectrum Company, "Comprehensive Spectrum Occupancy Measurements Over Six Different Locations", August 2005.

[4] Draft Standard for Wireless Regional Area Networks Part 22, IEEE P802.22™/ DRAFTv2.0. , May 2009

[0004] One of the major limitations facing the continuous increase in demands for higher data rate services and future wireless applications is the scarcity of spectrum. On the other hand measurements studies conducted by the FCC and industry [1 , 2] show light utilization of the spectrum at any given time or location. This is especially true for the TV spectrum, a high percentage of which is under utilized, or what is referred to as the White Space.

[0005] One solution to increase the efficiency of utilizing this spectrum and provide a solution for the spectrum scarcity is opportunistic usage of the under utilized spectrum without causing interference to the spectrum primary users or incumbents. In order to encourage unlicensed use of the spectrum, the FCC, through a Notice of Proposed Rule Making (FCC NPRM) is considering opening up the spectrum allocated to TV broadcast services for unlicensed use by secondary devices operating on a non-interference basis with the incumbent users (TV broadcasters) . The IEEE has also set up a working group (802.22 WG), which is drafting an emerging standard for opportunistic broadband data communication over Wireless Regional Area Networks (WRANs) utilizing cognitive radio technologies in the TV frequency spectrum [3] . The term 'cognitive radio' can be thought of as encompassing several techniques that seek to overcome the spectral shortage problem by enabling secondary (unlicensed) wireless devices to communicate without interfering with the primary users. Cognitive communication faces a multitude of hurdles in spectrum access and spectrum sharing. A spectrum sharing protocol is a technique to enable reliable operation of two or more systems sharing the same spectrum. Therefore a spectrum sharing protocol is essentially an interference management scheme between different systems.

[0006] Spectrum sharing techniques fall into differenct categories based on the level of information and cooperation between the different secondary systems. In particular, spectrum sharnig can be categorized into three broad approaches:

(1) The networks operate independently trying to access the medium, or in other words use non-cooperative approaches;

(2) The networks agree on a set of rules that do not require interoperability, for example listen-before-talk; and

(3) A common message approach in which different systems can utilize a common control channel to exchange information related to sharing the spectrum, which requires a level of interoperability between systems.

[0007] The IEEE 802.22 [4] system specifies a fixed wireless regional area network (WRAN) in which a base station (BS) manages a group of fixed customer premise equipments (CPEs) as depicted in Fig. 1. The IEEE 802.22 draft standard [4] describes a message based approach for self-coexistence among 802.22 WRANs. The draft standard defines a Coexistence Beacon Protocol (CBP) in which the CPEs and BSs are allowed to transmit coexistence information during a predefined coexistence window, namely a self-coexistence window (SCW), which is a specified duration of time in the UL (uplink) sub-frame. This is illustrated by the timing diagram of Figure 2, wherein TTG is the Transmit/ Receive Transition Guard, and RTG is the Receive /Transmit Transition Guard. The coexistence beacons are transmitted in the SCW either by the BS or the CPE and can carry information about the bandwidth allocations of the cell, and hence neighboring cells can implement interference-free scheduling. The BS decides whether the coexistence beacon is transmitted by the BS or one or more of its associated CPEs. The CBP can also carry timestamps for synchronizing BSs, which is required for coexistence.

[0008] The CBP enables the WRANs to perform an on demand contention protocol for spectrum sharing [4]. In this protocol, the contention destination (CD) is defined as the WRAN BS currently occupying the channel. The contention sources (CS) are defined as all WRAN BSs that wish to contend to access this channel. In order to decide on the winning CS, the following steps are implemented, as shown in Figure 3.

[0009] Each CS randomly generates a contention number (CN) as shown at 31. The CS's try transmitting their CN's during the SCW (self- coexistence-window) through contention with other CS's, as shown collectively at 32-38. After all CN's are received at the CD, the CD decides that the winning CS is the CS with the largest CN.

[0010] The on demand contention protocol of Figure 3 has disadvantages, some of which include: (1) All CS's have to complete the transmission of the generated CN's and then the CD chooses the CS with the highest CN; (2) There is a large probability of collision due to the probability of different CS's using the same size random back-off window; (3) If there are M CS's, then at least M SCW frames are required to complete the process (typically the number of SCW frames is larger than M, and the algorithm therefore does not scale well); (4) If the winning CS only needs to transmit x frames with x small, then at least M-x frames are wasted until that winning CS acquires the channel.

[0011] It is desirable in view of the foregoing to provide for spectrum contention procedures capable of avoiding prior art disadvantages such as described above. SUMMARY

[0012] In some embodiments, a back-off value is used to decide whether a contender's contention number will be transmitted when the contention channel is free, and the back-off value is determined based on the contention number. In some embodiments, a contender monitors the contention channel and withdraws from contention if it detects from the contention channel that a higher priority contender is in contention.

BRIEF DESCRIPTION OF THE DRAWINGS

[0013] Various aspects of a wireless communications system are illustrated by way of example, and not by way of limitation, in the accompanying drawings, wherein:

[0014] Figure 1 diagrammatically illustrates a prior art arrangement of WRANs that may contend for white space in the TV spectrum;

[0015] Figure 2 is a timing diagram showing a self-coexistence window in the UL subframe of a conventional IEEE 802.22 frame;

[0016] Figure 3 illustrates operations of a prior art spectrum contention procedure;

[0017] Figure 4 illustrates operations of a spectrum contention procedure according to exemplary embodiments of the present work;

[0018] Figure 5 shows a graphical comparison of the performances of spectrum contention procedures according to prior art and the present work; and [0019] Figure 6 illustrates a wireless communication apparatus according to exemplary embodiments of the present work.

DETAILED DESCRIPTION

[0020] The detailed description set forth below in connection with the appended drawings is intended as a description of various embodiments of the present work and is not intended to represent the only embodiments in which the present work may be practiced. The detailed description includes specific details for the purpose of providing a thorough understanding of the present work. However, it will be apparent to those skilled in the art that the present work may be practiced without these specific details. In some instances, well known structures and components are shown in block diagram form in order to avoid obscuring the concepts of the present work. The word "exemplary" is used herein to mean "serving as an example, instance, or illustration." Any embodiment described herein as "exemplary" is not necessarily to be construed as preferred or advantageous over other embodiments.

[0021] For secondary systems that use the aforementioned common message approach, example embodiments of the present work provide a distributed prioritized contention protocol for spectum sharing. The present work reduces the number of contention frames required to decide on the winning WRAN. Some embodiments exploit the following:

[0022] Step 1 - since the wireless channel is broadcast by nature, if a CS can hear the transmission of another CS, then instead of ignoring the information in that transmission, the CS will decode the transmitted packet (see 43 in Figure 4). If the CS finds that the CN observed after packet decoding is higher than its own generated CN (see 44 in Figure 4) it will quit contending for this channel in the current round (see 45 in Figure 4). This is because even if the CS transmits its CN later, it will definitely lose the contention to the CS with higher CN. The operations at 43-45 in Figure 4 serve to reduce the number of CS's each frame, which reduces the collision probability in each frame and reduces the total number of contention frames required.

[0023] Step 2 — Based on the above Step 1 , an idealized scenario would be if the CS with the largest generated CN transmits first. In this event only one contention frame is required and this achieves the minimum number of contention frames that any protocol could achieve. In prior art approaches such as shown in Figure 3, the transmission order of the CS's is random, because it is based on randomly generated back-off windows for the CS's. Exemplary embodiments of the present work emulate the idealized scenario described above by determining the size of the random back-off window based on the associated contention number (e.g., inversely related to the contention number). This is shown at 42 in Figure 2. The following steps explain how the size of the back-off window is designed based on the generated CN in some embodiments. Let CNmax be the maximum size of contention number window and RB_maχ the maximum size of random back-off window. For a total of K contending CSs:

[0024] For each CS(i) i = 1 , 2, 3. ... K:

[0025] Generate CN(i)=Uniformly distributed ~{0, l ,..., CNmax- 1}

(see also 31 in Figures 3 and 4)

[0026] Let ModRB_maχ=RB_maχ - round[CN(i)*(RB_maχ- l)/(CN_maχ- l)]

[0027] Generate CSBackoff(i)=Uniformly distributed

~{0, l ,...,ModRBmax- l} (see also 42 in Figure 4) [0028] As set out above, each CS(i) randomly selects its back-off value CSBackoff(i) from a set of back-off values whose maximum is a value ModRBmax calculated as a function of the contention number CN(i) associated with CS(i). Larger values of CN(i) produce smaller values of ModRBmax , and hence smaller values of CSBackoff(i). Smaller values of CSBackoff(i) provide correspondingly higher priorities for transmission of the associated CN(i) (see 34 in Figures 3 and 4).

[0029] Operation of a protocol according to some embodiments is illustrated by the flow chart in Figure 4, wherein conventional operations from the adaptive on demand scheme of Figure 3 are numbered the same as in Figure 3. The operations in Figure 4 may be performed by each contention source (CS) according to example embodiments of the present work.

[0030] As shown in Figure 4, after generating a contention number at 31 , a back-off is generated at 42 based on the contention number (e.g., inversely related to the contention number). At 43, the channel is sensed, and the coexistence beacon (e.g., a packet) is also decoded. If the channel is busy at 43, then it is determined at 44 whether the contention number (indicated by the packet decoded at 43) is larger than the contention number generated at 31. If yes at 44, then contention is discontinued at 45. If no at 44, then the back-off is frozen at 34, after which operation continues at 43.

[0031] If the channel is free at 43, then the back-off is decreased at

35, after which it is determined at 36 whether the back-off has reached 0. If no at 36, operation continues at 43. If yes at 36, a packet (coexistence beacon) is transmitted at 37. Thereafter, if a collision is detected at 38, operation returns to 42, where another back-off is generated based on the contention number generated at 31. [0032] Advantages associated with the procedure shown in Figure

4 include: (1) the CS with higher contention number (higher priority) will likely transmit the packet earlier, because it has a smaller size random back-off window; and (2) the CS will stop trying to transmit after it hears a higher contention number, so that the probability of collision is sharply decreased.

[0033] Figure 5 compares the performance of the prior art adaptive on demand contention protocol with embodiments of the present work for the following parameters: CN_max=2²⁰ and

. As is clear from the results, the present work significantly reduces the number of contention frames required to decide on the winning WRAN. For example, for three WRANs, only 1.6 frames are required on the average with the present work, while the on-demand contention protocol requires around 3.2 frames, which means a 100% reduction using the present work. The gain increases with the number of CS's as shown in Figure 5.

[0034] Figure 6 diagrammatically illustrates a wireless communication apparatus according to exemplary embodiments of the present work. In some embodiments, the apparatus of Figure 6 is capable of performing operations shown in Figure 4. In some embodiments, the apparatus of Figure 6 is a base station. In some embodiments, the apparatus of Figure 6 is customer premises equipment (CPE). Transmit/ receive facilities 61 support bidirectional wireless communication with other wireless communication apparatus (e.g., base stations that control contended-for channels). A packet receive/ decode unit 62 monitors the contention channel (e.g., during the SCW of Figure 2) to determine whether another contender has transmitted a packet containing a contention number. If a contention number (CN_C in Figure 6) is decoded at 62, a compare unit 63 compares it to a contention number CN generated by a CN generator 64. The compare unit 63 thus functions as a determiner for determining whether the contention priority represented by CN_C than the contention priority represented by CN. If CN_C > CN, the compare unit 63 produces a withdraw signal that causes the wireless communication apparatus to withdraw from contention for the channel.

[0035] If no contention number is decoded at 62, then the contention channel is considered to be free. In this case, a decrement (DEC) signal decrements the current count value of a counter 65. The initial count value of counter 65 has been loaded with a backoff value (BO) produced by a backoff generator 66 based on the contention number CN produced by the CN generator 64. A compare unit 67 (operation of which is triggered by the DEC signal in some embodiments) compares the current count value of counter 65 to 0. If the current count value reaches 0, the compare unit 67 triggers a packet transmit unit 69 to initiate transmission of a packet, including the contention number CN, on the contention channel (e.g., during SCW of Figure 2). Otherwise, the compare unit 67 signals the monitor 62 to continue monitoring the contention channel. The counter 65 and compare unit 67 are thus seen to constitute logic for determining, based on BO, whether to transmit CN when the contention channel is free.

[0036] A value BO is generated at 66 upon initialization of the apparatus' contention for a channel. A new value BO is also generated when a collision is detected (see 68 in Figure 6 and 38,42 in Figure 4) in conjunction with the packet transmission at 69.

[0037] Those of skill in the art would understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof. [0038] Those of skill would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present work.

[0039] The various illustrative logical blocks, modules, and circuits described in connection with the embodiments disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.

[0040] The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in a user terminal. In the alternative, the processor and the storage medium may reside as discrete components in a user terminal.

[0041] The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use products that embody principles of the present work. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the disclosure. Thus, the present work is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims

CLAIMSWHAT IS CLAIMED IS:

1. A method of contending on a contention channel for transmission access to a portion of a television channel spectrum, comprising: randomly selecting a contention value from a predetermined set of contention values; selecting a back-off value based on the selected contention value; determining whether the contention channel is available for transmission of the selected contention value; and in response to a determination that the contention channel is available, using the selected back-off value to decide whether to transmit the selected contention value on the contention channel.

2. The method of Claim 1 , wherein the contention values represent respective contention priorities, wherein said selecting a backoff value includes selecting a back-off value that is inversely related to the contention priority associated with the selected contention value, and wherein said using includes providing a relatively higher transmission priority to a selected contention value having a relatively lower associated back-off value.

3. The method of Claim 2, wherein said using includes decreasing the selected backoff value to produce a decreased back-off value, and using the decreased backoff value to decide whether to transmit the selected contention value on the contention channel.

4. The method of Claim 1 , wherein the contention values represent respective contention priorities, wherein said determining includes receiving one of said contention values transmitted on the contention channel by a contender for said portion, and further comprising determining whether a first contention priority represented by the received contention value is higher than a second contention priority represented by the selected contention value and, in response to a determination that the first contention priority is higher than the second contention priority, withdrawing from contention for said portion.

5. The method of Claim 4, wherein said selecting a back-off value includes selecting a back-off value that is inversely related to the contention priority associated with the selected contention value, and wherein said using includes providing a relatively higher transmission priority to a selected contention value having a relatively lower associated back-off value.

6. A wireless communication apparatus capable of contending on a contention channel for transmission access to a portion of a television channel spectrum, comprising: a contention value generator configured for randomly selecting a contention value from a predetermined set of contention values; a back-off value generator coupled to said contention value generator and configured for selecting a back-off value based on the selected contention value; a contention channel monitor configured to determine whether the contention channel is available for transmission of the selected contention value; and logic coupled to said back-off value generator and said contention channel monitor, said logic configured for, in response to a determination that the contention channel is available, using the selected back-off value to decide whether to transmit the selected contention value on the contention channel.

7. The apparatus of Claim 6, wherein the contention values represent respective contention priorities, wherein said back-off value generator is configured for selecting a back-off value that is inversely related to the contention priority associated with the selected contention value, and wherein said logic is configured to provide a relatively higher transmission priority to a selected contention value having a relatively lower associated back-off value.

8. The apparatus of Claim 7, wherein said logic is configured for decreasing the selected back-off value to produce a decreased back-off value, and for using the decreased back-off value to decide whether to transmit the selected contention value on the contention channel.

9. The apparatus of Claim 6, wherein the contention values represent respective contention priorities, wherein said contention channel monitor is configured to receive one of said contention values transmitted on the contention channel by a contender for said portion, and further comprising a determiner coupled to said contention channel monitor and said contention value generator for determining whether a first contention priority represented by the received contention value is higher than a second contention priority represented by the selected contention value and further for, in response to a determination that the first contention priority is higher than the second contention priority, directing withdrawal from contention for said portion.

10. The apparatus of Claim 9, wherein said back-off value generator is configured to select a back-off value that is inversely related to the contention priority associated with the selected contention value, and wherein said logic is configured to provide a relatively higher transmission priority to a selected contention value having a relatively lower associated back-off value.

1 1. An apparatus for contending on a contention channel for transmission access to a portion of a television channel spectrum, comprising: means for randomly selecting a contention value from a predetermined set of contention values; means for selecting a back-off value based on the selected contention value; means for determining whether the contention channel is available for transmission of the selected contention value; and means responsive to a determination that the contention channel is available for using the selected back-off value to decide whether to transmit the selected contention value on the contention channel.

12. The apparatus of Claim 1 1 , wherein the contention values represent respective contention priorities, wherein said means for selecting a back-off value includes means for selecting a back-off value that is inversely related to the contention priority associated with the selected contention value, and wherein said means for using includes means for providing a relatively higher transmission priority to a selected contention value having a relatively lower associated back-off value.

13. The apparatus of Claim 12, wherein said means for using includes means for decreasing the selected back-off value to produce a decreased back-off value, and means for using the decreased back-off value to decide whether to transmit the selected contention value on the contention channel.

14. The apparatus of Claim 1 1 , wherein the contention values represent respective contention priorities, wherein said means for determining includes means for receiving one of said contention values transmitted on the contention channel by a contender for said portion, and further comprising means for determining whether a first contention priority represented by the received contention value is higher than a second contention priority represented by the selected contention value and, in response to a determination that the first contention priority is higher than the second contention priority, for directing withdrawal from contention for said portion.

15. The apparatus of Claim 14, wherein said means for selecting a back-off value includes means for selecting a back-off value that is inversely related to the contention priority associated with the selected contention value, and wherein said means for using includes means for providing a relatively higher transmission priority to a selected contention value having a relatively lower associated back-off value.

16. A computer program product that supports contending on a contention channel for transmission access to a portion of a television channel spectrum, comprising: a computer readable medium comprising: code for causing at least one data processor to randomly select a contention value from a predetermined set of contention values; code for causing the at least one data processor to select a back-off value based on the selected contention value; code for causing the at least one data processor to determine whether the contention channel is available for transmission of the selected contention value; and code for causing the at least one data processor to, in response to a determination that the contention channel is available, use the selected back-off value to decide whether to transmit the selected contention value on the contention channel.

17. A method for a contender to contend on a contention channel for transmission access to a portion of a television channel spectrum, comprising: receiving via the contention channel a contention signal transmitted on the contention channel by a further contender for said portion; determining in response to the received contention signal whether a contention priority of the further contender is higher than a contention priority of said contender; and in response to a determination that the further contender has a higher contention priority than said contender, withdrawing from contention for said portion.

18. A wireless communication apparatus for participating as a contender on a contention channel for transmission access to a portion of a television channel spectrum, comprising: a contention channel monitor configured to receive via the contention channel a contention signal transmitted on the contention channel by a further contender for said portion; a determiner coupled to said contention channel monitor and configured to determine in response to the received contention signal whether a contention priority of the further contender is higher than a contention priority of said contender, said determiner further configured to direct said wireless communication apparatus to withdraw from contention for said portion in response to a determination that the further contender has a higher contention priority than said contender.

19. An apparatus for participating as a contender contending on a contention channel for transmission access to a portion of a television channel spectrum, comprising: means for receiving via the contention channel a contention signal transmitted on the contention channel by a further contender for said portion; means for determining in response to the received contention signal whether a contention priority of the further contender is higher than a contention priority of said contender; and means responsive to a determination that the further contender has a higher contention priority than said contender for directing said apparatus to withdraw from contention for said portion.

20. A computer program product that supports a contender contending on a contention channel for transmission access to a portion of a television channel spectrum, comprising: a computer readable medium comprising: code for causing at least one data processor to receive via the contention channel a contention signal transmitted on the contention channel by a further contender for said portion; code for causing the at least one data processor to determine in response to the received contention signal whether a contention priority of the further contender is higher than a contention priority of said contender; and code for causing at least one data processor to direct said contender to withdraw from contention for said portion in response to a determination that the further contender has a higher contention priority than said contender.