2009
DOI: 10.1109/tit.2008.2008137
|View full text |Cite
|
Sign up to set email alerts
|

Distributed Opportunistic Scheduling for Ad Hoc Networks With Random Access: An Optimal Stopping Approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
248
0
1

Year Published

2009
2009
2018
2018

Publication Types

Select...
3
2
2

Relationship

1
6

Authors

Journals

citations
Cited by 151 publications
(249 citation statements)
references
References 30 publications
0
248
0
1
Order By: Relevance
“…In [20], we have taken some initial steps to study distributed opportunistic scheduling (DOS) under the collision model, where the channel probing is successful only if one link contends for the channel. Specifically, we have shown that the scheduling problem can be cast as a maximal rate of return problem in optimal stopping theory [6], [8], where the rate of return is the average network throughput, x, which can be determined by the stopping time N as…”
Section: B Background On Distributed Opportunistic Scheduling: the Cmentioning
confidence: 99%
See 2 more Smart Citations
“…In [20], we have taken some initial steps to study distributed opportunistic scheduling (DOS) under the collision model, where the channel probing is successful only if one link contends for the channel. Specifically, we have shown that the scheduling problem can be cast as a maximal rate of return problem in optimal stopping theory [6], [8], where the rate of return is the average network throughput, x, which can be determined by the stopping time N as…”
Section: B Background On Distributed Opportunistic Scheduling: the Cmentioning
confidence: 99%
“…Our study here is built on the initial steps on developing distributed opportunistic scheduling (DOS) under the collision model [20], which can be summarized as follows. Consider a single-hop ad hoc network.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Over the recent years there has been some work on exploiting multi-user diversity in a distributed manner, in particular [4], [5], and [6]. In [4], the authors deal with channel-aware ALOHA using a decentralized MAC protocol where a source node would access the medium only when the channel gain is larger than a threshold.…”
Section: Introductionmentioning
confidence: 99%
“…In [5], the authors use a similar wireless LAN model (one-hop communication through an access point) and combine power control with threshold-based user diversity control. Different from the above two that are based on singlehop LAN model, in [6], the authors consider ad-hoc communication. However to make the analysis tractable it uses a model based on random access without carrier sensing.…”
Section: Introductionmentioning
confidence: 99%