2016
DOI: 10.1016/j.adhoc.2016.02.005
|View full text |Cite
|
Sign up to set email alerts
|

Energy-efficient scheduling and grouping for machine-type communications over cellular networks

Abstract: In this paper, energy-efficient scheduling for grouped machine-type devices deployed in cellular networks is investigated. We introduce a scheduling-based cooperation incentive scheme which enables machine nodes to organize themselves locally, create machine groups, and communicate through group representatives to the base station. This scheme benefits from a novel scheduler design which takes into account the cooperation level of each node, reimburses the extra energy consumptions of group representatives, an… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
18
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 22 publications
(19 citation statements)
references
References 49 publications
1
18
0
Order By: Relevance
“…Each scheme with L = 1 performs better than for L = 2. Also, as expected and in general, the CRS setups outperforms the RRS scheme, except when choosing a i , b i according to (33) and (34), for which a greater fairness is attained instead. Notice that when N is small, CRS outperforms RRS; while as N increases, their curves tend to overlap.…”
Section: Overall Performance For L =supporting
confidence: 77%
See 2 more Smart Citations
“…Each scheme with L = 1 performs better than for L = 2. Also, as expected and in general, the CRS setups outperforms the RRS scheme, except when choosing a i , b i according to (33) and (34), for which a greater fairness is attained instead. Notice that when N is small, CRS outperforms RRS; while as N increases, their curves tend to overlap.…”
Section: Overall Performance For L =supporting
confidence: 77%
“…Of course, a given system is projected to work given one value of N, and by properly choosing some fixed a i and b i we can reduce the performance gap between the MTDs sharing the channel, which is not possible for the RRS scheme since weighting the transmit powers is not available. Notice also that by choosing a i and b i according to (33) and (34) both MTDs reach similar performance, hence the fairest scheme. 9 Notice the gap also relies strongly on the value of µ.…”
Section: Overall Performance For L =mentioning
confidence: 94%
See 1 more Smart Citation
“…In [13], network-side reinforcement learning has been proposed for overload control in LTE systems serving massive IoT traffic. In [14], self-organized clustering and clustered-access for massive IoT deployments have been investigated. In [15], use of multi-arm bandit (MAB) for IoT networks has been proposed, where devices learn how to avoid sub-channels suffering from a high level of static interference.…”
Section: Introductionmentioning
confidence: 99%
“…To the best of our knowledge, accurate modeling of energy consumption in machine-type communications, individual and network battery lifetime models, and corresponding scheduling algorithms are absent in literature. As an extension of [5], which investigates clustered-access for massive M2M, in [20] joint energy efficient clustering and scheduling has been investigated, i.e. the cluster-size, selection of clusterheads, and the amount of scheduled resources to clusterheads have been optimized to prolong the battery lifetime.…”
Section: Introductionmentioning
confidence: 99%