Recent Advances in 5G Technologies: New Radio Access and Networking
View this Special IssueResearch Article  Open Access
EnergyEfficient Uplink Resource Units Scheduling for UltraReliable Communications in NBIoT Networks
Abstract
For 5G wireless communications, the 3GPP Narrowband Internet of Things (NBIoT) is one of the most promising technologies, which provides multiple types of resource unit (RU) with a special repetition mechanism to improve the scheduling flexibility and enhance the coverage and transmission reliability. Besides, NBIoT supports different operation modes to reuse the spectrum of LTE and GSM, which can make use of bandwidth more efficiently. The IoT application grows rapidly; however, those massive IoT devices need to operate for a very long time. Thus, the energy consumption becomes a critical issue. Therefore, NBIoT provides discontinuous reception operation to save devices’ energy. But, how to further reduce the transmission energy while ensuring the required ultrareliability is still an open issue. In this paper, we study how to guarantee the reliable communication and satisfy the quality of service (QoS) while minimizing the energy consumption for IoT devices. We first model the problem as an optimization problem and prove it to be NPcomplete. Then, we propose an energyefficient, ultrareliable, and lowcomplexity scheme, which consists of two phases. The first phase tries to optimize the default transmit configurations of devices which incur the lowest energy consumption and satisfy the QoS requirement. The second phase leverages a weighting strategy to balance the emergency and inflexibility for determining the scheduling order to ensure the delay constraint while maintaining energy efficiency. Extensive simulation results show that our scheme can serve more devices with guaranteed QoS while saving their energy effectively.
1. Introduction
The Internet of Things (IoT) is one of the key applications and technologies in the fifthgeneration (5G) communications. Since IoT is widely used for remote monitoring and reporting, such as smart building, smart transportation, smart grid, ehealth, and/or factory automation, it makes our life more convenient and makes industry more efficient. Therefore, the 3rd generation partnership project (3GPP) develops a new technology, Narrowband Internet of Things (NBIoT) [1, 2], as the communication standard for IoT, which is featured by low cost, low energy consumption, low complexity, and low throughput. Besides, the NBIoT supports massive connectivity and enhances the benefit of spectrum reuse. Specifically, it supports multiple types of resource units (RU) with specific repetitions for data transmission to improve the scheduling flexibility and enhance communication reliability. In addition, NBIoT also provides threeoperation modes to flexibly reuse the spectrum of LTE and GSM, which can achieve higher spectrum utilization and reduce the extra deployment cost for the operators.
On the other hand, due to the inherent behaviors of IoT applications, such as remote monitoring and reporting, IoT devices need to operate for a very long time [3]. Thus, energy consumption becomes a key issue. Currently, NBIoT provides discontinuous reception to save devices’ energy based on wakeup and sleep operation. However, how to further decrease their transmission energy during wakeup period is an open problem. In addition, the reliability of transmission is also a key issue in QoS for uplink transmission especially for mission critical applications (e.g., ehealth, intelligent transport), voice applications, and the high timing precision factory automation [4–6]. Thus, NBIoT provides the maximum repetition time up to 128 for a scheduling resource allocation to the ultrareliability issue. But, how to optimize the repetition operation to achieve high reliability while reducing the waste of resource and energy is still an open issue.
In this paper, we study how to ensure the high transmission reliability to guarantee the strict QoS for devices based on the RU scheduling and repetition determination while minimizing their energy consumption in NBIoT networks. We first model the problem as an optimization problem and prove it to be NPcomplete. Then, we propose an energyefficient and ultrareliable heuristic, which consists of two phases. The first phase tries to select the primary parameters which conduct the lowest energy consumption and ensure QoS requirements for uplink transmission. The second phase applies a weighting strategy to determine the precise scheduling order of uplink requests based on the scheduling emergency and inflexibility. In addition, it also adjusts the corresponding results appropriately to satisfy the strict delay constraint if needed while considering energy efficiency. Extensive simulation results show that our scheme can enlarge the number of serving devices with guaranteed QoS and decrease the packet drop ratio while saving energy.
The rest of this paper is organized as follows. Related work is discussed in Section 2. Preliminaries are given in Section 3. Section 4 presents our scheme. Simulation results are shown in Section 5. Section 6 concludes the paper.
2. Related Work
In the literature, the studies [7, 9–11] give an overview of NBIoT and conclude that NBIoT can enhance bandwidth efficiency and increase network coverage. Reference [12] proposes a new procedure for cell search and initial synchronization in NBIoT which can speed up the access operation for the devices with low SNR. In [13], it proposes a new channel equalization algorithm to optimize the sampling rate of devices when NBIoT and LTE share the same spectrum. However, they neglect the QoS and reliability of transmissions. The research [14] leverages the modulation and coding scheme (MCS) and repetition number to enhance the QoS satisfaction and transmission latency. However, it does not leverage different types of RUs; thus, it will reduce the service coverage of NBIoT and cannot allocate resource flexibly and effectively. In [15], the authors develop a new detection mechanism for random access procedure to enhance the coverage and access efficiency of NBIoT. However, it does not consider the transmission reliability and energy efficiency. The study [16] proposes a transmission scheme without connection setup to reduce connectivity latency. But, it may cause extra energy consumption. Reference [17] develops a detection scheme based on maximum likelihood to detect timing acquisition with low delay while reducing energy consumption. However, the QoS satisfaction and the transmission reliability are ignored in this paper. In [18], the authors develop a prediction method to allocate resource in advance based on the occurrence and delay time of uplink transmission. Although it can accelerate the transmission procedure, it may decrease the scheduling flexibility and resource efficiency. In [19], it leverages Nonorthogonal Multiple Access (NOMA) to allocate common subcarriers to multiple devices and thus to enhance the spectrum efficiency. However, it does not discuss how to ensure the energy efficiency and transmission reliability, which are the key issues in NBIoT.
Based on the above observation, it motivates us to address the issue of considering both transmission reliability and energy efficiency by scheduling multitypes of RUs with optimal repetition in NBIoT networks.
3. Preliminary
In this section, we first give an overview of the operation modes of NBIoT. Then, we introduce the resource unit and the repetition mechanism used in NBIoT. Finally, we formally define our resource allocation problem and show it to be NPcomplete.
3.1. NBIoT Operation Modes
In NBIoT, all devices connect with the centralized base station (also called the Evolved Node B, eNB). In order to enhance the spectrum utilization and reduce the cost of operators, NBIoT provides threeoperation modes for devices to access the eNB by reusing the existing spectrum of LTE and GSM [20–22]:
3.1.1. Inband
Using the bandwidth of one resource block (RB) inside the LTE carrier as the access spectrum is shown in Figure 1(a).
(a)
(b)
(c)
3.1.2. GuardBand
Using the bandwidth of one RB in the guardband of LTE carrier as the access spectrum is shown in Figure 1(b).
3.1.3. StandAlone
Using the bandwidth of a reframed GSM carrier as the access spectrum is shown in Figure 1(c).
3.2. Resource Unit (RU)
In NBIoT, the resource is divided into frames, where each frame consists of 10 subframes. The length of a subframe is 1 ms, which is further divided into two slots. For the uplink transmission, data is transmitted through Narrowband Uplink Shared Channel (NPUSCH). The resource unit (RU) is the basic transmission resource unit allocated in the bandwidth of 180 KHz. The transmission data can be carried by one or multiple RUs depending on the request size and MCS. Specifically, NBIoT supports multiple types of RUs based on the subcarrier spacing as shown in Table 1. Since the subcarrier spacing of 15 KHz is mandatory in the standard, we focus on it in this paper [1]. For the subcarrier spacing of 15 KHz, there are 4 types of RUs that are classified as singletone (1tone) or multitone (3tone, 6tone, and 12tone). Each type of RU is with a specific number of subcarriers and time slots, as shown in Figure 2.

3.3. Repetition Mechanism
In NBIoT, one of the key features is the repetition mechanism, which is designed to enhance the reliability of transmission and enlarge the network coverage. According to the NBIoT standard, the transmission RUs of each device i (also called user equipment i in the following) can associate with a specific number of repetition , where . Thus, each UE can ensure the transmission reliability based on the individual physical status, such as channel quality, path loss, biterrorrate (BER), and transmission power. Figure 3 shows an example of 5 UEs with different repetition numbers. Note that the transmission finish time of each UE should not violate its delay constraint.
3.4. Downlink Control Information (DCI)
Downlink Control Information (DCI) is the control message in Narrowband Physical Downlink Control Channel (NPDCCH), which is responsible for describing the scheduling results for both downlink and uplink transmissions. Each DCI is with the length of 1 ms. When the eNB completes the RU scheduling, each scheduling result will be carried by one DCI to inform the corresponding UE about its uplink transmission with the designate RU type, subcarrier set, allocation time, and the number of repetitions. Table 2 shows the main parameters in DCI (format N0), which is for uplink grant and scheduling in NPUSCH. Specifically, the subcarrier indication () describes the RU type and the corresponding subcarrier set to locate RUs. The resource assignment () represents the number of allocated continuous RUs for this transmission schedule excluding repetition. The modulation and coding scheme () means which MCS is applied on this RU transmission. Note that NBIoT supports 11 types of modulation and coding schemes for uplink, which depend on the biterrorrate and received signaltonoise ratio (this will be clear later on). The repetition number () represents the number of repetitions for the scheduled RUs. So, the total amount of RUs assigned to is .

Specifically, subcarrier indication () is used for the description of RU types and their subcarrier set, as shown in Table 3. When the subcarrier spacing is 15 KHz, represents the fact that the RU type is singletone and locates at the subcarrier set of . Thus, it has 12 possible locations. When , the RU type is 3tone and locates at , which has 4 possible locations, i.e., . When , it indicates the RU type of 6tone, which has 2 possible locations, i.e., . Finally, when , the RU type is 12tone, which has a unique location, i.e., and thus .

3.5. Problem Definition
In this paper, we consider an NBIoT network with a base station (eNB) serving UEs. Each , , has an uplink request with data size (bits), required reliability , and strict delay constraint (ms). To guarantee QoS, assume that the arrival time of the ’s request is at th (ms) and then the data must be uploaded to the base station before the delay deadline . For each , the transmit power is denoted as (mW) which is constrained by the maximum transmit power ; i.e.,
When scheduling, each has to be assigned one type of RUs; ; according to the designate subcarrier indication ; i.e.,
For each ’s RUs, the amount of data that can carry depends on the modulation and coding scheme . Specifically, the biterrorrate of the data received by the base station relies on the received signaltonoise ratio; i.e.,where is the received power at base station and , , and are the transmitter gain, receiver gain, and the path loss between and the eNB, respectively; B is the subcarrier bandwidth; i.e., 15 KHz, is the noise power and is the interference perceived at the eNB. Note that
is the SNR threshold to apply with the measured biterrorrate ().
According to Table 1, the number of required RUs () for each iswhere () is the data rate of (bits per subcarrier slot). To guarantee the transmission reliability , we have to leverage the number of repetitions and the successful probability of data transmission ; i.e.,where is the successful probability [23, 24] if data is transmitted one time and is the successful probability after repetitions. Thus, to ensure the reliability requirement of , Equation (5) is the necessary requirement.
Note that the scheduling results will be carried by the DCI message, which is scheduled at (subframe) for each . Thus, it has to satisfy the delay deadline of ; i.e.,where is the number of slots of single RU (two slots constitutes one ms), which depends on the RU type; i.e.,
Now, we consider the current scheduling subframe is (ms), the feasible subcarrier set is (e.g., if subcarrier spacing is 15 KHz), and the available earliest subframe for each subcarrier to allocate resource to devices is , . Our problem asks how to optimize the uplink scheduling results for each , by determining the type of RUs (), the number of RUs (), the subcarrier set of RUs (), and the allocation start time of RUs () with the number of repetitions (), transmit power of (), the modulation and coding scheme (), and the subframe index of DCI () to ensure that no two RUs overlap with each other and the QoS parameters including the request data size (), delay constraint (), and reliability of transmission () are satisfied while the total energy consumption of UEs, denoted as , is minimized, where
Therefore, our problem can be summarized as an optimizationlike problem:subject to (1), (2), (3), (4) (5), (6), and (7).
Table 4 also summarizes the notations used in this paper.

Theorem 1. The addressed problem is NPcomplete.
Proof. To simplify the proof, we consider the case of subcarrier spacing with 3.75 KHz where the UEs use the singletone only and the modulation and coding scheme (MCS) is monotonic. So, the number of repetitions with minimal transmission power to meet required reliability of each UE is unique. Thus, the energy cost of an UE on each parameter list is also uniquely determined. Then, we formulate the resource allocation problem as a decision problem: energyefficient ultrareliable scheduling decision (EUSD) problem. Given a NBIoT network and the UEs with required reliability for uplink transmission, we ask whether or not there exists a set of numbers of repetitions such that all UEs can conserve the total energy of to satisfy their uplink transmission with reliability. Then, we show that EUSD problem is NPcomplete.
We first show that the EUSD problem belongs to NP. Given a problem instance and a solution containing the set of repetition numbers it can be verified whether or not the solution is valid in polynomial time. Thus, this part is proved.
We then reduce the multiplechoice knapsack (MCK) problem [25], which is known to be NPcomplete, to the EUSD problem. Consider that there are disjointed classes of objects, where each class contains objects. In each class , every object has a profit and a weight . Besides, there is a knapsack with capacity of . The MCK problem asks whether or not we can select exact one object from each class such that the total object weight is no larger than and the total object profit is .
We then construct an instance of the EUSD problem as follows. Let be the number of UEs. Each has repetition selections to transmit data to the eNB. When selects the repetition number , it will conserve energy of . Note that the conserved energy of an UE with a particular number of repetition is compared to the same UE’s number with the most energy cost. Thus, the system should allocate a RU size of to transmit ’s data to the eNB. The total frame space is . Our goal is to let all UEs conserve energy of and satisfy their transmission requirement. We show that the MCK problem has a solution if and only if the EUSD problem has a solution.
Suppose that we have a solution to the EUSD problem, which is a set of repetition parameters with the conserved energy of RUs. Each UE can choose exact one repetition number and we need to assign each number to each UE to satisfy their transmission reliability. The total size of RUs cannot exceed the frame space and the conserved energy of all UEs is . By viewing the possible number of repetitions of an UE as a class of objects and the frame as the knapsack, the repetition numbers in all constitute a solution to the MCK problem. This proves the if part.
Conversely, let , be a solution to the MCK problem. Then, for each , we select a repetition number such that conserves energy of and the size of allocated RUs to transmit ’s data to the eNB is . In this way, the conserved energy of all UEs will be and the overall RU size is no larger than . This constitutes a solution to the EUSD problem, thus proving the only if part.
4. The Proposed Scheme
Since the EUSD problem is NPcomplete, finding the optimal solution is impractical due to the time complexity. Thus, we propose a lowcomplexity, energyefficient, and highreliable scheme to tackle this problem. This scheme consists of two phases. The first phase exploits the strategy of “minimal energy cost” to determine the scheduling parameters of UEs. This scheme first quantifies the consumed energy for each UE and then chooses the one with minimal energy cost and reserves the corresponding parameters as the default transmit setting while satisfying the required reliability. The second phase determines the scheduling order based on the “score function” which considers the emergency level of requests and inflexibility of the scheduling transmission. Then, it determines the best resource location of RUs of each UE based on the “potential resource waste” function to enhance the resource utilization. Finally, if the predetermined results violate an UE’s delay requirements on scheduling, the scheme will calculate a “cost ratio” to adaptively adjust the RU assignments. The details of the scheme are described as follows.
4.1. Phase 1. Minimal Energy Cost
The goal of the first phase is to determine the default parameters for each UE, including the type of RUs (), the number of RUs (), the best number of repetitions (), and transmit parameters ( and ), to guarantee QoS and the transmission reliability. These operations are described as follows.
Step 1. For each , we first calculate the required number of RUs according to (4) based on the available RU types and MCS selections. Specifically, the required transmit time to carry the amount of data cannot be greater than the delay requirements. These results are collected as the feasible setting pairs of RU type and MCS setting for each , denoted as set ; i.e.,where is the index of feasible setting pair of RU type and MCS for each and is the number of required slots when the RU type is , which can be obtained by (7). Note that is divided by 2 because two slots constitute 1 ms, which is the unit of delay constraint .
Step 2. For each , consider the feasible RU type and MCS setting pair ; we calculate the allowed repetition numbers in which each can make not only satisfy the required reliability but also ensure the corresponding transmission power in the feasible ranges; i.e.,whereis derived from (5) and is a function which returns the minimum transmit power for the RU type , MCS setting , and target biterrorrate ; i.e.,which can be derived from (3).
After that we have all the feasible RU type and MCS setting pairs with each of their allowed repetition numbers .
Step 3. Based on the results of Steps 1 and 2, we calculate the most energysaving repetition number for each feasible combination pair , where
Then, reform as a set of triplets (). Each triplet in is a feasible configuration of RU type, MCS setting, and repetition number.
Step 4. Then, we choose the best triplet of from as the default parameter of , which incurs the minimum energy consumption by
Through the above steps, we can determine the best RU type , MCS setting , and repetition number that can incur the least energy consumption and meet the reliability requirement of each .
4.2. Phase 2. Weighting Based Flexible Scheduling
The goal of the second phase is to optimize the scheduling results of requests from UEs, including the subcarrier set of RUs () and the start time of RUs (). In addition, if needed, it can adaptively adjust the transmission parameters of UEs to ensure the delay constraint and enhance spectrum utilization. The detailed steps are depicted as follows.
Step 1. We first define a score function to evaluate the emergency and inflexibility for each with uplink transmission request, i.e.,where and are the weighting factors of the degrees of the emergency and inflexibility, respectively, that satisfy . Note that is the urgent level of ’s request compared to others; i.e.,where is the remaining time from the scheduling subframe (or current subframe) to the delay deadline of ; i.e., is the number of RU types that can choose, which is defined bywhereand is the number of choices of RU types for the feasible setting pair . That means if has fewer choices, its inflexibility is higher and needs to be scheduled earlier.
Now, for each , we calculate its and sort them in descending order. For the UEs without any request, define its score as . Without loss of generality, we use List to represent the sorted sequence of the UEs.
Step 2. Before determining the subcarrier set of RUs, we first define a function to reflect the potential waste of resource if ’s RUs are allocated at subcarrier set ; i.e., where outputs the value larger than or equal to 0; means the earliest available resource allocation start time of RUs if the subcarrier set is , where is to ensure allocating RU after DCI. Note that (21) sums up the unused resource space before the resource allocation finish time of if ’s RUs are allocated at .
Then, based on (21), we choose the best subcarrier set that makes have the minimal without violating its delay deadline; i.e.,where is the set of available subcarrier sets when default RU type is used.
If Ø, we set the subframe index of by and start time . Then, update the available scheduling subframe for subcarriers and by and , respectively. Finally, update and then remove from List . However, if , it means that current transmission parameter setting is infeasible and then we check whether or not has other feasible triplet in other than the default parameter. If yes, go to Step 3 for further adjusting. If no, we remove such from List and go back to Step 2 to schedule the next UE. The above steps are repeated until List is empty and then terminate this phase.
Step 3. Here, we try to change the type of RUs and/or MCSs of by referring and choose the new triplet that can satisfy the delay deadline while incurring the least extra energy consumption and resource as follows.
First, we define a cost ratio to reflect the results of extra consumed energy over the extra required resource space when the original pair of RU type and MCS, denoted as , changes to the new pair, denoted as for ; i.e.,where the extra consumed energy is and the extra resource space is .
Then, we choose the new pair which incurs the minimal cost ratio; i.e.,and replace the default parameters by , , and accordingly. Finally, go back to Step 2 for further allocation.
Through the above steps, we can determine each ’s subcarrier set , start time , and the corresponding configurations of , , and while ensuring the delay deadline and reducing the waste of spectrum resource and energy.
Below, we give an example in Figure 4, where there are four scheduled UEs () and one UE () to be scheduled. The subframe indexes of DCIs for the four scheduled UEs are , , , and (ms), separately. The current earliest subframe index for DCI is subframe 14 and scheduling subframe is (ms). Now, we consider schedule , whose RU type is 3tone, number of RUs is , total length is (ms), arrival time is (ms), and delay constraint is (ms). From the current scheduling results, as shown in Figure 4(a), the available start time for each subcarrier is , , , , , , , , , , , and , respectively. Thus, the available subcarrier set for is . So, for the 4 possible subcarrier sets, the potential resource waste for is , , , and , which are the doted regions in Figures 4(b), 4(c), 4(d), and 4(e), respectively. Moreover, the subcarrier set of in Figure 4(e) is infeasible because it violates the delay deadline of (i.e., ). Thus, based on (21), the scheme chooses the best feasible subcarrier set and the start time of ’s schedules RUs is because it has the minimal value of .
(a) The scheduling results before scheduling
(b) The scheduling results if subcarrier set is
(c) The scheduling results if subcarrier set is
(d) The scheduling results if subcarrier set is
(e) The scheduling results if subcarrier set is
5. Simulation Results
In this section, we develop a simulator in C++ language to verify the efficiency of the proposed scheme (currently, the wellknown simulator, such as ns3 [26], has not supported NBIoT model in terms of channels mappings and access procedures.). The parameters of the simulation are shown in Table 5. Specifically, the simulator emulates a base station to serve UEs. Based on the model of MAR (Mobile Autonomous Reporting) [8], the uplink requests of UEs arrive randomly with the data size of bytes according to the Pareto distribution with = 2.5. In addition, the interarrival time of requests includes 30 minutes (5%), 1 hour (15%), 2 hours (40%), and 1 day (40%), respectively.

In this simulation, we compare our scheme (Ours) with the standard scheme (Spec) [2], Narrowband Link Adaptation scheme (NBLA) [14], random scheduling scheme (Random), and round robin scheme (RR). Specifically, Spec scheme chooses the singletone for UEs with constant repetition number for simplicity (the numbers are 1 and 2 in the simulation, denoted as Spec and Spec). NBLA can adjust the MCSs and repetition levels iteratively to ensure the transmission quality and delay. Random scheme schedules the UEs in a random order with a random repetition number. RR scheme schedules the UEs in round robin order with the repetition number of 1. Note that the weighting factors of our scheme is and .
We consider five performance metrics: (i) system throughput: the total number of data bits received successfully by the eNB during the experiment period; (ii) the number of serving UEs: the average number of UEs that satisfy QoS and reliability; (iii) resource consumption: the frame space allocated to the uplink transmission over the total frame space; (iv) packet drop rate: the number of dropped packets due to violating delay constraint over the total number of packets; (v) energy consumption per UE: the average consumed energy of each served UE. Note that the scheduling interval is 30 ms and the simulator emulates for 24 hours.
5.1. System Throughput
First, we investigate the effects of number of request UEs on system throughput. As shown in Figure 5(a), we can see that when the number of request UEs increases, the system throughput of all scheme increases fast and then slows down due to system saturation. RR, Spec, and Random perform worse because they cannot satisfy UEs’ QoS requirement and reliability. Thus, the total number of data bits received successfully by the eNB is few. Specifically, Spec performs slightly better than Spec because it can meet more UEs’ reliability due to applying the larger repetition number. NBLA is better than the above schemes because it can adjust MCSs and repetition levels to satisfy QoS and reliability. Note that our scheme outperforms other schemes because it can flexibly adjust RU type and optimize repetition number to satisfy QoS while ensuring transmission reliability.
(a)
(b)
(c)
(d)
We also investigate the effects of distribution of request data size on system throughput. As shown in Figure 5(b), similarly, when the request data size increases, the system throughput of most schemes increases and then slows down due to system saturation. RR and Spec decrease fast because their repetition number is 1 and may not satisfy the successful transmission probability due to larger request size. Our scheme is still the best because it can schedule UEs flexibly while ensuring QoS requirement and reliability.
Then, Figure 5(c) shows the impact of the distribution of delay constraints on system throughout. As can be seen, when the distribution of delay constraints increases, the system throughput of most schemes increases slowly. This is because the longer delay constraint can help more UEs to be satisfied until the frame space is exhausted. RR and Spec increase slowly because they fix repetition number by 1 that would limit the successful transmission probability even when the UEs have longer delay constraint. Note that our scheme has the highest throughput because of its flexible scheduling and appropriate parameter setting.
Finally, we investigate the impact of the distribution of required reliability on system throughout. In Figure 5(d), when the distribution of reliability increases, the system throughput of most schemes decreases. The reason is that more UEs with strict reliability make all schemes harder to serve them due to their higher requirements. RR and Spec decrease dramatically because their repetition number is 1 that could not serve most UEs with higher reliability. Note that our scheme still outperforms others.
5.2. Number of Serving UEs
Then, we investigate the effects of number of request UEs on number of serving UEs. As shown in Figure 6(a), similarly, Random performs the worst because it randomly schedules the UEs with a random repetition number; thus, the QoS and reliability of UEs may not be met. Spec and RR perform slightly better than Random scheme because they prefer to choose singletone with the fixed repetition number for UEs; thus, it could potentially satisfy more UEs with small data request and lower reliability requirement. Spec is better than Spec because a larger repetition number can achieve higher reliability. NBLA is better than the above schemes because it can adjust the repetition levels and MCSs interactively to satisfy the transmission reliability and delay. Note that our scheme outperforms all others because our scheme can optimize the number of repetitions to satisfy the transmission reliability in phase 1 and apply the best configuration pair of RU type and MCS to ensure QoS while enhancing the spectrum utilization in phase 2.
(a)
(b)
(c)
(d)
We also investigate the effects of distribution of request data size on number of serving UEs. As shown in Figure 6(b), contrarily, when the request data size increases, the number of serving UEs of all schemes decreases because the UEs with larger request size consume more frame space. RR and Spec decrease fast because their repetition number is fixed by 1 that would not satisfy the UEs with larger request size. Our scheme is the best because it flexibly schedules UEs to satisfy their delay requirement and reliability.
In Figure 6(c), we observe the impact of the distribution of delay constraints on number of serving UEs. As can be seen, when the distribution of delay constraints increases, the number of serving UEs of all schemes increases slowly. This is because the longer delay constraint can make more UEs tolerate allocation time until the frame space is exhausted. RR and Spec increase very slowly because their fixed repetition number (i.e., 1) would limit the transmission probability although the UEs have longer delay time. Note that our scheme has the highest performance because it can well determine the scheduling setting.
Finally, we investigate the impact of the distribution of required reliability on number of serving UEs in Figure 6(d). We can see that when the distribution of reliability increases, the number of serving UEs of all schemes decreases. The reason is that more UEs with strict reliability will make schemes hardly serve them due to higher requirements. Note that RR and Spec decrease dramatically because they fix the repetition number by 1 that could not serve the UEs with higher reliability requirements. Also note that our scheme still outperforms others even when the reliability requirements become higher.
5.3. Packet Drop Rate
Then, we investigate the effects of number of request UEs on packet drop rate. As shown in Figure 7(a), we can see that when the number of request UEs increases, the packet drop rate of all schemes increases due to network saturated gradually. Spec, Random, and RR perform worse because they usually schedule UEs with singletone so the UEs’ RU length may exceed their delay constraint. NBLA performs better than above schemes because it can choose better repetition number to mitigate packets being dropped. Our scheme has the lowest packet drop rate because our scheme can flexibly select multitype RUs and minimize the number of repetitions to guarantee the QoS while avoiding packets being dropped.
(a)
(b)
(c)
(d)
We also investigate the effects of distribution of request data size on packet drop rate. As shown in Figure 7(b), similarly, when the request data size increases, the packet drop rate of all schemes increases because the larger request size consumes more resources that may exceed the frame space which makes packet being dropped. RR and Spec increase fast because they could not satisfy the UEs with larger request size, which require higher transmission probability. Our scheme is the best because it can schedule UEs according to their delay and reliability requirements.
Then, in Figure 7(c), we investigate the impact of the distribution of delay constraints on packet drop rate. As can be seen, when the distribution of delay constraints increases, the packet drop rate of all schemes decreases gradually. This is because the longer delay constraint can make more packets tolerate the allocation time before delay expires. RR and Spec decrease very slowly because they fix repetition number by 1 so that it would not help packets being transmitted. Note that our scheme has the lowest packet drop rate because it can well determine the scheduling results.
Finally, we investigate the impact of the distribution of required reliability on packet drop rate in Figure 7(d). As can be seen, when the distribution of reliability increases, the packet drop rate of all schemes increases. Our scheme still outperforms others even when the reliability requirements are up to 95–99%.
5.4. Resource Consumption
Here, we investigate the effects of number of request UEs on resource consumption. As shown in Figure 8(a), we can see that when the number of request UEs increases, the resource consumption of all schemes increases. Spec, Random, and NBLA perform worst because they usually schedule the UEs with multiple number of repetitions and thus consume more resources. Spec and RR have lower resource consumption because they prefer to choose the UEs with single repetition to reduce resource. Note that our scheme needs the least spectrum resource because our scheme exploits a waste function to avoid resource consumption.
(a)
(b)
(c)
(d)
Here, we also investigate the effects of distribution of request data size on resource consumption. As shown in Figure 8(b), similarly, when the request data size increases, the resource consumption of most schemes increases slowly. Spec, Random, and NBLA waste more resources because they usually schedule the UEs with multiple repetitions and thus consume more resources. Our scheme is still the best because it can schedule UEs flexibly while ensuring QoS requirement and reliability.
Then, in Figure 8(c), we investigate the impact of the distribution of delay constraints on resource consumption. As can be seen, when the distribution of delay constraints increases, the resource consumption of all schemes increases. This is because the longer delay constraint can make more UEs satisfied that may consume more resources. Note that although Spec has the lowest resource consumption, it incurs lower system throughput, lower number of serving UEs, and higher packet drop rate, as compared to ours.
Finally, we investigate the impact of the distribution of required reliability on resource consumption, as shown in Figure 8(d). When the distribution of reliability increases, the resource consumption of most schemes increases. Our scheme increases slightly because our scheme can enlarge the repetition number with multiple tone to satisfy the UEs with higher reliability requirement.
5.5. Energy Consumption per UE
Finally, we investigate the effects of the number of request UEs on energy consumption per UE. As shown in Figure 9(a), we can see that the energy consumption per UE of all schemes increases when the number of request UEs increases. This is because the network is saturated and most satisfied UEs are with higher MCS, which require less resource but consume more energy. Random scheme performs the worst because it randomly chooses the number of repetitions that may potentially increase the transmission time, thus consuming more energy. Spec and RR are better than Random scheme because they only serve the UEs with small size request which consumes less energy. NBLA performs slightly better because it can determine the number of repetitions appropriately but neglects to minimize the transmission power. Note that our scheme performs the best because our scheme can choose the best scheduling parameters of RUs with least energy consumption in phase 1 and leverage the cost ratio to reduce energy consumption in phase 2, thus saving energy more efficiently.
(a)
(b)
(c)
(d)
In Figure 9(b), we also investigate the effects of distribution of request data size on energy consumption per UE. As can be seen, when the request data size increases, the energy consumption per UE of all schemes increases. Our scheme incurs the lowest energy consumption because it can determine the minimal transmit power and the corresponding RU setting to save energy.
Then, in Figure 9(c), we observe the impact of the distribution of delay constraints on energy consumption per UE. We can see that when the distribution of delay constraints increases, the energy consumption per UE of all schemes increases. Similarly, our scheme still has the lowest energy consumption because it can calculate the best transmit power and exploit the cost ratio to reduce energy consumption.
Finally, we investigate the impact of the distribution of required reliability on energy consumption per UE. Figure 9(d) shows that when the distribution of reliability increases, the energy consumption of most schemes increases. Our scheme still outperforms all other schemes because it can determine the best scheduling parameters based on the required reliability of UEs.
6. Conclusion
In this paper, we have addressed the problem of energy saving and reliable communications in NBIoT networks. We first model this problem as an optimization problem and prove it to be NPcomplete. Then, we propose an energyefficient and highreliable scheme which has two phases. The first phase leverages the strategy of minimal energy cost to choose the default scheduling parameters with least energy consumption. The second phase exploits the weighting score function to balance the emergency and inflexibility of the request transmission and then serve the UEs with least potential resource waste. Simulation results have verified that our scheme can satisfy more UEs with ultrareliability and QoS requirement while saving their energy.
Data Availability
The data used to support the findings of this study are available from the corresponding author upon request.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
Acknowledgments
This research is cosponsored by MOST 1062221E024004, 1022218E182008MY3, 1052221E182051, 1062221E182015MY3, 10527458182001, 1062221E024004, 1052221E009100MY3, 1052218E009029, 1052923E009001MY2, 1042221E009113MY3, MoE ATU Plan, Delta Electronics, ITRI, Institute for Information Industry, Academia Sinica AS105TPA07, and Chang Gung Memorial Hospital, Taoyuan.
References
 3GPP TS 36.211, “Evolved Universal Terrestrial Radio Access (EUTRA),” Physical Channels and Modulation, v14.4.0, pp. 1–6, 2017. View at: Google Scholar
 3GPP TS 36.213, “Evolved Universal Terrestrial Radio Access (EUTRA),” Physical Layer Procedures, v14.4.0, pp. 1–6, 2017. View at: Google Scholar
 J.M. Liang, J.J. Chen, H.H. Cheng, and Y.C. Tseng, “An energyefficient sleep scheduling with QoS consideration in 3GPP LTEadvanced networks for internet of things,” IEEE Journal on Emerging and Selected Topics in Circuits and Systems, vol. 3, no. 1, pp. 13–22, 2013. View at: Publisher Site  Google Scholar
 E. Mohyeldin, “Minimum Technical Performance Requirements for IMT2020 radio interface(s),” ITUR Workshop on IMT2020 Terrestrial Radio Interfaces, pp. 1–12, 2016. View at: Google Scholar
 R. Ma, K. H. Teo, S. Shinjo, K. Yamanaka, and P. M. Asbeck, “A GaN PA for 4G LTEAdvanced and 5G: Meeting the telecommunication needs of various vertical sectors including automobiles, robotics, health care, factory automation, agriculture, education, and more,” IEEE Microwave Magazine, vol. 18, no. 7, pp. 77–85, 2017. View at: Publisher Site  Google Scholar
 O. Teyeb, G. Wikstr, M. Stattin, T. Cheng, S. Faxér, and H. Do, “Evolving LTE to fit the 5G future,” Ericsson Technology Review, 2017. View at: Google Scholar
 R. Ratasuk, B. Vejlgaard, N. Mangalvedhe, and A. Ghosh, “NBIoT system for M2M communication,” in Proceedings of the 2016 IEEE Wireless Communications and Networking Conference, WCNC 2016, pp. 1–5, April 2016. View at: Publisher Site  Google Scholar
 TR 45.820, “Cellular system support for ultra low complexity and low throughput internet of things,” v2.1.0, pp. 1–6, 2015. View at: Google Scholar
 Y. E. Wang, X. Lin, A. Adhikary et al., “A primer on 3GPP narrowband Internet of Things (NBIoT),” IEEE Communications Magazine, vol. 15, no. 3, pp. 117–123, 2017. View at: Google Scholar
 R. Ratasuk, N. Mangalvedhe, Y. Zhang, M. Robert, and J. P. Koskinen, “Overview of narrowband IoT in LTE Rel13,” in IEEE Conference on Standards for Communications and Networking (CSCN), pp. 1–7, 2016. View at: Publisher Site  Google Scholar
 A. D. Zayas and P. Merino, “The 3GPP NBIoT system architecture for the Internet of Things,” in Proceedings of the 2017 IEEE International Conference on Communications Workshops (ICC Workshops), pp. 277–282, Paris, France, May 2017. View at: Publisher Site  Google Scholar
 N. Mangalvedhe, R. Ratasuk, and A. Ghosh, “NBIoT deployment study for low power wide area cellular IoT,” in Proceedings of the 2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), pp. 1–6, Valencia, Spain, September 2016. View at: Publisher Site  Google Scholar
 L. Zhang, A. Ijaz, P. Xiao, and R. Tafazolli, “Channel Equalization and Interference Analysis for Uplink Narrowband Internet of Things (NBIoT),” IEEE Communications Letters, vol. 21, no. 10, pp. 2206–2209, 2017. View at: Publisher Site  Google Scholar
 C. Yu, L. Yu, Y. Wu, Y. He, and Q. Lu, “Uplink Scheduling and link adaptation for narrowband internet of things systems,” IEEE Access, vol. 5, pp. 1724–1734, 2017. View at: Publisher Site  Google Scholar
 X. Lin, A. Adhikary, and Y. Eric Wang, “Random access preamble design and detection for 3GPP narrowband IoT systems,” IEEE Wireless Communications Letters, vol. 5, no. 6, pp. 640–643, 2016. View at: Publisher Site  Google Scholar
 S. Oh and J. Shin, “An efficient small data transmission scheme in the 3GPP NBIoT system,” IEEE Communications Letters, vol. 21, no. 3, pp. 660–663, 2017. View at: Publisher Site  Google Scholar
 H. Kroll, M. Korb, B. Weber, S. Willi, and Q. Huang, “Maximumlikelihood detection for energyefficient timing acquisition in NBIoT,” in Proceedings of the 2017 IEEE Wireless Communications and Networking Conference Workshops (WCNCW), pp. 1–5, San Francisco, CA, USA, March 2017. View at: Publisher Site  Google Scholar
 J. Lee and J. Lee, “Predictionbased energy saving mechanism in 3GPP NBIoT networks,” Sensors, vol. 17, no. 9, 2017. View at: Publisher Site  Google Scholar
 A. E. Mostafa, Y. Zhou, and V. W. Wong, “Connectivity maximization for narrowband IoT systems with NOMA,” in IEEE International Conference on Communications (ICC), pp. 1–6, Paris, France, May 2017. View at: Publisher Site  Google Scholar
 3GPP TS 36.331, “Evolved Universal Terrestrial Radio Access (EUTRA),” Radio Resource Control (RRC), v15.1.0, pp. 1–786, March 2018. View at: Google Scholar
 G. Tsoukaneri, M. Condoluci, T. Mahmoodi, M. Dohler, and M. K. Marina, “Group communications in NarrowbandIoT: Architecture, procedures, and evaluation,” IEEE Internet of Things Journal, vol. 1, no. 1, pp. 1–10, 2018. View at: Publisher Site  Google Scholar
 H. Malik, H. Pervaiz, M. Mahtab Alam, Y. Le Moullec, A. Kuusik, and M. Ali Imran, “Radio resource management scheme in NBIoT systems,” IEEE Access, vol. 6, pp. 15051–15064, 2018. View at: Publisher Site  Google Scholar
 A. RicoAlvarino, R. LopezValcarce, C. Mosquera, and R. W. Heath, “FER estimation in a memoryless BSC with variable frame length and unreliable ACK/NAK feedback,” IEEE Transactions on Wireless Communications, vol. 16, no. 6, pp. 3661–3673, 2017. View at: Publisher Site  Google Scholar
 M. Jacobsson and C. Rohner, “Estimating packet delivery ratio for arbitrary packet sizes over wireless links,” IEEE Communications Letters, vol. 19, no. 4, pp. 609–612, 2015. View at: Publisher Site  Google Scholar
 H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems, Springer, 2004. View at: Publisher Site  MathSciNet
 NS3 Consortium, “ns3 network simulator,” 2018, https://www.nsnam.org/. View at: Google Scholar
Copyright
Copyright © 2018 JiaMing Liang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.