2006
DOI: 10.1109/jsac.2005.862422
|View full text |Cite
|
Sign up to set email alerts
|

Multichannel random access in OFDMA wireless networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

1
111
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 158 publications
(112 citation statements)
references
References 15 publications
1
111
0
Order By: Relevance
“…In all cases, the mean service time beyond Aloha's saturation line converges to a constant which equals the mean access delay that was derived in the saturated case, see (2) for Aloha and (4) for OFDMA-Aloha as shown by the solid horizontal lines in Fig 11. Therefore, the behavior of the two MAC protocols in the unsaturated case is exactly opposite to that of the saturated case. This confirms our earlier reasoning that the reduction in the collision rate in OFDMA-Aloha has to be significant enough to overcome the effect of the expanded time scale.…”
Section: E Numerical and Simulation Resultsmentioning
confidence: 53%
See 3 more Smart Citations
“…In all cases, the mean service time beyond Aloha's saturation line converges to a constant which equals the mean access delay that was derived in the saturated case, see (2) for Aloha and (4) for OFDMA-Aloha as shown by the solid horizontal lines in Fig 11. Therefore, the behavior of the two MAC protocols in the unsaturated case is exactly opposite to that of the saturated case. This confirms our earlier reasoning that the reduction in the collision rate in OFDMA-Aloha has to be significant enough to overcome the effect of the expanded time scale.…”
Section: E Numerical and Simulation Resultsmentioning
confidence: 53%
“…The objective here is to exploit the multi-user diversity in a distributed manner and compare it to the centralized sub-channel allocation. OFDMAAloha was proposed in [2] as a direct extension of the singlechannel Aloha, where instead of waiting for a random backoff period when a collision occurs in one sub-channel, the node tries another (randomly selected) sub-channel immediately subject to a maximum retry limit. Recently [3] extended the basic idea of [2] to CSMA/CA systems.…”
mentioning
confidence: 99%
See 2 more Smart Citations
“…In [4], a new random access algorithm was proposed and analyzed, where a fast retrial algorithm is imposed upon the MSs to choose a random OFDMA sub-channel immediately for data retransmission instead of adopting time back-off for the first few collisions. Thereafter, if the retransmission number increases beyond some predefined threshold (retransmission threshold M) the MS starts backing of in time.…”
Section: B Related Workmentioning
confidence: 99%