The case for using traffic forecasting in schedule-based channel access

Petkov, Vladislav

doi:10.1109/ccnc.2011.5766456

Cited by 10 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, note that since the MAC-layer slots impose a discrete structure, the corresponding random variable in our case has a geometric distribution whose parameter is calculated based on the λ of the underlying exponential random variable. 33 Recall that for massive IoT, the delay constraint of burst j, which relates to the IoT application, is typically less than or equal to the traffic generation interval T i of the device i that generates burst j. Hence, new bursts typically do not accumulate at device i as i attempts to send the current burst by repeating this procedure until d j .…”

Section: Resultsmentioning

confidence: 99%

“…The main differences between these articles and JFS are as follows: (1) While these articles have addressed only Human-to-Human (H2H) applications, we focus entirely on M2M traffic for IoT in this paper. (2) Our methodology differs significantly from [32] and [33] in that we develop deterministic scheduling techniques while they use probabilistic scheduling. (3) While these papers focus on application-layer flows without any physical layer modeling, our emphasis is on the MAC-layer scheduling in the presence of multiple channels at the physical layer (as in OFDMA systems).…”

Section: Relationship To the State Of The Artmentioning

confidence: 99%

See 1 more Smart Citation

Multi-Channel Joint Forecasting-Scheduling for the Internet of Things

et al. 2020

View full text Add to dashboard Cite

We develop a methodology for Multi-Channel Joint Forecasting-Scheduling (MC-JFS) targeted at solving the Medium Access Control (MAC) layer Massive Access Problem of Machine-to-Machine (M2M) communication in the presence of multiple channels, as found in Orthogonal Frequency Division Multiple Access (OFDMA) systems. In contrast with the existing schemes that merely react to current traffic demand, Joint Forecasting-Scheduling (JFS) forecasts the traffic generation pattern of each Internet of Things (IoT) device in the coverage area of an IoT Gateway and schedules the uplink transmissions of the IoT devices over multiple channels in advance, thus obviating contention, collision and handshaking, which are found in reactive protocols. In this paper, we present the general form of a deterministic scheduling optimization program for MC-JFS that maximizes the total number of bits that are delivered over multiple channels by the delay deadlines of the IoT applications. In order to enable real-time operation of the MC-JFS system, first, we design a heuristic, called Multi-Channel Look Ahead Priority based on Average Load (MC-LAPAL), that solves the general form of the scheduling problem. Second, for the special case of identical channels, we develop a reduction technique by virtue of which an optimal solution of the scheduling problem is computed in real time. We compare the network performance of our MC-JFS scheme against Multi-Channel Reservation-based Access Barring (MC-RAB) and Multi-Channel Enhanced Reservation-based Access Barring (MC-ERAB), both of which serve as benchmark reactive protocols. Our results show that MC-JFS outperforms both MC-RAB and MC-ERAB with respect to uplink cross-layer throughput and transmit energy consumption, and that MC-LAPAL provides high performance as an MC-JFS heuristic. Furthermore, we show that the computation time of MC-LAPAL scales approximately linearly with the number of IoT devices. This work serves as a foundation for building scalable JFS schemes at IoT Gateways in the near future.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Relationship To the State Of The Artmentioning

confidence: 99%

Multi-Channel Joint Forecasting-Scheduling for the Internet of Things

et al. 2020

View full text Add to dashboard Cite

show abstract

Section: Proactive Solutionsmentioning

confidence: 99%

“…Other work [31,45,48] has developed proactive access schemes for Machineto-Human (M2H) or Human-to-Machine (H2M) traffic, while earlier research [43,44] has focused on Human-to-Human (H2H) traffic. In [43] a schedule-based protocol an expert system is used to determine schedules that minimize delay and maximize channel utilization. In [44], forecasts of data rates of individual applications are used to schedule channel scheduling, and network load has also been balanced based on the forecast of the total load of all machine-type devices [31].…”

Section: Proactive Solutionsmentioning

confidence: 99%

Mitigating the Massive Access Problem in the Internet of Things

Gelenbe

Nakıp

Marek

et al. 2022

Communications in Computer and Information Science

View full text Add to dashboard Cite

The traffic from the large number of IoT devices connected to the IoT is a source of congestion known as the Massive Access Problem (MAP), that results in packet losses, delays and missed deadlines for real-time data. This paper reviews the literature on MAP and summarizes recent results on two approaches that have been designed to mitigate MAP. One approach is based on randomizing the packet arrival instants to IoT gateways within a given time interval that is chosen so that packet arrivals do not exceed their deadlines, but also so that they do not constitute bulk arrivals. The second approach is a novel traffic shaping policy named the Quasi-Deterministic-Transmission-Policy (QDTP) which has been proved to drastically reduce queue formation at the receiving gateway by delaying packet departures from the IoT devices in a judicious manner. Both analytical and experimental results are summarized, that describe the benefits of these techniques.

show abstract