Search arXivSearch

arXiv · 1602.01161

Energy Efficient Scheduling and Groupping 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, and maximizes the network lifetime. As reusing cellular uplink resources for communications inside the groups degrades the Quality of Service (QoS) of the primary users, analytical results are provided which present a tradeoff between maximum allowable number of simultaneously active machine groups in a given cell and QoS of the primary users. Furthermore, we extend our derived solutions for the existing cellular networks, propose a cooperation-incentive LTE scheduler, and present our simulation results in the context of LTE. The simulation results show that the proposed solutions significantly prolong the network lifetime. Also, it is shown that under certain circumstances, reusing uplink resource by machine devices can degrade the outage performance of the primary users significantly, and hence, coexistence management of machine devices and cellular users is of paramount importance for next generations of cellular networks in order to enable group-based machine-type communications while guaranteeing QoS for the primary users.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amin Azari. 2016-03-17. Energy Efficient Scheduling and Groupping for Machine-TYpe Communications over Cellular Networks. https://doi.org/10.1016/j.adhoc.2016.02.005

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT