Develops SDR-based branch-and-bound for global optimum and SCA for near-optimal low-complexity solution to max-min secrecy rate in secure ISAC with power budget and sensing quality constraints.
IEEE Transactions on Signal Processing 68, 3929–3944 (2020)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SP 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Max-Min Secrecy Rate Optimization for Secure ISAC Networks: Global Optimization and Low-Complexity Algorithm
Develops SDR-based branch-and-bound for global optimum and SCA for near-optimal low-complexity solution to max-min secrecy rate in secure ISAC with power budget and sensing quality constraints.