No abstract

No abstract

Indoor localization has become one of the fundamental services that is required in a diverse set of applications these days, such as patient monitoring and smart parking. Highly accurate localization techniques impose high latency and high energy consumption on the underlying application system. Thus, for such indoor location-based application, offloading the computation of the localization process to a remote server with high resource capability has been recently introduced as an avenue to address such a challenge. In this paper, a computation offloading problem is formulated to find the optimal decision with regard to the operation of the localization process. This decision includes: a) Where to compute the localization task, either locally on the end device or on the edge server or on the cloud server, b) Which localization technique should be used, and finally, c) Which transmission technology is recommended to be chosen in combination with the localization technique. All these decisions are constrained by the device, and the servers resource capabilities load. They are also constrained by the fact that the localization algorithm has to satisfy a certain application QoS requirement. Within such context, three algorithms are proposed for task offload decision making. First, the Indoor Localization Latency Optimal Offloading algorithm, which finds the optimal offloading decision that minimizes the total latency of the system and is considered a benchmark for the other algorithms. Second, Indoor Localization Latency Centralized Offloading algorithm that finds a sub optimal solution with lower complexity. Third, Indoor Localization Latency Game-Theoretic Offloading decentralized algorithm that converges after finite improvement steps and achieves Nash equilibrium. Altogether, the paper finds the optimum localization strategy for all users with the minimum latency under mobile edge computing environment.

No abstract

No abstract