Game Theory for Multi-Access Edge Computing:Survey, Use Cases, and Future Trends

Game theory (GT) has been used with significant success to formulate, and either design or optimize, the operation of many representative communications and networking scenarios. The games in these scenarios involve, as usual, diverse players with conflicting goals. This paper primarily surveys the literature that has applied theoretical games to wireless networks, emphasizing use cases of upcoming multiaccess edge computing (MEC). MEC is relatively new and offers cloud services at the network periphery, aiming to reduce service latency backhaul load, and enhance relevant operational aspects such as quality of experience or security. Our presentation of GT is focused on the major challenges imposed by MEC services over the wireless resources. The survey is divided into classical and evolutionary games. Then, our discussion proceeds to more specific aspects which have a considerable impact on the game's usefulness, namely, rational versus evolving strategies, cooperation among players, available game information, the way the game is played (single turn, repeated), the game's model evaluation, and how the model results can be applied for both optimizing resource-constrained resources and balancing diverse tradeoffs in real edge networking scenarios. Finally, we reflect on lessons learned, highlighting future trends and research directions for applying theoretical model games in upcoming MEC services, considering both network design issues and usage scenarios

Game theory for cooperation in multi-access edge computing

Cooperative strategies amongst network players can improve network performance and spectrum utilization in future networking environments. Game Theory is very suitable for these emerging scenarios, since it models high-complex interactions among distributed decision makers. It also finds the more convenient management policies for the diverse players (e.g., content providers, cloud providers, edge providers, brokers, network providers, or users). These management policies optimize the performance of the overall network infrastructure with a fair utilization of their resources. This chapter discusses relevant theoretical models that enable cooperation amongst the players in distinct ways through, namely, pricing or reputation. In addition, the authors highlight open problems, such as the lack of proper models for dynamic and incomplete information scenarios. These upcoming scenarios are associated to computing and storage at the network edge, as well as, the deployment of large-scale IoT systems. The chapter finalizes by discussing a business model for future networks.info:eu-repo/semantics/acceptedVersio

Incentive Mechanisms in Peer-to-Peer Networks — A Systematic Literature Review

Centralized networks inevitably exhibit single points of failure that malicious actors regularly target. Decentralized networks are more resilient if numerous participants contribute to the network’s functionality. Most decentralized networks employ incentive mechanisms to coordinate the participation and cooperation of peers and thereby ensure the functionality and security of the network. This article systematically reviews incentive mechanisms for decentralized networks and networked systems by covering 165 prior literature reviews and 178 primary research papers published between 1993 and October 2022. Of the considered sources, we analyze 11 literature reviews and 105 primary research papers in detail by categorizing and comparing the distinctive properties of the presented incentive mechanisms. The reviewed incentive mechanisms establish fairness and reward participation and cooperative behavior. We review work that substitutes central authority through independent and subjective mechanisms run in isolation at each participating peer and work that applies multiparty computation. We use monetary, reputation, and service rewards as categories to differentiate the implementations and evaluate each incentive mechanism’s data management, attack resistance, and contribution model. Further, we highlight research gaps and deficiencies in reproducibility and comparability. Finally, we summarize our assessments and provide recommendations to apply incentive mechanisms to decentralized networks that share computational resources

Enabling Secure Direct Connectivity Under Intermittent Cellular Network Assistance

This work targets at investigating direct communications as a promising technology for the next-generation 5G wireless ecosystem that improves the degrees of spatial reuse and creates new opportunities for users in proximity. While direct connectivity has originally emerged as a technology enabler for public safety services, it is likely to remain in the heart of the 5G ecosystem by spawning a wide diversity of proximate applications and services. Direct communications couples together the centralized and the distributed network architectures, and as such requires respective enablers for secure, private, and trusted data exchange especially when cellular control link is not available at all times. Within the research group, the author was tasked to provide the state-of-the-art technology overview and to propose a novel algorithm for maintaining security functions of proximate devices in case of unreliable cellular connectivity, whenever a new device joins the secure group of users or an existing device leaves it. The proposed solution and its rigorous practical implementation detailed in this work open door to a new generation of secure proximity-based services and applications in future wireless communications systems

Distributed Resource Allocation and Performance Analysis in 5G Wireless Cellular Networks

This thesis focuses on the study of Heterogeneous Networks (HetNets), Device-to-device (D2D) communication networks, and unmanned aerial vehicle (UAV) networks in fifth generation wireless communication (5G) systems. HetNets that consist of macro-cells and small-cells have become increasingly popular in current wireless networks and 5G systems to meet the exponentially growing demand for higher data rates. Compared to conventional homogeneous cellular networks, the disparity of transmission power among different types of base stations (BSs), the relatively random deployment of SBSs, and the densifying networks, bring new challenges, such as the imbalanced load between macro and small cells and severe inter-cell interference. In the other hand, with the skyrocketing number of tablets and smart phones, the notion of caching popular content in the storage of BSs and users' devices is proposed to reduce duplicated wireless transmissions. To fulfill multi-fold communication requirements from humans, machine, and things, the 5G systems which include D2D communications, UAV communications, and so on, can improve the network performance. Among them, the performance analyses of these emerging technologies are attracting much attention and should be investigated first. This thesis focuses on these hot issues and emerging technologies in 5G systems, analyzing the network performance and conducting the allocation of available resources, such as serving BSs, spectrum resources, and storage resources. Specifically, three main research focuses are included in the thesis. The first focus of this thesis is the impact of the BS idle mode capacity (IMC) on the network performance of multi-tier and dense HCNs with both line-of-sight (LoS) and non-line-of-sight (NLoS) transmissions. I consider a more practical set-up with a finite number of UEs in the analysis. Moreover, the SBSs apply a positive power bias in the cell association procedure, so that macrocell UEs are actively encouraged to use the more lightly loaded SBSs. In addition, to address the severe interference that these cell range expanded UEs may suffer, the MBSs apply enhanced inter-cell interference coordination (eICIC), in the form of almost blank subframe (ABS) mechanism. For this model, I derive the coverage probability and the rate of a typical UE in the whole network or a certain tier. The impact of the IMC on the performance of the network is shown to be significant. In particular, it is important to note that there will be a surplus of BSs when the BS density exceeds the UE density, and thus a large number of BSs switch off. As a result, the overall coverage probability, as well as the area spectral efficiency (ASE), will continuously increase with the BS density, addressing the network outage that occurs when all BSs are active and the interference becomes LoS dominated. Finally, the optimal ABS factors are investigated in different BS density regions. One of major findings is that MBSs should give up all resources in favor of the SBSs when the small cell networks go ultra-dense. This reinforces the need for orthogonal deployments, shedding new light on the design and deployment of the future 5G dense HCNs. The second focus of this thesis is the content caching in D2D communication networks. In practical deployment, D2D content caching has its own problem that is not all of the user devices are willing to share the content with others due to numerous concerns such as security, battery life, and social relationship. To solve this problem, I consider the factor of social relationship in the deployment of D2D content caching. First, I apply stochastic geometry theory to derive an analytical expression of downloading performance for the D2D caching network. Specifically, a social relationship model with respect to the physical distance is adopted in the analysis to obtain the average downloading delay performance using random and deterministic caching strategies. Second, to achieve a better performance in more practical and specific scenarios, I develop a socially aware distributed caching strategy based on a decentralized learning automaton, to optimize the cache placement operation in D2D networks. Different from the existing caching schemes, the proposed algorithm not only considers the file request probability and the closeness of devices as measured by their physical distance, but also takes into account the social relationship between D2D users. The simulation results show that the proposed algorithm can converge quickly and outperforms the random and deterministic caching strategies. With these results, the work sheds insights on the design of D2D caching in the practical deployment of 5G networks. The third focus of this thesis is the performance analysis for practical UAV-enabled networks. By considering both LoS and NLoS transmissions between aerial BSs and ground users, the coverage probability and the ASE are derived. Considering that there is no consensus on the path loss model for studying UAVs in the literature, in this focus, three path loss models, i.e., high-altitude model, low-altitude model, and ultra-low-altitude model, are investigated and compared. Moreover, the lower bound of the network performance is obtained assuming that UAVs are hovering randomly according to homogeneous Poisson point process (HPPP), while the upper bound is derived assuming that UAVs can instantaneously move to the positions directly overhead ground users. From the analytical and simulation results for a practical UAV height of 50 meters, I find that the network performance of the high-altitude model and the low-altitude model exhibit similar trends, while that of the ultra-low-altitude model deviates significantly from the above two models. In addition, the optimal density of UAVs to maximize the coverage probability performance has also been investigated

Opportunistic device-to-device communication in cellular networks: from theory to practice

Mención Internacional en el título de doctorCellular service providers have been struggling with users’ demand since the emergence of mobile Internet. As a result, each generation of cellular network prevailed over its predecessors mainly in terms of connection speed. However, the fifth generation (5G) of cellular network promises to go beyond this trend by revolutionizing the network architecture. Device-to-Device (D2D) communication is one of the revolutionary changes that enables mobile users to communicate directly without traversing a base station. This feature is being actively studied in 3GPP with special focus on public safety as it allows mobiles to operate in adhoc mode. Although under the (partial) control of the network, D2D communications open the door to many other use-cases. This dissertation studies different aspects of D2D communications and its impact on the key performance indicators of the network. We design an architecture for the collaboration of cellular users by means of timely exploited D2D opportunities. We begin by presenting the analytical study on opportunistic outband D2D communications. The study reveals the great potential of opportunistic outband D2D communications for enhancing energy efficiency, fairness, and capacity of cellular networks when groups of D2D users can be form and managed in the cellular network. Then we introduce a protocol that is compatible with the latest release of IEEE and 3GPP standards and allows for implementation of our proposal in a today’s cellular network. To validate our analytical findings, we use our experimental Software Defined Radio (SDR)-based testbed to further study our proposal in a real world scenario. The experimental results confirm the outstanding potential of opportunistic outband D2D communications. Finally, we investigate the performance merits and disadvantages of different D2D “modes”. Our investigation reveals, despite the common belief, that all D2D modes are complementary and their merits are scenario based.This work has been supported by IMDEA Networks Institute.Programa Oficial de Doctorado en Ingeniería TelemáticaPresidente: Douglas Leith.- Secretario: Albert Banchs Roca.- Vocal: Carla Fabiana Chiasserin