The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2019 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB) 2019
DOI: 10.1109/bmsb47279.2019.8971897
|View full text |Cite
|
Sign up to set email alerts
|

Performance Analysis of Paging Strategies and Data Delivery Approaches for Supporting Group-Oriented IoT Traffic in 5G Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
1
1

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 8 publications
0
7
0
Order By: Relevance
“…The algorithm's goal is to determine the groups, which will be served simultaneously, and the corresponding transmit power to minimize the ratio of occupied to Algorithm 2: Modified Incremental Multicast Grouping [17], L ≥ 1 available resources. Thus, the algorithm works until all groups are deleted from S M (lines [5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22]. We also use D (m) to denote a set of groups to be served at a time slot m. The algorithm selects the worst (in the sense of the needed power) group from S M and adds this group to set D (m) (lines 7-9).…”
Section: Beam Assignment and Power Allocationmentioning
confidence: 99%
See 2 more Smart Citations
“…The algorithm's goal is to determine the groups, which will be served simultaneously, and the corresponding transmit power to minimize the ratio of occupied to Algorithm 2: Modified Incremental Multicast Grouping [17], L ≥ 1 available resources. Thus, the algorithm works until all groups are deleted from S M (lines [5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22]. We also use D (m) to denote a set of groups to be served at a time slot m. The algorithm selects the worst (in the sense of the needed power) group from S M and adds this group to set D (m) (lines 7-9).…”
Section: Beam Assignment and Power Allocationmentioning
confidence: 99%
“…Finally, the computational complexity of Algorithm 3 is O(KL), where K is the complexity due to the "while" cycle over all n groups (with max K) in the worst case of the single group transmissions (lines [5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22]. For the second component, which is inside the "while" cycle, L − 1 is the complexity due to the possible selection of simultaneous groups (lines [11][12][13][14][15][16][17][18].…”
Section: Complexity Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…In [13], we discussed the necessary improvements of the SC-PTM service announcement and proposed a new grouping solution for the multicast reception of critical content, considering the drawbacks of the strategies from [11]. In the new strategy, the network schedules SC-PTM transmissions in a fixed interval named critical interval.…”
Section: Related Work and Contribution Of This Papermentioning
confidence: 99%
“…We also discuss minor but necessary changes in some messages of the RA stage, not addressed in [13].…”
Section: Related Work and Contribution Of This Papermentioning
confidence: 99%