This letter investigates a hybrid non-orthogonal multiple access (H-NOMA) based Unmanned aerial vehicle (UAV) assisted mobile edge computing (MEC) network. The goal is to reduce the offloading energy consumption in data-intensive and time-critical smart devices (SDs). To achieve this, we proposed latency-based clustering low-complexity resource allocation algorithms. Instead of traditional methods, have introduced latency condition where H-NOMA surpasses both NOMA orthogonal (OMA)...

In this letter, we explore the hybrid Non-orthogonal multiple access (H-NOMA) premised Unmanned aerial vehicle (UAV)-Enabled mobile edge computing (MEC) network. Our research emphasizes importance of adept clustering techniques to meet high demands data-intensive and time-sensitive users. Instead conventional single-stage clustering, introduce a novel 2-tier mechanism. We assort users based on channel gains cluster sizes in initial phase. Then, these undergo second their latency demands....

Waterfilling problems subjected to peak power constraints are solved, which known as cave-filling (CFP). The proposed algorithm finds both the optimum number of positive powers and resources that assigned before finding specific be assigned. solution is non-iterative results in a computational complexity, order M, O(M), where M total resources, significantly lower than existing algorithms given by an <sup xmlns:mml="http://www.w3.org/1998/Math/MathML"...

Multiple linear constraint water filling problem (MLWFP) is solved innovatively in this paper, which powers allotted to the T resources of transmitting user maximize capacity while controlling interference all surrounded users wireless network. MLWFP previously using iterative algorithms that take more number iterations, thus, increasing computational complexity. Unlike prior algorithms, uniqueness proposed algorithm detecting tight bounds for nonzero S. Subsequently, S calculated from its...

In this study, a closed-form solution is presented for the constrained water-filling problem (CWFP) where in powers allocated to user resources maximise user's capacity under an interference constraint and total power constraint. Total CWFP save energy wireless network. To solve CWFP, erstwhile algorithms compute all iteratively. Unlike existing algorithms, proposed method calculates number of that gets positive (or non-zero) using concepts traditional problem. Later, are resolved (that...

In this paper, a novel approach for solving the `Water- filling problem with peak power constraints individual resources' also known as Cave-Filling Problem (CFP) is proposed. The proposed algorithm calculates lower bound number of resources that are assigned positive powers, K, and then K powers only once. This lowers total computational cost significantly. Simulation results validate algorithm.

This paper presents the implementation of a remote health monitoring system by using Heterogeneous Networks (HetNet), in which patients' vital data can be sent to proximate hospital with very low end-to-end latency. To carry out aforementioned process, statistics are delivered initially from Wireless Body Area Network (WBAN) mobile phone ISM band. Then, there, contemporary networks make use single wireless network alone send nearest (even though there multiple terrain). But, this particular...

The Unmanned Aerial Vehicle (UAV) base station plays a crucial role in establishing communication at temporary events and destruction areas. However, Placing the aerial for serving more users with optimum resource is challenging task. This article investigates altitude power optimization of UAV-assisted Multi Inputs Outputs (MIMO) systems. MIMO provides reliability improves data rate. In addition, NOMA was adopted to serve fewer spectrums. maximization sum rate mixed integer nonlinear...

In this paper, Weighted water-filling problem (WeWF) is solved with lesser computational complexity. Unlike previous algorithms, the proposed algorithm finds initially lower bound and upper for number of positive powers (L) first using these bounds, L computed later. The calculates bounds minute noise levels whereas existing algorithms considers all computing L. This uniqueness reduces floating point operations. Also, out water level itself, are from one another which again leads to

Centralized Cognitive Radio Base Station (CCRBS) observes power budget while assigning resources to Secondary Users (SU). Concurrently, doing resource allocation, CCRBS ensures that all the surrounded Primary (PU) are induced with interferences below their endurable levels. Further, should ensure complete data transmission each SU before it senses allotted no longer useful. As a consequence, allocation (by CCRBS) needs be done as quickly possible. The proposed algorithm does very by bringing...