Mobile edge computing (MEC) is a promising technology that has the potential to meet the latency requirements of next-generation mobile networks. Since MEC servers have limited resources, an orchestrator utilizes a scheduling algorithm to decide where and when each task should execute so that the quality of service (QoS) of each task is achieved. The scheduling algorithm should use the least possible resources required to meet the service demands. In this paper, we develop a two-level cooperative scheduling algorithm with a centralized orchestrator layer. The first scheduling level is used to schedule tasks locally on MEC servers. In contrast, the second level resides at the orchestrator and assigns tasks to a neighboring base station or the cloud. The tasks serve in accordance with their priority, which is determined by the latency and required throughput. We also present a resource optimization algorithm for determining resource distribution in the system in order to ensure satisfactory service availability at the minimum cost. The resource optimization algorithm contains two variations that can be employed depending on the traffic model. One variant is used when the traffic is uniformly distributed, and the other is used when the traffic load is unbalanced among base stations. Numerical results show that the cooperative model of task scheduling outperforms the non-cooperative model. Furthermore, the results show that the suggested scheduling algorithm performs better than other well-known scheduling algorithms, such as shortest job first scheduling and earliest deadline first scheduling.

No abstract

The past two decades noticed a great development in ad hoc wireless networks. Although most of the routing algorithms that have been produced to ad hoc networks find the shortest discovered path, they have different network performances. It is hard to predict which routing algorithm will perform well under different scenarios. In this paper, an empirical study of the elements that may affect a routing algorithm's performance using NS2 simulator is presented. AODV and SARA routing algorithms have been chosen to apply the study on and their performances have been investigated under different scenarios. NS2 has been used to simulate three topologies and their performances have been measured. According to the results, it is suggested to use AODV routing algorithm in low interference scenarios and to use SARA routing algorithm in high interference scenarios.