Apparatus and method capable of providing quality of service channel access in a wireless network
View Patent ↗Briefly, in accordance with one embodiment of the invention, an apparatus with capabilities to communicate in a wireless network, comprising a channel access scheme providing access to the wireless network, the access scheme using a modulo N backoff scheme providing a modulo N backoff; and the channel access scheme further providing traffic prioritization.
1. An apparatus, comprising:
a storage device to store data corresponding to a channel access scheme providing access to a wireless network, said access scheme using a modulo N backoff scheme providing a modulo N backoff; and
said channel access scheme further providing traffic prioritization,
wherein one slot difference in AIFS intervals correspond to N-value difference in backoff counters in said modulo N backoff scheme.
2. The apparatus of claim 1 , wherein said traffic prioritization is accomplished by using an AIFS interval defined on a per-class basis.
3. The apparatus of claim 1 , wherein said modulo N backoff is aligned with an EDCF algorithm.
4. The apparatus of claim 1 , wherein said AIFS interval replaced a DFIS interval.
5. The apparatus of claim 2 , wherein decrementing a backoff counter takes place at the beginning or end of a foreign transmission period.
6. The apparatus of claim 2 , wherein a contention window associated with said channel access scheme has a window range of <0,3> and said modulo N is modulo 4 improving the probability of strict-priority precedence of real-time traffic over non-real time packets.
7. The apparatus of claim 2 , wherein said access scheme using a modulo N backoff scheme providing a modulo N backoff with prioritization comprises:
(a) setting b=random(0, CW);
(b) waiting AIFS after medium busy;
(c) transmitting one slot burst if b<N, and if b=0 transmitting a packet; if b≠0, wait one slot, set b=b−1 and, if slot is idle, repeat until b=0; if slot is not idle, return to step (b); and
(d) waiting one slot if b≧N and if slot is idle, setting b=b−N and repeating until b<N; if slot is not idle, determine if b=0 and if so, transmit packet; if b≠0, wait one slot, set b=b−1 and, if slot idle, repeat until b=0; if slot is not idle return to step (b).
8. The apparatus of claim 2 , wherein the number of backoff slots in said access scheme using a modulo N backoff scheme is expressed as:
MBL k,N =[k/N]+ 1 +( k mod N )
where,
k=a drawn random backoff counter,
N=modulo number.
9. The apparatus of claim 2 , wherein said modulo N backoff scheme is a modulo 4 scheme and wherein said CW is quadrupled after each collision to a maximum of 4 CW increases.
10. A method, comprising:
providing a channel access scheme to a wireless network, said access scheme using a modulo N backoff scheme providing a modulo N backoff; and
prioritizing traffic seeking access to said wireless network,
wherein one slot difference in AIFS intervals correspond to N-value difference in backoff counters in said modulo N backoff scheme.
11. The method of claim 10 , wherein said traffic prioritization is accomplished by using an AIFS interval defined on a per-class basis.
12. The method of claim 10 , wherein said modulo N backoff is aligned with an EDCF algorithm.
13. The method of claim 10 , wherein said AIFS interval replaced a DFIS interval.
14. The method of claim 11 , wherein decrementing a backoff counter takes place at the beginning of a foreign transmission period.
15. The method of claim 11 , wherein a contention window associated with said channel access scheme has a window range of <0,3> and said modulo N is modulo 4 ensuring strict-priority precedence of real-time traffic over non-real time packets.
16. The method of claim 11 , wherein said access scheme using a modulo N backoff scheme providing a modulo N backoff with prioritization comprises:
(a) setting b=random(0, CW);
(b) waiting AIFS after medium busy;
(c) transmitting one slot burst if b<N, and if b=0 transmitting a packet; if b≠0, wait one slot, set b=b−1 and, if slot is idle, repeat until b=0; if slot is not idle, return to step (b); and
(d) waiting one slot if b≧N and if slot is idle, setting b=b−N and repeating until b<N; if slot is not idle, determine if b=0 and if so, transmit packet; if b≠0, wait one slot, set b=b−1 and, if slot idle, repeat until b=0; if slot is not idle return to step (b).
17. The method of claim 11 , wherein the number of backoff slots in said access scheme using a modulo N backoff scheme is expressed as:
MBL k,N =[k/N]+ 1+( k mod N )
where,
k=a drawn random backoff counter,
N=modulo number.
18. The method of claim 11 , wherein said modulo N backoff scheme is a modulo 4/4/4.
19. An article comprising a storage medium having stored thereon instructions, that, when executed by a computing platform, establishes a channel access scheme providing access to a wireless network, said access scheme using a modulo N backoff scheme providing a modulo N backoff; and
said channel access scheme further providing traffic prioritization,
wherein one slot difference in AIFS intervals correspond to N-value difference in backoff counters in said modulo N backoff scheme.
20. The article of claim 19 , wherein said traffic prioritization is accomplished by using an AIFS interval defined on a per-class basis.
21. The article of claim 19 , wherein said modulo N backoff is aligned with an EDCF algorithm.
22. The article of claim 19 , wherein said AIFS interval replaced a DFIS interval.
23. The article of claim 20 , wherein decrementing a backoff counter takes place at the beginning of a foreign transmission period.
24. The article of claim 20 , wherein a contention window associated with said channel access scheme has a window range of <0,3> and said modulo N is modulo 4 ensuring strict-priority precedence of real-time traffic over non-real time packets.
25. The article of claim 20 , wherein said access scheme using a modulo N backoff scheme providing a modulo N backoff with prioritization comprises:
(a) setting b=random(0, CW);
(b) waiting AIFS after medium busy;
(c) transmitting one slot burst if b<N, and if b=0 transmitting a packet; if b≠0, wait one slot, set b=b−1 and, if slot is idle, repeat until b=0; if slot is not idle, return to step (b); and
(d) waiting one slot if b≧N and if slot is idle, setting b=b−N and repeating until b<N; if slot is not idle, determine if b=0 and if so, transmit packet; if b≠0, wait one slot, set b=b−1 and, if slot idle, repeat until b=0; if slot is not idle return to step (b).
26. The article of claim 20 , wherein the number of backoff slots in said access scheme using a modulo N backoff scheme is expressed as:
MBL k,N =[k/N]+ 1+( k mod N )
where,
k=a drawn random backoff counter,
N=modulo number.
in a wireless communication environment, protection-capable and non-protection-capable Management Frames, said protection-capable Management Frames being protected.
27. A system, comprising:
said system capable of prioritizing traffic access to a wireless network,
a storage device to store data corresponding to a channel access scheme which provides access to said wireless network; said channel access scheme using a modulo N backoff scheme providing a modulo N backoff; and
said prioritization is accomplished by using an AIFS interval defined on a per-class basis and wherein said AIFS intervals correspond to N-value difference in backoff counters in said modulo N backoff scheme, wherein one slot difference in AIFS intervals correspond to N-value difference in backoff counters in said modulo N backoff scheme.
28. The system of claim 27 , wherein said modulo N backoff is aligned with an EDCF algorithm.
29. The system of claim 27 , wherein said AIFS interval replaced a DFIS interval.
30. The system of claim 27 , wherein decrementing a backoff counter takes place at the beginning of a foreign transmission period.
31. The system of claim 27 , wherein a contention window associated with said channel access scheme has a window range of <0,3> and said modulo N is modulo 4 ensuring strict-priority precedence of real-time traffic over non-real time packets.
32. The system of claim 27 , wherein said access scheme using a modulo N backoff scheme providing a modulo N backoff with prioritization comprises:
(a) setting b random(0, CW);
(b) waiting AIFS after medium busy;
(c) transmitting one slot burst if b<N, and if b=0 transmitting a packet; if b≠0, wait one slot, set b=b−1 and, if slot is idle, repeat until b=0; if slot is not idle, return to step (b); and
(d) waiting one slot if b≧N and if slot is idle, setting b=b−N and repeating until b<N; if slot is not idle, determine if b=0 and if so, transmit packet; if b≠0, wait one slot, set b=b−1 and, if slot idle, repeat until b=0; if slot is not idle return to step (b).
33. The system of claim 27 , wherein the number of backoff slots in said access scheme using a modulo N backoff scheme is expressed as:
MBL k,N =[k/N]+ 1+( k mod N )
where,
k=a drawn random backoff counter,
N=modulo number.
34. Computer-executable instructions stored on a computer-readable storage medium for providing a Quality of Service (QoS) service prioritization to a wireless station in a wireless network, said computer-executable instructions comprising:
providing a channel access scheme using a modulo N backoff scheme providing a modulo N backoff; and
prioritizing traffic seeking access to said wireless network by using an AIFS interval defined on a per-class basis, wherein one slot difference in said AIFS intervals correspond to N-value difference in backoff counters in said modulo N backoff scheme.
35. The computer-executable instructions stored on a computer-readable storage medium of claim 34 , wherein decrementing a backoff counter takes place at the beginning of a foreign transmission period.
36. The computer-executable instructions stored on a computer-readable storage medium of claim 34 , wherein a contention window associated with said channel access scheme has a window range of <0,3> and said modulo N is modulo 4 ensuring strict-priority precedence of real-time traffic over non-real time packets.
37. The computer-executable instructions stored on a computer-readable storage medium of claim 34 , wherein said access scheme using a modulo N backoff scheme providing a modulo N backoff with prioritization comprises:
(a) setting b=random(0, CW);
(b) waiting AIFS after medium busy;
(c) transmitting one slot burst if b<N, and if b=0 transmitting a packet; if b≠0, wait one slot, set b=b−1 and, if slot is idle, repeat until b=0; if slot is not idle, return to step (b); and
(d) waiting one slot if b>N, and, if slot is idle, setting b=b−N and repeating until b <N; if slot is not idle, determine if b=0 and if so, transmit packet; if b≠0, wait one slot, set b=b−1 and, if slot idle, repeat until b=0; if slot is not idle return to step (b).
38. The computer-executable instructions stored on a computer-readable storage medium of claim 34 , wherein the number of backoff slots in said access scheme using a modulo N backoff scheme is expressed as:
MBL k,N =[k/N]+ 1+( k mod N )
where,
k=a drawn random backoff counter,
N=modulo number.
39. The apparatus of claim 1 , wherein said wireless network is a wireless local area network (WLAN).
40. The method of claim 10 , wherein said wireless network is a wireless local area network (WLAN).
41. The article of claim 19 , wherein said wireless network is a wireless local area network (WLAN).
42. The system of claim 27 , wherein said wireless network is a wireless local area network (WLAN).
43. The computer-executable instructions stored on a computer-readable storage medium of claim 34 , wherein said wireless network is a wireless local area network (WLAN).
44. The apparatus of claim 1 , wherein said modulo N backoff scheme is augmented with a modified CW increase scheme, modulo N/GWinc_factor/CWinc_limit.