1. Adaptive On Demand Channel Contention
Month Year
doc.: IEEE yy/xxxxr0
February 2008
Adaptive On Demand Channel Contention
IEEE P Wireless RANs Date:
Authors:
Notice: This document has been prepared to assist IEEE It is offered as a basis for discussion and is not binding on the contributing individual(s) or organization(s). The material in this document is subject to change in form and content after further study. The contributor(s) reserve(s) the right to add, amend or withdraw material contained herein.
Release: The contributor grants a free, irrevocable license to the IEEE to incorporate material contained in this contribution, and any modifications thereof, in the creation of an IEEE Standards publication; to copyright in the IEEE’s name any IEEE Standards publication even though it may include portions of this contribution; and at the IEEE’s sole discretion to permit others to reproduce in whole or in part the resulting IEEE Standards publication. The contributor also acknowledges and accepts that this contribution may be made public by IEEE
Patent Policy and Procedures: The contributor is familiar with the IEEE 802 Patent Policy and Procedures including the statement "IEEE standards may include the known use of patent(s), including patent applications, provided the IEEE receives assurance from the patent holder or applicant with respect to patents essential for compliance with both mandatory and optional portions of the standard." Early disclosure to the Working Group of patent information that might be relevant to the standard is essential to reduce the possibility for delays in the development process and increase the likelihood that the draft publication will be approved for publication. Please notify the Chair
Carl R. Stevenson as early as possible, in written or electronic form, if patented technology (or technology under patent application) might be incorporated into a draft standard being developed within the IEEE Working Group. If you have questions, contact the IEEE Patent Committee Administrator at
>
Wendong Hu, STMicroelectronics
John Doe, Some Company

2. Month Year
doc.: IEEE yy/xxxxr0
February 2008
Abstract
This document presents details of the Adaptive On Demand Channel Contention Algorithm and the simulation results.
Wendong Hu, STMicroelectronics
John Doe, Some Company

3. February 2008
Overview
AODCC – a Distributed, Cooperative, and Real-time spectrum sharing protocol
Coexisting networks exchange spectrum access priority numbers via MAC messaging.
Random number between [0, 2^32-1], for intra-operator operation
Credit tokens, for inter-operator operation
The winner, with higher access priority compared to that of the losers, will occupy the spectrum.
Wendong Hu, STMicroelectronics

4. On-Demand Spectrum Contention – Message Flow
February 2008
On-Demand Spectrum Contention – Message Flow
Wendong Hu, STMicroelectronics

5. Contention source (SRC) Contention destination (DST)
February 2008
Contention source (SRC)
Contention destination (DST)
Wendong Hu, STMicroelectronics

6. Performance Evaluation
February 2008
Tool:
NS2 model for IEEE
AODSC (random contention number) protocols implemented on reservation based CBP
Parameters:
Single channel sharing
Size of super-frame: 16 frames
Frame size: 10ms
Simulation time: 10,000s
Number of networks: up to 7 co-channel networks (for each type of basic scenarios)
Basic Coexistence Scenarios
Complete Graph scenarios
Cycle Graph scenarios
Wheel Graph scenarios
Wendong Hu, STMicroelectronics

7. Coexistence Scenarios
February 2008
Coexistence Scenarios
Complete
Cycle
Wheel
Wendong Hu, STMicroelectronics

8. February 2008
Simulation results
Wendong Hu, STMicroelectronics

9. Simulation results (cont’d)
February 2008
Simulation results (cont’d)
Wendong Hu, STMicroelectronics

10. Fairness and Convergence Time
February 2008
Fairness and Convergence Time
Wendong Hu, STMicroelectronics

11. Adaptive On-Demand Channel Contention – the Properties
February 2008
Adaptive On-Demand Channel Contention – the Properties
Efficient
Simple contention process (random number or credit token exchange)
Contentions are in parallel with data transmissions
Avoid collisions and the hidden node problem
Fair
Random number comparisons (or credit token comparison)
On-demand iterative contention process
Scalable
Distributed decision making, no central arbiter needed.
Stable
Cooperation among networks to achieve the goals of fairness and efficiency of spectrum sharing
Wendong Hu, STMicroelectronics