Skip to main content

Maxmin Strategy for a Dual Radar and Communication OFDM Waveforms System Facing Uncertainty About the Background Noise

  • Conference paper
  • First Online:
Book cover Cognitive Radio Oriented Wireless Networks (CROWNCOM 2018)

Abstract

The paper considers the problem of designing the maxmin strategy for a dual-purpose communication and radar system that employs multicarrier OFDM style waveforms, but faces an uncertain level of background noise. As the payoff for the system, we consider the weighted sum of the communication throughput and the radar’s SINR. The problem is formulated as a zero-sum game between the system and a rival, which may be thought of as the environment or nature. Since the payoff for such a system combines different type of metrics (SINR and throughput), this makes underlying problem associated with jamming such a systems different from the typical jamming problem arising in communication scenarios, where the payoff usually involves only one of these metrics. In this paper, the existence and uniqueness of the equilibrium strategies are proven as well as water-filling equations to design the equilibrium are derived. Finally, using Nash product the optimal value of weights are found to optimize tradeoff of radar and communication objectives.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aubry, A., De Maio, A., Huang, Y., Piezzo, M., Farina, A.: A new radar waveform design algorithm with improved feasibility for spectral coexistence. IEEE Trans. Aerosp. Electron. Syst. 51, 1029–1038 (2015)

    Article  Google Scholar 

  2. Bica, M., Huang, K.W., Koivunen, V., Mitra, U.: Mutual information based radar waveform design for joint radar and cellular communication systems. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 3671–3675 (2016)

    Google Scholar 

  3. Bica, M., Koivunen, V.: Delay estimation method for coexisting radar and wireless communication systems. In: IEEE Radar Conference, pp. 1557–1561 (2017)

    Google Scholar 

  4. Garnaev, A., Liu, Y., Trappe, W.: Anti-jamming strategy versus a low-power jamming attack when intelligence of adversary’s attack type is unknown. IEEE Trans. Sig. Inf. Process. Netw. 2, 49–56 (2016)

    MathSciNet  Google Scholar 

  5. Garnaev, A., Trappe, W.: To eavesdrop or jam, that is the question. In: Mellouk, A., Sherif, M.H., Li, J., Bellavista, P. (eds.) ADHOCNETS 2013. LNICST, vol. 129, pp. 146–161. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-04105-6_10

    Chapter  Google Scholar 

  6. Garnaev, A., Trappe, W.: Bargaining over the fair trade-off between secrecy and throughput in OFDM communications. IEEE Trans. Inf. Forensics Secur. 12, 242–251 (2017)

    Article  Google Scholar 

  7. Garnaev, A., Trappe, W.: The rival might be not smart: revising a CDMA jamming game. In: IEEE Wireless Communications and Networking Conference (WCNC). IEEE (2018)

    Google Scholar 

  8. Garnaev, A., Trappe, W., Petropulu, A.: Bargaining over fair performing dual radar and communication task. In: 50th Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, pp. 47–51, November 2016

    Google Scholar 

  9. Garnaev, A., Trappe, W., Petropulu, A.: Optimal design of a dual-purpose communication-radar system in the presence of a Jammer. In: IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), pp. 1–5 (2018)

    Google Scholar 

  10. Garnaev, A., Trappe, W.: Fair scheduling of two-hop transmission with energy harvesting. In: Zhou, Y., Kunz, T. (eds.) Ad Hoc Networks. LNICST, vol. 223, pp. 189–198. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-74439-1_17

    Chapter  Google Scholar 

  11. Gogineni, S., Rangaswamy, M., Nehorai, A.: Multi-modal OFDM waveform design. In: IEEE Radar Conference, pp. 1–5 (2013)

    Google Scholar 

  12. Gohary, R.H., Huang, Y., Luo, Z.-Q., Pang, J.-S.: A generalized iterative water-filling algorithm for distributed power control in the presence of a Jammer. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 2373–2376 (2009)

    Google Scholar 

  13. Han, Z., Niyato, D., Saad, W., Basar, T., Hjrungnes, A.: Game Theory in Wireless and Communication Networks: Theory, Models, and Applications. Cambridge University Press, Cambridge (2012)

    MATH  Google Scholar 

  14. Lagarias, J.C., Reeds, J.A., Wright, M.H., Wright, P.E.: Convergence properties of the Nelder-Mead simplex method in low dimensions. SIAM J. Optim. 9, 112–147 (1998)

    Article  MathSciNet  Google Scholar 

  15. Lan, T., Kao, D., Chiang, M., Sabharwal, A.: An axiomatic theory of fairness in network resource allocation. In: IEEE INFOCOM, pp. 1–9 (2010)

    Google Scholar 

  16. Li, B., Petropulu, A.P., Trappe, W.: Optimum co-design for spectrum sharing between matrix completion based MIMO radars and a MIMO communication system. IEEE Trans. Sig. Process. 64, 4562–4575 (2016)

    Article  MathSciNet  Google Scholar 

  17. Liu, Y., Garnaev, A., Trappe, W.: Maintaining throughput network connectivity in ad hoc networks. In: 41st IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 6380–6384 (2016)

    Google Scholar 

  18. Namvar, N., Saad, W., Bahadori, N., Kelleys, B.: Jamming in the Internet of Things: a game-theoretic perspective. In: IEEE Global Communications Conference (GLOBECOM), Washington, DC (2016)

    Google Scholar 

  19. Park, H., van der Schaar, M.: Bargaining strategies for networked multimedia resource management. IEEE Trans. Sig. Process. 55, 3496–3511 (2007)

    Article  MathSciNet  Google Scholar 

  20. Poor, H.V.: An Introduction to Signal Detection and Estimation. Springer, New York (1994). https://doi.org/10.1007/978-1-4757-2341-0

    Book  MATH  Google Scholar 

  21. Federal Communications Commission (FCC): FCC proposes innovative small cell use in 3.5 GHz band, December 2012. https://apps.fcc.gov/edocs_public/attachmatch/DOC-317911A1.pdf

  22. Slimeni, F., Scheers, B., Le Nir, V., Chtourou, Z., Attia, R.: Closed form expression of the saddle point in cognitive radio and Jammer power allocation game. In: Noguet, D., Moessner, K., Palicot, J. (eds.) CrownCom 2016. LNICST, vol. 172, pp. 29–40. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-40352-6_3

    Chapter  Google Scholar 

  23. Song, T., Stark, W.E., Li, T., Tugnait, J.K.: Optimal multiband transmission under hostile jamming. IEEE Trans. Commun. 64, 4013–4027 (2016)

    Article  Google Scholar 

  24. Thomson, W.: Bargaining and the Theory of Cooperative Games: John Nash and Beyond. Edward Elgar Pub., Cheltenham (2010)

    Book  Google Scholar 

  25. Turlapaty, A., Jin, Y.: A joint design of transmit waveforms for radar and communications systems in coexistence. In: IEEE Radar Conference, pp. 0315–0319 (2014)

    Google Scholar 

  26. Yang, D., Xue, G., Zhang, J., Richa, A., Fang, X.: Coping with a smart Jammer in wireless networks: a stackelberg game approach. IEEE Trans. Wirel. Commun. 12, 4038–4047 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andrey Garnaev .

Editor information

Editors and Affiliations

Appendix: Proof of Theorem 1

Appendix: Proof of Theorem 1

Proof

(I) By definition, \({\varvec{P}}\) and \({\varvec{J}}\) are equilibrium strategies if and only if each of them is the best response to the other, i.e., they are solutions of the equations: and By the Karush-Kuhn-Tucker (KKT) theorem, since v is concave on \({\varvec{P}}\), \({\varvec{P}}\in \varPi _S\) is the best response strategy to \({\varvec{J}}\) if and only if there is an \(\omega \) (Lagrange multiplier) such that

$$\begin{aligned} w^C\frac{h^C_i}{\sigma ^2+h^C_i P_i+ g^C_i J_i}+w^R\frac{h^R_i}{\sigma ^2+g^R_i J_i} {\left\{ \begin{array}{ll} =\omega ,&{} P_i>0,\\ \le \omega ,&{} P_i=0. \end{array}\right. } \end{aligned}$$
(9)

Similarly, since v is convex on \({\varvec{J}}\), \({\varvec{J}}\in \varPi _R\) is the best response strategy to \({\varvec{P}}\) if and only if there is a \(\nu \) (Lagrange multiplier) such that

$$\begin{aligned} \begin{aligned} w^C\frac{h^C_ig^C_i P_i}{(\sigma ^2+h^C_i P_i+ g^C_i J_i)(\sigma ^2+g^C_i J_i)}+w^R\frac{h^R_i g^R_i P_i}{(\sigma ^2+g^R_i J_i)^2} {\left\{ \begin{array}{ll} =\nu ,&{} J_i>0,\\ \le \nu ,&{} J_i=0. \end{array}\right. } \end{aligned} \end{aligned}$$
(10)

Then, (9) and (10) imply that \(\omega \) and \(\nu \) are positive. By (10) if \(P_i=0\) then \(J_i=0\). Thus, to find \({\varvec{P}}\) and \({\varvec{J}}\) we have to consider only three cases: (a) \(P_i=0, J_i=0\), (b) \(P_i=0, J_i>0\), and (c) \(P_i>0, J_i>0\).

(a) Let \(P_i=0, J_i=0\). Then, by (9) and (10), \(w^Ch^C_i/\sigma ^2+w^Rh^R_i/\sigma ^2\le \omega \). Thus, \(i\in I_{00}(\omega ,\nu )\), and (I-a) follows.

(b) Let \(P_i>0, J_i=0\). Then, by (9) and (10), we have that

$$\begin{aligned} w^Ch^C_i/(\sigma ^2+h^C_i P_i)+w^R h^R_i/\sigma ^2&=\omega , \end{aligned}$$
(11)
$$\begin{aligned} w^Ch^C_ig^C_i P_i/((\sigma ^2+h^C_i P_i)\sigma ^2)+w^Rh^R_i g^R_i P_i/(\sigma ^2)^2&\le \nu . \end{aligned}$$
(12)

By (11), \(P_i=P_i(\omega ,\nu )\) is given by (1). Note that, \(P_i\) is decreasing with respect to \(\omega \). By (1), \(P_i>0\) (this holds by assumption of (b)) if and only if:

$$\begin{aligned} w^R h^R_i/\sigma ^2<\omega <w^C h^C_i/\sigma ^2+w^R h^R_i/\sigma ^2. \end{aligned}$$
(13)

Substituting (1) into (12) yields that

$$\begin{aligned} \frac{w^Cg^C_i}{\sigma ^2}+\frac{w^Cw^Rh^R_ig^R_i}{\sigma ^4\left( \omega -w^Rh^R_i/ \sigma ^2\right) } \le \nu +\frac{w^Rh^R_ig^R_i}{\sigma ^2 h^C_i}+\frac{g^C_i}{h^C_i}\left( \omega -\frac{w^Rh^R_i}{\sigma ^2}\right) . \end{aligned}$$
(14)

The left side of (14) is decreasing with respect to \(\omega \) from infinity for \(\omega =w^Rh^R_i/\sigma ^2\) to \(A_L:=w^Cg^C_i/\sigma ^2+w^Rh^R_ig^R_i/(\sigma ^2 h^C_i)\) for \(\omega =w^Ch^C_i/\sigma ^2+w^Rh^R_i/\sigma ^2\).

The right side of (14) is increasing with respect to \(\omega \) from \(\nu +w^Rh^R_ig^R_i/h^C_i\) for \(\omega =w^Rh^R_i/\sigma ^2\) to \(A_R:=\nu +w^Rh^R_ig^R_i/(\sigma ^2 h^C_i)+w^Chg^C_i/\sigma ^2 =\nu +A_L>A_L\) for \(\omega =w^C h^C_i/\sigma ^2+w^R h^R_i/\sigma ^2\). Thus, for any positive \(\nu \) there is a unique \(\omega =\omega _{+,i}(\nu )\) such that (13) holds, while (14) holds as equality. It is clear that \(\omega _{+,i}(\nu )\) is decreasing on \(\nu \). Since this is a quadratic equation on \(\omega \), \(\omega _{+,i}(\nu )\) can be found in closed form, by (2), and (II-b) follows.

(c) Let \(P_i>0, J_i>0\). Then, by (9) and (10) we have that

$$\begin{aligned}&w^Ch^C_i/(\sigma ^2+h^C_i P_i+ g^C_i J_i)+w^Rh^R_i/(\sigma ^2+g^R_i J_i)=\omega ,\end{aligned}$$
(15)
$$\begin{aligned}&w^Ch^C_ig^C_i P_i/((\sigma ^2+h^C_i P_i+ g^C_i J_i)(\sigma ^2+g^C_i J_i))+w^Rh^R_i g^R_i P_i/(\sigma ^2+g^R_i J_i)^2=\nu . \end{aligned}$$
(16)

By (15), we have that

$$\begin{aligned} P_i=w^C/(\omega - w^Rh^R_i/(\sigma ^2+g^R_i J_i))-(\sigma ^2+g^C_i J_i)/h^C_i. \end{aligned}$$
(17)

By (17), \(P_i\) is decreasing with respect to \(J_i\). Substituting (17) into (16) implies (3). The left side of (3) is decreasing with respect to \(J_i\) and tends to zero while \(J_i\) tends to infinity. Thus, for each \(\omega \) and \(\nu \), (3) has a root (which is unique) if and only if:

$$\begin{aligned} \frac{w^Cg^C_i}{\sigma ^2}+\frac{w^Cw^Rh^R_ig^R_i}{\sigma ^4\left( \omega - w^Rh^R_i/ \sigma ^2\right) } > \nu +\frac{w^Rh^R_ig^R_i}{\sigma ^2 h^C_i}+\frac{g^C_i}{h^C_i}\left( \omega -\frac{w^Rh^R_i}{\sigma ^2}\right) . \end{aligned}$$
(18)

By (14), the condition (18) is equivalent to \(\omega <\omega _{+,i}(\nu )\). Denote this root by \(J_i(\omega ,\nu )\). Then, substituting this \(J_i(\omega ,\nu )\) into (17) we can uniquely define \(P_i\) denoted by \(P_i(\omega ,\nu )\), and (I-c) follows.

Note that, by (3), \(J_i(\omega ,\nu )\) is decreasing on \(\omega \) and \(\nu \). The left side of (16) is increasing with respect to \(P_i\) and decreasing with respect to \(J_i\). Thus, the fact that \(J_i(\omega ,\nu )\) is decreasing with respect to \(\omega \) implies that \(P_i(\omega ,\nu )\) is also decreasing with respect to \(\omega \). Also, the left side of (15) is decreasing on \(P_i\) and on \(J_i\). Thus, the fact that \(J_i(\omega ,\nu )\) is decreasing on \(\nu \) implies that \(P_i(\omega ,\nu )\) is increasing on \(\nu \). Thus, \(H_J(\omega ,\nu )\) is continuous and decreasing on \(\omega \) and \(\nu \), while \(H_S(\omega ,\nu )\) is continuous and decreasing on \(\omega \) and increasing on \(\nu \). These monotonous properties yields that solution of (5) is the unique, and (I) follows.

(II) If \(w^C=0\) then (9) implies (6). Thus, \(J_i(\nu )\) is defined uniquely. Substituting this \(J_i(\nu )\) into (9) and taking into account that \({\varvec{P}}\in \varPi _S\) implies the result.

Rights and permissions

Reprints and permissions

Copyright information

© 2019 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Garnaev, A., Trappe, W., Petropulu, A. (2019). Maxmin Strategy for a Dual Radar and Communication OFDM Waveforms System Facing Uncertainty About the Background Noise. In: Moerman, I., Marquez-Barja, J., Shahid, A., Liu, W., Giannoulis, S., Jiao, X. (eds) Cognitive Radio Oriented Wireless Networks. CROWNCOM 2018. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 261. Springer, Cham. https://doi.org/10.1007/978-3-030-05490-8_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-05490-8_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-05489-2

  • Online ISBN: 978-3-030-05490-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics