CN105704835A - Method for media access in competition-based network and equipment thereof - Google Patents
Method for media access in competition-based network and equipment thereof Download PDFInfo
- Publication number
- CN105704835A CN105704835A CN201610269479.8A CN201610269479A CN105704835A CN 105704835 A CN105704835 A CN 105704835A CN 201610269479 A CN201610269479 A CN 201610269479A CN 105704835 A CN105704835 A CN 105704835A
- Authority
- CN
- China
- Prior art keywords
- platform
- network
- competition
- slot count
- slot
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 139
- 238000004891 communication Methods 0.000 claims abstract description 35
- 230000005540 biological transmission Effects 0.000 claims abstract description 25
- 125000004122 cyclic group Chemical group 0.000 claims description 11
- 238000012790 confirmation Methods 0.000 claims description 3
- 230000008569 process Effects 0.000 description 24
- 230000007246 mechanism Effects 0.000 description 22
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 description 11
- 238000007726 management method Methods 0.000 description 9
- 230000008859 change Effects 0.000 description 8
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 230000008901 benefit Effects 0.000 description 3
- 230000004308 accommodation Effects 0.000 description 2
- 230000002411 adverse Effects 0.000 description 2
- 230000004087 circulation Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000002829 reductive effect Effects 0.000 description 2
- 229920006395 saturated elastomer Polymers 0.000 description 2
- 239000000243 solution Substances 0.000 description 2
- 238000005309 stochastic process Methods 0.000 description 2
- 206010019233 Headaches Diseases 0.000 description 1
- 230000009471 action Effects 0.000 description 1
- 239000002585 base Substances 0.000 description 1
- 239000003637 basic solution Substances 0.000 description 1
- 229910002056 binary alloy Inorganic materials 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000005315 distribution function Methods 0.000 description 1
- 239000012634 fragment Substances 0.000 description 1
- 231100000869 headache Toxicity 0.000 description 1
- 235000003642 hunger Nutrition 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000007639 printing Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
- 230000037351 starvation Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000003860 storage Methods 0.000 description 1
- 230000004083 survival effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000035899 viability Effects 0.000 description 1
- 230000003313 weakening effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0833—Random access procedures, e.g. with 4-step access
- H04W74/0841—Random access procedures, e.g. with 4-step access with collision treatment
- H04W74/085—Random access procedures, e.g. with 4-step access with collision treatment collision avoidance
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a method for acquiring communication media access in a competition-based network and equipment thereof. The method comprises the steps that the counting number of time slots is determined based on the number of platforms in the competition-based network, and the counting number of the time slots is adjusted; and frame transmission is started when the counting number of the time slots reaches a preset number, wherein the priority is reflected by adjusting the number of the platforms and address sequences. Furthermore, the invention also provides the method for acquiring the communication media access in the competition-based network and the equipment thereof. The method comprises the steps that the counting number of the time slots based on the number of the platforms in the competition-based network is received, and the counting number of the time slots is adjusted; and frame transmission is started when the counting number of the time slots reaches the preset number, wherein the priority is reflected by adjusting the number of the platforms and the address sequences.
Description
The application is the divisional application of the application for a patent for invention that application number is 200780053322.0 " method and apparatus based on being used for media interviews in the network of competition " submitted on June 22nd, 2007。
Technical field
The present invention relates to the media interviews (mediaaccess) in the network based on competition, particularly relate to and obtain based on the access of communication medium in the network competed based on the competition in competition network by reducing or eliminates。
Background technology
The major function of media interviews control (mediaaccesscontrol, MAC) layer is to provide fairness mechanism and controls the access to shared communication medium。But, in the wireless communication media of such as IEEE802.11WLAN, MAC layer must obtain the access to network before sending Frame。Can be completed by access mechanism two kinds different: mechanism and central authorities based on competition control access mechanism。Mechanism based on competition is referred to as distributed coordination function (distributedcoordinationfunction, DCF)。Central authorities control access mechanism and are referred to as point coordination function (pointcoordinationfunction, PCF)。
PCF pattern allows for service quality (qualityofservice, QoS) mechanism, but it is optional, and needs the extra QoS consulted alternately between mobile terminal and access point (accesspoint, AP)。The DCF pattern generally used as default mode does not provide any QoS mechanism。Therefore, in a WLAN (wirelesslocalareanetwork, WLAN), all platforms (station) including base station AP have identical probability obtain the access to media and send data by media。This kind of service is referred to as " best endeavors (besteffort) "。
The access for media of the IEEE802.11 platform has been postponed at the interval (interval) of 3 kinds of interFrameGaps (inter-framespace, IFS), and it is other to provide multiple priorities。Each interval (interval) defines the time between the beginning of the end of last symbol of previous frame and first symbol of next frame。Short interFrameGap (shortinter-framespace, SIFS) by allowing some frames can access the priority level that media provide the highest before other frame, such as, ACK frame, clear to send (clear-to-send, CTS) frame, or the fragment of a upper Frame。
Because can only send a transmission stream in any one time period, multiple wireless station can cause the conflict in downlink communication media and uplink communication media while attempt to send data。This problem is especially apparent when portfolio is big, and is likely to so that agreement is unstable。In order to send and receive data simultaneously, IEEE802.11MAC layer does not use collision detection, and is the use of conflict avoidance。In order to solve collision problem, binary exponential backoff (binaryexponentialbackoff) is used to make follow-up transmission attempt interlocking at random in time。DCF uses physics and the virtual carrier sense mechanisms (csma with conflict avoidance, carriersensemultipleaccesswithcollisionavoidance, CSMA/CA) and binary exponential backoff, thus the trial that allows to conduct interviews after monitor channel is active。
Backoff procedure (backoffprocedure) for IEEE802.11 family of standards is introduced by DCF pattern at first, is used as the basic solution of conflict avoidance。Then it was used for solving to strengthen the intramural conflict problem in distributed channel access function (enhanceddistributedchannelaccessfunction, EDCAF) by IEEE802.11e later。IEEE802.11n standard among formulating still backoff procedure as supporting that the basic skills of the distributed access between movement station uses。Now, the almost all of commercial wireless product of IEEE802.11 series uses DCF/EDCAF as the solution of media interviews, therefore, relies heavily on avoidance mechanism and avoids conflict。In this article, "/" represents the another name of same or similar assembly or structure。That is, "/" and "or" in this article equivalent in meaning。
The principle of exponential random backoff process with operation in the two standard similar。In order to introduce the background technology of the present invention, the backoff procedure in IEEE802.11 is described below。Before sending each Frame, movement station (includes AP) and uses physically or a virtually carrier sense to determine the state of wireless medium。If busy, movement station selects the random number being evenly distributed between 0 and competition window (contentionwindow, CW), its initial value as the slot count (slotcount) for keeping out of the way。If it is determined that media are at DCF interFrameGap (DCFinter-framespace, DIFS) free time (wherein often cross slot time (slottime) movement station and just slot count subtracted one) after adding the random number of slot count, then movement station sends data。If whenever busy medium being detected what keep out of the way, then suspend this process。Send trial each time unsuccessful, exponential increase competition window。Competition window starts from minima CWmin, it is possible to increase to maximum CWmax。Including slot time, DIFS, CWmin, CWmax will specify for physical layer in interior all relevant to backoff procedure parameter。
What Fig. 1 was exemplary illustrates above-mentioned stochastic backoff process。In this scenario, WLAN (WLAN) includes an access point and the movement station of three associations。In this article, access point include bridger, router, bridging router and other any by website for accessing the equipment of network。Further, access point is also as the tie point between radio net (wireless network) and cable LAN。Fig. 1 shows two-wheeled medium contentions。Access point (AP) first have sent a Frame。Media become the free time (idle) after transmission terminates。When judging that media continuous print within equal to the time of DIFS is idle, include all websites of AP and run exponential random backoff process media are at war with。Now, each platform maintains a slot count for keeping out of the way。For winning the AP of last round of competition, competition window [0, CW] randomly selects its slot count。And other platform remains in that the slot count in the last round of competition of each leisure。Slot count is used for determining that it is before transmitting data by website, it is necessary to waits and how long could judge whether media are busy。As it is shown in figure 1, in the first round competes, the random number for the slot count of AP is 7。The slot count of website 1 is 8。The slot count of website 2 is 5。The slot count of website 3 is 3。If media are idle in a slot time, then often crossing this slot time, all websites subtract 1 respective slot count all respectively。Because website 3 has minimum backoff slot counts (3), so website 3 has won competition after media idle 3 slot times, and website 3 starts the transmission of new frame in the 4th slot time。Note that other website subtracts 3 their slot count when website 3 starts to send。When website 3 completes to send, then start second and take turns competition, and website 3 randomly selects 8 as its slot count in competition window [0, CW]。In the first round, other website uses they remaining slot count for keeping out of the way。Now, the slot count of AP is 4。The slot count of website 1 is 5。The slot count of website 2 is 2。The slot count of website 3 is 8。Taking turns in competition at this, website 2 has minimum slot count, and therefore it is competed at DIFS plus having won after two slot times and send Frame。Above procedure repeats within the duration of network。
The major defect that stochastic backoff process exists is: the numerical value that randomly selects of slot count is likely to weaken the utilization rate of media, thus reducing the performance of csma (CSMA) technology。Two kinds of factors may cause the weakening of utilization rate。The first factor is, specifies that the platform with minimum back off time (slot count) wins the access to media in standard。Therefore, before upper once data send, there is the period that one section of media is idle。The efficiency of backoff procedure be adversely affected by this idle meeting existed between continuous print Frame sends。The second factor is to there is the probability of conflict between multiple platform。Although using stochastic process can significantly alleviate conflict in the selection of backoff period, but still can not ignore its adverse effect on network performance, time especially competition station number is bigger。
Another drawback is that of stochastic backoff process lacks justice between platform。Once unsuccessful transmission, competition window expand twice method can during the next one is competed/competing cycle in platform is placed in disadvantageous status, this is because platform tends to select the slot count more than other platform。The double backoff procedure of this binary system index has seriously postponed the access to media, is likely to result in bandwidth starvation in some cases。Empirical data suggests that the difference of the handling capacity between the website of consolidated network on average can reach 30%。
Many back-off scheme are suggested for solving these problems。One existing back-off scheme introduces the incremental linear decrease (multiplicativeincreaseandlineardecrease, MILD) of the property taken advantage of and suitably adjusts backoff contention window, thus improving fairness。Another existing scheme, in order to realize the fairness between platform, is distributed to, based on what estimate, the share that each platform is fair, is dynamically adjusted competition window。Another existing scheme uses a kind of mechanism that given fairness model is converted to the contention resolution scheme of correspondence。By using contention resolution scheme to obtain to be capable of matching the back off algorithm of justice (proportionalfairness)。Another existing scheme considers the probability distribution of Slot selection, and have employed exponential random walking backoff algorithm, wherein, based on predetermined probability, backoff slot counts is successively decreased。In another media access scheme, time slot is assigned to each platform, and wherein the number of time slot is at least with the quantity of platform in network as many。The program substantially uses time division multiple acess (timedivisionmultipleaccess) scheme, and namely time slot is assigned to each platform, replaces the frequency-divided scheme based on competition, such as CSMA。Although having a lot of research in back off algorithm field, but the problem of fairness and service quality not still being solved。
Therefore, it is desirable to have a kind of scheme to can solve the problem that fairness and the service quality problem of stochastic backoff process in IEEE802.11 standard。
Summary of the invention
Invention describes a kind of new back-off method, for improving the performance of legacy random backoff procedure。The method of the present invention have employed diverse ways to solve open conflict。The numerical value determined is selected for backoff slot counts。Therefore, among the slot count of distribution, do not have the numerical value repeated, and media can be conducted interviews by each platform uniquely, and do not conflict with other platform。The method of the present invention provides the service of a kind of Cyclic Service type by the following method between platform: circulating slot count between fixing interval [0, N], wherein N is the quantity of platform in network。Therefore, the method for the present invention is that network provides guaranteed fairness, additionally, analyze show the method for the present invention in wait until that heavy service traffics have high network efficiency。Between N number of platform, the service of the Cyclic Service type of circulation is equal to the platform of scheduling, thus each platform has the time one fair。The platform of the present invention can be mobile or fixing, and network can be cable network or wireless network。This invention address that any network based on competition, wherein in the network, platform uses physics or Virtual Carrier Sense mechanism to determine that whether network is busy。Should should include its mac-layer protocol based on the network of competition and be based upon any network on CSMA, for instance cable system。But, platform is likely to also be fixing, and network is any network based on competition。
One of the method for the present invention is mainly characterized by, and when saturated traffic, two different platforms the interval/time period between the continuous print Frame switch sequence initiated is that a DIFS is plus a slot time。Here interval/time period is than DCF/EDCA (EnhancedDistributedChannelAccess, strengthen distributed channel access) use the interval/time period in traditional random backoff method short, but to grow than the interval/time period of the point coordination function (PCF) of PCF/HCCA (HCFControlledChannelAccess, Hybrid Coordination Function controls channel access) mechanism use。But, invention provides for the orderly SO service order between platform, the feature that this random backoff method being also traditional does not possess。
Network conflict for being a problem having a bad headache based on the radio communication of CSMA, this is because conflict seriously reduces network performance, particularly in handling capacity and network efficiency aspect。But, the definitiveness of the present invention is kept out of the way (communication medium access) method and is eliminated (or drastically reduce the area) conflict。Each platform can control wireless medium uniquely when its slot count arrives 0。In this respect, the definitiveness back-off method of the present invention is better than traditional random backoff method。
The present invention describes a kind of method and apparatus for obtaining communication medium access in the network based on competition, including: determine slot count based on this based on the quantity of platform in the network of competition, adjust this slot count, the start frame transmission when this slot count arrives a predetermined numerical value, wherein, priority is reflected in the quantity and the address queue that adjust platform。Further, invention further describes a kind of method and apparatus for obtaining communication medium access in the network based on competition, including: receive based on this slot count based on the quantity of the platform in the network of competition, adjust this slot count；The start frame transmission when this slot count arrives a predetermined numerical value, wherein, priority is reflected in the quantity and the address queue that adjust platform。
Accompanying drawing explanation
In conjunction with relevant drawings with described below can understand the present invention more accurately。Below accompanying drawing being briefly described, wherein, label similar in accompanying drawing represents similar element。
Fig. 1 illustrates and applies the result that the traditional stochastic backoff process adopted by DCF and EDCAF generates。
Fig. 2 illustrates the result that the definitiveness avoidance mechanism of the application present invention generates。
Fig. 3 illustrates an embodiment of the management frame format according to principles of the invention。
The flow chart of Fig. 4 a illustrates the operation of the definitiveness back-off method of the present invention of access point side。
The flow chart of Fig. 4 b illustrates the operation of the definitiveness back-off method of the present invention of platform side。
Schematic diagram/the block of Fig. 5 a illustrates the operation obtaining the access to communication medium according to principles of the invention AP in the network based on competition。
Schematic diagram/the block of Fig. 5 b illustrates the operation obtaining the access to communication medium according to principles of the invention platform in the network based on competition。
Detailed description of the invention
Existing random backoff mechanism and follow-up deformation thereof all rely on stochastic process each wheel in competition when selection initial backoff slot count (hereinafter referred to as initial count)。Due to each platform, to select respective initial count, two or more platforms to have the probability of identical slot count independently just very low simultaneously。The distribution function of quantity, the competition window (CW) of use and initial count that the possible foundation competition of actual numerical value is stood。In most cases, CW is significantly larger than the quantity at competition station。Therefore, sending for each and attempt, the probability of potential conflict is very low。Random backoff mechanism is based on the low probability of conflict。
Present invention uses a kind of diverse method problem to solve network conflict。It was noted that multiple platforms use identical slot count be the main cause led to a conflict, therefore, the method for the present invention by prediction in the way of or deterministic mode select initial count。The method of the present invention uses the unique information of each platform to obtain their initial count, and the present invention ensures that each platform has unique slot count in a network in any one slot time。Therefore can ensure that to access each time and attempt that all there are unique media interviews。Owing to the method for the present invention selects initial count in a deterministic manner, so it is also just named as definitiveness keeps out of the way (deterministicbackoff)。
In the definitiveness back-off method of the present invention, idling the DIFS time whenever listening to media, each platform just reduces its slot count。Such as, when time slot count down to and reaches 0 time, platform starts to send in the wireless network data。These operations are similar with the operation in traditional random backoff mechanism。When due to complete Frame switch or send failed movement station need the initial count selecting to keep out of the way time, both also exist difference。The network globally unique information of definitiveness back-off method of the present invention, such as the quantity of platform, selects initial count, thus avoiding the slot count of the platform with other to overlap。Cyclic Service (roundrobinservice) method using the present invention replace that conventional random backoff uses when conflicting or when failure the method for competition window twice。In the Cyclic Service method of the present invention, slot count circulates between fixed interval [0, N], and wherein N is equal to the quantity (including AP) of platform in network。The Cyclic Service of the present invention is all used at whole viability。Once slot count arrives 0, platform then obtains chance start frame turnaround sequence。Then, slot count is again from N。The initial value of slot count is set when platform first time attempts accessing media, and along with network change accommodation slot count。In addition, consider to also exist between multiple platform that slot time is asynchronous in time and clear channel assessment (clearchannelassessment, CCA) probability of mistake, invention applies slot count calibration procedure (slotcountcalibrationprocedure)。
Fig. 2 illustrates the definitiveness avoidance mechanism of the present invention。In this example, WLAN includes an AP and three movement stations。As it can be seen, each platform maintains a slot count from 0 to 4 circulations, and, when time slot count down to and reaches 0 time, start the transmission of Frame, then slot count is set to 4 again。For each take turns keep out of the way, always have a platform can be serviced after DIFS and a slot time。Therefore, as token-ring network, it is thus achieved that the chance of wireless MAC is circulated in a predefined order between these platforms。In the example of Fig. 2, service order is AP → platform 1 → platform, 2 → platform, 3 → AP, and the intermediate period (intermediatetimespace) between continuous service opportunity is that DIFS adds a slot time。Relative to traditional random backoff method, it it has been the very short time。
As in figure 2 it is shown, AP is reset to 4 slot count after sending Frame, this value is equal to the maximum quantity (N) of platform in this example。When next round competition starts, include all platforms of AP listening to media free time DIFS, after so long, respective slot count is subtracted 1。Because platform 1 has minimum slot count (1), thus it crossed a slot time and slot count reach 0 after won competition, thus obtaining chance to send Frame。Other platform of period sending data at platform 1 suspends the slot count reducing them。Once platform 1 finishes to send, it is reset to 4 slot count, and starts new one and take turns and keep out of the way。This data receiver formula was continued in the duration of network, and each platform obtains chance sequentially and sends data。If there being a new platform to be associated with on network, AP increases by 1 slot count, and this slot count can pass through to manage the data field of frame or carry (piggypack) secretly to be distributed to platform and this new platform of each association current in associated response。Note that should during the SIFS after association process terminates in perform slot count distribution procedure at once, thus avoiding other platform to reduce their slot count in two processes。
For single platform, it is possible to use two parameters describe the whole process that definitiveness is kept out of the way。Namely initial slot count during platform first time addition network, is denoted as C0, and start new one and take turns, for platform, the slot count kept out of the way, it is denoted as C1。At the end of the association process slot count is set at once C0, it is accessed the starting point of media as platform。C0Will not be used by platform more thereafter。In order to avoid the overlapping slot counts between platform, it should be carefully chosen C0Numerical value。At the period of platform survival in a network, parameter C1It is used to reset the slot count of Cyclic Service。Same C is shared between all platforms of same network1Value。C should be determined in the association process of a new platform0And C1, and along with the change of network adjusts C1。
AP is different with platform role in the definitiveness backoff procedure of the present invention。The responsibility of AP is C0And C1Select suitable numerical value, and its selection is distributed to network。Wherein, each platform person of being carried out, the definitiveness backoff procedure of the present invention is performed for using the parameter selected by AP to arrange。Therefore, AP is as scheduler and coordinator in the definitiveness backoff procedure of the present invention, and then all platforms are all as sender。It is further possible to solve network conflict by consulting to adjust their slot count with platform。
In the method for the invention, C1Numerical value be set to be present in the quantity (N) of platform of the platform including new association in network and AP。
C1=N (1)
C0Numerical value be set to one currently without by network any one platform use numerical value。What the method for the present invention ensured all of slot count used in network is generally a set, and this set starts the sum up to platform from 1。In this case, at the notice message sending successful association, (such as the association with success status is corresponding, or new management frame as shown in Figure 3) before, it is (N-1) that other all platforms all maintain the quantity of platform, and respective slot count should be an integer between 1 and (N-1)。Therefore, for new addition platform, one is used for initial slot count C0Rationally to select be use the station number N updated such that it is able to avoid and currently used overlapping slot counts, and also the seriality of the allocated slot count can be kept。That is,
C0=N (2)
Wherein N is the quantity of all platforms (AP and client computer) of the client computer including newly being associated with network。Equation (1) and (2) are for arranging the initial count of the platform being newly added network。It will be apparent that parameter C0And C1Can be arranged by one numerical value of transmission, i.e. the quantity of platform in network。Message including platform quantity can be entrained in association accordingly, or is carried in the data field managing frame as shown in Figure 3。
Although C in equation (1)1The numerical value quantity that is set in network platform, but it still can be greater than in network any numerical value of platform quantity, correspondingly, it is likely to reduced some administration overheads。In this case, average backing off time is corresponding to C1About linear increase。But, in another embodiment of the present invention, it is used between platform provides the service with priority。For example, it is possible to realize a simple precedence scheme, wherein can repeatedly insert the platform with high priority in the address queue bigger than N。Such as, the priority of a platform is 3, it is meant that the address of this platform can be inserted into address queue 3 times。Therefore, this platform can be taken turns any one has 3 chances to send data in back-off period。The priority of another platform is probably 2, it is meant that the address of this platform is inserted in address queue 2 times。Therefore, this platform is taken turns any one has 2 chances to send data in back-off period。This embodiment reduces the fairness of entirety to a certain extent, but necessary or useful for being probably certain form of services/data or important services/data。
Notice in some cases, although in network, but the quantity of platform is very big be only that the sub-fraction platform among them needs to send data, therefore, according to equation (1) and (2) C0And C1Numerical value be set to the quantity of platform and be not likely to be very efficient way。Such as, a WLAN has an AP and the movement station of 30 associations。AP is probably sender in the most of the time。In this case, AP be required for each time waiting 30 continuous print time slots can access channel, relative to traditional exponential random backoff method, this method reduces the performance of AP and network。Therefore, in another embodiment, C0And C1Numerical value be adjusted to less than the numerical value of website quantity in network。This can realize by making at least one platform with less uplink service share same slot count。Whenever send opportunity arrives time (that is, slot count arrives 0), each of these websites is taken action according to any one following rule:
1) platform sends Frame with predetermined collision probability p。
2) platform adopts the mechanism similar with traditional exponential random backoff method to determine whether to utilize this chance to send data。That is, platform initializes an enumerator, and just reduces the numerical value of enumerator whenever send opportunity belongs to it time。If enumerator reaches 0, then platform determines to send data, otherwise, then abandons send opportunity。
3) at every 1/NssIndividual time slot gives the deterministic chance of platform sharing a time slot and sends for starting Frame, wherein NssIt is the quantity of the platform sharing a particular time-slot。In theory, profit does not result in conflict in this way, but can postpone the send opportunity of the website of shared time slot。
In adopting the above-mentioned embodiment of regular 1 and 2, share the probability that there is conflict between the platform of same slot count。But benefit is if appropriate use, can improve the utilization rate of channel。It was noted that this embodiment needs to change address queue。Additionally, AP requires over the platform transfer management frame to those shared slot count or information is entrained in the platform having to explicitly notifying those shared slot count in data or control frame。
In the definitiveness back-off method of the present invention, platform needs oneself registered to AP before definitiveness backoff procedure and obtain C starting0And C1Numerical value。In other words, platform can not use the definitiveness back-off method of the present invention to access media before successful association。If it practice, not associated movement station adopts inappropriate method, for instance traditional random back, it is possible to ongoing definitiveness backoff procedure can be destroyed。This is because elective slot count may overlap with the slot count of other platform, and therefore lead to a conflict。
This problem can solve by the following method above: by making not associated platform select a static time delay in the process added, such as DIFS, accesses media。It was noticed that equation (2) ensure that the platform of those associations needed to wait before obtaining the control of media at least DIFS plus a slot time cycle/interval。Owing to DIFS is shorter than the time delay that the platform of those associations uses, therefore, not associated movement station is set to postpone a DIFS, thus ensure that the data of not associated movement station send will not cause conflict in ongoing backoff procedure。
But, multiple not associated platforms access media simultaneously can produce new problem, causes the conflict between them。In order to solve this problem, each not associated platform was allowed to select a random number as its back off time in [0, JoinTimeOut] interval before attempting sending addition request。Once cross during this period of time, platform can be attempted accessing media after listening to the duration of media free time DIFS。In actual applications, to be simultaneously introduced the probability of network non-normally low for two or more platforms。Major part platform can with regard to successful access media in they first trials。
It should be noted that, here do not use an interFrameGap (pointinter-framespace, PIFS)。This is because it is reserved for AP for performing point coordination function (pointcoordinationfunction, PCF) operation/Hybrid Coordination Function controls channel access (HCFcontrolledchannelaccess, HCCA) or for other emergency。
Along with the dynamically change of wireless network needs slot count is adjusted。In the duration of wireless network, some movement stations add network in the regular hour, and other then leave network in other time。In this case, the quantity associating movement station varies over time。According to principles of the invention, the setting (reseting) of backoff slot counts is based on the global information of network, i.e. the quantity of platform。It is thus desirable to the dynamically change according to network carrys out this setting of accommodation。
Each platform should maintain the information for adjusting slot count in wireless network dynamic changing process。First, the variable N in each platformiHave and represent the numerical value of platform quantity in network。By using its numerical value and equation (1) and (2) to obtain C0/C1Numerical value。When platform adds or leaves network, associate/go association messages by trying to find out or receive the management frame as shown in Figure 3 broadcasted by AP and allow each platform update the numerical value of each independent variable。Once after updating, the N of all of platformiNumerical value all should be identical。Secondly, platform should maintain the address sequence for recording Cyclic Service order。The corresponding platform in each address。And the relative position of address indicates the service order of these platforms in sequence。The platform that its corresponding address is adjacent in the sequence should be serviced by continuous print, and the interval/time period between service is that a DIFS is plus a slot time continuously。Sequencing service mechanism is realized by arranging these slot count according to address sequence。In the embodiment including simple priority scheme described above, NiMore than the quantity of platform, and some platforms (having high priority) can occur more than once in address queue。In precedence scheme, each platform is endowed a priority (station priority scheme), or needs according to platform or want the priority of the data/business sent to give priority it is thus possible to dynamically over time change the priority (service priority scheme) of platform。In service priority scheme, address queue needs to change along with the change of service priority。
These two information (quantity of platform and the address sequence of platform) shared by each platform including AP in the life span of network。A lot of methods can realize this purpose。For example, it is possible to collected by the network activity of monitoring wireless media always He other platform。Passively listen technology simply easily although this, but be a lack of reliability。According to principles of the invention, AP directly these information to be supplied to network by this information broadcasted at management frame。When the station that is moved adds or leaves such event of network, AP after association exchange (going association exchange) short interFrameGap (SIFS) time period/time during in the extra Frame of the transmission information that comprises these needs。That is, this new data frame can be considered last Frame of association exchange (going association exchange) sequence。
Fig. 3 illustrates exemplary management frame, and wherein, frame (framebody) includes platform quantity and address sequence。In addition it should be remembered that the above-mentioned embodiment comprising simple priority scheme has the platform quantity (N more than actual platform quantityi), and include same platform repeatedly at address sequence。
Therefore, association process (removing association process) is as follows。When AP receives an association (going association) claim frame, AP responds first by disassociation frame (removing disassociation frame)。Then, SIFS after receiving ACK time period/interval, AP is to the new management frame of Web broadcast one, and this management frame includes following information: the 1) quantity of platform in network；With 2) address sequence。Movement station should update the information of they storages after receiving this management frame。
Some platforms are likely not to have this notification message of correct reception, therefore can cause that the information maintained between platform is inconsistent。In this case, AP can 1) having to explicitly notify each platform by setting up reliable unicast session；Or 2) in beacon message (beaconmessage), periodically notice this information。In addition it is also possible to apply other method that reliable information can be provided to transmit。
When movement station aloft can catch Frame, address sequence can calibrate the basis of slot count as movement station。Such as, when platform j finishes its transmission, platform i catches at least one Frame of current transmission, then platform i can use following equation and address sequence to recalculate its slot count slot (i):
Slot (i)=(seq (i) seq (j)) mod (C1)(3)
Wherein, seq (i) and seq (j) represents the relative position (i.e. serial number) of platform i and platform j address in address sequence respectively。Because AP always exists in network, so its address is 1 first and address sequence number。
By using equation (3), platform can calibrate its slot count after Frame switch each time terminates。The inherent character sharing wireless medium is easy to calibration process, this is because the total interface that aerial Frame can be shared these media listens to。Additionally, calibration process can be used in solving to be updated, by control channel access (controlledchannelaccess, CCA) mistake or discarded network allocation vector (networkallocationvector, NAV), the conflict caused。Such as, if the Frame of two movement stations conflicts in certain slot time, then two platforms can use calibration process to recalculate their slot count before their next round services, thus avoiding later conflict。
Monitor and determine media idle DIFS time period/interval after each platform reduce respective slot count。Even if being also such when platform does not have data to send。Slot count within the duration of platform ceaselessly at C1Circulate between 0。Whenever slot count arrives 0, platform or start a new Frame switch sequence or do not do anything, it is then followed by new one and takes turns slot count。This mechanism for keeping the mutual relation between these distributed slot counts in the process of the network operation。
The flow chart of Fig. 4 a and 4b illustrates the operation of the definitiveness back-off method of the present invention。One not associated platform should perform association process first by reserved DIFS interval and add network。AP informs this new platform use and the initial slot count of definitiveness back-off method in current exchange。In this, platform judges whether it wishes to become a member of the network using this back-off method。This platform is probably the platform of a legacy version that can not support the property of present invention determine that back-off method。Once platform becomes a member (add network or associated with network) of this network, platform just circulates its slot count between N is to 0, the quantity that wherein N is at least in network platform。In general, N is equal to the quantity of platform in network, but as mentioned above it is possible, for an above-described embodiment, the quantity that N is set greater than in network platform is advantageous for。Whenever slot count arrives 0, platform just obtains and starts the chance that Frame sends。Additionally, there are in the whole duration in network, the slot count of oneself SO service order information based on platform can be adjusted by platform after having waited the regular hour。
The flow chart of Fig. 4 a illustrates the operation of the definitiveness back-off method of the access point side present invention。In step 405, AP receives the request becoming network a member (adding network or and network associate) from platform。In step 410, AP check this platform whether with network associate (being a member of network)。If this addition platform is not a member of network, then at step 420, AP sends quantity and the address queue of platform in the communication access method of use, network in initial slot count, network to adding platform。AP is then etc. to be received from adding the confirmation of platform or removing association messages。Such as, when to add the legacy version platform that platform is the communication access method that cannot support the present invention, association messages is gone to be sent。If add platform with network associate, then step 450AP wait predetermined time period。Slot count has been adjusted by step 425。In one exemplary embodiment, slot count has been reduced 1。It addition, also be able to use the adjustment increased。Step 430 compares slot count and predetermined numerical value。The exemplary embodiment of Fig. 4 a compares (minimizing) slot count and 0 after adjustment。If slot count reaches predetermined numerical value, then in step 435, AP judges whether AP has Frame to send。If AP has Frame to be transmitted, then start Frame in step 440 and send。If the Frame that AP not send, then AP skips its current chance and selects a new slot count in step 445。Once Frame transmission, then in step 445, AP can select a new slot count。If slot count is not reaching to predetermined numerical value in step 430, then AP waits predetermined time period in step 450。Certainly, if AP does not receive the new request adding network, then step 405,410,415,420 and 450 all can be skipped/not perform。
The flow chart of Fig. 4 b illustrates the operation of the definitiveness back-off method of the platform side present invention。In step 460, add platform and send the request adding network to AP。Then in step 465, add platform wait, wait until communication medium access (definitiveness is kept out of the way) method from AP always, and the quantity of platform and address queue in slot count, network。In step 470, platform is added to whether supporting that communication medium access (definitiveness is kept out of the way) method of Web vector graphic is determined。If adding platform to determine support communication access method, then in step 480, preserve the quantity of platform in slot count, address queue and network。According to principles of the invention, platform performs according to the method described above thus obtaining the access to communication medium。If adding platform to determine that it does not support the communication access method of the present invention, then send to AP in step 475 and remove association messages。If it is apparent that add a member (or with network associate) that platform has been network, then can skip or not perform step 460,465,470,475 and 480。
Schematic diagram/the block of Fig. 5 a illustrates and obtains the operation of the AP of communication medium access in competition network in accordance with the principles of the present invention。Relating module 505 receives any addition request message of platform, confirms message or remove association messages。Relating module performs any operation that network (becoming a member of network) is relevant that adds to platform, and sends any message relevant to platform addition network by transport module 510。Transport module 510 is responsible for any message being associated with platform addition network of transmission and the data that AP must send after AP obtains communication medium access。Transport module is also responsible for coding, encryption and modulation。Data module 515 is responsible for preparing the AP data wanting or requiring over transport module to send。Above description is one exemplary embodiment of the present invention, and in actual applications, above-mentioned module can be merged into a module or be further subdivided into other module, for instance coding, encryption and modulation module。
Schematic diagram/the block of Fig. 5 b illustrates and obtains the operation of the platform of communication medium access in competition network in accordance with the principles of the present invention。Relating module 520 sends the request adding network and receives quantity and the address queue of platform the instruction of communication access method, slot count, network from AP。Relating module further determines that if this communication access method supported by platform, then send to AP and confirm message。If adding platform do not support communication access method, then send to AP and remove association messages, thus going to associate with network。It is to say, relating module performs any operation that network (becoming a member of network) is relevant that adds to platform, and send any message relevant to platform addition network by transport module 525。Transport module 525 is responsible for any message relevant to platform addition network of transmission and the data that platform must send after platform obtains communication medium access。Transport module is also responsible for coding, encryption and modulation。Data module 515 is responsible for preparing the data that platform wants or require over transport module to send。Above description is one exemplary embodiment of the present invention, and in actual applications, upper act module can be merged into a module or be further subdivided into other module, for instance coding, encryption and modulation module。
It should be noted that, the reception of data is not shown or described, this is because it is not affected by the method for the present invention。It is apparent that the platform that data are by AP with as network members receives and processes, but this invention address that the method and apparatus for obtaining communication medium access for start frame transmission in competition network。
The definitiveness back-off method of the present invention employs the method being different from traditional C/S MA/CA to process media interviews problem。CSMA/CA uses random backoff method to avoid conflict, but the method for the present invention reduces or conflict removal for slot count assignment with being determined by。Two kinds of solutions are incompatible。One platform using random backoff method is cannot to work in using definitiveness back-off method as the network of its media access method。
AP notifies potential new entrant the media interviews algorithm of Web vector graphic。Only support that the platform of legacy version of random backoff method is after determining the determining that property back-off method that network is currently in use, it should cancel its association request。In this case, AP only accepts the request of those platforms supporting definitiveness back-off method。
Relation object between two kinds of algorithms is similar to the relation between TDMA (timedivisionmultipleaccess, time division multiplexing) and CSMA (carriersensemultipleaccess, Carrier-Sense Multiple multiplexing)。They are all exclusive, and can only deposit among them in one network。However, it should be noted that the method for the present invention still falls within the category of CSMA, because 1) its operation is based on and is in the carrier sense mechanisms that the physical layer of low layer provides；And 2) AP controls time distribution unlike TDMA。It practice, not free distribution in the method for the present invention, each platform obtains the chance of transmission by the mode of Cyclic Service。
The Cyclic Service that definitiveness back-off method provides ensure that the platform fairness to media interviews。In each each platform for once chance of taking turns in the seeervice cycle to complete the transmission of Frame。If additionally, the duration of send opportunity each time is increased a time restriction (being designated as TxopLimit), then service intervals is ((m-1) (TxopLimit+DIFS)+DIFS)。Wherein, m is the quantity of platform in network。Therefore, by being carefully chosen TxopLimit and the suitable control to network size, network application can be provided guaranteed QoS by the present invention。
An above-mentioned alternative embodiment provides a kind of simple precedence scheme, and the program is by increasing the quantity of platform and the platform with high-priority service/data is repeatedly inserted address queue realizing。Although this scheme have impact on the overall fairness of the definitiveness back-off method of the present invention, but is also advantageous in some cases。
Network conflict for being a troubling problem based on the radio communication of CSMA, because conflict seriously reduces network performance, particularly in handling capacity and network efficiency aspect。But, the definitiveness back-off method of the present invention can eliminate (or largely reducing) conflict。When the slot count arrival 0 of platform time, it can control wireless medium uniquely。In this, the definitiveness back-off method of the present invention does well than traditional random backoff method。
The definitiveness back-off method of the present invention another advantage is that network efficiency is high when each platform has data to when obtaining the control of channel send。In this case, interval between two continuous print send opportunity be only DIFS time period/interval is plus a slot time, for nearly 70 μ s IEEE802.11b, just shorter for the time IEEE802.11a and IEEE802.11g。Therefore, the ratio of idle period and peak hours/period is low, and network efficiency is high。At so saturated network, the duty of network is similar with TDMA network。
It is understood that the present invention can with the form of hardware (such as asic chip), software, firmware, the processor of specific use or their combination in the server, realize in (such as WAP or wireless router) or mobile equipment in intermediate equipment。Preferably, the present invention realizes in a combination of hardware and software。Additionally, software is preferably implemented as the application program being stored on program storage device。This application program can involved suitable framework machine be loaded into and perform。Preferably, this machine is implemented in and includes such as at least one CPU (centralprocessingunits, CPU), random access memory (randomaccessmemory, RAM) and on the computer platform of input/output (input/output, I/O) interface etc hardware。Computer platform also includes operating system and microinstruction code。Diverse ways described in the present invention and function can be through the part (or in combination with part) of the part of the microinstruction code that operating system performs or application program。It addition, computer platform can connect other peripheral apparatus, for instance other data storage device and printing device。
It should further be appreciated that because certain methods step described in accompanying drawing and system component preferably implement in software, thus the difference of mode that can be implemented according to the present invention of the actual connection of system component (or method step) and different。Those of ordinary skill in the art will appreciate that the present invention provides and similar realization or configuration based on the instruction that the present invention provides。
Claims (12)
1. the method for obtaining communication medium access in the network based on competition, described method includes:
Slot count is determined based on the described quantity based on the platform in the network of competition；
Adjust described slot count；
Start frame transmission when described slot count arrives a predetermined value time；And
Described slot count is calibrated when the described frame end of transmission, wherein exist equal to DIFS constant time delay transmitted plus the frame of a slot time, wherein adopt Cyclic Service and reduce or eliminate described based on the competition in the network of competition, using slot (i)=(seq (i)-seq (j)) mod (C1) complete described calibration, wherein seq (i) and seq (j) represents platform i and the platform j relative position of address in address sequence。
2. the method for claim 1, wherein said based on competition network in described platform share described communication medium。
3. the method for claim 1, farther includes to receive the request adding the described network based on competition。
4. method as claimed in claim 3, farther includes to send about the described information based on the communication access method of Web vector graphic of competition, the quantity of described platform, described slot count and address queue。
5. method as claimed in claim 4, farther includes to receive confirmation。
6. method as claimed in claim 4, farther includes reception and removes association messages。
7. the method for obtaining communication medium access in the network based on competition, described method includes:
Receive the slot count based on the described quantity based on the platform in the network of competition；
Adjust described slot count；
Start frame transmission when described slot count arrives a predetermined value time；And
Described slot count is calibrated when the described frame end of transmission, wherein exist equal to DIFS constant time delay transmitted plus the frame of a slot time, wherein adopt Cyclic Service and reduce or eliminate described based on the competition in the network of competition, using slot (i)=(seq (i)-seq (j)) mod (C1) complete described calibration, wherein seq (i) and seq (j) represents platform i and the platform j relative position of address in address sequence。
8. method as claimed in claim 7, wherein, described shares described communication medium based on the described platform in the network of competition。
9. method as claimed in claim 7, farther includes to send the request adding the described network based on competition。
10. method as claimed in claim 9, farther includes to receive about the described information based on the communication access method of Web vector graphic of competition, the quantity of described platform, described slot count and address queue。
11. method as claimed in claim 10, farther include to send confirmation。
12. method as claimed in claim 10, farther include transmission and remove association messages。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610269479.8A CN105704835A (en) | 2007-06-22 | 2007-06-22 | Method for media access in competition-based network and equipment thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610269479.8A CN105704835A (en) | 2007-06-22 | 2007-06-22 | Method for media access in competition-based network and equipment thereof |
Related Parent Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200780053322A Division CN101682559A (en) | 2007-06-22 | 2007-06-22 | Method and apparatus for media access in contention-based networks |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105704835A true CN105704835A (en) | 2016-06-22 |
Family
ID=56216576
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610269479.8A Pending CN105704835A (en) | 2007-06-22 | 2007-06-22 | Method for media access in competition-based network and equipment thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105704835A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106358314A (en) * | 2016-09-28 | 2017-01-25 | 北京大学深圳研究生院 | Method and system for controlling channel competition of wireless nodes of metroregion honeycomb Internet of Things |
| CN108738101A (en) * | 2017-04-21 | 2018-11-02 | 网件公司 | Method and apparatus for generating and safeguarding accurate network map in a communication network |
| CN109845381A (en) * | 2016-10-21 | 2019-06-04 | 佳能株式会社 | In wireless network under multi-user EDCA transmission mode AC Strengthening Management |
| CN111095840A (en) * | 2017-09-15 | 2020-05-01 | 高通股份有限公司 | System and method for data transmission mode |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5784375A (en) * | 1996-06-12 | 1998-07-21 | Advanced Micro Devices, Inc. | Rotating priority arrangement in an ethernet network |
| US20030210850A1 (en) * | 2002-05-08 | 2003-11-13 | Deangelis Mario Eugene | System and method to calibrate an optical cross-connect |
| CN1553586A (en) * | 2003-12-19 | 2004-12-08 | 大唐移动通信设备有限公司 | Descending synchronous calibrating method and apparatus for TD-SCDMA system |
| CN1965547A (en) * | 2004-05-11 | 2007-05-16 | 诺基亚公司 | Frame transmission interval |
| CN1968049A (en) * | 2005-11-16 | 2007-05-23 | 大唐移动通信设备有限公司 | Synchronization method and device after terminal dormancy awaken of TD_SCDMA mobile phone |
-
2007
- 2007-06-22 CN CN201610269479.8A patent/CN105704835A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5784375A (en) * | 1996-06-12 | 1998-07-21 | Advanced Micro Devices, Inc. | Rotating priority arrangement in an ethernet network |
| US20030210850A1 (en) * | 2002-05-08 | 2003-11-13 | Deangelis Mario Eugene | System and method to calibrate an optical cross-connect |
| CN1553586A (en) * | 2003-12-19 | 2004-12-08 | 大唐移动通信设备有限公司 | Descending synchronous calibrating method and apparatus for TD-SCDMA system |
| CN1965547A (en) * | 2004-05-11 | 2007-05-16 | 诺基亚公司 | Frame transmission interval |
| CN1968049A (en) * | 2005-11-16 | 2007-05-23 | 大唐移动通信设备有限公司 | Synchronization method and device after terminal dormancy awaken of TD_SCDMA mobile phone |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106358314A (en) * | 2016-09-28 | 2017-01-25 | 北京大学深圳研究生院 | Method and system for controlling channel competition of wireless nodes of metroregion honeycomb Internet of Things |
| CN106358314B (en) * | 2016-09-28 | 2019-11-19 | 北京大学深圳研究生院 | A kind of the channel competition control method and system of metropolitan area honeycomb Internet of Things radio node |
| CN109845381A (en) * | 2016-10-21 | 2019-06-04 | 佳能株式会社 | In wireless network under multi-user EDCA transmission mode AC Strengthening Management |
| CN109845381B (en) * | 2016-10-21 | 2022-12-27 | 佳能株式会社 | Communication method, communication device and readable storage medium in communication network |
| US11595996B2 (en) | 2016-10-21 | 2023-02-28 | Canon Kabushiki Kaisha | Enhanced management of ACs in multi-user EDCA transmission mode in wireless networks |
| CN108738101A (en) * | 2017-04-21 | 2018-11-02 | 网件公司 | Method and apparatus for generating and safeguarding accurate network map in a communication network |
| CN111095840A (en) * | 2017-09-15 | 2020-05-01 | 高通股份有限公司 | System and method for data transmission mode |
| CN111095840B (en) * | 2017-09-15 | 2021-06-29 | 高通股份有限公司 | Method and apparatus for wireless communication over a shared medium |
| US11438911B2 (en) | 2017-09-15 | 2022-09-06 | Qualcomm Incorporated | System and method of modes for data transmission |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101682531B (en) | Method and apparatus for media access in contention-based networks | |
| CN101682559A (en) | Method and apparatus for media access in contention-based networks | |
| JP7005720B2 (en) | Extended management of AC in multi-user EDCA transmission mode in wireless network | |
| CN108924945B (en) | A kind of cut-in method and device | |
| KR100570830B1 (en) | method for medium access in wireless local area network system based on carrier sense multiple access with collision avoidance and apparatus thereof | |
| KR100560738B1 (en) | method for medium access control in wireless local area network system based on carrier sense multiple access with collision avoidance and station thereof | |
| EP3485692B1 (en) | Restored fairness in an 802.11 network implementing resource units | |
| CN109644501A (en) | Integrated OFDMA and EDCA channel access mechanisms | |
| JP2000253017A (en) | Radio packet control station | |
| US20220174725A1 (en) | Communication devices and methods | |
| JP5376673B2 (en) | Device for media access in contention network | |
| CN105704835A (en) | Method for media access in competition-based network and equipment thereof | |
| JP7508658B2 (en) | QoS management for multi-user EDCA transmission mode in 802.11ax networks - Patents.com | |
| CN116192305B (en) | Channel access method, communication device, chip, storage medium and program product | |
| KR100799584B1 (en) | Method of media access control in wireless LAN | |
| CN113473615A (en) | Scheduling method and device of air interface resources |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: I Si Eli Murli Nor, France Applicant after: THOMSON LICENSING Address before: BLONEY-BIYANGU CITY, FRANCE Applicant before: THOMSON LICENSING |
|
| CB02 | Change of applicant information | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20190603 Address after: Paris France Applicant after: Interactive digital CE patent holding Co. Address before: I Si Eli Murli Nor, France Applicant before: THOMSON LICENSING |
|
| TA01 | Transfer of patent application right | ||
| AD01 | Patent right deemed abandoned |
Effective date of abandoning: 20200407 |
|
| AD01 | Patent right deemed abandoned |