Message Delay Analysis for Polling and Token Multiple-Access Schemes for Local Communication Networks

1983 ◽  
Vol 1 (5) ◽  
pp. 935-947 ◽  
Author(s):  
I. Rubin ◽  
L. De Moraes
Author(s):  
Aasheesh Shukla ◽  
◽  
Manish Kumar ◽  
Vinay Kumar Deolia ◽  
◽  
...  

Future communication networks may encounter various issues in order to facilitate heavy heterogeneous data traffic and large number of users, therefore more advanced multiple access (MA) schemes are being developed to meet the changing requirements. The research space on making more robust MA scheme is continuously increasing, so it becomes significant to analyze the various schemes to determine the appropriate MA scheme for 5G networks. Therefore, in this paper the comprehensive overview of the most popular and recent MA schemes is presented for 5G networks. This paper mainly classifies the MA techniques in orthogonal MA (OMA) and various types of non-OMA (NOMA) techniques. Specifically, we introduce RSMA (Rate splitting multiple access) and IDMA (interleave division multiple access). Further the close attention is paid to NOMA family, including code-domain NOMA (e.g., SCMA (sparse code multiple access)), power-domain NOMA. Above all, from this exploration, the opportunities and challenges could be notified in MA schemes and further the optimum MA technique can be point out among discussed MA schemes for 5G and beyond communication networks.


PLoS ONE ◽  
2021 ◽  
Vol 16 (3) ◽  
pp. e0248271
Author(s):  
Qiang He ◽  
Zheng Xiang ◽  
Peng Ren

With the development of the economy and technology, people’s requirement for communication is also increasing. Satellite communication networks have been paid more and more attention because of their broadband service capability and wide coverage. In this paper, we investigate the scheme of convolutional long short term memory (CLSTM) network and transfer learning (TL) based combined free/demand assignment multiple access (CFDAMA) scheme (CFDAMA-CLSTMTL), which is a new multiple access scheme in the satellite communication networks. Generally, there is a delay time T between sending a request from the user to the satellite and receiving a reply from the satellite. So far, the traditional multiple access schemes have not processed the data generated in this period. So, in order to transmit the data in time, we propose a new prediction method CLSTMTL, which can be used to predict the data generated in this period. We introduce the prediction method into the CFDAMA scheme so that it can reduce data accumulation by the way of sending the slots request which is the sum of slots requested by the user and the predicted slots generated in the delay time. A comparison with CFDAMA-PA and CFDAMA-PB is provided through simulation results, which gives the effect of the CFDAMA-CLSTMTL in a satellite communication network.


Author(s):  
Mohamed A. Abd-Elmagid ◽  
Alessandro Biason ◽  
Tamer ElBatt ◽  
Karim G. Seddik ◽  
Michele Zorzi

1985 ◽  
Author(s):  
L. Georgiadis ◽  
L. Merakos ◽  
P. Papantoni-Kazakos

Sensors ◽  
2020 ◽  
Vol 21 (1) ◽  
pp. 116
Author(s):  
Wissal Ben Ameur ◽  
Philippe Mary ◽  
Jean-François Hélard ◽  
Marion Dumay ◽  
Jean Schwoerer

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.


Sign in / Sign up

Export Citation Format

Share Document