A method and system by which a base station in a Wireless Regional Area Network (WRAN), and more generally a transceiver in a cognitive radio (CR) system, can communicate with other transceivers to fairly share transmission and reception of scheduled use (“occupancy”) of frames on a single channel w
A method and system by which a base station in a Wireless Regional Area Network (WRAN), and more generally a transceiver in a cognitive radio (CR) system, can communicate with other transceivers to fairly share transmission and reception of scheduled use (“occupancy”) of frames on a single channel within a frame-based, on demand spectrum contention system. The method and system disclose how the base station can initiate contentions for an increased share of the frames available in the following superframe of the CR system. The method and system assure fair and efficient access to the transmission channel by a random number based contention process.
대표청구항▼
1. A method for use in operating a cognitive radio (CR) communication network, the method comprising: operating the CR communication network using synchronized frames and superframes to provide communication services within cells of base stations of the CR communication network;operating a communica
1. A method for use in operating a cognitive radio (CR) communication network, the method comprising: operating the CR communication network using synchronized frames and superframes to provide communication services within cells of base stations of the CR communication network;operating a communication link between the base stations;maintaining a schedule of assignments (SchAs) of frames, within a channel, to the base stations, wherein each frame is assigned to at most one base station for exclusive use for the communication services by the base stations;communicating the SchAs between base stations on the communication link; andusing a frame contention among a plurality of contending base stations to share use of a single channel by assigning individual frames to base stations for scheduled sole use for communication services;wherein the frame contention comprises making assignments, in the SchAs, of individual frames of subsequent superframes of the single channel among the plurality of contending base stations by comparing spectrum contention numbers (SCNs) which are randomly chosen from a finite set of numbers in which each number is equally likely; andwherein the frame contention further comprises a source resolution by which a base station which does not have scheduled use of a set of assigned frames in a subsequent superframe can contend to obtain the scheduled use of some or all of the frames in the set. 2. The method of claim 1, wherein the finite set of numbers from which SCNs are chosen is a set of integers {0, 1, . . . , 2X−1}, where X is a number of binary bits representing a fixed point integer used by the CR communication network. 3. The method of claim 1, wherein the communication link operates using discrete sensing time periods and discrete messaging time periods. 4. The method of claim 1, wherein the frame contention assigns frames from a superframe which follows immediately after the superframe in which the frame contention occurs. 5. The method of claim 1, further comprising simultaneously for each channel of the CR communication network, maintaining a SchAs of frames to base stations, and using the frame contention and source resolution to share use of the channel. 6. The method of claim 1, wherein a base station only initiates the source resolution if the needs of the base station for communication services exceed the communication services available in unscheduled frames of subsequent superframes. 7. The method of claim 1, wherein a base station initiates the source resolution by (a) identifying, from the SchAs, assigned frames to be contended for, and destination base stations to which the assigned frames to be contended for have already been assigned, (b) generating the SCNs, one for each of the destination base stations, and (c) transmitting on the communication link a source request message (SC_REQ) which comprises a list of the assigned frames to be contended for, and the SCNs. 8. The method of claim 7, wherein reception of the SC_REQ by destination base stations initiates, at the destination base stations to which the frames listed in the SC_REQ have been assigned, frame contentions for the frames listed in the SC_REQ. 9. The method of claim 7, wherein after transmitting the SC_REQ, the base station which initiated the source resolution senses on the communication link for response messages from the destination base stations for a fixed time. 10. The method of claim 9, wherein responsive to the base station which initiated the source resolution sensing one or more response messages from destination base stations, said response messages indicating either that the assigned frames contended for are maintained scheduled to the respective destination base station or are now available for contention, the base station which initiated the source resolution begins a frame contention for frames which are now available for contention, and exits the source resolution. 11. A system for a cognitive radio (CR) communication network, the system comprising: a plurality of base station transceivers each serving as a point in a point-to-multipoint architecture, communicating on a communication link between base stations, using synchronized frames and superframes to provide communication services within cells of base stations, wherein there is a beacon window in each frame;wherein the system maintains a schedule of assignments (SchAs) of frames within a channel to the base stations, wherein each frame is assigned to at most one base station for exclusive use for communication services by the base station;wherein the system communicates the SchAs between the base stations on the communication link;wherein the system operates a frame contention among a plurality of contending base stations to share use of a single channel by assigning frames for exclusive communication services to base stations;wherein the frame contention comprises making assignments in the SchAs of individual frames of subsequent superframes of the single channel among the plurality of contending base stations by comparing spectrum contention numbers (SCNs) which are randomly chosen from a finite set of numbers in which each number is equally likely; andwherein the frame contention further comprises a source resolution by which a base station which does not have scheduled use of a set of assigned frames in a subsequent superframe can contend to obtain the scheduled use of some or all of the frames in the set. 12. The system according to claim 11 wherein each superframe includes 16 frames. 13. The system according to claim 11, wherein the finite set of numbers from which the SCN is chosen is a set of integers {0, 1, . . . , 2X−1}, where X is a number of binary bits representing a fixed point integer used by the CR communication network. 14. The system according to claim 11 wherein the system is operable to send a response message from a second base station to a first base station with results of a frame contention and a source resolution. 15. The system according to claim 14, wherein responsive to the response message indicating the first base station has won access to at least one or more frames occupied by the second base station, the first base station is assigned scheduled use of the at least one or more frames. 16. The system of claim 11, wherein the system maintains a SchAs and operates frame contention and source resolution simultaneously for each channel of the CR communication network. 17. The system of claim 11, wherein a base station only initiates the source resolution process if the needs of the base station for communication services exceed the communication services available in unscheduled frames of subsequent superframes. 18. The system of claim 11, wherein the beacon windows are used for sensing and messaging among the base stations.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (6)
Ahmadi Hamid (Somers NY) Bantz David F. (Chappaqua NY) Bauchot Frederic J. (LaTourraque Saint-Jeannet NY FRX) Krishna Arvind (Briarcliff Manor NY) La Maire Richard O. (Yorktown Heights NY) Natarajan , Adaptive medium access control scheme for wireless LAN.
Ahmadi Hamid ; Bantz David ; Bauchot Frederic,FRX ; Harrison Colin ; Krishna Arvind ; Martinez Jose Louis,FRX ; Natarajan Kadathur ; Wetterwald Michelle,FRX, Allocation method and apparatus for reusing network resources in a wireless communication system.
Ahmadi Hamid ; Bantz David ; Bauchot Frederic,FRX ; Harrison Colin ; Krishna Arvind ; Martinez Jose Louis,FRX ; Natarajan Kadathur ; Wetterwald Michelle,FRX, Allocation method and apparatus for reusing network resources in a wireless communication system.
Ahmadi, Hamid; Bantz, David; Bauchot, Frederic; Harrison, Colin; Krishna, Arvind; Martinez, Jose Louis; Natarajan, Kadathur; Wetterwald, Michelle, Allocation method and apparatus for reusing network resources in a wireless communication system.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.