2019
DOI: 10.1109/tnet.2019.2892709
|View full text |Cite
|
Sign up to set email alerts
|

Uncoordinated Massive Wireless Networks: Spatiotemporal Models and Multiaccess Strategies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
44
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
3
1

Relationship

2
7

Authors

Journals

citations
Cited by 48 publications
(46 citation statements)
references
References 44 publications
2
44
0
Order By: Relevance
“…The interaction among queues, together with the temporal correlation, incurs memory to the service process and can highly complicate the analysis. Fortunately, such dependency of neighborhood queueing status becomes relatively weak at the macroscopic scale, which motivates the following assumption [29]:…”
Section: (21)mentioning
confidence: 99%
See 1 more Smart Citation
“…The interaction among queues, together with the temporal correlation, incurs memory to the service process and can highly complicate the analysis. Fortunately, such dependency of neighborhood queueing status becomes relatively weak at the macroscopic scale, which motivates the following assumption [29]:…”
Section: (21)mentioning
confidence: 99%
“…By noticing that centralized protocols, e.g., the ones proposed in [14], [15], can incur large communication overhead and do not scale with the network size, we propose a distributed scheduling policy that exploits only local information to control the medium access probability at each node. Notably, while a few recent attempts to the design and analysis of a scheduling scheme under similar model have been made in [25], [28], [29], the current paper differs from and generalizes these works in two key aspects: 1) Design: Different from [25], [28], [29], where the channel access probability is universally designed as a single parameter, our approach gives a channel access probability which is a function of local topology and varies among different transmitters. 2) Analysis: While [25], [28], [29] carry out their analysis based on constant channel access probabilities, our analysis characterizes the dynamics of a scheduling policy that changes according to node locations.…”
Section: Introductionmentioning
confidence: 99%
“…See Appendix A 1) Network Categorization: It is observed from Lemma 1 that the macroscopic network-wide aggregate characterization depends on the parameter Θ T . Before delving into the details of such characterization, we first discretize the meta distribution of P s (θ) through uniform network partitioning [31]. Categorizing each devices within the network into a distinctive QoS class is not feasible due to the continuous support of P s (θ) ∈ [0, 1].…”
Section: Across Different Time Slots Within the Same Cycle T By An Apmentioning
confidence: 99%
“…Remark 3: The analysis in this paper can be extended to the case of static network with high b and/or d by following the same methodology in [18], which is postponed to future extension.…”
Section: Remarkmentioning
confidence: 99%