51 research outputs found

    ๋ฌด์„  ์ „๋ ฅ ํ†ต์‹  ๋„คํŠธ์›Œํฌ์—์„œ ํ•ฉํ†ต์‹ ๋Ÿ‰ ์ตœ๋Œ€ํ™” ๊ธฐ๋ฐ˜ ์ž์› ํ• ๋‹น ๊ธฐ๋ฒ•

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ (๋ฐ•์‚ฌ) -- ์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› : ๊ณต๊ณผ๋Œ€ํ•™ ์ „๊ธฐยท์ •๋ณด๊ณตํ•™๋ถ€, 2020. 8. ์ด์ •์šฐ.With the explosive growth of smart devices equipped with wireless communication, there have been numerous challenges to untangle for supporting user demands in the next generation of communication networks such as Internet of Things networks. One of prime concerns is to overcome the finite lifespan of networks due to the limited battery capacity. Wireless power transfer (WPT) has been considered as a promising solution for providing self-sustainability to energy-constrained networks. WPT enables users to charge their batteries by collecting energy from a radio-frequency signal transmitted by a dedicated energy source. As a framework to the design of wireless networks with WPT, a wireless powered communication network (WPCN) consisting of a hybrid access-point (H-AP) and multiple users has emerged. A H-AP serves users in a WPCN as a base station as well as delivers energy to users as a dedicated energy source. In a WPCN, users charge their batteries by WPT via downlink, and use the energy for uplink transmission. Due to the scarcity of resources, an efficient design is crucial to exploit the system. To support this, I explore system design and resource allocation for WPCNs, especially in the perspective of throughput performance. In addition, I aim to mitigate severe rate disparity which originates from the doubly near-far problem, an inherent characteristic of a WPCN. To begin with, I discuss a cooperative WPCN, in which a user with good channel condition relays information of a user with bad channel condition to enhance user fairness. The sum-throughput is maximized in the considered network subject to a set of quality of service (QoS) requirements. By analyzing the optimal solution, the conditions under which the WPCN benefits from the cooperation are characterized. Based on the new findings, I propose a novel resource allocation algorithm for sum-throughput maximization, which is helpful to practical use of user cooperation. Secondly, I discuss a multi-antenna WPCN where non-orthogonal multiple access (NOMA) transmission is employed in the uplink. To address issues regarding adopting NOMA, user clustering exploiting the multi-antenna system is further applied so that the number of users in a single NOMA transmission is reduced. To deal with the difficulty of jointly optimizing cluster-specific beamforming and time/energy resources for sum-throughput maximization, the beamforming is determined first, and then the resources are optimized for given beamforming. A novel algorithm for cluster-specific beamforming design followed by the sum-throughput maximization algorithm is proposed. Lastly, I consider a WPCN assisted by intelligent reflecting surface (IRS) which has recently received significant attention for its potential of enhancing wireless communication experience. By employing an IRS in a WPCN,users harvest extra energy, and the signal strength of each user can be elevated. For the considered system model, beamforming at the IRS and resources are optimized to maximize sum-throughput. In particular, both NOMA and orthogonal multiple access are considered for uplink transmission, and the performance comparison between the two multiple access schemes are presented.๋ฌด์„  ํ†ต์‹ ์ด ํƒ‘์žฌ๋œ ์Šค๋งˆํŠธ ๊ธฐ๊ธฐ์˜ ํญ๋ฐœ์ ์ธ ์„ฑ์žฅ์œผ๋กœ, ์‚ฌ๋ฌผ ์ธํ„ฐ๋„ท ๋„คํŠธ์›Œํฌ์™€ ๊ฐ™์€ ์ฐจ์„ธ๋Œ€ ํ†ต์‹  ๋„คํŠธ์›Œํฌ์—์„œ ์š”๊ตฌํ•˜๋Š” ์„ฑ๋Šฅ์„ ์ถฉ์กฑํ•˜๊ธฐ ์œ„ํ•˜์—ฌ ํ•ด๊ฒฐํ•ด์•ผ ํ•  ์—ฌ๋Ÿฌ ๋ฌธ์ œ๊ฐ€ ๋ฐœ์ƒํ•˜์˜€๋‹ค. ์ฃผ์š” ๋ฌธ์ œ ์ค‘ ํ•˜๋‚˜๋Š” ๊ธฐ๊ธฐ์˜ ํ•œ์ •๋œ ๋ฐฐํ„ฐ๋ฆฌ ์šฉ๋Ÿ‰์œผ๋กœ ๋„คํŠธ์›Œํฌ๊ฐ€ ์ œํ•œ๋œ ์‹œ๊ฐ„ ๋™์•ˆ์—๋งŒ ๋™์ž‘ํ•  ์ˆ˜ ์žˆ๋Š” ๊ฒƒ์„ ๊ทน๋ณตํ•˜๋Š” ๊ฒƒ์ด๋‹ค. ๋ฌด์„  ์ „๋ ฅ ์ „์†ก์€ ์ด์™€ ๊ฐ™์ด ์—๋„ˆ์ง€๊ฐ€ ์ œํ•œ๋œ ๋„คํŠธ์›Œํฌ์— ์ž๊ธฐ ์ง€์†์„ฑ์„ ๋ถ€์—ฌํ•  ์ˆ˜ ์žˆ๋Š” ํ•ด๊ฒฐ ๋ฐฉ๋ฒ•์œผ๋กœ ๊ณ ๋ ค๋˜๊ณ  ์žˆ๋‹ค. ์‚ฌ์šฉ์ž๋“ค์€ ๋ฌด์„  ์ „๋ ฅ ์ „์†ก์„ ํ†ตํ•˜์—ฌ ์ „์šฉ ์—๋„ˆ์ง€์›์— ์˜ํ•ด ์ „์†ก๋˜๋Š” ๋ฌด์„  ์ฃผํŒŒ์ˆ˜ ์‹ ํ˜ธ๋กœ๋ถ€ํ„ฐ ์—๋„ˆ์ง€๋ฅผ ์ˆ˜์ง‘ํ•˜๊ณ  ๋ฐฐํ„ฐ๋ฆฌ๋ฅผ ์ถฉ์ „์‹œํ‚ฌ ์ˆ˜ ์žˆ๋‹ค. ๋ฌด์„  ์ „๋ ฅ ์ „์†ก์ด ๊ฐ€๋Šฅํ•œ ๋ฌด์„  ๋„คํŠธ์›Œํฌ๋ฅผ ์„ค๊ณ„ํ•˜๊ธฐ ์œ„ํ•œ ์ฒด๊ณ„๋กœ์„œ ๋ฌด์„  ์ „๋ ฅ ํ†ต์‹  ๋„คํŠธ์›Œํฌ(Wireless powered communication network, WPCN)๊ฐ€ ์ œ์•ˆ๋˜์—ˆ๋‹ค. WPCN์€ ๊ธฐ์ง€๊ตญ๊ณผ ์ „์šฉ ์—๋„ˆ์ง€์›์˜ ์—ญํ• ์„ ๊ฐ™์ด ํ•˜๋Š” hybrid access-point (H-AP)์™€ ์—ฌ๋Ÿฌ ์‚ฌ์šฉ์ž๋กœ ๊ตฌ์„ฑ๋œ๋‹ค. WPCN์—์„œ ์‚ฌ์šฉ์ž๋“ค์€ ํ•˜ํ–ฅ๋งํฌ๋ฅผ ํ†ตํ•˜์—ฌ ๋ฌด์„  ์ „๋ ฅ ์ „์†ก์œผ๋กœ ๋ฐฐํ„ฐ๋ฆฌ๋ฅผ ์ถฉ์ „์‹œํ‚ค๊ณ , ์ƒํ–ฅ๋งํฌ๋ฅผ ํ†ตํ•˜์—ฌ ํ•ด๋‹น ์—๋„ˆ์ง€๋กœ ์ •๋ณด๋ฅผ ์ „์†กํ•œ๋‹ค. ์ด ๋•Œ, ์ž์›์ด ๋ถ€์กฑํ•˜๋ฏ€๋กœ WPCN์˜ ์‹œ์Šคํ…œ์„ ํ™œ์šฉํ•˜๊ธฐ ์œ„ํ•ด์„œ๋Š” ํšจ์œจ์ ์ธ ์„ค๊ณ„๊ฐ€ ํ•„์ˆ˜์ ์ด๋‹ค. ์ด๋ฅผ ์œ„ํ•˜์—ฌ, ๋ณธ ๋…ผ๋ฌธ์—์„œ๋Š” WPCN์„ ์œ„ํ•œ ์‹œ์Šคํ…œ ์„ค๊ณ„์™€ ์ž์› ํ• ๋‹น์— ๋Œ€ํ•˜์—ฌ, ํŠนํžˆ ํ†ต์‹ ๋Ÿ‰ ๊ด€์ ์—์„œ ํƒ๊ตฌํ•˜๊ณ ์ž ํ•œ๋‹ค. ๋˜ํ•œ, WPCN์˜ ํŠน์ง•์ธ ์ด์ค‘ ๊ทผ๊ฑฐ๋ฆฌ ๋ฌธ์ œ์—์„œ ๋น„๋กฏ๋œ ๋†’์€ ์‚ฌ์šฉ์ž๊ฐ„ ์ „์†ก ์†๋„ ๊ฒฉ์ฐจ๋ฅผ ์™„ํ™”ํ•˜๊ณ ์ž ํ•œ๋‹ค. ์šฐ์„ , ํ˜‘๋ ฅ ๋ฌด์„  ์ „๋ ฅ ํ†ต์‹  ๋„คํŠธ์›Œํฌ์— ๋Œ€ํ•ด ๋…ผ์˜ํ•œ๋‹ค. ํ•ด๋‹น ๋„คํŠธ์›Œํฌ์—์„œ๋Š” ์ฑ„๋„ ์ƒํƒœ๊ฐ€ ์ข‹์€ ์‚ฌ์šฉ์ž๊ฐ€ ๊ทธ๋ ‡์ง€ ์•Š์€ ์‚ฌ์šฉ์ž์˜ ์ •๋ณด๋ฅผ ์ค‘๊ณ„ํ•˜์—ฌ ์‚ฌ์šฉ์ž ๊ณต์ •์„ฑ์„ ํ–ฅ์ƒ์‹œํ‚จ๋‹ค. ๊ณ ๋ คํ•˜๋Š” ์‹œ์Šคํ…œ ๋ชจ๋ธ์—์„œ ํ•ฉํ†ต์‹ ๋Ÿ‰์„ ์ตœ๋Œ€ํ™”ํ•˜๋Š” ๋ฐ ๊ฐ ์‚ฌ์šฉ์ž์˜ ์„œ๋น„์Šค ํ’ˆ์งˆ(Quality of service, QoS)์„ ๋ณด์žฅํ•˜๋„๋ก ํ•œ๋‹ค. ์œ„ ๋ฌธ์ œ์˜ ์ตœ์ ํ•ด๋ฅผ ๋ถ„์„ํ•˜์—ฌ, WPCN์ด ์‚ฌ์šฉ์ž ํ˜‘๋ ฅ ๊ธฐ๋ฒ•์„ ํ†ตํ•˜์—ฌ ์ด๋“์„ ์–ป๋Š” ์กฐ๊ฑด์„ ๋ฐํžˆ๊ณ , ์ด๋ฅผ ๊ธฐ๋ฐ˜์œผ๋กœ ์‚ฌ์šฉ์ž ํ˜‘๋ ฅ ๊ธฐ๋ฒ•์„ ์‹ค์šฉ์ ์œผ๋กœ ํ™œ์šฉํ•  ์ˆ˜ ์žˆ๋Š” ํ•ฉํ†ต์‹ ๋Ÿ‰ ์ตœ๋Œ€ํ™”๋ฅผ ์œ„ํ•œ ์ƒˆ๋กœ์šด ์ž์› ํ• ๋‹น ์•Œ๊ณ ๋ฆฌ์ฆ˜์„ ์ œ์•ˆํ•œ๋‹ค. ๋‹ค์Œ์œผ๋กœ, ์ƒํ–ฅ๋งํฌ์—์„œ ๋น„์ง๊ต ๋‹ค์ค‘ ์ ‘์†(Non-orthogonal multiple access, NOMA)์ด ์ ์šฉ๋œ ๋‹ค์ค‘ ์•ˆํ…Œ๋‚˜ WPCN์— ๋Œ€ํ•˜์—ฌ ๋…ผ์˜ํ•œ๋‹ค. NOMA๋ฅผ ํ™œ์šฉํ•˜๋Š” ๊ฒƒ๊ณผ ๊ด€๋ จ๋œ ์—ฌ๋Ÿฌ ๋ฌธ์ œ๋ฅผ ํ•ด๊ฒฐํ•˜๊ธฐ ์œ„ํ•˜์—ฌ, ๋‹ค์ค‘ ์•ˆํ…Œ๋‚˜ ์‹œ์Šคํ…œ์„ ์ด์šฉํ•œ ์‚ฌ์šฉ์ž ํด๋Ÿฌ์Šคํ„ฐ๋ง ๊ธฐ๋ฒ•์ด ์ถ”๊ฐ€๋กœ ์ ์šฉ๋˜๊ณ , ์ด์— ๋‹จ์ผ NOMA ์ „์†ก์˜ ์‚ฌ์šฉ์ž ์ˆ˜๊ฐ€ ๊ฐ์†Œํ•œ๋‹ค. ํ•ฉํ†ต์‹ ๋Ÿ‰ ์ตœ๋Œ€ํ™”๋ฅผ ์œ„ํ•˜์—ฌ ํด๋Ÿฌ์Šคํ„ฐ๋ณ„ ๋น”ํ˜•์„ฑ๊ณผ ์‹œ๊ฐ„ ๋ฐ ์—๋„ˆ์ง€ ์ž์›์„ ๊ณต๋™์œผ๋กœ ์ตœ์ ํ™”ํ•˜๋Š” ๊ฒƒ์ด ์–ด๋ ต๊ธฐ ๋•Œ๋ฌธ์—, ๋จผ์ € ๋น”ํ˜•์„ฑ์„ ์„ค๊ณ„ํ•œ ๋‹ค์Œ, ํ•ด๋‹น ๋น”ํ˜•์„ฑ์ด ์ ์šฉ๋œ ๋„คํŠธ์›Œํฌ์— ๋Œ€ํ•˜์—ฌ ์ž์›์„ ์ตœ์ ํ™”ํ•œ๋‹ค. ์ด์—, ํด๋Ÿฌ์Šคํ„ฐ๋ณ„ ๋น”ํ˜•์„ฑ ์„ค๊ณ„์™€ ํ•ฉํ†ต์‹ ๋Ÿ‰ ์ตœ๋Œ€ํ™”๋ฅผ ์œ„ํ•œ ์ƒˆ๋กœ์šด ์•Œ๊ณ ๋ฆฌ์ฆ˜์„ ์ œ์•ˆํ•œ๋‹ค. ๋งˆ์ง€๋ง‰์œผ๋กœ, ๋ฌด์„  ํ†ต์‹ ์˜ ์„ฑ๋Šฅ์„ ํ–ฅ์ƒ์‹œํ‚ฌ ํ›„๋ณด ๊ธฐ์ˆ  ์ค‘ ํ•˜๋‚˜์ธ ์ง€๋Šฅํ˜• ๋ฐ˜์‚ฌ ํ‘œ๋ฉด(Intelligent reflecting surface, IRS)์ด ๋„์ž…๋œ WPCN์„ ๊ณ ๋ คํ•œ๋‹ค. IRS๋ฅผ ๋„์ž…ํ•จ์œผ๋กœ์จ, ์‚ฌ์šฉ์ž๋“ค์€ ์ถ”๊ฐ€๋กœ ์—๋„ˆ์ง€๋ฅผ ์–ป์„ ์ˆ˜ ์žˆ์œผ๋ฉฐ ์‹ ํ˜ธ ์„ธ๊ธฐ๋ฅผ ๋†’์ผ ์ˆ˜ ์žˆ๋‹ค. ๊ณ ๋ ค๋œ ์‹œ์Šคํ…œ ๋ชจ๋ธ์˜ ํ•ฉํ†ต์‹ ๋Ÿ‰์„ ์ตœ๋Œ€ํ™”ํ•˜๋„๋ก IRS์˜ ๋น”ํ˜•์„ฑ๊ณผ ์ž์›์„ ์ตœ์ ํ™”ํ•œ๋‹ค. ํŠนํžˆ, ์ƒํ–ฅ๋งํฌ๋ฅผ ์œ„ํ•˜์—ฌ NOMA์™€ ์ง๊ต ๋‹ค์ค‘ ์ ‘์†์ด ๊ณ ๋ ค๋˜๊ณ , ๋‘ ๋‹ค์ค‘ ์ ‘์† ๊ธฐ๋ฒ•๊ฐ„์˜ ์„ฑ๋Šฅ ๋น„๊ต๊ฐ€ ์ด๋ฃจ์–ด์ง„๋‹ค.1 Introduction 1 1.1 Related Work 3 1.1.1 Wireless Powered Communication Networks 3 1.1.2 A NOMA-Based WPCN 4 1.2 Contributions and Organization 6 1.3 Notation 8 2 Wireless Powered Communication Networks with User Cooperation 9 2.1 Introduction 10 2.2 System model 14 2.3 Problem Formulation 18 2.4 Optimal Solution of QoS Constrained Sum-Throughput Maximization 21 2.4.1 Case (I): Positive z1, z21 and z22 25 2.4.2 Case (II): Positive z1 and z22, and undefinable z21 35 2.5 QoS Constrained Sum-Throughput Maximization Algorithm 40 2.5.1 Proposed Algorithm 41 2.5.2 Computational Complexity Comparison 42 2.6 Sum-Throughput Maximization with Processing Cost 46 2.7 Simulation Results 48 2.8 Conclusion 53 3 NOMA-Based Wireless Powered Communication Networks with User Clustering 56 3.1 Introduction 57 3.1.1 Throughput Maximization in WPCN 58 3.1.2 User Clustering in NOMA 59 3.1.3 Motivation and Contribution 60 3.2 System model 62 3.3 Optimal Beamforming And Resource Allocation 66 3.3.1 Beamforming Design 67 3.3.2 Sum-Throughput Maximization 69 3.3.3 TDMA-based WPCN with Cluster-specific Beamforming 76 3.4 Simulation Results 79 3.5 Conclusion 87 4 IRS-Assisted Wireless Powered Communication Networks: Comparison of NOMA and OMA 89 4.1 Introduction 90 4.2 System Model 91 4.2.1 NOMA-based WPCN 92 4.2.2 OMA-based WPCN 94 4.3 Sum-Throughput Maximization 94 4.3.1 NOMA-based WPCN with throughput constraints 95 4.3.2 OMA-based WPCN with throughput constraints 98 4.4 Simulation Results 99 4.5 Conclusion 102 5 Conclusion 106 5.1 Summary 106 5.2 Future directions 107 Abstract (In Korean) 117 ๊ฐ์‚ฌ์˜ ๊ธ€ 119Docto

    Extending Wireless Powered Communication Networks for Future Internet of Things

    Get PDF
    Energy limitation has always been a major concern for long-term operation of wireless networks. With today's exponential growth of wireless technologies and the rapid movement towards the so-called Internet of Things (IoT), the need for a reliable energy supply is more tangible than ever. Recently, energy harvesting has gained considerable attention in research communities as a sustainable solution for prolonging the lifetime of wireless networks. Beside conventional energy harvesting sources such as solar, wind, vibration, etc. harvesting energy from radio frequency (RF) signals has drawn significant research interest in recent years as a promising way to overcome the energy bottleneck. Lately, the integration of RF energy transfer with wireless communication networks has led to the emergence of an interesting research area, namely, wireless powered communication network (WPCN), where network users are powered by a hybrid access point (HAP) which transfers wireless energy to the users in addition to serving the functionalities of a conventional access point. The primary aim of this thesis is to extend the baseline model of WPCN to a dual-hop WPCN (DH-WPCN) in which a number of energy-limited relays are in charge of assisting the information exchange between energy-stable users and the HAP. Unlike most of the existing research in this area which has merely focused on designing methods and protocols for uplink communication, we study both uplink and downlink information transmission in the DH-WPCN. We investigate sum-throughput maximization problems in both directions and propose algorithms for optimizing the values of the related parameters. We also tackle the doubly near-far problem which occurs due to unequal distance of the relays from the HAP by proposing a fairness enhancement algorithm which guarantees throughput fairness among all users

    Wireless Information and Power Transfer in Communication Networks: Performance Analysis and Optimal Resource Allocation

    Get PDF
    Energy harvesting is considered as a prominent solution to supply the energy demand for low-power consuming devices and sensor nodes. This approach relinquishes the requirements of wired connections and regular battery replacements. This thesis analyzes the performance of energy harvesting communication networks under various operation protocols and multiple access schemes. Furthermore, since the radio frequency signal has energy, in addition to conveying information, it is also possible to power energy harvesting component while establishing data connectivity with information-decoding component. This leads to the concept of simultaneous wireless information and power transfer. The central goal of this thesis is to conduct a performance analysis in terms of throughput and energy e๏ฌƒciency, and determine optimal resource allocation strategies for wireless information and power transfer. In the ๏ฌrst part of the thesis, simultaneous transfer of information and power through wireless links to energy harvesting and information decoding components is studied considering ๏ฌnite alphabet inputs. The concept of non-uniform probability distribution is introduced for an arbitrary input, and mathematical formulations that relate probability distribution to the required harvested energy level are provided. In addition, impact of statistical quality of service (QoS) constraints on the overall performance is studied, and power control algorithms are provided. Next, power allocation strategies that maximize the system energy e๏ฌƒciency subject to peak power constraints are determined for fading multiple access channels. The impact of channel characteristics, circuit power consumption and peak power level on the node selection, i.e., activation of user equipment, and the corresponding optimal transmit power level are addressed. Initially, wireless information transfer only is considered and subsequently wireless power transfer is taken into account. Assuming energy harvesting components, two scenarios are addressed based on the receiver architecture, i.e, having separated antenna or common antenna for the information decoding and energy harvesting components. In both cases, optimal SWIPT power control policies are identi๏ฌed, and impact of the required harvested energy is analyzed. The second line of research in this thesis focuses on wireless-powered communication devices that operate based on harvest-then-transmit protocol. Optimal time allocation for the downlink and uplink operation interval are identi๏ฌed formulating throughput maximization and energy-e๏ฌƒciency maximization problems. In addition, the performance gain among various types of downlink-uplink operation protocols is analyzed taking into account statistical QoS constraints. Furthermore, the performance analysis of energy harvesting user equipment is extended to full-duplex wireless information and power transfer as well as cellular networks. In full-duplex operation, optimal power control policies are identi๏ฌed, and the signi๏ฌcance of introducing non-zero mean component on the information-bearing signal is analyzed. Meanwhile, SINR coverage probabilities, average throughput and energy e๏ฌƒciency are explicitly characterized for wireless-powered cellular networks, and the impact of downlink SWIPT and uplink mmWave schemes are addressed. In the ๏ฌnal part of the thesis, energy e๏ฌƒciency is considered as the performance metric, and time allocation strategies that maximize energy e๏ฌƒciency for wireless powered communication networks with non-orthogonal multiple access scheme are determined. Low complex algorithms are proposed based on Dinkelbachโ€™s method. In addition, the impact of statistical QoS constraints imposed as limitations on the bu๏ฌ€er violation probabilities is addressed

    Secrecy Throughput Maximization for Full-Duplex Wireless Powered IoT Networks under Fairness Constraints

    Full text link
    In this paper, we study the secrecy throughput of a full-duplex wireless powered communication network (WPCN) for internet of things (IoT). The WPCN consists of a full-duplex multi-antenna base station (BS) and a number of sensor nodes. The BS transmits energy all the time, and each node harvests energy prior to its transmission time slot. The nodes sequentially transmit their confidential information to the BS, and the other nodes are considered as potential eavesdroppers. We first formulate the sum secrecy throughput optimization problem of all the nodes. The optimization variables are the duration of the time slots and the BS beamforming vectors in different time slots. The problem is shown to be non-convex. To tackle the problem, we propose a suboptimal two stage approach, referred to as sum secrecy throughput maximization (SSTM). In the first stage, the BS focuses its beamforming to blind the potential eavesdroppers (other nodes) during information transmission time slots. Then, the optimal beamforming vector in the initial non-information transmission time slot and the optimal time slots are derived. We then consider fairness among the nodes and propose max-min fair (MMF) and proportional fair (PLF) algorithms. The MMF algorithm maximizes the minimum secrecy throughput of the nodes, while the PLF tries to achieve a good trade-off between the sum secrecy throughput and fairness among the nodes. Through numerical simulations, we first demonstrate the superior performance of the SSTM to uniform time slotting and beamforming in different settings. Then, we show the effectiveness of the proposed fair algorithms
    • โ€ฆ
    corecore