Massive Random Access of Machine-to-Machine Communications in LTE Networks: Modeling and Throughput Optimization

Zhan, Wen; Dai, Lin

doi:10.1109/twc.2018.2803083

Cited by 69 publications

(44 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed mechanism in [23] reduces the delay and energy consumption by achieving an efficiency of 53% compare to the typical RACH mechanism with 37% success rate. In [24], an analytical framework has been proposed to optimize the RACH performance by optimizing the access throughput by properly adjusting the ACB parameter and uniform backoff window size according to the number of M2M devices and the traffic from each device. The analytical framework proposed in [24] has been extended in [25] to analyse the effect of data transmission rate which is defined as the number of data packets transmitted per time slot on the optimal access throughput.…”

Section: Related Workmentioning

confidence: 99%

“…In [24], an analytical framework has been proposed to optimize the RACH performance by optimizing the access throughput by properly adjusting the ACB parameter and uniform backoff window size according to the number of M2M devices and the traffic from each device. The analytical framework proposed in [24] has been extended in [25] to analyse the effect of data transmission rate which is defined as the number of data packets transmitted per time slot on the optimal access throughput. An analysis of energy harvesting based ACB mechanism has been carried out in [26] to study the joint effect of an energy-threshold-based activation policy and the ACB mechanism on the RACH performance in terms of random access success probability and average access de-lay.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A Successive Interference Cancellation Based Random Access Channel Mechanism for Machine-to-Machine Communications in Cellular Internet-of-Things

et al. 2021

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

A Successive Interference Cancellation Based Random Access Channel Mechanism for Machine-to-Machine Communications in Cellular Internet-of-Things

et al. 2021

View full text Add to dashboard Cite

“…In order to obtain accurate load data, several estimation algorithms are developed to track the real-time number of access devices [11], [12]. Furthermore, [13] suggested a new control strategy based on statistical information to optimize the long-term network performance, which is more suitable for the implementation.…”

Section: Introductionmentioning

confidence: 99%

“…Note that the aggregate traffic is determined by the interaction of each node's queue, an access network can be regarded as a multi-queue-single-server system [31]. A double-queue model is established to characterize the grant-based random access process, where the performance is mainly determined by the request queue [13], [32]. Differently, for GFMA, the key lies on the interaction of Head-Of-Line (HOL) packets in nodes' data queues.…”

Section: Introductionmentioning

confidence: 99%

For Massive Access With Sporadic Traffic in M2M Communication: Collision Avoidance or Collision Resolution

Wang

2020

IEEE Access

View full text Add to dashboard Cite

To meet the increased requirement of machine-to-machine (M2M) communication, the potential to support massive access with sporadic traffic in uplink of two typical methods, one is the collision avoidance (CA) method at the user side, and the other is the collision resolution (CR) method at the base station (BS) side, is explored under grant-free protocol in this paper. A comprehensive study from MAC layer is conducted under the proposed distributed queue model, which describes the queue behavior of each device and the interaction between devices under grant-free protocol. The upper bounds of the throughput and the success probability of CA method are derived and the closed forms of the throughput and the success probability of a typical CR method, known as power domain multiple access (PDMA), are derived. The performance is further analyzed besides delay and stability. Through simulations, we validate that there is a hopeful upper bound for CA method, and the performance of PDMA can be flexibly improved with variable power level, which has a similar effect with channel extension. On the other hand, we note that grant-free protocol is suitable for access when the input traffic is below a critical threshold, otherwise packets would be blocked at the queue and the delay would increase infinitely.

show abstract

“…Social networking services delivered via the Internet have come to permeate every corner of people’s lives [ 1 ], including business, academia, entertainment and dating, and their commercial and academic value are gradually increasing. With the development of “Web 2.0” technologies, the amount of data on the Internet has grown explosively [ 2 , 3 ].…”

Section: Introductionmentioning

confidence: 99%

Optimization of Big Data Scheduling in Social Networks

Liu

Srivastava

2019

Entropy

228

View full text Add to dashboard Cite

In social network big data scheduling, it is easy for target data to conflict in the same data node. Of the different kinds of entropy measures, this paper focuses on the optimization of target entropy. Therefore, this paper presents an optimized method for the scheduling of big data in social networks and also takes into account each task’s amount of data communication during target data transmission to construct a big data scheduling model. Firstly, the task scheduling model is constructed to solve the problem of conflicting target data in the same data node. Next, the necessary conditions for the scheduling of tasks are analyzed. Then, the a periodic task distribution function is calculated. Finally, tasks are scheduled based on the minimum product of the corresponding resource level and the minimum execution time of each task is calculated. Experimental results show that our optimized scheduling model quickly optimizes the scheduling of social network data and solves the problem of strong data collision.

show abstract

Massive Random Access of Machine-to-Machine Communications in LTE Networks: Modeling and Throughput Optimization

Cited by 69 publications

References 45 publications

A Successive Interference Cancellation Based Random Access Channel Mechanism for Machine-to-Machine Communications in Cellular Internet-of-Things

A Successive Interference Cancellation Based Random Access Channel Mechanism for Machine-to-Machine Communications in Cellular Internet-of-Things

For Massive Access With Sporadic Traffic in M2M Communication: Collision Avoidance or Collision Resolution

Optimization of Big Data Scheduling in Social Networks

Contact Info

Product

Resources

About