Bibliographies thématiques / User pairing algorithms

Sommaire

Articles de revues
Thèses
Chapitres de livres
Actes de conférences

Littérature scientifique sur le sujet « User pairing algorithms »

Auteur : Grafiati

Publié le 1 mars 2025

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « User pairing algorithms ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "User pairing algorithms"

Narottama, Bhaskara, Denny Kusuma Hendraningrat et Soo Young Shin. « Quantum-inspired evolutionary algorithms for NOMA user pairing ». ICT Express 8, n^o 1 (mars 2022) : 11–17. http://dx.doi.org/10.1016/j.icte.2022.01.014.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

El-ghorab, Mahmoud Ahmed, Mohamed Rihan El-meligy, Mohamed Mostafa Ibrahim et Fatma Newagy. « Energy-Efficient User Pairing for Downlink NOMA in Massive MIMO Networks ». Applied Sciences 12, n^o 11 (27 mai 2022) : 5421. http://dx.doi.org/10.3390/app12115421.

Texte intégral

Résumé :

The motivations for deploying energy and spectral-efficient network architectures are the high energy consumption and the need for more spectral resources in modern cellular networks. The key method to solve the energy efficiency EE maximization problem of the downlink non-orthogonal multiple access (NOMA)-based massive MIMO system is to decouple it into user pairing and efficient power allocation problems. This work studies the performance of three main pairing methods in NOMA-based networks: Hungarian, Gale–Shapley, and correlation-based approaches. Firstly, we provide a mathematical analysis for EE of downlink NOMA in a massive MIMO system for the non-line of sight (NLoS) channel model with perfect successive interference cancellation (SIC). Finally, the sequential convex programming (SCP) approach is used to tackle the power allocation problem. Simulation results show that the Hungarian algorithm for pairing plus SCP for power allocation (Hungarian algorithm-SCP) achieves the highest energy efficiency among all the three pairing algorithms with an identical performance to joint user and resource block association with power allocation (joint user-RB PA) algorithm but with much lower computational complexity and outperforms the NOMA SCP greedy algorithm (NOMA-SCP-GA).

Styles APA, Harvard, Vancouver, ISO, etc.

Ibrahim, Hesham S., Mohamed Abaza, Ali Mansour et Ayman Alfalou. « Performance Analysis of Power Allocation and User-Pairing Techniques for MIMO-NOMA in VLC Systems ». Photonics 11, n^o 3 (25 février 2024) : 206. http://dx.doi.org/10.3390/photonics11030206.

Texte intégral

Résumé :

In this paper, we evaluate the performance of multiple-input multiple-output (MIMO) communication systems applied with a non-orthogonal multiple access (NOMA)-based indoor visible light communication (VLC). We present two efficient user-pairing algorithms for NOMA in VLC, aiming to enhance achievable data rates effectively. Our investigation involves the application of three low-complexity power allocation techniques. Comparative analysis reveals performance enhancements when employing the proposed schemes, especially when contrasted with NOMA without user pairing and orthogonal frequency division multiple access (OFDMA). Additionally, we explore the performance of both algorithms in scenarios with both even and odd numbers of users. Simulation results demonstrate the superiority of NOMA in comparison to OFDMA.

Styles APA, Harvard, Vancouver, ISO, etc.

Wu, Jiang, Leyang Sun et Yubo Jia. « User Pairing and Power Allocation for NOMA-CoMP Based on Rate Prediction ». Information 13, n^o 4 (15 avril 2022) : 200. http://dx.doi.org/10.3390/info13040200.

Texte intégral

Résumé :

In this paper, we consider a non-orthogonal multiple access (NOMA) system with coordinated multi-point (CoMP), which is used in 5G cellular networks to guarantee the rate requirements from the different edge users. Based on the China Family Panel Studies (CFPS) dataset, we use several learning algorithms to predict users’ rate requirements according to their profiles. We propose a many-to-many two-side subchannel–user matching strategy, which can classify users into cell-center users, high-rate requirement edge users, and low-rate requirement edge users based on their status and learning prediction results, and pair users with different subchannels to form joint transmission CoMP (JT-CoMP) subchannels and dynamic point selection CoMP (DPS-CoMP) subchannels. Furthermore, a discrete power allocation algorithm based on group search is proposed. Simulation results show that our proposed algorithm outperforms the traditional NOMA-CoMP algorithm and maximum throughput (MT) NOMA-CoMP algorithm. It maximizes the rate of high-rate requirement edge users while guaranteeing user fairness.

Styles APA, Harvard, Vancouver, ISO, etc.

Ma, Lizhi, Guangyu Liu et Shuo Liu. « Design of Pairing Mechanisms for the Device-to-Device Communication System ». Journal of Physics : Conference Series 2537, n^o 1 (1 juin 2023) : 012017. http://dx.doi.org/10.1088/1742-6596/2537/1/012017.

Texte intégral

Résumé :

Abstract The potential of device-to-device (D2D) communication lies in improving system performance and user experience. Thus, D2D communication is widely concerned. For the D2D communication system, this work investigates the D2D pairing problem to maximize the sum rate of all D2D pairs. To comprehensively compare the performance of different algorithms, three pairing mechanisms are proposed based on the graph theory and the matching theory. The simulation results show the impact of the network scale on the optimized results. And for small and large network scales, the Hungary algorithm and the minimum distance matching algorithm are selected as the D2D pairing mechanism, respectively.

Styles APA, Harvard, Vancouver, ISO, etc.

Annadurai, Soorya, et Bhargav J. Bhatkalkar. « Secure Multiparty Device Pairing Using Random Peephole Generations ». Journal of Computational and Theoretical Nanoscience 17, n^o 1 (1 janvier 2020) : 216–21. http://dx.doi.org/10.1166/jctn.2020.8653.

Texte intégral

Résumé :

A secure device pairing mechanism is used to establish a trusted communication channel between unassociated wireless devices. The broadcast nature of wireless communication opens the door for man-in-the-middle (MITM) attacks, and even other subtle forms of masquerader and misfeasor attacks. This paper introduces a simple device pairing approach to tackle such attacks seamlessly. The algorithm is compatible with a multitude of devices, whereas a majority of existing algorithms are based on two devices exclusively. This approach utilizes a human visual channel as an Out-Of-Band (OOB) channel to authenticate the public keys exchanged between the devices. The interactive nature of this approach forces user attention, hence improving the reliability and consistency of the device pairing process. To do so, we introduce the concept of ‘peepholes,’ and mathematically define it before demonstrating the algorithm’s methodology. Subsequent sections also demonstrate its robustness against attacks via misfeasors, masqueraders, and men-in-the-middle.

Styles APA, Harvard, Vancouver, ISO, etc.

Wang, Xinshui, Ke Meng, Xu Wang, Zhibin Liu et Yuefeng Ma. « Dynamic User Resource Allocation for Downlink Multicarrier NOMA with an Actor–Critic Method ». Energies 16, n^o 7 (24 mars 2023) : 2984. http://dx.doi.org/10.3390/en16072984.

Texte intégral

Résumé :

Future wireless communication systems require higher performance requirements. Based on this, we study the combinatorial optimization problem of power allocation and dynamic user pairing in a downlink multicarrier non-orthogonal multiple-access (NOMA) system scenario, aiming at maximizing the user sum rate of the overall system. Due to the complex coupling of variables, it is difficult and time-consuming to obtain an optimal solution, making engineering impractical. To circumvent the difficulties and obtain a sub-optimal solution, we decompose this optimization problem into two sub-problems. First, a closed-form expression for the optimal power allocation scheme is obtained for a given subchannel allocation. Then, we provide the optimal user-pairing scheme using the actor–critic (AC) algorithm. As a promising approach to solving the exhaustive problem, deep-reinforcement learning (DRL) possesses higher learning ability and better self-adaptive capability than traditional optimization methods. Simulation results have demonstrated that our method has significant advantages over traditional methods and other deep-learning algorithms, and effectively improves the communication performance of NOMA transmission to some extent.

Styles APA, Harvard, Vancouver, ISO, etc.

Chandrasekaran, Balaji, et Ramadoss Balakrishnan. « An Efficient Tate Pairing Algorithm for a Decentralized Key-Policy Attribute Based Encryption Scheme in Cloud Environments ». Cryptography 2, n^o 3 (15 juillet 2018) : 14. http://dx.doi.org/10.3390/cryptography2030014.

Texte intégral

Résumé :

Attribute-based encryption (ABE) is used for achieving data confidentiality and access control in cloud environments. Most often ABE schemes are constructed using bilinear pairing which has a higher computational complexity, making algorithms inefficient to some extent. The motivation of this paper is on achieving user privacy during the interaction with attribute authorities by improving the efficiency of ABE schemes in terms of computational complexity. As a result the aim of this paper is two-fold; firstly, to propose an efficient Tate pairing algorithm based on multi-base number representation system using point halving (TP-MBNR-PH) with bases 1/2, 3, and 5 to reduce the cost of bilinear pairing operations and, secondly, the TP-MBNR-PH algorithm is applied in decentralized KP-ABE to compare its computational costs for encryption and decryption with existing schemes.

Styles APA, Harvard, Vancouver, ISO, etc.

Zhao, Zhixin, Dong Wang, Hongwei Zhang et Haitao Sang. « Joint User Pairing and Power Allocation Scheme Based on Transmission Mode Switching between NOMA-Based Maximum Ratio Transmission and MMSE Beamforming in Downlink MISO Systems ». Mobile Information Systems 2021 (9 mars 2021) : 1–21. http://dx.doi.org/10.1155/2021/6671371.

Texte intégral

Résumé :

This paper investigates the design of the joint user pairing and power allocation scheme with transmission mode switching (TMS) in downlink multiple-input-single-output (MISO) systems. Firstly, the closed-form expressions of the boundary of achievable rate region of two candidate transmission modes, i.e., non-orthogonal multiple access based maximum ratio transmission (NOMA-MRT) and minimum mean square error beamforming (MMSE-BF), are obtained. By obtaining the outer boundary of the union of the achievable rate regions of the two transmission modes, an adaptive switching method is developed to achieve a larger rate region. Secondly, based on the idea that the solution to the problem of weighted sum rate (WSR) optimization must be on the boundary of the achievable rate region, the optimal solutions to the problem of WSR optimization for NOMA-MRT and MMSE-BF are obtained for the two-user case, respectively. Subsequently, by exploiting the aforementioned optimal solutions for two transmission modes and the high efficiency of TMS, a suboptimal user pairing and power allocation algorithm (JUPA) is proposed to further improve the sum rate performance for the multiuser case. Compared with the exhaustive search-based user pairing and power allocation algorithm (ES-PPA), the proposed JUPA can enjoy a much lower computational complexity and only suffers a slight sum rate performance loss, and it outperforms other traditional schemes. Finally, numerical results are provided to validate the analyses and the proposed algorithms.

Styles APA, Harvard, Vancouver, ISO, etc.

Yu, Zhihao, et Jia Hou. « Research on Interference Coordination Optimization Strategy for User Fairness in NOMA Heterogeneous Networks ». Electronics 11, n^o 11 (26 mai 2022) : 1700. http://dx.doi.org/10.3390/electronics11111700.

Texte intégral

Résumé :

In order to comprehensively improve the performance of edge users in heterogeneous cellular networks and the fairness of network users, a downlink interference coordination optimization strategy in heterogeneous cellular networks with non-orthogonal multiple access (NOMA) based on the cell range expansion (CRE) and the almost blank subframe (ABS) technology is proposed. Different from the traditional interference coordination strategy, a NOMA user pairing scheme combined with ABS technology and a dynamic NOMA power allocation scheme are designed to maximize the network fairness based on the optimized throughput of the edge users. The simulation results show that the proposed optimization strategy can balance the performance of network users more effectively to improve the throughput of edge users and network fairness than other NOMA user pairing and power allocation algorithms without the complexity being increased.

Styles APA, Harvard, Vancouver, ISO, etc.

Plus de sources

Thèses sur le sujet "User pairing algorithms"

Badran, Ibrahim Hesham Sadat. « Enhancement of Optical Wireless Communications Using Hybrid and Multiple Access Techniques ». Electronic Thesis or Diss., Brest, École nationale supérieure de techniques avancées Bretagne, 2024. http://www.theses.fr/2024ENTA0010.

Texte intégral

Résumé :

La communication par lumière visible (VLC) est une technologie prometteuse pour la connectivité sans fil en intérieur, offrant une transmission de données à haute vitesse tout en atténuant la congestion du spectre. Cette thèse explore l’intégration de l’accès multiple nonorthogonal (NOMA) et des techniques à entrées multiples et sorties multiples (MIMO) pour améliorer l’efficacité des systèmes VLC. Nous examinons différentes techniques d’allocation de puissance, notamment l’allocation de puissance fixe (FPA), selon le ratio de gain (GRPA) et selon la différence de gain normalisée (NGDPA), afin d’optimiser la répartition des ressources entre les utilisateurs. Divers algorithmes de couplage d’utilisateurs, tels que l’algorithme de couplage à différence la plus proche (NLUPA) et celui de la différence de gain uniforme (UCGD), sont également étudiés. Le débit total réalisable dans des scénarios avec un nombre pair et impair d’utilisateurs est évalué et comparé aux performances du NOMA sans couplage et de l’OFDMA. De plus, l’analyse du taux d’erreur binaire (BER) est réalisée sous différentes techniques de diversité (SC, EGC, MRC). Nous dérivons également une expression analytique du BER pour un nombre arbitraire d’utilisateurs, fournissant des informations précieuses sur les performances des systèmes NOMA-MIMO-VLC
Visible light communication (VLC) is a promising technology for indoor wireless connectivity, offering high-speed data transmission and alleviating spectrum congestion. This thesis explores the integration of non-orthogonal multiple access (NOMA) and multiple-input multiple-output (MIMO) techniques to improve VLC system efficiency. We investigate various power allocation techniques, including fixed power allocation (FPA), gain ratio power allocation (GRPA), and normalized gain difference power allocation (NGDPA), to enhance resource distribution among users. Different user pairing algorithms, such as next-largest difference user-pairing algorithm (NLUPA) and uniform channel gain difference (UCGD), are also examined. The achievable sum rate for NOMAMIMO-VLC systems is analyzed in scenarios with even and odd user numbers, and results are compared with NOMA without pairing and orthogonal frequency division multiple access (OFDMA). Furthermore, we assess the bit error rate (BER) performance under diversity techniques, such as selection combining (SC), equal gain combining (EGC), and maximum ratio combining (MRC). Finally, we derive an analytic expression for BER for an arbitrary number of users. Overall, our comprehensive study provides valuable insights into NOMA-MIMO-VLC systems for indoor wireless communication

Styles APA, Harvard, Vancouver, ISO, etc.

Shin, Shan-De, et 施善得. « A Low-Complexity Gram-Schmidt Pairing Algorithm for Multi-Cell Multi-User MIMO Systems ». Thesis, 2014. http://ndltd.ncl.edu.tw/handle/p4apxt.

Texte intégral

Résumé :

碩士
國立中正大學
通訊工程研究所
102
Since the radio spectrum is a finite and precious resource, the resource allocation for multi-user MIMO (MU-MIMO) wireless networks is an important problem. Cooperative multiple point transmission / reception (CoMP) has been proposed as an approach to improve the cell-edge throughput. Due to the fact that each base station may have multiple users located at the cell-edge. We propose low complexity user pairing strategies for MU-MIMO downlink scenario. The goal of the sum rate pairing strategy is to select two users which having the maximum sum of data rate in certain frequency resources to enhance system throughput. This problem has been shown to be an NP-hard problem, since for any given users, to find the optimum precoding matrices with maximal throughput is essentially an NP-hard problem. Therefore, we attempt to design a low-complexity algorithm to find an appropriate pair of users between two BSs that can be served using the same resource blocks (RBs). In this thesis, we proposed a low-complexity pairing algorithm called Gram-Schmidt pairing algorithm.The algorithm selects the user pair with maximum product of eigenvalues of signal channel multiplied by the orthogonal projection matrix of interference channel. Simulation results show that Gram-Schmidt pairing algorithm achieves performance that is close to the sum rate pairing algorithm.

Styles APA, Harvard, Vancouver, ISO, etc.

Haung, Feng-Ru, et 黃鳳汝. « User Pairing Algorithm for Coordinated Scheduling with Beam-forming in Multi-Cell MIMO system ». Thesis, 2011. http://ndltd.ncl.edu.tw/handle/91561264145871654490.

Texte intégral

Résumé :

碩士
國立中正大學
通訊工程研究所
99
Cooperative multiple point transmission / reception (CoMP) have been proposed as an approach to improve the cell-edge throughput. The fact is that each base station may have multiple users located at the cell-edge. In this thesis, we consider a cooperative serving strategy between two base stations (BSs) with precoding. We observed that finding users with precoding that maximize the throughput is a combinatorial optimization problem. This problem has been shown to be an NP-hard problem, since for any given users, to find the optimum precoding matrices with maximal throughput is essentially an NP-hard problem. Therefore, we attempt to design a low-complexity algorithm to find an appropriate pair of users between two BSs that can be served using the same resource blocks (RBs). In the proposed scheme, the pairing problem and the design of precoding matrix are treated separately, which makes the problem easier. Simulation results show that the proposed algorithm achieves a good performance with much lower complexity.

Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "User pairing algorithms"

Sreenu, Sunkaraboina, et Kalpana Naidu. « Modified Hungarian Algorithm-Based User Pairing with Optimal Power Allocation in NOMA Systems ». Dans Proceedings of the International Conference on Paradigms of Computing, Communication and Data Sciences, 21–33. Singapore : Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-8742-7_3.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Chervyakov, Nikolay Ivanovich, Mikhail Grigorevich Babenko, Nikolay Nikolaevich Kucherov, Viktor Andreevich Kuchukov et Maria Nikolaevna Shabalina. « Researches of Algorithm of PRNG on the Basis of Bilinear Pairing on Points of an Elliptic Curve with Use of a Neural Network ». Dans Proceedings of the Second International Afro-European Conference for Industrial Advancement AECIA 2015, 167–73. Cham : Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-29504-6_17.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Soykan, Bülent, et Serpil Erol. « An Optimization-Based Decision Support Framework for Robust Airline Crew Pairing Process ». Dans Advances in Civil and Industrial Engineering, 1–35. IGI Global, 2016. http://dx.doi.org/10.4018/978-1-4666-8648-9.ch001.

Texte intégral

Résumé :

Robust airline crew pairing process refers to the procedure of constructing anonymous crew pairings to cover the given flight schedule in near-optimal way that is less prone to disruptions or easier to recover once disrupted. This process has to deal with complicated specifications of inputs and satisfy a number of different and often conflicting constraints. Also user inputs are often needed in several points in the process to obtain high quality and timely solutions. This chapter presents a model-driven Decision Support Framework (DSF) which utilizes an optimization algorithm that generates robust crew schedules and a simulation model that evaluates the schedules in terms of their robustness quality. The presented DSF can primarily assist airline crew schedule planners, who have to spend a lot of time and effort creating crew schedules taking into account non-linear cost structure, various amounts of constraints that affect cost and flight safety. The proposed DSF can be used either as a standalone tool or as part of an integrated or enterprise-level DSS.

Styles APA, Harvard, Vancouver, ISO, etc.

Denno Peter, Dickerson Charles et Harding Jenny. « Production System Identification with Genetic Programming ». Dans Advances in Transdisciplinary Engineering. IOS Press, 2017. https://doi.org/10.3233/978-1-61499-792-4-227.

Texte intégral

Résumé :

Modern system-identification methodologies use artificial neural nets, integer linear programming, genetic algorithms, and swarm intelligence to discover system models. Pairing genetic programming, a variation of genetic algorithms, with Petri nets seems to offer an attractive, alternative means to discover system behaviour and structure. Yet to date, very little work has examined this pairing of technologies. Petri nets provide a grey-box model of the system, which is useful for verifying system behaviour and interpreting the meaning of operational data. Genetic programming promises a simple yet robust tool to search the space of candidate systems. Genetic programming is inherently highly parallel. This paper describes early experiences with genetic programming of Petri nets to discover the best interpretation of operational data. The systems studied are serial production lines with buffers.

Styles APA, Harvard, Vancouver, ISO, etc.

Balasubramanian, Kannan, et M. Rajakani. « Implementation of Algorithms for Identity Based Encryption and Decryption ». Dans Research Anthology on Blockchain Technology in Business, Healthcare, Education, and Government, 320–32. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-5351-0.ch019.

Texte intégral

Résumé :

Identity-based cryptosystems were introduced to overcome one of the main problems in public key encryption, the generation of public and private keys. In the identity-based cryptosystem, an identifier such as an e-mail address of a user can be used to generate public and private keys by a trusted third party. The trusted third party uses a system-wide master secret to provide private keys to a user. Identity-based cryptosystems can be constructed using the idea of pairings. This article discusses four different identity-based cryptosystems: the Boneh-Franklin scheme, the Cock's scheme, the Authenticated IBE scheme and the Hierarchical IBE scheme. This article also discusses the security notions considered for the identity-based cryptosystem. The security notions considered are: one-wayness, indistinguishability, semantic security and non-malleability. An architecture consisting of a public parameter server and private key generator for the implementation of the identity-based cryptosystems is also discussed.

Styles APA, Harvard, Vancouver, ISO, etc.

Balasubramanian, Kannan, et M. Rajakani. « Implementation of Algorithms for Identity Based Encryption and Decryption ». Dans Research Anthology on Artificial Intelligence Applications in Security, 315–27. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-7705-9.ch015.

Texte intégral

Résumé :

Styles APA, Harvard, Vancouver, ISO, etc.

Texte intégral

Résumé :

Styles APA, Harvard, Vancouver, ISO, etc.

Sriram, Siddharth. « A Method Based on Machine Learning to Classify Text for the Field of Cybersecurity ». Dans Demystifying Emerging Trends in Machine Learning, 1–12. BENTHAM SCIENCE PUBLISHERS, 2025. https://doi.org/10.2174/9789815305395125020003.

Texte intégral

Résumé :

Rapid advancements in networks and computer systems have opened a new door for immoral acts like cybercrime, which threaten public safety, and security, as well as the global economy. The purpose of this proposal is to analyse IP fraud and cyberbullying as two distinct types of cybercrime. The primary goals of this study are to use instances of cybercrime to provide a short examination of cybercrime activities, and the family member principles, and propose a pairing schema. Using the Naive Bayes (NB) & Support Vector Machine (SVM) artificial intelligence techniques, cybercrime instances are categorised according to their ideal qualities. The Twitter data in the Kaggle database has been clustered using K-means. User ID, sign-up date, referral, browser, gender, and age as well as IP address are just a few of the most useful information used to educate the computer. Total 151,113 datasets were used for experimental analysis of the suggested algorithm's performance. The accuracy of the suggested approach, 97%, is higher than that of the current method (NB). The challenge of regression may be easily surmounted with the use of the random forest method for the categorization of the resultant cybercrimes. The planned study uses age categories as the foundation for identifying the different offenses.

Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "User pairing algorithms"

Dhakal, Sagar, et JoonBeom Kim. « Statistical analysis of user-pairing algorithms in virtual MIMO systems ». Dans 2010 Wireless Telecommunications Symposium (WTS 2010). IEEE, 2010. http://dx.doi.org/10.1109/wts.2010.5479641.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Zhang, Xiaozhou, Tsung-Hui Chang, Ya-Feng Liu, Chao Shen et Gang Zhu. « Uplink and downlink user pairing in full-duplex multi-user systems : Complexity and algorithms ». Dans 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2017. http://dx.doi.org/10.1109/icassp.2017.7952833.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Choi, Hyun-Ho. « On the design of user pairing algorithms in full duplexing wireless cellular networks ». Dans 2014 International Conference on Information and Communication Technology Convergence (ICTC). IEEE, 2014. http://dx.doi.org/10.1109/ictc.2014.6983189.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Katta, Kanchana, Ramesh Ch Mishra et Kuntal Deka. « Optimal user pairing using the shortest path algorithm ». Dans 2021 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS). IEEE, 2021. http://dx.doi.org/10.1109/ants52808.2021.9937012.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Xiang, Qiwei, Yau Hee Kho, Winston K. G. Seah, Yue Tian, Rui Fang et Peng Huang. « Quantum Approximate Optimization Algorithm for PD-NOMA User Pairing ». Dans ICC 2023 - IEEE International Conference on Communications. IEEE, 2023. http://dx.doi.org/10.1109/icc45041.2023.10279755.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Wang, Jie, et Chen Xu. « A Novel User Pairing Algorithm for Lte Femtocell Uplink ». Dans International Conference on Advances in Computer Science and Engineering. Paris, France : Atlantis Press, 2013. http://dx.doi.org/10.2991/cse.2013.29.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Chai, Xiaomeng, Siyu Zhang, Tianyu Zhang et Zhongshan Zhang. « A User-Pairing Power Control Algorithm in Two-Tier HetNet ». Dans 2015 IEEE 81st Vehicular Technology Conference (VTC Spring). IEEE, 2015. http://dx.doi.org/10.1109/vtcspring.2015.7145658.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Zhang, Han, De-Kun Zhang, Wei-Xiao Meng et Cheng Li. « User pairing algorithm with SIC in non-orthogonal multiple access system ». Dans ICC 2016 - 2016 IEEE International Conference on Communications. IEEE, 2016. http://dx.doi.org/10.1109/icc.2016.7511620.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Lv, Wenyi, Yu Zeng, Tiecheng Song, Tianheng Xu et Honglin Hu. « Stable and Proportional Fair User Pairing Algorithm for D2D-Relay Systems ». Dans GLOBECOM 2018 - 2018 IEEE Global Communications Conference. IEEE, 2018. http://dx.doi.org/10.1109/glocom.2018.8647902.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Zheng, Jianbin, Zhifeng Huang, Hui Song et Zhikai Liu. « A D2D User Pairing Algorithm Combining Motion Prediction and Dynamic Transmit Power ». Dans 2021 IEEE 21st International Conference on Communication Technology (ICCT). IEEE, 2021. http://dx.doi.org/10.1109/icct52962.2021.9657970.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!