Visible to the public Game-Based Attack Defense Model to Provide Security for Relay Selection in 5G Mobile Networks

TitleGame-Based Attack Defense Model to Provide Security for Relay Selection in 5G Mobile Networks
Publication TypeConference Paper
Year of Publication2019
AuthorsBoubakri, Wided, Abdallah, Walid, Boudriga, Noureddine
Conference Name2019 IEEE Intl Conf on Parallel Distributed Processing with Applications, Big Data Cloud Computing, Sustainable Computing Communications, Social Computing Networking (ISPA/BDCloud/SocialCom/SustainCom)
Keywords5G mobile communication, 5G mobile networks, 5G networks, attack-defense, composability, cooperative D-to-D communication, data packet transmission, Device-to-device communication, dynamic game theoretic based approach, Dynamic Networks and Security, equilibrium state, extensive signal coverage, game theoretic security, game theory, game-based attack defense model, heterogeneous devices, heuristic algorithm, human factors, large-scale mobile networks, link reliability, multiple communication technologies, Nash equilibrium convergence analysis, networking capabilities, noncooperative game, Predictive Metrics, protected relay, protection level, pubcrawl, relay networks (telecommunication), relay nodes, relay selection, Resiliency, Scalability, scalable connectivity, security, source device, source node, spectral efficiency, system capacity, telecommunication security, telecommunication traffic, ubiquitous connectivity, universal communication environment, utility function
Abstract

5G mobile networks promise universal communication environment and aims at providing higher bandwidth, increased communication and networking capabilities, and extensive signal coverage by using multiple communication technologies including Device-to-Device (D-to-D). This paradigm, will allow scalable and ubiquitous connectivity for large-scale mobile networks where a huge number of heterogeneous devices with limited resources will cooperate to enhance communication efficiency in terms of link reliability, spectral efficiency, system capacity, and transmission range. However, owing to its decentralized nature, cooperative D-to-D communication could be vulnerable to attacks initiated on relay nodes. Consequently, a source node has the interest to select the more protected relay to ensure the security of its traffic. Nevertheless, an improvement in the protection level has a counterpart cost that must be sustained by the device. To address this trade-off as well as the interaction between the attacker and the source device, we propose a dynamic game theoretic based approach to model and analyze this problem as a cost model. The utility function of the proposed non-cooperative game is based on the concepts of return on protection and return on attack which illustrate the gain of selecting a relay for transmitting a data packet by a source node and the reward of the attacker to perform an attack to compromise the transmitted data. Moreover, we discuss and analyze Nash equilibrium convergence of this attack-defense model and we propose an heuristic algorithm that can determine the equilibrium state in a limited number of running stages. Finally, we perform simulation work to show the effectiveness of the game model in assessing the behavior of the source node and the attacker and its ability to reach equilibrium within a finite number of steps.

DOI10.1109/ISPA-BDCloud-SustainCom-SocialCom48970.2019.00033
Citation Keyboubakri_game-based_2019