vahid solouk

With the rapid deployment of users and increasing demands for mobile data, communication networks with high capacity are needed more than ever. Furthermore, there are several challenges, such as providing efficient coverage and reducing power consumption. To tackle these challenges, using unmanned aerial vehicles (UAVs) would be a good choice. This paper proposes a scheme for uplink non-orthogonal multiple access (NOMA) in UAV communication systems in the presence of granted and grant-free users. At first, the service area users, including granted and grant-free users, are partitioned into some clusters. We propose that the hover location for each cluster is determined considering the weighted mean of users’ locations. We aim to allocate transmission power and form NOMA pairs to maximize the energy efficiency in each cluster subject to the constraints on spectral efficiency and total transmission power. To this end, the transmission powers of each possible pair are obtained, and then Hungarian matching is used to select the best pairs. Finally, finding the flight path of the UAV is modeled by the traveling salesman problem (TSP), and the genetic algorithm method obtains its solution. The results show that the increasing height of the UAV and density of users increases the spectral and energy efficiencies and reduces the outage probability. Also, considering the quality of service (QoS) of granted users for determining the UAV's hover location enhances the transmission's performance.

Computation offloading is known to be among the effective solutions of running heavy applications on smart mobile devices. However, irregular changes of a mobile data rate have direct impacts on code partitioning when offloading is in progress. It is believed that once a rate-adaptive partitioning performed, the replication of such substantial processes due to bandwidth fluctuation can be avoided. Currently, a wide range of mobile applications are based on web services, which in turn influences the process of offloading and partitioning. As a result, mobile users are prone to face difficulties in data communications due to cost of preferences or connection quality. Taking into account the fluctuations of mobile connection bandwidth and thereby data rate constraints, the current paper proposes a method of adaptive partitioning and computation offloading in three forms. Accordingly, an optimization problem is primarily formulated to each of three main objectives under the investigation. These objectives include run time, energy consumption and the weighted composition of run time and energy consumption. Next, taking into consideration the time complexity of the optimization problems, a heuristic partitioning method based on Genetic Algorithm (GABP) is proposed to solve each of the three objectives and with the capability of acceptable performance maintenance in both dynamic and static partitionings. In order to evaluate and analyze the performance of the proposed approach, a simulation framework was built to run for random graphs of different sizes with the capability of setting specific bandwidth limits as target. The simulation results evidence improved performance against bandwidth fluctuations when compared to similar approaches. Moreover, it was also seen that once the problem circumstances are modified, the offloading can take place in the vicinity of the target node. Furthermore, we implemented the proposed method in form of an application on Android platform to conduct experiments on real applications. The experiments prove that those partitions of the applications requiring higher processing reqources rather than data rate are the best candidates for offloading.