CN100591037C - Method and apparatus for an AD-HOC wireless communications system - Google Patents
Method and apparatus for an AD-HOC wireless communications system Download PDFInfo
- Publication number
- CN100591037C CN100591037C CN200580016506A CN200580016506A CN100591037C CN 100591037 C CN100591037 C CN 100591037C CN 200580016506 A CN200580016506 A CN 200580016506A CN 200580016506 A CN200580016506 A CN 200580016506A CN 100591037 C CN100591037 C CN 100591037C
- Authority
- CN
- China
- Prior art keywords
- token
- station
- sta
- sequence table
- message
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
An IBSS that allows token passing for round-robin service of QoS flows is disclosed (an RRBSS). The RRBSS permits low-latency, reduced contention, distributed scheduling useful in any ad hoc network,but particularly suitable for high data rates. Distributed scheduled access is provided for flows through a round-robin token passing service discipline. STAs follow a round-robin order, or list, andare able to communicate with round-robin transmit opportunities during a defined period. Each STA in the list transmits a respective token to transfer access to the shared medium to the next STA in the RR List. The sequence is terminated with an end token. STAs maintain station identifiers and list updates are maintained with a sequence identifier. Techniques are disclosed to add and remove STAs to the sequence, establish connectivity lists (receive and forward), and maintain other sequence parameters such as bandwidth management and TXOP duration. Various other aspects are also disclosed.
Description
Priority request according to 35U.S.C. § 119
Present patent application requires the priority of following application:
On March 26th, 2004 submitted to, exercise question is the provisional application No.60/556 of " Method and Apparatus forScheduling in an Ad Hoc Network ", 965;
On June 2nd, 2004 submitted to, exercise question is the provisional application No.60/576 of " Method and Apparatus for RobustWireless Network ", 545;
On July 8th, 2004 submitted to, exercise question is the provisional application No.60/586 of " Method and Apparatus forDistributing Communication Resources Among Multiple Users ", 841;
On August 11st, 2004 submitted to, exercise question is the provisional application No.60/600 of " Method, Apparatus and Systemfor Wireless Communications ", 960;
More than all applications all transferred the application's assignee, and by reference it is incorporated into herein hereby.
Technical field
Present invention relates in general to communication, and more clearly relate to the medium access control.
Background technology
Wireless communication system is widely used in to be provided such as the so various types of communications of voice-and-data.A kind of typical radio data system or network provide the multi-user access to one or more shared resources.System can use various multiple access techniques, such as frequency division multiplexing (FDM), Time Division Multiplexing, code division multiplexing (CDM) or the like.
The wireless network of example comprises the data system based on honeycomb.Below be several such examples: (1) " TIA/EIA-95-B Mobile Station-Base Station CompatibilityStandard for Dual-Mode Wideband Spread Spectrum Cellular System " (IS-95 standard), (2) standard that provides by " 3rd Generation Partnership Project " association (3GPP) by name, and this standard is embodied in and comprises number of documents 3G TS 25.211,3GTS 25.212, in one group of document of 3G TS 25.213 and 3G TS 25.214 (W-CDMA standard), (3) standard that provides by " 3rd Generation Partnership Project 2 " association (3GPP2) by name, and this standard is embodied in high data rate (HDR) system (IS-856 standard) that " TR-45.5 Physical Layer Standard forcdma2000 Spread Spectrum Systems " (IS-2000 standard) and (4) observes the TIA/EIA/IS-856 standard.
The example of other wireless system comprises the wireless lan (wlan) such as IEEE 802.11 standards (i.e. 802.11 (a), 802.11 (b) or 802.11 (g)).Comprise by employing and multiple-input and multiple-output (MIMO) WLAN of OFDM (OFDM) modulation technique can realize improvement these networks.Introducing 802.11 (e) is improved some shortcomings of 802.11 previous standards.
Along with the development of wireless system design, higher data rate becomes possibility.Higher data rate has been opened advanced possibility of its application, and voice, video, high speed data transfer and various other application are wherein arranged.Yet various application may have different demands for their transfer of data separately.The data of many types have the demand of stand-by period and throughput, perhaps need some service quality (QoS) to guarantee.Do not having to reduce the capacity of system under the situation of resource management, and system may not work efficiently.
There is not the ad hoc network at 802.11 WLAN stations (STA) of centralized controller to be called as independent basic service set (IBSS).In the prior art, in IBSS, do not provide service quality (QoS) function.Medium access control (MAC) agreement is often used in distributing between a plurality of users the communication resource of sharing.Interface between the normally high-rise and physical layer that is used to transmit and receive data of MAC agreement.In order from the growth of data rate, to benefit, must design utilize the MAC agreement of shared resource efficiently.Usually also wish to keep and alternative or tradition (legacy) communication standard between interoperability.Therefore, need a kind of like this IBSS in this area, it is supported in the competition and the distributed scheduling of low latency all useful, that be particularly suitable for high throughput systems, minimizing in any ad hoc network.Also need such treatment technology in this area, they can the various types of legacy systems of back compatible.
Summary of the invention
According to an aspect of the present invention, described a kind of device, it comprises: memory is used for the storage sequence table; Receiver is used for receiving first signal that the control of shared medium is shifted in indication from first distant station that has the station identifier that is associated in described sequence table; And transmitter, be used for after receiving described signal, sending at described shared medium, and be used for after distributing expiration, sending the secondary signal that the control of described shared medium is shifted in indication to second distant station that in described sequence table, has the station identifier that is associated at the time of the control of described shared medium
According to a further aspect in the invention, disclose a kind of message that is used to indicate the control that shifts shared medium, it comprises: the first stop identifier that is associated with the first stop that shifts control; And second station identifier that is associated with second station that receives control, at second station identifier described in the sequence table after described first stop identifier.
According to a further aspect in the invention, disclose a kind of message that is used to indicate the control that shifts shared medium, it comprises: the station identifier that is associated with the station that receives control; And the sequence table that comprises the station identifier that is associated with a plurality of stations of inserting shared medium in proper order.
According to a further aspect in the invention, provide a kind of method of shared public medium, it comprises: formation comprises one or the more sequence table of multistation identifier; And send token from first stop to second station according to described sequence table, so that the control of described public medium is delivered to described second station from described first stop.
According to a further aspect in the invention, provide a kind of method, it is used for: according to the tabulation that is made of the one or more stations that shared medium is shared successively, send token from the first stop of access right with described shared medium to second station; And after sending described token, be transferred to described second station sharing the control that inserts.
According to a further aspect in the invention, described a kind of BSS, it comprises: a plurality of stations, the access right of its shared public medium; And the token transfer device, be used for according to the tabulation that comprises with the corresponding station identifier in one or more stations at described a plurality of stations, to serving in proper order from the information flow at the described one or more stations in described a plurality of stations.
According to a further aspect in the invention, provide a kind of method that is used in the wireless network that comprises the one or more stations of sharing public medium, it is used for: insert described medium in a series of timeslices, described timeslice is by first signal description; After first delay after the transmission of described first signal, on described shared medium, send secondary signal from first stop, described first retardation ratio is postponed short by one or more distant stations employed one or more second, described secondary signal comprises the token message that is used for the control of described shared medium is transferred to second station.
According to a further aspect in the invention, described a kind of device, having comprised: the device that is used to form the sequence table that comprises one or more station identifiers; And be used for sending token from first stop to second station according to described sequence table, so that the control of public medium is delivered to the device at described second station from described first stop.
According to a further aspect in the invention, described a kind of device, it comprises: be used for according to the tabulation that is made of the one or more stations that shared medium is shared successively, send the device of token from the first stop of access right with described shared medium to second station; And be used for after sending described token, sharing the device that the control that inserts is transferred to described second station.
According to a further aspect in the invention, disclose computer-readable medium, it is used for carrying out: form the sequence table that comprises one or more station identifiers; And send token from first stop to second station according to described sequence table, so that the control of public medium is delivered to described second station from described first stop.
The invention also discloses various other aspect and embodiment.
Description of drawings
Fig. 1 is the embodiment of an example of the Basic Service Set (BSS) of prior art;
Fig. 2 has described the embodiment of the example of the IBSS that uses as RRBSS;
Fig. 3 has described the embodiment of the example of Wireless Telecom Equipment or STA;
Fig. 4 has illustrated the part of embodiment of the example of STA;
Fig. 5 has described the relation of an example between the delay parameter that is used to set up and keep RRP;
Fig. 6 has illustrated the timetable of the example of RRBSS at work;
Fig. 7 has described the embodiment that is used for an example of the method for startup RRBSS in IBSS;
Fig. 8 has described the embodiment of an example that is used for typical R RBSS method for communicating;
Fig. 9 has described and has been used for the embodiment that STA asks oneself to join RRBSS and is used for generating an example of the method that receives connectedness tabulation (receive connectivity list) and the connective tabulation of transmission (forwardconnectivity list);
Figure 10 has described the embodiment that is used to handle an example of adding the method for asking;
Figure 11 has described and has been used to propagate the RR tabulation after the renewal and responds initiate RR
STA and carry out the embodiment of an example of method for updating to receiving and send connective tabulation;
Figure 12 has described the embodiment of an example of the method for the insertion point that is used for being modified in RR tabulation RR STA;
Figure 13 has described and has been used for STA removes the method for oneself from RR tabulation the embodiment of an example;
Figure 14 has described the embodiment of an example of the method that is used for removing automatically the STA that underuses;
Figure 15 has described the embodiment of an example of the method that is used for explicit token transmission;
Figure 16 has described the embodiment of an example of the method that is used for Bandwidth Management;
Figure 17 has described the embodiment of an example of the method that is used to manage fairness (fairness);
Figure 18 has described the embodiment of an example of the method for the TXOP duration that is used to adjust STA;
Figure 19 has described the embodiment of an example that is used for method for saving energy;
Figure 20 is the embodiment of an example of short token; And
Figure 21 is the embodiment of an example of long token.
Embodiment
There is not the ad hoc network at 802.11 WLAN stations (STA) of centralized controller to be called as independent basic service set (IBSS).Up to now, in IBSS, also do not provide service quality (QoS) function.Support that (round-robin, RR) service uses the IBSS of token transmission to be called as RRBSS herein for the circulation of QoS information flow.This RRBSS is the enhancing of IBSS, and it is supported in low latency all useful, that be particularly suitable for the High Data Rate network, the competition and the distributed scheduling of minimizing in any ad hoc network.By circulation (RR) token passing service principle,, the QoS information flow inserts for providing the scheduling of distributed low latency.RR STA observes cyclic order, and can communicate with circulation send opportunity (RR TXOP) during being called as a part of beacon interval of RR cycle or RRP.In one embodiment, the STA that only has a QoS information flow is allowed to join in the RR scheduling and inserts medium during RRP.At competing cycle (CP), (best effort) information flow of doing one's best uses distributed coordination function (DCF) to continue to insert medium, is described in further detail below.
For WLAN (perhaps using the similar application of emerging transmission technology), the efficient operation that the embodiment support of example disclosed herein combines with the unusual physical layer of bit rate.The WLAN of example is supported in the bit rate that surpasses 100Mbps (per second megabit) on the bandwidth of 20MHz.Along with the increase of WLAN bandwidth, mean packet delay reduces automatically.Introduce round-robin scheduling and further reduced delay jitter, and therefore can in ad hoc network, carry out the service of QoS information flow.
The embodiment of various examples has kept the simplicity and the robustness of the distributed coordination operation of traditional wlan system, such as (a) and (b) with (e) can find the example of these traditional wlan systems in such 802.11 standards.Can realize the advantage of various embodiment, keep back compatible simultaneously with these legacy systems.(noting, in the following description, is 802.11 system descriptions the legacy system of example.Person of skill in the art will appreciate that these improve also and alternative system and operating such.)
The WLAN of an example can support high data rate, high bandwidth physical layer transmission mechanism usually, and it includes, but are not limited to: based on those systems of OFDM modulation, single-carrier modulated technology; Use a plurality of transmitting antennas and a plurality of reception antenna to be used for the very system of the efficient operation of high bandwidth (multiple-input and multiple-output (MIMO) system comprises the single output of many inputs (MISO) system); Use a plurality of antennas that transmit and receive combine with the spatial multiplexing technology, so that sending data or from the system of multiple users transmission data to multiple users at interval at the same time; And employing code division multiple access (CDMA) technology is to allow a plurality of users system for transmitting simultaneously.Alternative example comprises single input many output (SIMO) system and the single output of single input (SISO) system.
One or more exemplary embodiment described herein is to propose in the background of wireless data communication system.Although it is useful using within this background, different embodiment of the present invention can be incorporated in different environment or the configuration.Usually, can use software-controlled processor, integrated circuit or discreet logic to form various system described herein.The data that can quote from whole application, instruction, order, information, signal, symbol and chip can be represented with voltage, electric current, electromagnetic wave, magnetic field or magnetic particle, light field or light particle or their combination easily.In addition, can represent hardware or method step at the square frame shown in each block diagram.Under the situation that does not deviate from scope of the present invention, method step can exchange mutually.Here " exemplary " vocabulary of using shows " example or illustration as an example, ".Any conduct described herein " exemplary " embodiment needn't be interpreted as being preferred or having advantage with respect to other embodiment.
Fig. 1 is the embodiment of an example of prior art system 100, and this system 100 comprises a centralized access point (AP) 104, and it is connected to one or more user terminals (UT) 106A-N that is commonly called Basic Service Set (BBS).According to 802.11 terms, AP and UT are also referred to as station or STA in this article.Via wireless lan (wlan) 120, AP and UT communicate.In the embodiment of this example, WLAN 120 is high speed MIMOOFDM systems.Yet WLAN 120 can be any WLAN.Via network 102, the external equipment or the processing of access point 104 and arbitrary number communicate.Network 102 can be internet, Intranet or any other wired, wireless or optical-fiber network.Connect 110 and carry from this network to access point 104 physical layer signal.Equipment or handle can be connected to network 102 or as the UT among the WLAN 120 (perhaps, via with its be connected).For example, the equipment that can be connected to network 102 or WLAN 120 comprises: phone, PDA(Personal Digital Assistant), various types of computers (terminal of portable computer, personal computer, work station, any type), such as camera, camcorder, the such video equipment of web camera, and the data equipment of any other type almost.Processing can comprise voice, video, data communication or the like.Different data flow can have different transmission demand, can adapt to these demands by using different service quality (QoS) technology.
Fig. 2 has described IBSS system 200, is included in the UT or the STA 106 of communication on the WLAN 120.Noting, in system 200, is not that each STA can communicate with each other STA.Via connecting 110 (they can be to use connection any agreement, wired or wireless, any kind), shown user terminal 106A is connected to external network 102.This is optionally, because this IBSS does not need to comprise any other the connection except that WLAN 120.Below describe the embodiment of the example of the IBSS with one or more cycle characteristicss in detail, be called as RRBSS.Notice that RRBSS can comprise the STA of any kind, comprise and can be used as the access point that UT uses, perhaps can with RR technology interoperability described below.Similarly, in the following description, Wireless Telecom Equipment is commonly called STA, and STA can be the equipment of any kind as described herein.
Fig. 3 has described the embodiment of the example of Wireless Telecom Equipment or STA 106.Transceiver 310 is optionally, and according to the physical layer demand of network 102, it can be used for receiving and sending in connection 110.The WLAN transceiver 340 that is described in further detail below transmits and receive data on WLAN 120 via one or more antenna 350.
Being connected to the equipment of WLAN 120 or network 102 or the data of application reception or transmission can be handled by processor 320.These data are called as information flow here.According to the type of the application relevant with information flow, this information flow may take on a different character, and may and need different processing.For example, the feature of video and voice can be the information flow (usually, video has the more demand of high-throughput than voice) of low latency.Many data are used the stand-by period not too responsive, but may have higher data integrality demand (just, voice can allow some packet loss, but file transfer can't stand packet loss usually).Use circulating technology disclosed herein can the QoS of information flow be managed.
In the embodiment of example, in processor 320, carry out the processing of adaptation layer (ADAP) and data link control layer (DLC).WLAN transceiver 340 associative processors 320 are carried out the processing of physical layer (PHY).Those skilled in the art will appreciate that and to carry out cutting apart of various functions with in the various configurations any one.Processor 320 can be carried out the processing of the physical layer of some or all.The WLAN transceiver can comprise that being used to carry out MAC handles or its a part of processor.Can use processor, specialized hardware or their combination of arbitrary number.Layer described herein is just illustrative.
Such as these above-mentioned wireless system standards of listing, 340 pairs of signals that are sent out of transceiver format according to one or more.The example of the parts that can comprise in the transceiver 340 is amplifier, filter, digital-to-analogue (D/A) transducer, radio frequency (RF) transducer or the like.Can format so that transmit data and control channel according to multiple form.According to dispatching algorithm indicated speed and modulation format, in the modulator (not shown), format in the data that forward link data channel transmits being used for.Other examples of members that can be incorporated in the transmitter of transceiver 340 is drawn together various types of encoders, interleaver, frequency multiplier and modulator.
Shown WLAN transceiver 340 is connected with antenna 350A-N.In various embodiments, can support the antenna of arbitrary number.Antenna 350 can be used for sending and receiving in various WLAN (that is, 120).
In an example system, a STA can have N antenna, and the 2nd STA can have M antenna.Thereby, between the antenna of a STA and the 2nd STA, the MxN paths is arranged.The multiple space technology of using these mulitpaths to improve throughput is well known in the art.In space-time emission diversity (STTD) system (being also referred to as " diversity " here), the transmission data are formatd and encode, send on all antennas as a data flow then.Utilize M transmitting antenna and N reception antenna, can form MIN (M, N) individual independently channel.Spatial multiplexing adopts these independent paths, and can send different data on each independent paths, so that improve transmission rate.
Become known for learning or adapting to the various technology of the feature of two channels between the STA.Can send peculiar pilot tone from each transmitting antenna.Measure in each reception antenna reception pilot tone and to it.Then, the channel condition information feedback can turn back to transmitter to use in transmission.Can carry out eigen decomposition to the channel matrix measured so that determine the eigenmodes of channel.As alternative technology,, the intrinsic of using pilot tone and data is led the spatial manipulation of simplified receiver for fear of the eigen decomposition of carrying out channel matrix at receiver.
So,,, have multiple different message transmission rate to use for various user terminals in whole system or the transmission of other STA according to current channel conditions.Based on any spatial manipulation of using for physical layer link, WLAN transceiver 340 can be determined supported speed.
Can rely on the demand data of STA and size and shape factor and determine the number of antenna of use.For example, the high sharpness video display is because its high bandwidth requirements can comprise for example 4 antennas, and PDA may only need two.
Fig. 4 has described the part of embodiment of the example of STA 106.Shown various functional block is illustrative, and can be used as the function of aforesaid discreet logic, processor (that is, processor 320) or processing, with combine such as the such memory of memory 330 or their combination in any.In this example, from such as the such transceiver received signal of transceiver 340 (perhaps 310).
Can adopt channel estimating unit 420 to use any (for example, the threshold value of the energy that receives) in the multiple means, determine that whether shared medium (for example WLAN 120) is used by other STA, perhaps detects the medium free time.(Clear ChannelAssessment, CCA) technology is well known in the art in the channel idle assessment.Channel estimating unit 420 also can be carried out beacon and detect so that set up the system time cycle.In the embodiment of an example, select RRP as target beacon transmit time (TBTT) part at interval.In this area, channel estimating and beacon detection technique are well-known.For example, can use any equipment that is used for detected beacon signals (that is, intensity, search, decoding, deinterleaving, filtering or any other signal processing technology of the signal that receives of measurement well-known in the art).Shown channel estimating unit 420 is connected on the mediation function 425.In the embodiment of an example, can use easily from 802.11 distributed coordination function (DCF) or its expansion or its additional CSMA/CA and ad hoc network concept, to be used for initially inserting and finding other STA.Technology disclosed herein and such 802.11 systems and the ad hoc interoperability of system of any other type.Mediation function 425 can be carried out DCF or other access procedure, and the circulation of describing in detail about the various embodiment is here coordinated.Shown mediation function 425 is connected on the message generator 430, and this message generator can be in response to the signal of decoding and message and determining and in response to the function and the process of coordination function logic 425, transmit message transfer channel conditions.
Various other message also are known in the art, and can be employed within the scope of the invention.For example, can use the message that be used to related with STA asked and allowed or refuse.Confirm that (ACK or NAK) message can be included in the various communication formats.Can use process and the message setting up or remove the information flow between one or more STA.
Illustrative loop parameter has been shown among Fig. 4.These parameters can extract from the message from distant station that receives, also can in processor 320, generate or revise, and can be stored in the memory 330, can be included in (that is generation in message generator 430) in one or more various types of message.The example that is discussed in further detail below comprises with the lower part: " loop identifier (RRID) " 440 that is used for other STA that STA is different from recirculating network, be used to identify " cyclic sequence number (the RR Seq) " 442 of cyclic sequence and its variation of indication, comprise RRID and they separately " circular list (the RR List) " 444 of order in this cyclic sequence, be used for indicating this STA can receive which RRID of this RR tabulation " receiving connective tabulation ", be used for keeping the RR tabulation with can be to those STA that this STA receives " sending connectedness tabulates " 448 of relevant RRID, and various other is provided with 450.These parameters can be used for the various processes of following detailed description, and can send to other STA so that coordinate cyclic sequence.
Fig. 5 has described the relation of an example between the delay parameter that is used to set up and keep RRP, in this example, can use the interFrameGap (IFS) from 802.11DCF.The interFrameGap duration depends in the type in the gap that two or more STA are inserted between the transmission on the shared medium and changes.Indicated the time delay relation between short interFrameGap (SIFS), some interFrameGap (PIFS) and DCF interFrameGap (DIFS) and the cycle frame interbody spacer (RRIFS).Note SIFS＜PIFS＜DIFS.So, and attempt must to wait for before the access channel that the transmission of long period compares, the transmission afterwards of shorter duration will have higher priority.In DCF BSS, wherein AP serves as centralized controller, has defined the PIFS duration to give the priority that this AP inserts medium.When expectation obtains ad hoc circle transmission within the system that is also comprising an access point (it is observed PIFS and keeps out of the way (backoff) restriction), RRIFS can be provided with shortlyer than PIFS, so, compare with those transmission from this AP, give circle transmission higher priority.In an alternative, RRIFS also can be provided with longlyer than PIFS, so that the business of the coordinating priority higher than the business of circulating to AP.In another embodiment, RRIFS can equate with PIFS.Although do not force, in the embodiment of this example, the ratio SIFS that RRIFS is provided with is long, so that support to observe such as ACK, NAK and other priority of the such message of message that SIFS keeps out of the way restriction.In alternative, can use other priority mechanism.Those skilled in the art will be easy to principle disclosed herein is adapted to application cycle process in using any adhoc system of any priority mechanism.Usually, take and utilize channel so that the QoS characteristic of expectation to be provided, can use any delay parameter in order to allow the RR transmission.The technology that recycles with fairness of managing this shared medium further describes below.
Fig. 6 has illustrated the timetable of the example of RRBSS at work.Beacon 620 has been indicated the beginning of TBTT 610, and this TBTT 610 comprises " ad hoc service indication message (ATIM) window " 660, " cycle period (RRP) " 670 and " competing cycle (CP) " 680.During the ATIM window, only allow the ATIM frame, it is to the existence of receiving station's indicating services.In this embodiment, this ATIM window no change.Alternative embodiment needn't be supported ATIM.RRIFS is not described in detail in detail at interval in Fig. 6.RRP is by a series of RR transmission opportunity (RR TXOPS) 630A-630N formation at each STA among N STA in the RR tabulation.Each STA in this tabulation sends token 640 separately so that the access right of shared medium is transferred to the next STA of this RR in tabulating.Note, STA needn't utilize its RRTXOP, but can (for example be transferred to next station to access right with token 640 simply, note, token 640B shifts STA C to access right from STA B, subsequently, make access right transfer to STA D, and do not need RR TXOP to get involved) from STA C with token 640C.Last STA (STA N) in this RR tabulation stops this RRP by sending " end token " 640N.In the embodiment of an example, identify this end token by the RRID (for example, complete zero) that sends a special use, so that indicate finishing of this RRP.
That follow this RRP is CP, and STA can compete access right arbitrarily in CP.In the embodiment of this example, STA can use DCF (perhaps other 802.11 competition access procedure) to carry out general communication arbitrarily, and DCF can be used for carrying out various controlled function (promptly, in the RR tabulation, add STA, perhaps set up information flow between the STA or the like), its example is described in further detail below.In Fig. 6, these transmission are represented with frame 650A-650N usually.The beginning of the end of a TBTT and a new TBTT is by another beacon 620 indications.Embodiment and the process of describing the example of various characteristics are described below.Clear for what discuss, suppose the access of adopting 802.11 IBSS and DCF type.RR STA can be called as MIMO STA, so that distinguish mutually with other STA, other STA is called as traditional STA.Clearly, different with the STA of these uses MIMO technology STA also go for RRBSS.Those skilled in the art will be easy to make the technology of equivalence to be applicable in the alternative embodiment, and be fit to and be different from these networks of being planned by standards of 802.11 standards and their derivations and carry out interoperability.
In case start RRBSS, for current beacon interval, first STA in the RR scheduling sends beacon.This is different from the beacon transmission methodology in traditional 802.11 IBSS, and in traditional 802.11 IBSS, a plurality of stations are competed and sent beacon.The order of STA in the RR scheduling is taken turns commentaries on classics in each beacon interval, so that send beacon at the STA that sends at last during the beacon interval k during beacon interval k+1.Rearrangement to this RR tabulation is optionally, but it can be used for distributing supervision and controlled function (and by avoiding such process to come energy-conservation ability) between the STA of this RRP.Can imagine alternative rearrangement scheme is taken turns commentaries on classics, and this is to it will be readily apparent to those skilled in the art that.
May wish that the ATIM window is set to finish immediately after beacon transmissions.This will forbid traditional sleep pattern.The various sleep mode procedures that MIMO STA in RRBSS can use the RR scheduling to support, its example is described below.If a plurality of traditional STA shared mediums, if then support ATIM, after the expiration of ATIM window, RRP following closely.
In the embodiment of this example, the STA that participates among IBSS or the RRBSS observes TBTT and when TBTT expires, finishes any ongoing transmission.This has considered the cycle of RRP more generally.Yet the transmission of traditional STA may expand to outside the TBTT, and causes the shake in the beacon transmissions.Technology described herein allows and traditional STA carries out interoperability.
Consider the minimizing overhead, in the embodiment of this example, defined long token and short token.The long token and the short token of example have been further described below.In alternative, can use single token (for example, Ding Yi long token here also has the token of any other type) or other token type.For clear, will use one group of RR parameter to describe the embodiment of example.In this example, this RR tabulation can comprise 15 STA at most, so RRID is the value of 4 bits." 0000 " RRID keeps for special-purpose purpose, and for example indication finishes token, and other technology, for example removes RRID (following detailed description) from this RR tabulation.In alternative, other RRID value can be replaced.Also can alternatively introduce other token type and indicate the end token.Those skilled in the art will be easy to use any a plurality of alternative parameter group to transform these embodiment.
In the embodiment of an example, basic cycling is undertaken by following.In the IBSS of existing or new formation, the STA that expectation brings into use periodic transfer to satisfy its (a plurality of) QoS information flow obtains a TXOP and the long token PPDU of transmission (broadcasting) by the DCF process, and this PPDU comprises RRID 4 bits, that also do not used by other STA (not being 0000).In order to reduce the possibility that two STA select same RRID at one time, can increase the length of RRID field.As mentioned above, RRID value 0000 has special implication.Along with other STA joins RR scheduling, as described below, each STA selects an own RRID from untapped RRID, then it is joined during RR dispatches itself.Can use the technology of distributing or select RRID arbitrarily.
Fig. 7 has described the embodiment that is used for an example of the method 700 of startup RRBSS in IBSS.Start the access right of the STA acquisition shared medium of RRBSS 710, one plans.In one embodiment, this is to carry out with the DCF process during the CP.Alternative system can specify the alternative approach of obtaining access right.720, in case obtain access right, this STA sends the token of the selected RRID that contains it.At this moment, the RR tabulation is made of the RRID of the STA of single startup.As following further described like that, other STA can observe this token and transmit (or in RRP subsequently another) and the STA that manages to add this startup among this RRBSS.730, during one or more delimiting periods (CP among the embodiment in example), this STA monitors the interpolation message from other STA.The example that adds message is described below, but alternative embodiment can be used the message of any kind.740, receive after the one or more interpolation message, this STA is the increase of one or more STA and correctly upgrade current RR tabulation, to form a new RR tabulation (will pass through approval process alternatively, it can comprise the speed or the like of the STA support of the type of the business that the STA of request is desired, available bandwidth, request).When joining this RR tabulation more than one STA when, each must select unique RRID.In one embodiment, during each TBTT, only to add a STA, although this is not compulsory.The technology that is used to arbitrate a kind of example of a plurality of interpolation message is to select first request that effectively receives.
In the embodiment of this example, 750, after CP finished, this STA waited for a duration.In this case, this duration is RRIFS, and it gives this STA priority higher than other STA, and other STA will wait for DIFS (adding applicatory keeping out of the way).This allows this STA to take these medium so that start the RRP of this TBTT.Alternative network can utilize different being used for to determine one-period (for example, the technology that TBTT) finishes and begin a new cycle.760, the STA of startup (also being last STA or only STA in current RR tabulation) is responsible for the new RRP of beginning, realizes by sending a beacon.Follow closely after this beacon, 770, if at other process (not shown) predefined target, then the STA of this startup can send a TXOP.In case finish, or no longer need TXOP, then the STA that should start transmits a token to the STA that adds recently, is included in other RR parameter (example is described in further detail below) that defines in this token.So, started a new RRBSS, and begun the beginning of typical R RBSS communication.
They are own along with STA in RR scheduling adds, leaves or insert again, write down the variation of this RR in dispatching by a global variable RR Seq.Whenever in this RR scheduling, STA adds, leaves or when diverse location inserted oneself again, this RR Seq added one.This RR Seq is included among short token PPDU and the long token PPDU as a field, describes in further detail below.Alternative can use alternative technique to remind variation (and other RR parameter) in this RR scheduling to STA.
Fig. 8 has described the embodiment of an example that is used for typical R RBSS method for communicating 800, above with reference to figure 6 described should typical case RRBSS communication example.810, follow the TBTT expiration closely, last STA in the RR scheduling of previous beacon interval (that is previous RRP) sends beacon after waiting for a RRIFS gap.As mentioned above, this RRIFS gap is delay or a duration shorter than DCF interFrameGap (DIFS).In this example, this DIFS is can be by the interFrameGap of the minimum of any other STA use among the IBSS.This has given and has used the STA priority higher than the STA of other competition of token to insert medium.In one embodiment, select RRIFS to equal PIFS, owing to do not have AP to exist, so and not conflict of AP.As mentioned above, in an alternative,, RRIFS can be shortened so that the priority ratio AP height of RRBSS if there is AP.
820, if expectation, a RR STA can send according to its TXOP.830, send a long token so that control is passed to the next RR STA of indication in current RR tabulation.If next RR STA does not send behind RRIFS, after additional delay expiration, the control of medium returns to the STA that sends beacon in previous beacon interval.So, beacon interval hereto, commentaries on classics is not taken turns in the RR scheduling.Should additional delay can be set to arbitrary value, although in the embodiment of this example, total the idle channel time ratio DIFS of expectation is little, so that guarantee that RR STA maintenance is to the control of medium during RRP.This condition is described in further detail below, and for clear, does not illustrate in Fig. 8.
As shown, as indication in the RR tabulation, a plurality of RR STA can send a series of zero or more RR TXOP in proper order.Follow by the transmission of token so that the control of medium is passed to next STA in this RR tabulation.In the time of additional message of needs or control (below be described in further detail), can be short token (consider usually and reduce expense) or long token at the token of every grade of transmission.For example, can send a RR TXOP (optional), send a short token (this token is not optional, but can define the technology that is used for fault recovery, and its example describes in detail below) 850 afterwards 840.After each RR TXOP finished, each RR STA passed to next STA in this RR scheduling to token.In this example, by sending a token PPDU who comprises the RRID of the next STA in this RR scheduling, this STA explicitly has been indicated the end (according to the enlightenment here, can adopt other technology that comprises that implicit expression is handled in alternative) of a RR TXOP.In this embodiment, the STA among the RRP always is to use long token PPDU transfers control.Be discussed below other situation that STA wherein need send long token PPDU.Each next STA in this RR scheduling receives this token and waits for that a RRIFS after the duration, obtains the control of medium.Any transmission from such STA is used as the implicit expression affirmation that this token transmits.So the entry of control from the RR for current beacon interval dispatches is that the entry that the STA of j is sent in this RR scheduling is the STA of j+1.860, send last TXOP (if any) of RRP.
870, after last STA in this RR scheduling had finished its transmission and sent the end token, the RRP of this beacon interval finished.In the embodiment of this example, this is set to 0000 (can substituting with alternative specific value) by the next RRID field in the STA token that sends and indicates in alternative.Bandwidth Management and fairness process can be included in the RRBSS system, and its example is described in further detail below.In this example, finished before the time that RRP need indicate in the RRP mark that is not later than at this token (RRP Fraction) field.
880,, this RR tabulation is upgraded for distribution monitoring and demand for control between the STA of this RRBSS.With a new RR STA this RR tabulation is upgraded, this new RR STA will start next RRP.As mentioned above, in the embodiment of this example, wheel changes this RR tabulation makes last STA become a STA, and all other STA moves a position.Shuffling again like this is optionally, and can substitute with the alternative process of shuffling in alternative.
890, these medium turn back to alternative access scheme.In this example, use distributed coordination function (DCF) operation, up to next TBTT.This cycle is also referred to as competing cycle (CP).In alternative, can use the access scheme (no matter whether based on competition) of any other type, and can use the alternative technique of obtaining the control of medium for RRP subsequently again.As described below, during CP, can begin other RR signaling.For example, can comprise and add STA or beginning or consult new information flow.At decision block 895, processing procedure circulates up to (that is TBTT) the expiration, of this cycle.When this RRBSS was activity, method 800 can infinitely repeat.
In the embodiment of this example, the STA that does not add the non-QoS information flow of having of RRP can use the DCF process to send during CP.Notice in alternative, the data that send do not require it is the QoS information flow during this RRP, but the QoS information flow is as a good example that uses RRBSS.TXOP transmission during this CP does not require with explicit token and finishes (unless during the cycle after this RRP, other requirement being arranged when using alternative access procedure).Be set to 0000 token (can be detected the RR signaling) if want to add the STA of this CP its next RRID that decoded if this STA is equipped with, if perhaps it (for example observes non-RR TXOP, the token transmission is not followed in the end of TXOP), it can determine the beginning of CP transmission so.
As mentioned above, each RR TXOP finishes with the transmission of a token PPDU, and the control of medium is transferred to next STA in RR scheduling.In this example, be set to the end that RRP is indicated in the transmission of 0000 token by next RRID field.Typically, in this RR scheduling, there is the STA of entry during the RR TXOP that it is scheduled, to need to send at least one frame.Yet, as mentioned above, if this STA without any the frame of buffering, its sends a short token or long token to keep its position in this RR dispatches.In addition, in this example, the STA that first sends in beacon interval sends long token (reason is further described below).In addition, along with one (because RR tabulates or the variation of various other RR parameters, the depending on the specific embodiment of short token or long token) that add of RR Seq, each RR STA need send vice-minister's token at least.For example, if the connective tabulation of the reception of STA changes, it also is to send vice-minister's token (below be described in further detail) at least.
Technology disclosed herein and embodiment go for the communication network (wireless with wired) of various other types.The transformat of the data that send during TXOP (for example, modulation type, speed, power level, coding or the like) can be an any kind.Applied communication format can with technology can be merged in the transmission of TXOP and reception and token and (note, token needs not to be independent message, but it is such as described herein, can combine with various types of data, message or signal transmission, this is apparent to one skilled in the art).For example, under illustrative 802.11 environment, can introduce following process.When the STA in the RR scheduling obtains the control of medium so that when sending the RRTXOP that it is scheduled, during this RR TXOP, it can use frame transmission protection (for example, RTS/CTS).It can use ACK immediately, perhaps postpones the piece ACK of ACK and 802.11e.It can be to one or more STA transmit frame.It can send one or more and assemble frame.Along with enhancing is incorporated in 802.11 standards, and develop any new system, can imagine that those skilled in the art will easily make available transmission and receiving course be suitable for comprising principle disclosed herein.
Fig. 9 has described and has been used for STA request the embodiment that oneself joins RRBSS and be used to generate an example of the method 900 that receives connective tabulation and send connective tabulation (is fit to be used in combination with the method 1000 and 1100 of example, described method 1000 and 1100 is used to add STA, the connective tabulation of reception of propagating the RR tabulation of upgrading and upgrading other STA of request and sends connective tabulation, is described in further detail below).When STA planned to join the RR scheduling, 905, it intercepted these medium comprise the RR tabulation with searching long token.In case it has had the copy of this RR scheduling, 910, it intercepts these medium, and its reception is connective tabulates so that construct to seek one or more beacon interval.915, each that can decode in the interim of intercepting for it (long or short) token transmission, this STA in the connective tabulation of its reception accordingly bit be set to 1.Notice that the connective tabulation of this reception has only been indicated on this STA the token of which STA is decoded, and no matter whether those STA can decode to the token transmission from this STA.In case this STA adds this RR scheduling, will generate subsequently and send connective tabulation, describe in detail below.It is also noted that can use any technology that is used to form and keeps connective tabulation, for a person skilled in the art, the equivalence techniques of these technology is conspicuous.In this example, this connectedness tabulation is the field of 15 bits, and the connectedness according to being associated with corresponding STA in the RR tabulation is provided with or resets each bit.Naturally, after RR tabulation resequenced, correspondingly to this connectedness tabulation resequence (using the suitable function of resequencing of being used for) based on selected list structure.
In order to add this RR scheduling, during the CP of beacon period, the STA of request competes access right, in this beacon period, last RRID represents such STA, and the connective bit that promptly is used for this STA in the connective tabulation of the reception of the STA of this request is set to 1.At decision block 920, the STA of this request circulates up to satisfying this condition.When condition satisfied, 925, the STA of this request competed access right.In case the acquisition access right, as decision block 930 illustrated, 935, the STA of this request sent one and adds message.If do not obtain access right, then turn back to decision block 920 (before the condition of decision block 920 satisfies again, one or more RRP may take place).In the embodiment of this example, this interpolation message is the short token PPDU by the STA transmission of this request, in this PPDU, this request STA inserts its selected RRID, and next STA field and last STA field all are set to last RRID (receiving in the connective tabulation and indicating its connectedness) in the cycle at this RRP.Because last RRID may not receive this request, the optional condition that is used to be increased to RRBSS may not satisfy, may receive that perhaps the interpolation message of maximum number is (in the embodiment of this example, a message), in decision block 940, the STA of this request determines whether it successfully is added in this RR tabulation.If enter 945.If not, then turn back to decision block 920 and (in an alternative, can keep current RR tabulation and connective tabulation at the interval repeating step 905-915 of expectation, as described) so that attempt continuing request.Be used in reference to and be shown as the technology that merit joins the example of RR tabulation and will describe in detail below with reference to Figure 10.
Figure 10 has described the embodiment that is used to handle an example of adding the method 1000 of asking.1010, last STA monitors that during CP medium add message to seek among the RRP.Note, in alternative, can use with described based on the technology of competition different technology or appearance interpolation request in the alternative cycle within TBTT (or other at interval).Equally, can give the alternative such tasks requested of one or more STA assignment process.As described, each cycle can allow one to add request, perhaps can allow higher or lower frequency.These modifications are conspicuous for a person skilled in the art.
At decision block 1020,, then enter 1030 if last STA receives one or more interpolation message among the RRP.If during TBTT, do not receive interpolation message, then enter 1050 so that send long token in the next RRP cycle.In this case, except any RR tabulation that may expect was shuffled, this RR tabulation did not change.In the embodiment of this example, last STA wheel changes, and becomes first STA among the next RRP, so it sends first long token (after beacon) at next cycle.(for what discuss clear, as in Figure 10, to have ignored various other the steps that describe in detail here).
1030, if successfully received one or more interpolation message (that is, this STA can to decoding based on the access of competition), last STA selects first message that effectively receives and a relevant RRID is joined in this RR tabulation.In alternative, can join one or more STA in the RR tabulation with any order, this is conspicuous for a person skilled in the art.Although new RRID can be placed on any position of this RR tabulation, in this example, following further explanation like that, it has been placed on the end.1040, RR sequence number (RR Seq) is upgraded to indicate this RR tabulation change (also can use alternative RR sequence identifier technology).As previously mentioned, 1050, this last STA becomes the long token (after beacon) that first STA and transmission comprise the RR Seq after this new RR tabulation and this renewal in next RRP.After each RRP, each last STA can repetition methods 1000, adds request so that monitor.Notice that alternative can provide one or more interpolation cycle that is different from the RRP time cycle afterwards or also provide one or more interpolation cycle except the time cycle after the RRP.
Get back to Fig. 9 now.As mentioned above, at decision block 940, the STA of request determines whether it is successfully added.Describe as Figure 10,, and see that its RRID (in the end), determines so the request of making is received in this example, in the RR tabulation if the STA of this request receives first token among the next RRP.Because this new STA is added in the end of this RR sequence, it receives the access right to medium at last, and sends the end token.As mentioned above, it becomes first STA among the next RRP then.So 945, in beacon interval subsequently, it sends beacon and first token.950, send first (length) token, comprise its connective tabulation of reception.The long-range STA that listens to this long token can correspondingly upgrade their the connective tabulation of reception.In addition, because this new STA has indicated it and can receive from those each STA, can upgrade their the connective tabulation of transmission for this new STA so see the long-range STA of its corresponding bits that in the connective tabulation of the reception of this new STA, is provided with.By reference Figure 11, will further describe the operation of these long-range STA below.
955, this new STA monitors the long token from long-range STA, so that upgrade the connective tabulation of its transmission.In the current cycle, as described below, all waking state and long-range STA successfully of being in to decoding from the message of this new STA, with the connective tabulation of reception after sending their and upgrading, so that indication has listened to the long token that has amended RR tabulation and added one RR Seq.If this new STA also can listen to long-range STA, so, it can upgrade its connective tabulation of transmission for that distant station.In other is handled and in At All Other Times, each STA can receive the connective connective tabulation of transmission (having reason to send the random time of long token at the station) of tabulating and upgrading it by receive one from distant station.STA also can be periodically comprehensively monitor beacons and their RRID are separately joined in the connective tabulation of their receptions separately (below be described in further detail the energy conservation characteristic that requires the STA dormancy) at interval so that detect new STA.When corresponding bit all is set up in connective tabulation of two STA reception separately and the connective tabulation of transmission, can carry out two-way communication between them.
Figure 11 has described the RR tabulation that is used to propagate renewal and in response to initiate RR
STA and upgrade the embodiment of an example of the method 1100 that receives and send connective tabulation.Each step of Xiang Shuing responds the message of tabulating from the new RR of the indication of the STA that monitors corresponding to STA in this drawing, and response is from the message of this new STA.These steps are considered the propagation of the variation in the RR tabulation, and as mentioned above, help STA to upgrade their connectedness tabulation.
1110, STA receive contain new RR sequence (RR Seq) number, there is the long token that changes in indication.In this example, this new STA is added in the tabulation.Other the time, following further detailed description the in detail changes in (in alternative) when STA leaves (perhaps being extruded) or other parameter that need propagate, can upgrade this RR Seq.1120, this STA after any TXOP communication, sends a long sequence that comprises new RR tabulation, and this makes new information propagate the STA that can listen to this long token to all.As long as receive the token that contains the RR Seq after the renewal, just send this long token.Note, in an alternative, can define other token form, and notion described herein can be applicable to the form that these are alternative at an easy rate.For example, can define single token, it comprises all RR information and can send (although may increase the control expense, this can simplify some processes) when this token is transmitted.
At decision block 1130,, then enter 1140 if STA receives long token from initiate STA in next RRP.If no, this processing procedure can stop so.In this case, do like this except that optional, this STA will stop its TXOP with a short token, if any.So, as above describing in detail at Fig. 9, this new STA will can not receive and indicate the connectedness tabulation that successfully receives, and as a result of, this new STA will can not upgrade its connective tabulation of transmission.Notice that if for the reception that will finish, condition changes (if perhaps this STA is in sleep state in certain energy saver mode), long token subsequently can be used for to connectedness tabulation and upgrade, and that is as above described in detail is such.
1140, after successfully decoding from this new STA token, this reception STA is to being provided with corresponding field of this new STA or bit in the connective tabulation of its reception.1150, the STA of this reception checks the connective tabulation of the reception of the STA that this is new, and if field or the bit relevant with this reception STA was set up in that tabulation, then this reception STA knows that this new SAT has also heard its transmission.If this field is not set up, this reception STA can hear the STA that this is new so, but this new STA can not receive.So, correctly upgraded the transmission connectedness of this reception STA.
1160, this STA transmission has the long token of the connective tabulation of reception after the renewal.For each station that receives this tabulation, comprise the STA that this is new, can upgrade sending connective tabulation according to being provided with correctly.In the above by the connective setting of tabulating of the transmission that new STA has been described in detail in detail with reference to figure 9.The STA that each its connective tabulation changes need send this long token in beacon interval subsequently.As long as RRBSS is in active state, method 1100 is iteration infinitely.
Figure 12 has described and has been used for revising the embodiment of RR STA in an example of the method 1200 of the insertion point of RR tabulation.1210, because in its reception and the renewal in the connective tabulation of transmission, and because a plurality of STA arrives the RR scheduling or leaves from this RR scheduling, sometimes, a STA can determine that it preferably a different position that is inserted into again in this RR scheduling itself.In this example, a following reposition m who has determined in the RR tabulation
01220, in the RR tabulation, select a possible position m.1230, calculate X
mEqual to receive the number of 1 before the m of position in the connective tabulation.1240, calculate Y
mEqual to send the number of 1 after the m of position in the connective tabulation.1250, if other the possible position that will calculate is in addition upgraded and forwarded 1230 at 1260 couples of m.If no,, select m then 1270
0=max
m[min (X
m, Y
m)].1280, the diverse location that oneself is inserted into this RR scheduling, this STA sends a long token PPDU for again, and it contains and adds one RR Seq, and the RRID of this STA is inserted into this diverse location of RR tabulation.
Figure 13 has described STA removes the method 1300 of oneself from the RR tabulation the embodiment of example.Determine oneself to stop participating in the RR scheduling at 1310, one stations.1320, this STA sends long token PPDU, and it contains and adds one RR Seq, and the position of this STA in the RR tabulation is set to 0000 (in alternative, or other value of being scheduled to).As above describe in detail, a plurality of STA that receive the long token that contains the sequence identifier after the renewal propagate this variation (comprising that one or more STA is set to 0000 to their RR list placement) in the RR sequence.1330, will get rid of this STA outside this RR scheduling in next beacon interval.In the embodiment of this example, if a STA is at predetermined number, M
RRDo not send non-token PPDU within the individual continuous beacon interval, then this STA stops participating in this RR scheduling.M
RRNominal value be 8.This characteristic is considered when not making full use of the token transmission, removes the expense (also having the RR time slot, if supply limited) that token transmits.This technology allows each station to rectify oneself.Subsequently, a STA can use above-mentioned technology oneself joining again in the RR scheduling.
Figure 14 has described the embodiment of an example of the method 1400 that is used for removing automatically the STA that underuses.Using this optional method can replacement method 1300, and perhaps it can be used in combination with method 1300.If the STA (entry j) in the RR scheduling is at N
RRFail the TXOP that utilizes it to be scheduled in the individual continuous beacon interval, then it loses its position in this RR scheduling automatically.Can replace (for example, when STA does not successfully repeat to transmit token, also can use this technology) in the alternative by alternative condition.1410, entry is the transmission of the STA supervision STAj of j-1 in this RR scheduling.1420, if having satisfied, STAj utilizes requirement, so, 1440, STAj-1 transmits token to STAj, as the situation in the typical R R communication.Utilize requirement if STAj fails to satisfy, STAj-1 sends a long token PPDU, and this token is passed to the STA that entry is j+1, and wherein this token comprises the RR Seq that adds after, and is set to 0000 with the corresponding RR tabulation of STAj entry.This has removed STAj in trailing wheel commentaries on classics effectively.Can apply other condition (that is, observing other Bandwidth Management or fair principle or any other system parameters) for rest parts among the RRBSS.In this scheduling, except when other STA outside the preceding STA can alternatively be entrusted the task of supervision.In any of these cases, the process described in Figure 14 goes for providing the rectification of STA and the removing of STA in the RR tabulation.In addition, as mentioned above, when when changing in the RR scheduling during the beacon interval, all STA subsequently send long token in this RR scheduling.Operation for stalwartness, when in the RR scheduling, changing (, new STA joins this RR scheduling, STA and leaves this RR scheduling, removes STA or STA again oneself being inserted in this RR scheduling from this RR scheduling), send long token at all STA of next beacon interval.N
RRNominal value be 8.
Figure 15 has described the embodiment of an example of the method 1500 that is used for explicit token transmission.As mentioned above, in typical R R communication, the STA each STA tabulates token passing to this RR in.1510, index i=1 is set.1520, the position is that the STA of j sends token to next STA (j+i, perhaps the j+1 in the iteration) for the first time in the RR tabulation.1530, when STAj+i within RRIFS (perhaps, in the embodiment of this example at the RRIFS place) when sending, token transmission success and processing procedure can stop.If (in this example, RRIFS) STAj+i does not send, and STAj will attempt to seek another STA and receive this token so within the duration of expectation.1540, if remain a plurality of STA in tabulation, so 1550, i adds one.1560, STAj regains the control of medium after the delay of a weak point.RR STA as mentioned above, in one embodiment, this delay is set, so that can keep the control to public medium.Turn back to 1520, STAj attempts giving next STAj+i token passing here.Repeat this processing procedure up to successfully carrying out the token transmission or in tabulation, no longer including STA (1540).If token transmission failure, and tabulation used up, then 1570, STAj sends one " next STA " and is set to 0000 token, so that indicate the end of this RRP.This has indicated the early stopping of crossing of this RRP.1580, STAj serves as last STA in this tabulation and send beacon and long token in next RRP.
If a STA can not decode to the token PPDU transmission before its RR that is scheduled transmission, the then transmission among the RRP of this STA postponement during this beacon interval.This has guaranteed healthy and strong operation and has avoided conflict.Owing to use the method 1500 just described that control is passed in this scheduling subsequently STA, so do not have waste bandwidth.The STA that postpones can add the CP during that beacon interval.
STA attempts to obtain to suppose that then it has lost its position in this RR scheduling, and add DCF after token all fails during its RR TXOP several times.Use above-mentioned technology, by the transmission at CP, it can be competed once more and add this RR scheduling.Its entry before in this RR scheduling will be at N
RRIndividual or several beacon interval (depending on the implementation that is adopted) still less are back expired.
As mentioned above, the method that can select various RR scheduling to shuffle.In the embodiment of this example, change this RR scheduling at each TBTT wheel.What be described in further detail below is to be used for requiring the method for shuffling at random.The wheel of RR scheduling changes (alternative approach of perhaps shuffling) a lot of advantages: each RR STA periodically sends beacon, so make the propagation of information spread all over this RRBSS.Change the order of transmission, made it possible to achieve fairness and better energy conservation.
The shuffling of RR scheduling might cause that STA can not obtain control when having stipulated this shuffling.The example of the solution of two replacements has below been described.In order to describe, supposing has following scheduling: BDFGH at beacon interval k, wherein each letter indication RRID in the RR tabulation.
In the embodiment of first replacement, STA B is after first transmission of beacon interval k, and in whole beacon interval, it keeps waking state.As mentioned above, it utilizes this cycle that its reception and the connective tabulation of transmission are upgraded.STA B explicitly is passing to last RRID (STA H) for the primary importance in the RR scheduling of beacon interval k+1.When this TBTT expiration, wait for that STAH need send the beacon of beacon interval k+1 after the RRIFS gap.If because certain reason, STA H does not send after this RRIFS gap, then control is got back to STAB, and this STAB sends the beacon of beacon interval k+1 after the delay of a weak point, and finishes its TXOP with a long token.(in this case, postponement is dispatched RR and is taken turns commentaries on classics.) based on the observation of in beacon interval k transmission being carried out, the RR that STA B can revise beacon interval k+1 dispatches and specifies last different RRID.For example, STA B can remove STA H from this RR scheduling, and perhaps STA B can (between F and G, be the diverse location that oneself is inserted into again in this RR scheduling the transmission of following scheduling: BGHDF) for example, subsequently.If STA H and STA B fail to send beacon, then the embodiment of this first replacement may be healthy and strong inadequately.Be anti-failure, this RRBSS can restart.
Even STAH and G fail to send token, can realize the embodiment of second replacement by relying on robustness (for example, carrying out channel idle assessment (CCA)) that different STA (for example, STA F) come measured channel.The method 1500 that is used for transmitting reliably token is applicable to delivery beacon control reliably, and this will be readily apparent to persons skilled in the art.For example, STA B is after first transmission of beacon interval k, and it keeps waking state in whole beacon interval.As mentioned above, it uses this cycle that its reception and the connective tabulation of transmission are upgraded.STA B needs explicitly passing to last RRID (STA H) for the primary importance in the RR scheduling of beacon interval k+1.When this TBTT expiration, wait for that STA H need send the beacon of beacon interval k+1 after the RRIFS gap.If because certain reason, after this RRIFS gap, STA H does not send, then after the delay of a weak point, control is delivered to STA G, and it sends following scheduling: GHBDF.If STA G does not send beacon, then control passes to STA F, by that analogy, and up to the tabulation of having used up possible STA or successfully sent beacon.
Can application bandwidth, expense and/or fairness management.In the embodiment of this example, by the RR Bandwidth Management field (example describes in detail below) in the token, managing bandwidth and overhead management in RRBSS.The STA that sends at RRP keeps clear-headed and observation CP at last.During next beacon interval, based on the observation to RRP and CP, it upgrades the parameter of Bandwidth Management field.
Figure 16 has described the embodiment of an example of the method 1600 that is used for Bandwidth Management.Transmit expense in order to shakeout token, can change TBTT.When each beacon interval began, the STA that sends beacon can change this TBTT.The value of this TBTT is included in the token.1610, the TBTT duration is set to initial value.1620, if there is STA to add, and STA outnumbered predefined threshold value, then increase TBTT 1630.1640, if there is STA to leave, and the number of STA is lower than predefined threshold value (this value can be different from add threshold value), then reduces TBTT 1650.Alternatively, can use additional condition.1660,,, can adjust parameter for alternative TBTT length then 1670 if detect too much conflict.Can use new argument to repeat this processing procedure then.When conflict reduces, also can readjust the parameter (not shown).In the embodiment of this example, use following rule: the initial value of TBTT is set to 512 (1024) individual symbols.Make that as the STA adding number of STA was increased to above 9 o'clock in the RR scheduling, TBTT is set to 1024 (1536) individual symbols.Leave as STA and to make that the number of STA is reduced in RR scheduling and be lower than at 7 o'clock that TBTT is set to 512 (1024) individual symbols.If a STA determines to exist too much conflict (may use the RTS/CTS protection in RRBSS), it can be set to the higher value shown in the round parentheses in the above rule by TBTT.It will be appreciated by those skilled in the art that the parameter (that is, the number of STA, TBTT duration or the like in the RR tabulation) that is based upon RRBSS and selects, can replace with various other values.In alternative, method 1600 can comprise meticulousr adjustment, and based on the environment of channel, it can be to change that threshold value and TBTT adjust, this (not shown) that will be readily apparent to persons skilled in the art.
Figure 17 has described the embodiment of an example of the method 1700 that is used to manage fairness.In the embodiment of this example, in RRBSS, carry out the fairness management by the RRP fraction fields (example is at following detailed description) in the RR Bandwidth Management field in the token.1710, the RRP mark is set to initial value.1720, STA monitors this RRP duration.1730,, enter 1760 then if this RRP duration less than this RRP mark, then 1740, reduces this RRP mark.1730,,, increase this RRP mark then 1750 if this RRP duration is not less than this RRP mark.1760, in next RRP, send this new RRP mark.Can this processing procedure of iteration in RRBSS operating period.The various modifications of method 1700 will be readily apparent to persons skilled in the art.For example, can get rid of the too early end of this RRP by adjusting the RRP mark.Can introduce additional change granularity (that is,, increase on a small quantity or more or reduce) based on the different amplitude between RRP duration and the RRP mark.Identical with the RRP mark or within threshold value separately the time when the RRP duration, can not do any change.
In the embodiment of this example, for current RRP is provided with the regular as follows of RRP mark: the initial value of RRP mark is set to 12/32.Last STA in this RRP observes the end of RRP and whole CP, to determine the RRP mark of next beacon interval.If RRP is early than the currency of RRP mark and finish, then the RRP mark reduces 1/32.If RRP finishes or finishes after it at the currency place of RRP mark, then the RRP mark increases by 1/32.If observe one or transmission still less during CP, then the RRP mark increases by 1/8.If RRP finishes too early, then the RRP mark does not change.
Within each RRP, can define the rule that is used between the TXOP of a plurality of STA, distributing RRP.Figure 18 has described the embodiment of an example of the method 1800 of the TXOP duration that is used to adjust STA.In this example, between a plurality of STA, distribute available additional RRP pro rata.Can alternatively use the allocative decision of various replacements.1810, " maximal increment " value of current RRP is defined as (" current RRP mark "-" last RRP mark ")/" last RRP mark ".1820, " the maximum TXOP " that allow for any STA in each RRP interval is defined as Max[" minimum TXOP ", (1+ " maximal increment ") * (" last RR TXOP ")].In the embodiment of this example, " minimum TXOP " is set to 16 OFDM symbols.Can adopt the alternative with alternative parameter, and can introduce other adjustment, this each those of ordinary skill to this area is conspicuous.Notice that " maximal increment " can be positive or negative.Should " last RR TXOP " be the length of the RR TXOP that in previous RRP, utilized of STA.Finish too early for fear of RRP before STA acquisition RR TXOP, should not change by " last RR TXOP " variable.
In each RRP, RR STA it RR TXOP and the RR TXOP of all and its corresponding STA (that is, having set up those STA of information flow) for it finish afterwards can dormancy.Note, in the embodiment of this example, each RR STA its as beacon interval in during last STA, keep waking state in the whole beacon interval that is comprising CP.Other example had been described, wherein STA may also need to keep waking state in case during beacon interval monitor transmissions.Wish and STA that corresponding STA foundation is communicated by letter in that beacon interval RRP or CP in can do like this or in office what it they determine that the time that this corresponding STA is in waking state can do like this.The STA that does not participate in RRBSS can read the RRP fraction fields in any token, and dormancy finishes (although if this RRP finishes too early, this STA can not utilize additional CP) up to this RRP mark during this period.
Figure 19 has described the embodiment of an example that is used for method for saving energy 1900.1910, if because any reason, STA need keep waking state, then stops this processing procedure.1920,, then be turned back to 1920 if the RR TXOP of this STA does not still finish.When this RR TXOP finishes, enter 1930.1930, if do not finish from the one or more information flows of other STA among this RRP, then this STA is recycled to 1930, and keeps waking state to finish up to them.In case satisfy these conditions, then this STA can dormancy in the remaining time of this TBTT.
In an alternative, can use additional characteristic.Every S beacon period, each STA does not at least once enter energy saver mode.RRID is that the STA of A calculates this value (A mould S).A newer field that calls beacon sequence number (BSN) is joined in this beacon.Each TBTT, this BSN adds one.At each TBTT, this STA calculates (BSN mould S), and if this value equal (A mould S), then before next TBTT, this STA does not enter energy saver mode.This makes possible corresponding STA to communicate with STA A during CP.
Figure 20 is the embodiment of an example of short token 2000.Short token PPDU 2000 comprises Physical layer convergence protocol (PLCP) lead code (preamble) 2010 (when existing) of one 16 microsecond, 1 " signal 1 " field 2020 that the OFDM symbol is long, and 2 " signal 2 " fields 2040 that the OFDM symbol is long." signal " field of " signal " field back compatible tradition 802.11 of expansion.Untapped value is carried out and is provided with so that define new PPDU type in " speed " field in tradition " signal " field.For back compatible tradition STA, " speed " field in " signal " field of PLCP header is modified to " speed/type " field.The untapped value of " speed " is designated as " PPDU type "." PPDU type " also indicates the existence and the length of " signal " field extension that is designated as " signal 2 ".Tradition STA is these values of definition " speed/type " not.Therefore, traditional STA abandons this PPDU is decoded after successfully " signal 1 " field being decoded and finding in " speed " field undefined value is arranged.Submit on October 13rd, 2004, exercise question is the total unsettled U. S. application sequence number 10/964 of " HIGH SPEED MEDIA ACCESS CONTROL WITHLEGACY SYSTEM INTEROPERABILITY ", an example system has been described in detail in detail in 330, it has illustrated the various embodiment with technology that describes in detail and the PPDU compatibility described here in Figure 20-21, this application is transferred to the application's assignee, and by reference it is incorporated into herein hereby.
The round parentheses of the field width of the embodiment of this example after by the field of each definition provide." signal 1 " 2020 comprises: be set to " speed/type " field 2022 (4 bit), " reservation " bit 2024 of 1000, " RR Seq " field 2026 (4 bit), " RR Bandwidth Management " field 2028 (8 bit), " parity check " bit 2030 and " afterbody " 2032 (6 bit) for short token." RR Bandwidth Management " field comprises: " TBTT length " 2034 (2 bit), " RRP mark " 2036 (4 bit) and " maximal increment " 2038 (2 bit)." signal 2 " 2040 comprises: " reservation " bit 2042, " compact RR tabulation " 2044 (12 bits), " frame detects sequence (FCS) " 2046 (4 bits) and " afterbody " 2048 (6 bit).Compact RR tabulation 2044 comprises: " STA RRID " 2050 (4 bit), " next RRID " 2052 (4 bit) and " last RRID " 2054 (4 bit).
The above embodiments have described each the example that uses in these fields in detail.Variation in the RR Seq2026 record RR tabulation.RR Bandwidth Management field 2028 comprises following field: " TBTT length " field 2034 identifies the length of this TBTT.More than stipulated to change the rule of the length of TBTT, it can use following coding: a 00:512 symbol; 01:1024 symbol; 10:1536 symbol; And 11: reserve.
As above describe in detail, can use maximal increment 2038.Compare with previous beacon interval,, allow RR STA that the length of their TXOP is increased a factor (1+ maximal increment) for current beacon interval.A kind of coding of example is as follows: 00:0; 01:1/32; 10:1/8; And 11:-1/32.
For current beacon interval, compact RR tabulation 2044 comprises three RRID from the RR tabulation: the RRID 2054 of the RRID 2050 of the STA of the short token of transmission, the RRID 2052 of the next STA in the RR scheduling and last STA in the RR scheduling." signal 1 " and " signal 2 " field is calculated the FCS 2046 of 4 bits.
Figure 21 is the embodiment (wherein " speed/type " field is set to 1010) of the example of long token PPDU 2100.Most of field of long token 2100 is identical with short token 2000, and similar numbering is arranged.Field additional or that revised has below been described.
" signal 2 " 2140 comprises: " reservation " field (3 bit), " connective vector " 2144 (15 bits), " complete RR tabulation " 2146 (64 bits), " FCS " 2148 (8 bit) and " afterbody " 2150 (6 bit) that " signal 1 " and " signal 2 " field is calculated.For each STA that this STA in RR tabulation can decode to the token of its transmission, this STA in connective vector 2144 accordingly bit be set to 1.
Complete RR tabulation 2146 has replaced compact RR tabulation 2044.Complete RR tabulation 2146 comprises the RRID 2152 (4 bit) of next STA and can comprise RR tabulation 2154 (60 bits) of 15 RRID at most.
As mentioned above, those skilled in the art will be easy to these embodiment are applicable to and comprise various alternative parameter size, field and type of messages.In an example, use long token and short token so that describe various RR processes and bandwidth conservation technology.Different message can comprise different fields.Those skilled in the art will be easy to various type of messages are applicable to said process.For example, be described in further detail below an alternative.
In an alternative, RR list message and RR control messages have been defined.Similar with long token, this RR list message comprises the whole tabulation of RRID.Along with STA adds and leaves the RR scheduling, write down this variation by the global variable RR change sequence similar to RR Seq.Whenever a STA or add the RR scheduling or leave the RR scheduling, this RR change sequence adds one.This RR change sequence is included in RR list message and the RR control messages as a field.As selection, this RR change sequence field can be used as a header fields and is included among each RR TXOP.By sending a RR TXOP end frame (similar) to token defined above, the end that STA can explicitly indication RR TXOP, this end frame comprises the RRID of the next STA in the RR scheduling.
The RR control messages is a short message, and in use similar to short token, it has indicated the variation of RR tabulation during TBTT.This RR control messages comprises " RR change sequence " field and " RR bitmap " field.Each bit in this RR bitmap is corresponding with the RRID entry in the RR list message.When STA left the RR scheduling, its entry in this RR bitmap was set to 0 in the remaining time of this TBTT.This makes in RR scheduling STA subsequently rise in order of transmission.Notice that because this RR control messages is very short, it can send and do not need many expenses at each RR TXOP.In the RR scheduling, exist the STA of entry should during its TXOP that is scheduled, send a frame at least.If this STA is without any the frame of buffering, it should send a RR list message or RR control messages so that keep its position in this RR scheduling.
When changing in the RR scheduling during the TBTT, all STA subsequently can or send the RR list message or send the RR control messages in this RR scheduling.If each RR TXOP comprises the RR control messages all the time, then this is to handle automatically.For the operation of stalwartness, and when in RR scheduling, changing (, perhaps new STA adds this RR scheduling or a STA leaves this RR scheduling), all STA send the RR list message at least one time in this RR scheduling.This makes this RR list message to propagate in whole RRBSS.
When in the RR scheduling, not changing, only require that first STA in this RR scheduling sends the RR list message.If desired, other STA can be at their RR
Send the RR list message during the TXOP.All STA can send the RR control messages.Those skilled in the art will be easy to the example of these alternative message is applicable in the process of above detailed description, suitably replace long token and short token.
The embodiment of two other alternative bandwidth sharing and fairness has been described in detail in detail below.In first alternative approach, and when in the RR scheduling, having K STA (, in the RR tabulation, K entry arranged), RR TXOP volume of services (service quantum) Q is defined as Q=r*TBTT/K.Here r is the TBTT largest score at interval that can use for this RRP.As described below, the value of r falls into r
MinAnd r
MaxBetween.
In this RR scheduling, each STA can use maximum length to be no more than the TXOP of R when taking turns to oneself.Initial this STA is provided with R[0]=Q.
Last STA in the current TBTT RR scheduling at interval notices the end of this RRP.The definition of the TBTT that takies by RRP mark at interval have two kinds may.The first, s_a is the mark in the time that this TBTT is taken by RRP at interval.The second, s_b is the mark of the TBTT that expired when RRP finishes.Difference may be that traditional STA has postponed this TBTT beginning at interval.The definition that the supposition employing below is discussed is s_a, yet any one can both be determined by last STA in the RR scheduling in the TBTT interval.At next TBTT at interval, after beacon, this STA sends first.Previous TBTT value s at interval is included in the RR list message.
If for next TBTT at interval, a STA expects the RR TXOP of its each TBTT is increased to than R[i] big, then it can use following process.Then, at next TBTT at interval, allow this STA it TBTT at interval the RR TXOP among the i+1 be increased to R[i+1]＜r
i.R[i]/s
I-1Self can change the value of r.The value of r changes according to the occupancy of CP in each TBTT.The STA that sends at last during RRP also monitors CP, so it can following value to r upgrade.CP is in each idle TBTT interval therein, and the value of R increases by 0.1 up to reaching maximum r
MaxFor each busy CP, the value of r reduces by 0.02, but never is lower than r
MinThis RR list message comprises the currency of r.The nominal value of variable: r
Min=0.4 and r
Max=0.8.If use second definition s=s_b, then can use higher value.In alternative, can substitute with alternative parameter.
Consider following example, useful when describing the differentiation of these variablees.Consider this situation, promptly single information source STA A transmits QoS data (for example, video flowing) to two stay of two nights STA B and STA C.STA B and STA C only produce professional and some the application layer control business of piece ACK.We suppose STA B and each 0.05 mark that all consumption is fixed in each TBTT interval of STA C.
Table 1, the differentiation of the TBTT that variable r, s and information source can be used mark at interval
| TBTT is (i) at interval | r i | R A[i]＝R A[i-1]*r i/s i-1 | R B，R C | s i |
| 1 | 0.4(r min) | 0.13 | 0.13，0.13 | 0.13+0.05+0.05＝0.23 |
| 2 | 0.5 | 0.28＝(0.13*0.5/0.23) | 0.05，0.05 | 0.28+0.05+0.05＝0.38 |
| 3 | 0.6 | 0.44＝(0.28*0.6/0.38) | 0.05，0.05 | 0.44+0.05+0.05＝0.54 |
| 4 | 0.7 | 0.57＝(0.44*0.7/0.54) | 0.05，0.05 | 0.57+0.05+0.05＝0.67 |
| 5 | 0.8(r min) | 0.68＝(0.57*0.8/0.67) | 0.05，0.05 | 0.68+0.05+0.05＝0.78 |
| 6 | 0.8 | 0.69＝(0.68*0.8/0.78) | 0.05，0.05 | 0.69+0.05+0.05＝0.79 |
As mentioned above, table 1 shows r, R
A, R
B, R
CDifferentiation with s.We see from this example, and within 5 TBTT intervals, information source (STA A) can take almost 70% TBTT interval from 13% of first TBTT interval.So the fairness criterion of forcing by parameter r and s can cause bandwidth waste hardly.
In the method for second alternative bandwidth sharing and fairness,, K STA (that is, in the RR tabulation K entry being arranged) arranged, and RR TXOP volume of services Q is defined as Q=r*TBTT/K in the RR scheduling as first.When only the number of STA changes in this RR scheduling, just can change the value of Q.The currency of r (or Q) is included in this RR list message.
As preceding, this RR list message comprises the RR scheduling of current TBTT.Each STA in this RR scheduling or explicit or implicitly token is transferred to next STA in the tabulation.After previous STA finishes its RR TXOP, wait for a RRIFS after the cycle, this next one STA begins its RR TXOP transmission.In order to keep its entry in this RR scheduling, this STA sends during the RR TXOP that it is scheduled.When not having data in the buffering area, this STA can or send the RR list message or sends the RR control messages, to keep its RR scheduling entry.
In the method for this bandwidth sharing, at TBTT at interval during the i, entry is that the STA of j is at TBTT[i in the RR scheduling]+its guaranteed RRTXOP finished before b+ (j-1) Q.Here b is the transmission time of beacon.So previous STA does not utilize the distribution fully of their volume of services Q in this RR scheduling, then j STA can begin its transmission in advance, but finishes its transmission before its deadline that is scheduled.This has guaranteed that each STA obtains minimum amount Q at least during each TBTT.
For justice inserts untapped bandwidth, replacement is can use shuffling at random this RR scheduling at each TBTT each this RR scheduling of TBTT wheel commentaries on classics.
After last STA in this RR scheduling sent its RR TXOP end frame, remaining mac frame was given back CP.Yet, in this example, during CP, introduce three priority levels: height, standard and low priority.High priority comprises in this RR scheduling the STA that utilizes their guaranteed volume of services (Q) in this TBTT interim fully, and in this RR scheduling because they during this TBTT, can not decode and the STA that postpones transmission to nearest RR list message or RR control messages.Standard priority comprises the STA that does not add in this RR scheduling.Low priority comprises the STA that uses during the order that they are scheduled in this TBTT in this RR scheduling less than this volume of services Q.In this embodiment, the STA of high priority uses RRIFS and short keeping out of the way.The STA of standard priority uses the DCF of DIFS and standard to keep out of the way.The STA of low priority uses the low priority interFrameGap (LIFS) longer than DIFS, and uses long keeping out of the way.
When the STA in this RR scheduling successfully inserts medium during CP (using the competition mechanism of high priority or low priority), it can send maximum and reach volume of services Q.The STA of standard priority also needs their TXOP is restricted to Q, but for traditional STA, this can not guarantee.
Can with second alternative bandwidth just having described and fairness method together, use a kind of alternative energy conservation characteristic.Owing to can follow after the RRTXOP transmission at priority TXOP during the CP, therefore can revise energy-conservation.In its RR or priority TXOP, whether it also can attempt to transmit to its corresponding STA during current TBTT remainder at interval in this STA indication.If not further transmission of expectation, this STA can dormancy up to next TBTT.
As above with reference to Figure 19 described in detail, every S is in the beacon period, and each STA has at least and once is not in energy saver mode.RRID is the STA calculated value (A mould S) of A.Calculate (BSN mould S) at this STA of each TBTT, and if this number equal (A mould S), then this STA does not enter energy saver mode, up to next TBTT.This makes the STA of possible correspondence to communicate with STA A during CP.As before, this characteristic is optional.
It should be appreciated by those skilled in the art, can use various arbitrarily science and technology and technology to come expression information and signal.For example, data, instruction, order, information, signal, bit, symbol and the chip that can quote from whole above-mentioned explanation can make up arbitrarily with voltage, electric current, electromagnetic wave, magnetic field or magnetic particle, light field or light particle or they and represent.
Those skilled in the art can also understand, and can realize with electronic hardware, computer software or their combination in conjunction with various illustrative logical block, module, circuit and the algorithm steps of embodiment explanation disclosed herein.In order to clearly demonstrate the interchangeability of hardware and software, more than usually with regard to its functional description various illustrative parts, functional block, module, circuit and step.To determine still to be with hardware that software is realized so functional according to being applied to application-specific on the whole system and design constraint.At each application-specific, the professional and technical personnel can the accomplished in various ways above-mentioned functions, does not make and has departed from scope of the present invention but such realization decision-making should not be interpreted as it.
The combination in any that can adopt general processor, digital signal processor (DSP), application-specific integrated circuit (ASIC) (ASIC), field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware elements or design to be used for carrying out the above-mentioned parts of function described herein in conjunction with various illustrative logical block, module and the circuit of embodiment disclosed herein explanation realizes or carries out.General processor can be a microprocessor, but as selection, this processor can be any conventional processors, controller, microcontroller or state machine.Processor also can realize with the combination of computing equipment, for instance, and the combination of DSP and microprocessor, a plurality of microprocessor, in conjunction with one or more microprocessors or any other such configuration of DSP kernel.
Can directly embody in conjunction with the method for embodiment explanation disclosed herein or the step of algorithm with hardware, the software module of processor execution or both combinations.Software module may reside in the storage medium known in the art of RAM memory, flash memory, ROM memory, eprom memory, eeprom memory, register, hard disk, moveable magnetic disc, CD-ROM or any other form.Exemplary storage medium is connected on the processor, and like this, processor can read information from storage medium, also can be to the storage medium writing information.As selection, storage medium can be integrated in the processor.Processor and storage medium may reside among the ASIC.ASIC may reside in the user terminal.As selection, processor and storage medium can be used as discrete component and are present in the user terminal.
Above-mentioned explanation to disclosed embodiment is provided, has made any technical staff of this area can both make or use the present invention.The various modifications of these embodiment will be readily apparent to persons skilled in the art, and under the situation that does not deviate from the spirit or scope of the present invention, defined here general principle can be applied among other embodiment.Thereby the present invention will be restricted to shown embodiment here, but will meet and principle disclosed herein and the corresponding to wide region of novel feature.
Claims (41)
1, a kind of medium access control apparatus that is used for the AD-HOC communication system comprises:
Memory is used for the storage sequence table;
Receiver is used for receiving first signal that the control of shared medium is shifted in indication from first distant station that has the station identifier that is associated in described sequence table; And
Transmitter, be used for after receiving described signal, sending at described shared medium, and be used for after distributing expiration at the time of the control of described shared medium, send the secondary signal that the control of described shared medium is shifted in indication to second distant station that in described sequence table, has the station identifier that is associated
Wherein, described secondary signal comprises a token, described token be comprise compact version described sequence table short token or comprise the long token of the described sequence table of full version.
2, device according to claim 1, wherein:
Described receiver also receives one or more signals from one or more distant stations, and comprises:
Message decoder is used for the message that receives from one or more distant stations is decoded;
Processor is used for:
The station identifier that selection is associated with described device;
From the described message of described message decoder, decoding, extract described sequence table, and described sequence table is stored in the described memory;
Generate and upgrade and receive connective tabulation, and the connective list storage of described reception in described memory, wherein said receive connective tabulation indicate signal from which distant station in the described sequence table to be received and message decoded;
Generate and upgrade and send connective tabulation, and in described memory, the wherein said transmission on connective which distant station of signal in described sequence table of indicating described transmitter to send of tabulating can be received with decoded the connective list storage of described transmission;
From described message decoder, receive and upgrade the sequence identifier that is associated with described sequence table conditionally, and described sequence identifier is stored in the described memory; And
Message generator is used to generate the token message that control is shifted in indication, and transmits described message to be used for transmission to described transmitter.
3, a kind of method of shared public medium comprises:
Formation comprises one or the more sequence table of multistation identifier; And
Send token from first stop to second station according to described sequence table, so that the control of described public medium is delivered to described second station from described first stop;
Wherein, described token is selected from a plurality of token message, described a plurality of token message comprises first token message and second token message, first token message is shorter than second token message, first token message comprises the described sequence table of compact version, and second token message comprises the described sequence table of full version.
4, method according to claim 3 wherein, is selected described token from a plurality of token message, described a plurality of token message comprise first token message and second token message, and described first token message is shorter than described second token message.
5, method according to claim 4, wherein said first token message comprises:
The first stop identifier that is associated with the described first stop that shifts control; And
Second station identifier that is associated with described second station that receives control, at second station identifier described in the described sequence table after described first stop identifier.
6, method according to claim 5, wherein said first token message also comprises the 3rd station identifier that is associated with the 3rd station, described the 3rd station identifier is last station identifier in the described sequence table.
7, method according to claim 6, wherein said first token message also comprises the Bandwidth Management field.
8, method according to claim 4, wherein said second token message comprises:
The station identifier that is associated with described second station that receives control; And
Comprise the described sequence table of the station identifier that is associated with a plurality of stations of inserting described public medium in proper order.
9, method according to claim 8, wherein said second token message also comprises connective vectorial field.
10, method according to claim 3 is wherein in continuous sequence period, to take turns commentaries on classics at the described first stop that sends during the sequence period in described shared medium.
11, method according to claim 3, wherein, described formation sequence table comprises:
Obtain the access right of described public medium;
Select the first stop identifier;
Formation has the described sequence table of described first stop identifier;
Transmission comprises the token of described first stop identifier;
Monitor described public medium to seek the one or more interpolation message from one or more distant stations, each adds message and comprises second station identifier that is associated with the respective remote station; And
In described sequence table, add one or more second station identifiers.
12, method according to claim 11 also comprises:
After first postpones, insert described public medium, one or more second delays that described first retardation ratio is associated with one or more alternative public medium access styles are short;
Send beacon; And
Send the token that comprises described sequence table to next distant station, described next distant station is associated with next station identifier in the described sequence table.
13, method according to claim 3 also comprises:
Send the token comprise the connective tabulation of reception that is associated with this station from first stop, the ability that the connective tabulation indication of described reception receives from the station that is associated with station identifier the described sequence table;
Receive described token at one or more distant stations; And
In each second distant station that can decode to described token, upgrade the described transmission connectedness that sends connective tabulation with indication and described first stop, and, in the connective tabulation of the reception of described first stop, indicated its receiving ability to each second station.
14, method according to claim 3 also comprises:
Monitor that at first stop the signal from one or more second stations transmits; And
Upgrade the connective tabulation of reception is received each also decoded second station for its signal transmission with indication receiving ability.
15, method according to claim 3 also comprises:
When described sequence table is modified, sequence identifier is upgraded; And
Transmission comprises the token of described sequence identifier and described amended sequence table.
16, method according to claim 3 wherein when adding in described sequence table when inbound, is upgraded described sequence identifier.
17, method according to claim 3 wherein when removing the station from described sequence table, is upgraded described sequence identifier.
18, method according to claim 3, wherein the order of the station identifier in the described sequence table changes, rather than during the rearrangement of predefined periodic sequence table, described sequence identifier is upgraded.
19, method according to claim 18, the rearrangement of wherein predefined periodic sequence table comprises: the station identifier in the described tabulation is moved a position towards the end of described tabulation, and last station identifier is moved to first position in the described tabulation.
20, method according to claim 18, wherein predefined periodic sequence table rearrangement comprises: the order to the station identifier in the described sequence table shuffles at random.
21, method according to claim 15 also comprises:
Receive a series of one or more token at the 3rd station, each token comprises a sequence identifier;
When an included sequence identifier of token in the described one or more tokens is updated, send the token that comprises described sequence table.
22, method according to claim 3 also comprises:
Send token from the 3rd station to the 4th station, described token comprises amended described sequence table, and this sequence table is modified the predefine value in the position that is associated with described the 3rd station with indication in described sequence table, rather than described the 3rd station identifier;
After receiving the token of described transmission, from described sequence table, remove the station identifier that is associated with described the 3rd station.
23, method according to claim 3 also comprises:
Supervision is from the transmission of one or more distant stations; And
When a station in the described one or more distant stations fails to utilize transmission opportunity within a predetermined period of time, remove the station identifier that is associated with the respective remote station.
24, method according to claim 23, wherein said removing comprises: send the token that comprises amended described sequence table, this sequence table is modified the predefine value in the position that is associated with the described distant station of failing to utilize described transmission opportunity with indication in described sequence table, rather than station identifier accordingly.
25, method according to claim 3 also comprises:
Reception comprises the token of sequence table, and described sequence table comprises the one or more station identifiers that are associated with one or more distant stations;
Supervision is from the transmission of the described one or more distant stations of indicating in the described sequence table;
Select the station identifier of described monitoring station; And
Transmission comprises the interpolation message of new sequence table, and described new sequence table comprises the station identifier of described monitoring station.
26, method according to claim 25, wherein with transmission cycle that described sequence table is associated after, send described interpolation message.
27, method according to claim 25, wherein, after the 3rd station sends the token of the end of indicating the transmission cycle relevant with described tabulation, if receiving from the transmission at described the 3rd station and to it, the station of transmission interpolation message decodes, send described interpolation message so.
28, a kind of media access control method that is used for the AD-HOC communication system comprises:
According to the tabulation that constitutes by the one or more stations that shared medium is shared successively, send token to second station from the first stop of access right with described shared medium; And
After sending described token, be transferred to described second station sharing the control that inserts,
Wherein, described token be comprise compact version described tabulation short token or comprise the long token of the described tabulation of full version.
29, method according to claim 28, wherein said token are the message that comprises the tabulation at the one or more stations that described shared medium is shared successively.
30, method according to claim 28, wherein said token are the message that comprises sequence identifier.
31, method according to claim 28, wherein said token are the message that has comprised the identifier at last station in the tabulation that is made of the one or more stations that described shared medium is shared successively.
32, method according to claim 28 wherein selects described second station as the station after first stop described in the described tabulation from described tabulation.
33, method according to claim 28 wherein after the one or more transfer of data between described first stop and one or more distant station, sends described token.
34, method according to claim 28 also comprises: described second stands in and receives after the described token, sends to one or more distant stations.
35, method according to claim 34 also comprises: send the token that indicator sequence finishes.
36, method according to claim 28 also comprises: if within the predetermined period of time after control shifts, described second station fails to send on described shared medium, then described first stop is regained the access right to described shared medium.
37, a kind of AD-HOC network that is made of a plurality of stations comprises:
A plurality of stations, the access right of its shared public medium; And
The token transfer device is used for according to the tabulation that comprises with the corresponding station identifier in one or more stations at described a plurality of stations, to serving in proper order from the information flow at the described one or more stations in described a plurality of stations,
Wherein, described token transfer device is used to transmit a token, wherein, described token be comprise compact version described tabulation short token or comprise the long token of the described tabulation of full version.
38, in the wireless network that comprises the one or more stations of sharing public medium, a kind of method comprises:
Insert described medium in a series of timeslices, described timeslice is by first signal description;
After first delay after the transmission of described first signal, on described shared medium, send secondary signal from first stop, described first retardation ratio postpones short by one or more distant stations employed one or more second, described secondary signal comprises the token message that is used for the control of described shared medium is transferred to second station
Wherein, described token message be comprise compact version sequence table short token message or comprise the long token message of the sequence table of full version, described sequence table comprises and the relevant station identifier in a plurality of stations of sequentially visiting described public medium.
39, according to the described method of claim 38, described secondary signal also comprises: one or more transmission before the token message transmission between described first stop and one or more the 3rd distant station.
40, a kind of medium access control apparatus that is used for the AD-HOC communication system comprises:
Be used to form the device of the sequence table that comprises one or more station identifiers; And
Be used for sending token from first stop to second station according to described sequence table, so that the control of public medium is delivered to the device at described second station from described first stop,
Wherein, described token be comprise compact version described sequence table short token or comprise the long token of the described sequence table of full version.
41, a kind of medium access control apparatus that is used for the AD-HOC communication system comprises:
Be used for according to the tabulation that constitutes by the one or more stations that shared medium is shared successively, from having the device that the first stop of the access right of described shared medium is sent token to second station; And
Be used for after sending described token, the control of sharing access be transferred to the device at described second station,
Wherein, described token be comprise compact version described tabulation short token or comprise the long token of the described tabulation of full version.
Applications Claiming Priority (6)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US55696504P | 2004-03-26 | 2004-03-26 | |
| US60/556,965 | 2004-03-26 | ||
| US60/576,545 | 2004-06-02 | ||
| US60/586,841 | 2004-07-08 | ||
| US60/600,960 | 2004-08-11 | ||
| US11/088,382 | 2005-03-23 |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010002064A Division CN101741748A (en) | 2004-03-26 | 2005-03-24 | Method and apparatus for an ad-hoc wireless communications system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1957570A CN1957570A (en) | 2007-05-02 |
| CN100591037C true CN100591037C (en) | 2010-02-17 |
Family
ID=38063780
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200580016506A Active CN100591037C (en) | 2004-03-26 | 2005-03-24 | Method and apparatus for an AD-HOC wireless communications system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100591037C (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9307567B2 (en) * | 2013-10-28 | 2016-04-05 | Qualcomm Incorporated | Methods for detecting rejoining nodes in an IBSS |
-
2005
- 2005-03-24 CN CN200580016506A patent/CN100591037C/en active Active
Non-Patent Citations (2)
| Title |
|---|
| A Wireless Token Ring Protocol for Ad-Hoc Networks. Duke Lee,etc.Aerospace Conference Proceedings,2002,IEEE,Vol.3 . 2002 |
| A Wireless Token Ring Protocol for Ad-Hoc Networks. Duke Lee,etc.Aerospace Conference Proceedings,2002,IEEE,Vol.3. 2002 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1957570A (en) | 2007-05-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101741748A (en) | Method and apparatus for an ad-hoc wireless communications system | |
| Bellalta et al. | AP-initiated multi-user transmissions in IEEE 802.11 ax WLANs | |
| CN108605367B (en) | Apparatus and method for prioritizing random access in a multi-user wireless communication system | |
| TWI375480B (en) | Method and system for controlling access to a wireless communication medium | |
| CN102571801B (en) | For the method for Peer Data Communication | |
| CN107211373A (en) | Trigger-type target recovery time is operated | |
| Ha et al. | HE-MAC: Harvest-then-transmit based modified EDCF MAC protocol for wireless powered sensor networks | |
| CN109156024A (en) | It is dispatched using the transmission of mixing signaling technology | |
| CN102036389B (en) | Multichannel diversity-based cognitive medium access control realizing method | |
| CN107113782A (en) | System and method for avoiding interference in digital communication | |
| US20230107072A1 (en) | Sharing buffer information for multi-link transmission | |
| CN101656644A (en) | Access point device, mobile terminal, wireless communication system and control method of wireless communication system | |
| CN107637141A (en) | Method and apparatus for multiple user uplink | |
| Chou et al. | QoS provisioning for wireless LANs with multi-beam access point | |
| EP4117383A1 (en) | Method for performing multi-link communication in wireless communication system | |
| US20230156606A1 (en) | Technique for performing multi-link communication in wireless communication system | |
| US20230083599A1 (en) | Technique for performing multi-link communication in wireless communication system | |
| JP2023145777A (en) | integrated circuit | |
| CN108476476A (en) | Power indicates system and method | |
| Hsieh et al. | Energy-efficient multi-polling scheme for wireless LANs | |
| CN100591037C (en) | Method and apparatus for an AD-HOC wireless communications system | |
| CN100508482C (en) | Medium access control method of radio local network and power supply management | |
| Stine et al. | Tactical communications using the IEEE 802.11 MAC protocol | |
| Tuan et al. | Improving QoS mechanisms for IEEE 802.11 ax with overlapping basic service sets | |
| Ibrahim Masri et al. | Review Paper on 802.11 ax Scheduling and Resource Allocation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 1102729 Country of ref document: HK |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: GR Ref document number: 1102729 Country of ref document: HK |