Skip navigation

Game theoretic path selection to support security in device-to-device communications

Game theoretic path selection to support security in device-to-device communications

Panaousis, Emmanouil, Karapistoli, Eirini, Elsemary, Hadeep, Alpcan, Tansu, Khuzani, MHR and Economides, Anastasios A. (2016) Game theoretic path selection to support security in device-to-device communications. Ad Hoc Networks, 56. pp. 28-42. ISSN 1570-8705 (doi:https://doi.org/10.1016/j.adhoc.2016.11.008)

[img]
Preview
PDF (Author's Accepted Manuscript)
24380 PANAOUSIS_Game_Theoretic_Security_Device-to-device_Communications_(AAM)_2016.pdf - Accepted Version

Download (2MB) | Preview

Abstract

Device-to-Device (D2D) communication is expected to be a key feature sup- ported by 5G networks, especially due to the proliferation of Mobile Edge Computing (MEC), which has a prominent role in reducing network stress by shifting computational tasks from the Internet to the mobile edge. Apart from being part of MEC, D2D can extend cellular coverage allowing users to communicate directly when telecommunication infrastructure is highly congested or absent. This significant departure from the typical cellular paradigm imposes the need for de- centralised network routing protocols. Moreover, enhanced capabilities of mobile devices and D2D networking will likely result in proliferation of new malware types and epidemics. Although the literature is rich in terms of D2D routing protocols that enhance quality-of-service and energy consumption, they provide only basic security support, e.g., in the form of encryption. Routing decisions can, however, contribute to collaborative detection of mobile malware by leveraging different kinds of anti-malware software installed on mobile devices. Benefiting from the cooperative nature of D2D communications, devices can rely on each other’s contributions to detect malware. The impact of our work is geared to- wards having more malware-free D2D networks. To achieve this, we designed and implemented a novel routing protocol for D2D communications that optimises routing decisions for explicitly improving malware detection. The protocol identifies optimal network paths, in terms of malware mitigation and energy spent for malware detection, based on a game theoretic model. Diverse capabilities of network devices running different types of anti-malware software and their potential for inspecting messages relayed towards an intended destination device are leveraged using game theoretic tools. An optimality analysis of both Nash and Stackelberg security games is undertaken, including both zero and non-zero sum variants, and the Defender’s equilibrium strategies. By undertaking network simulations, theoretical results obtained are illustrated through randomly generated network scenarios showing how our protocol outperforms conventional routing protocols, in terms of expected payoff, which consists of: security damage inflicted by malware and malware detection cost.

Item Type: Article
Uncontrolled Keywords: security economics, cyber security
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Faculty / Department / Research Group: Faculty of Architecture, Computing & Humanities
Faculty of Architecture, Computing & Humanities > Department of Computing & Information Systems
Faculty of Architecture, Computing & Humanities > Internet of Things and Security (ISEC)
Last Modified: 30 Jul 2019 12:59
Selected for GREAT 2016: None
Selected for GREAT 2017: None
Selected for GREAT 2018: None
Selected for GREAT 2019: GREAT 5
URI: http://gala.gre.ac.uk/id/eprint/24380

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics