Mohammed Abd-Elnaby^*

CMC-Computers, Materials & Continua, Vol.69, No.1, pp. 521-537, 2021, DOI:10.32604/cmc.2021.018351

Abstract Non-orthogonal multiple access (NOMA) is one of the leading technologies for 5G communication. User pairing (UP) and power allocation (PA) are the key controlling mechanisms for the optimization of the performance of NOMA systems. This paper presents a novel UP and PA (UPPA) technique for capacity and fairness maximization in NOMA called (CFM-UPPA). The impact of the power allocation coefficient and the ratio between the channel gains of the paired users on the sum-rate capacity and the fairness in NOMA is firstly investigated. Then, based on this investigation, the PA and UP algorithms of the… More >

Vankamamidi S. Naresh^1,∗, Sivaranjani Reddi²

Computer Systems Science and Engineering, Vol.35, No.6, pp. 457-465, 2020, DOI:10.32604/csse.2020.35.457

Abstract Multiparty Key Agreement (MKA) is the backbone for secure multiparty communication. Although numerous efficient MKA-cryptosystems are available in the classical field, their security relies on the assumption that some computational issues are infeasible. To overcome this dependency, a new area, quantum cryptography, evolves to support key agreement among two or more participants securely. In this paper, first, we present a two-part quantum key agreement with Strong Fairness Property (SFP) and extends it to a Multiparty Quantum Key Agreement (MQKA) protocol. In the first round of proposed MQKA, a participant will act as a group controller… More >

Jianzhong Li¹, DexiangMei¹, Dong Deng¹, Imran Khan², Peerapong Uthansakul^{3, *}

CMC-Computers, Materials & Continua, Vol.65, No.2, pp. 1571-1590, 2020, DOI:10.32604/cmc.2020.011822

Abstract Non-orthogonal multiple access (NOMA) is one of the key 5G technology which can improve spectrum efficiency and increase the number of user connections by utilizing the resources in a non-orthogonal manner. NOMA allows multiple terminals to share the same resource unit at the same time. The receiver usually needs to configure successive interference cancellation (SIC). The receiver eliminates co-channel interference (CCI) between users and it can significantly improve the system throughput. In order to meet the demands of users and improve fairness among them, this paper proposes a new power allocation scheme. The objective is More >

Jin Han¹, Wenhao Jiang¹, Jin Shi^{2, *}, Sun Xin², Jin Peng², Haibo Liu³

CMC-Computers, Materials & Continua, Vol.64, No.2, pp. 1171-1184, 2020, DOI:10.32604/cmc.2019.07447

Abstract The assessment of the fairness of health resource allocation is an important part of the study for the fairness of social development. The data used in most of the existing assessment methods comes from statistical yearbooks or field survey sampling. These statistics are generally based on administrative areas and are difficult to support a fine-grained evaluation model. In response to these problems, the evaluation method proposed in this paper is based on the query statistics of the geographic grid of the target area, which are more accurate and efficient. Based on the query statistics of… More >

Zhou Feng, Xue Weilian^*

Computer Systems Science and Engineering, Vol.33, No.4, pp. 275-286, 2018, DOI:10.32604/csse.2018.33.275

Abstract The fireworks algorithm features a small number of parameters, remarkable optimization ability, and resistance to a local optimum. Based on the graph coloring model, the fireworks algorithm is introduced for the first time to solve the spectrum allocation problem for cognitive radio networks, thus maximizing utility and fairness of spectrum allocation. Two-layer binary coding is adopted for individual fireworks. The first layer refers to the coding of cognitive users used to determine channels that can be connected with the user. The second layer refers to the auxiliary coding of channels responsible for addressing mutual interference More >

En Zhang^1,2, Xintao Duan^1,2, Siuming Yiu³, Junbin Fang⁴, Zoe L. Jiang^5,*, Tsz HonYuen⁶, Jie Peng¹

CMC-Computers, Materials & Continua, Vol.56, No.3, pp. 401-414, 2018, DOI:10.3970/cmc.2018.03733

Abstract In the setting of (t, n) threshold secret sharing, at least t parties can reconstruct the secret, and fewer than t parties learn nothing about the secret. However, to achieve fairness, the existing secret sharing schemes either assume a trusted party exists or require running multi-round, which is not practical in a real application. In addition, the cost of verification grows dramatically with the number of participants and the communication complexity is O(t), if there is not a trusted combiner in the reconstruction phase. In this work, we propose a fair server-aided multi-secret sharing scheme for weak… More >