Dynamic Group Based Authentication Protocol for Machine Type Communications

2012 ◽  
Author(s):  
Yueyu Zhang ◽  
Jie Chen ◽  
Hui Li ◽  
Wujun Zhang ◽  
Jin Cao ◽  
...  
Keyword(s):  
Authentication Protocol ◽  
Machine Type ◽  
Dynamic Group ◽  
Machine Type Communications

scholarly journals A secure group based authentication protocol for machine to machine communications in LTE-WLAN interworking architecture

2019 ◽  
Vol 16 (2) ◽  
pp. 848
Author(s):  
Mariya Ouaissa ◽  
Abdallah Rhattoy
Keyword(s):  
Authentication Protocol ◽  
Machine To Machine ◽  
Machine Type ◽  
Transmission Cost ◽  
Diffie Hellman ◽  
Machine Type Communications ◽  
Industry Automation ◽  
Secure Networks ◽  
Important Challenge ◽  
3Rd Generation Partnership Project

Machine to Machine (M2M) communication has been used in applications such as telemetry, industry, automation and health. Support for a large number of devices has been considered an essential requirement in M2M communications. During this time, security is the most important challenge; M2M cannot access secure networks through effective authentication, all relevant M2M applications cannot be accepted. The challenge of M2M research is authentication by the group when a large number of M2M devices simultaneously accessing the network will cause severe authentication signaling congestion. The group based model under an M2M architecture, especially when the Machine Type Communication (MTC) devices belong to the non 3rd Generation Partnership Project (3GPP) network, will face a new challenge of access authentication. In this paper, we propose a group based authentication and key agreement protocol for machine type communications combining Elliptic Curve based Diffie-Hellman (ECDH) on the Extensible Authentication Protocol (EAP). Compared to EAP-AKA and other existing authentication protocols, our solution provides increased security against various malicious activities and better performance in terms of signaling overhead, bandwidth consumption and transmission cost.

scholarly journals Event-Driven Source Traffic Prediction in Machine-Type Communications Using LSTM Networks

2020 ◽  
Author(s):  
Thulitha Senevirathna ◽  
Bathiya Thennakoon ◽  
Tharindu Sankalpa ◽  
Chatura Seneviratne ◽  
Samad Ali ◽  
...  
Keyword(s):  
Traffic Prediction ◽  
Machine Type ◽  
Machine Type Communications ◽  
Event Driven

scholarly journals Autonomous Power Decision for the Grant Free Access MUSA Scheme in the mMTC Scenario

Sensors ◽  
2020 ◽  
Vol 21 (1) ◽  
pp. 116
Author(s):  
Wissal Ben Ameur ◽  
Philippe Mary ◽  
Jean-François Hélard ◽  
Marion Dumay ◽  
Jean Schwoerer
Keyword(s):  
Interference Cancellation ◽  
Error Propagation ◽  
Multiple Access ◽  
Transmission Rate ◽  
Free Access ◽  
Decoding Complexity ◽  
Machine Type ◽  
Machine Type Communications ◽  
Multiple Access Schemes ◽  
Lower Complexity

Non-orthogonal multiple access schemes with grant free access have been recently highlighted as a prominent solution to meet the stringent requirements of massive machine-type communications (mMTCs). In particular, the multi-user shared access (MUSA) scheme has shown great potential to grant free access to the available resources. For the sake of simplicity, MUSA is generally conducted with the successive interference cancellation (SIC) receiver, which offers a low decoding complexity. However, this family of receivers requires sufficiently diversified received user powers in order to ensure the best performance and avoid the error propagation phenomenon. The power allocation has been considered as a complicated issue especially for a decentralized decision with a minimum signaling overhead. In this paper, we propose a novel algorithm for an autonomous power decision with a minimal overhead based on a tight approximation of the bit error probability (BEP) while considering the error propagation phenomenon. We investigate the efficiency of multi-armed bandit (MAB) approaches for this problem in two different reward scenarios: (i) in Scenario 1, each user reward only informs about whether its own packet was successfully transmitted or not; (ii) in Scenario 2, each user reward may carry information about the other interfering user packets. The performances of the proposed algorithm and the MAB techniques are compared in terms of the successful transmission rate. The simulation results prove that the MAB algorithms show a better performance in the second scenario compared to the first one. However, in both scenarios, the proposed algorithm outperforms the MAB techniques with a lower complexity at user equipment.

Enhanced Random Access for Massive Machine Type Communications

2020 ◽  
pp. 1-1
Author(s):  
Byung-Hyun Lee ◽  
Hyun-Suk Lee ◽  
Seokjae Moon ◽  
Jang-Won Lee
Keyword(s):  
Random Access ◽  
Machine Type ◽  
Machine Type Communications
Sign in / Sign up

Export Citation Format

Share Document