Article (Périodiques scientifiques)
Sum Rate Maximization of Ad-Hoc Network in Adversarial Communication Environments: A Game-Theoretic Approach
Lin, Xin; Liu, Aijun; Ni, Wanli et al.
2024In IEEE Transactions on Vehicular Technology, 73 (11), p. 17905 - 17910
Peer reviewed vérifié par ORBi Dataset
 

Documents


Texte intégral
Sum Rate Maximization of Ad-Hoc Network in Adversarial Communication Environments_ A Game-Theoretic Approach _ IEEE Journals & Magazine _ IEEE Xplore.pdf
Postprint Auteur (2.91 MB)
Télécharger

Tous les documents dans ORBilu sont protégés par une licence d'utilisation.

Envoyer vers



Détails



Mots-clés :
Adversarial communication environments; coalition-based Ad-hoc network; game theory; sum rate maximization; Ad-hoc networks; Adversarial communication environment; Coalition-based ad-hoc network; Communication environments; Device-to-Device communications; Game; Interchannel interference; Jamming; Sum-rate maximizations; Task analysis; Automotive Engineering; Aerospace Engineering; Computer Networks and Communications; Electrical and Electronic Engineering; Ad hoc networks; Games; Device-to-device communication; Autonomous aerial vehicles
Résumé :
[en] Recently, the hierarchical coalition-based Ad-hoc network (HCAN) has been adopted to establish link connection in adversarial environments. In this paper, a game-theoretic-based link access (GTLA) approach is proposed to maximize the sum rate of HCAN. Our scheme consists of two phases: the assignment between coalition head (CH) and coalition member (CM) as well as the matching between CH and disconnected node (DN). Firstly, the CH-CM assignment problem is formulated as a coalition formation game (CFG). It's proved that the CFG with the two-side best order is an exact potential game (EPG), which can significantly mitigate co-channel interference and hostile jamming. Secondly, the CH-DN matching problem is formulated as a bilateral many-to-one matching game. Then a partial mutual benefit order (PMBO) based matching algorithm with low computational complexity is designed to reconstruct broken links. Finally, simulation results are provided to verify the superior performance of our scheme.
Disciplines :
Sciences informatiques
Auteur, co-auteur :
Lin, Xin ;  Army Engineering University of Pla, College of Communications Engineering, Nanjing, China
Liu, Aijun ;  Army Engineering University of Pla, College of Communications Engineering, Nanjing, China
Ni, Wanli ;  Tsinghua University, Department of Electronic Engineering, Beijing, China
An, Kang ;  National University of Defense Technology, Sixty-Third Research Institute, Nanjing, China
Han, Chen ;  National University of Defense Technology, Sixty-Third Research Institute, Nanjing, China ; National University of Defense Technology, College of Electronic Science and Technology, Changsha, China
Gao, Zhixiang ;  Army Engineering University of Pla, College of Communications Engineering, Nanjing, China
CHATZINOTAS, Symeon  ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > SigCom
Co-auteurs externes :
yes
Langue du document :
Anglais
Titre :
Sum Rate Maximization of Ad-Hoc Network in Adversarial Communication Environments: A Game-Theoretic Approach
Date de publication/diffusion :
novembre 2024
Titre du périodique :
IEEE Transactions on Vehicular Technology
ISSN :
0018-9545
Maison d'édition :
Institute of Electrical and Electronics Engineers Inc.
Volume/Tome :
73
Fascicule/Saison :
11
Pagination :
17905 - 17910
Peer reviewed :
Peer reviewed vérifié par ORBi
Organisme subsidiant :
National Natural Science Foundation of China
National University of Defense Technology
Natural Science Foundation on Frontier Leading Technology Basic Research Project of Jiangsu Province
Disponible sur ORBilu :
depuis le 06 janvier 2025

Statistiques


Nombre de vues
73 (dont 0 Unilu)
Nombre de téléchargements
32 (dont 0 Unilu)

citations Scopus®
 
8
citations Scopus®
sans auto-citations
5
OpenCitations
 
0
citations OpenAlex
 
6
citations WoS
 
7

Bibliographie


Publications similaires



Contacter ORBilu