2016 IEEE Wireless Communications and Networking Conference Workshops (WCNCW) 2016
DOI: 10.1109/wcncw.2016.7552735
|View full text |Cite
|
Sign up to set email alerts
|

A hierarchical radio resource management scheme for next generation cellular networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 7 publications
(11 citation statements)
references
References 8 publications
0
11
0
Order By: Relevance
“…Consequently, 6 bytes are needed to capture the physical and the Medium Access Control (MAC) layer overhead [9], which resulted in 11 bytes overhead in the OSGRR algorithm. Note that the sub-granting signaling imposes the same overhead on both algorithms, which amounted to 1 byte [5]. Table 4 illustrates components and size of the overhead in both algorithms.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Consequently, 6 bytes are needed to capture the physical and the Medium Access Control (MAC) layer overhead [9], which resulted in 11 bytes overhead in the OSGRR algorithm. Note that the sub-granting signaling imposes the same overhead on both algorithms, which amounted to 1 byte [5]. Table 4 illustrates components and size of the overhead in both algorithms.…”
Section: Resultsmentioning
confidence: 99%
“…As a result, a part of allocated resources is wasted, especially for the overlay radio resource allocation. In [5], a new idea of sub-granting has been proposed wherein the allocated but not fully utilized resources are granted in a finer granularity to the other nearby users, i.e., beneficiary users. Further studies have been conducted in [6] and [7] to improve the efficiency of the sub-granting scheme.…”
Section: Introductionmentioning
confidence: 99%
“…The rest of the symbols unused by the device could be delegated to another device that needs it. Thus, it is introduced the D2D communications for resource delegation in [ 18 ]. That work proposes a framework which is divided into two main algorithms, one of them is for the device that requests resources (called Cellular User Equipment C-UE), and the other one is for the device that offers resources (denominated Device-To-Device User Equipment D2D-UE).…”
Section: Related Workmentioning
confidence: 99%
“…ω k (s + 1) = ω k (s)exp( γr k,s K ) (16) end end terms in (13) and (14) are achieved through different sets, where F s is the set containing those wrongly predicted nodes in k s . The reason is that with the partial information obtained from this feedback, it is impossible to draw the conclusion that other nodes in j (not involved in k s ) will fail to access the BS in the reserved RBs at t s .…”
Section: Algorithm 3: Dynamic Reservation Prediction Strategymentioning
confidence: 99%
“…Therefore, access latency will be reduced at the expense of spectrum resources if SPS is applied for the uplink scheduling in MTC without enhancements [8]. As the solution, some efforts have been made to deal with diverse QoS requirements through clustering [9][10] [11], and coarse granularity of pre-assigned resources via adaptive allocation by BSR, or reusing vacant dedicated resources through device-to-device (D2D) technique [12] [13]. However, some of these solutions may lead to extra access latency due to the additional overhead during information exchange.…”
Section: Introductionmentioning
confidence: 99%