2015
DOI: 10.1109/lcomm.2015.2461212
|View full text |Cite
|
Sign up to set email alerts
|

Queueing Analysis of Deadline-Constrained Broadcasting in Wireless Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(3 citation statements)
references
References 10 publications
0
3
0
Order By: Relevance
“…For example, the works in [10]- [13] consider optimal scheduling schemes for traffic with deadlines. The works in [14], [15], study the performance of random access deadline-constrained wireless networks. In [16], [17], the authors analyze the benefits of scheduling based on exploiting variable transmission times in multi-channel wireless systems with heterogeneous traffic flows.…”
Section: A Related Workmentioning
confidence: 99%
“…For example, the works in [10]- [13] consider optimal scheduling schemes for traffic with deadlines. The works in [14], [15], study the performance of random access deadline-constrained wireless networks. In [16], [17], the authors analyze the benefits of scheduling based on exploiting variable transmission times in multi-channel wireless systems with heterogeneous traffic flows.…”
Section: A Related Workmentioning
confidence: 99%
“…Under saturated traffic, Bae [4], [5] obtained the optimal slotted-ALOHA for broadcasting single-slot packets and optimal p-persistent CSMA for broadcasting multi-slot packets, respectively. Under a discrete-time Geo/Geo/1 queue model, Bae [6] obtained the optimal slotted-ALOHA for broadcasting single-slot packets. Under frame-synchronized traffic, Campolo et al [7] proposed an analytical model for using IEEE 802.11p CSMA/CA to broadcast multi-slot packets, which can be used to obtain the optimal contention window size.…”
Section: Introductionmentioning
confidence: 99%
“…Under frame-synchronized traffic, Campolo et al [7] proposed an analytical model for using IEEE 802.11p CSMA/CA to broadcast multi-slot packets, which can be used to obtain the optimal contention window size. However, [4], [5], [6] adopted a static transmission probability and [7] adopted a static contention window size, thus inevitably limiting the maximum achievable TDR. Other studies on deadline-constrained random access include [8], [9] for uplink to a common receiver and [10] for unicast in ad hoc networks, which all still restrict their attentions to static access parameters.…”
Section: Introductionmentioning
confidence: 99%