Hierarchical Resource Optimization for Covert SAGINs: A Stackelberg-Matching Game Approach
IEEE Transactions on Wireless Communications · 2026 · 25 · 20558-20573
DOI: 10.1109/twc.2026.3715486 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Wireless Communications, 2026. Verfasst von Min Wu und 6 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 60 Literaturangaben. Gefördert von: Beijing Advanced Innovation Center for Future Blockchain and Privacy Computing Fund.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Beijing Advanced Innovation Center for Future Blockchain and Privacy Computing Fund
Zitieren
APA
Wu, M., Guo, K., Tsiftsis, T. A., Mumtaz, S., Wang, Z., Liu, Y., & Zheng, Z. (2026). Hierarchical Resource Optimization for Covert SAGINs: A Stackelberg-Matching Game Approach. IEEE Transactions on Wireless Communications, 25, 20558-20573. https://doi.org/10.1109/twc.2026.3715486
Vancouver
Wu M, Guo K, Tsiftsis TA, Mumtaz S, Wang Z, Liu Y, et al. Hierarchical Resource Optimization for Covert SAGINs: A Stackelberg-Matching Game Approach. IEEE Transactions on Wireless Communications. 2026;25:20558-20573. doi:10.1109/twc.2026.3715486
BibTeX
@article{Wu2026,
author = {Wu, Min and Guo, Kefeng and Tsiftsis, Theodoros A. and Mumtaz, Shahid and Wang, Ziwei and Liu, Yang and Zheng, Zhiming},
title = {Hierarchical Resource Optimization for Covert SAGINs: A Stackelberg-Matching Game Approach},
journal = {IEEE Transactions on Wireless Communications},
year = {2026},
volume = {25},
pages = {20558--20573},
doi = {10.1109/twc.2026.3715486}
}
EUVIMED