Skip to main content
SpringerLink
Log in

Message-Driven Frequency Hopping Systems

  • Chapter
  • First Online:
Book cover Wireless Communications under Hostile Jamming: Security and Efficiency

  • 430 Accesses

Abstract

In this chapter, we present and analyze the original message-driven frequency hopping (MDFH) system and its enhanced version, anti-jamming message-driven frequency hopping (AJ-MDFH). MDFH is a three-dimensional modulation scheme, for which the selection of carrier frequencies is directly controlled by the encrypted information stream rather than by a pre-selected pseudo-random sequence as in conventional FH. The most significant property of MDFH is that transmission through hopping frequency control adds another dimension to the signal space, and the resulted coding gain can increase the system spectral efficiency by multiple times. When jamming is present, it is observed that MDFH is robust under strong jamming but experiences considerable performance losses under disguised jamming from sources that mimic the true signal. To overcome this limitation, we present the AJ-MDFH system. The main idea is to transmit a secure ID sequence along with the information stream. The ID sequence is generated through a cryptographic algorithm using the shared secret between the transmitter and the receiver, and it is then exploited by the receiver for effective signal extraction. It is shown that AJ-MDFH can effectively reduce the performance degradation caused by disguised jamming and is also robust under strong jamming. In addition, we extend AJ-MDFH to the multi-carrier case, which can increase the system efficiency and jamming resistance significantly through jamming randomization and frequency diversity and can readily be used as a collision-free multiple access system. Finally, based on the arbitrarily varying channel (AVC) model, we analyze the capacity of MDFH and AJ-MDFH under disguised jamming. We show that under the worst-case disguised jamming, as long as the secure ID sequence is unavailable to the jammer (which is ensured by AES), the AVC corresponding to AJ-MDFH is nonsymmetrizable. This implies that the deterministic capacity of AJ-MDFH with respect to the average probability of error is positive. On the other hand, due to lack of shared randomness, the AVC corresponding to MDFH is symmetric, resulting in zero deterministic capacity. We further calculate the capacity of AJ-MDFH and show that it converges as the ID constellation size goes to infinity.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    It is interesting to note that in [16], the message is used to select the spreading code in code-division multiple access, which is the counterpart of FH in spread-spectrum techniques.

  2. 2.

    A deterministic (n, k) code means that each k-bit data word is mapped to a unique n-bit codeword.

References

  1. G.R. Cooper and R.W. Nettleton. A spread spectrum technique for high capacity mobile communuzation. IEEE Transactions on Vehicular Technology, 27(4):264–275, Nov. 1978.

    Article  Google Scholar 

  2. A.J. Viterbi. A processing-satellite transponder for multlple access by low rate mobile users. In Proc. Digital Satellite Commun. Conf., pages 166–174, Montreal, Canada, October 1978.

    Google Scholar 

  3. E.A. Geraniotis and M.B. Pursley. Error probabilities for slow frequency-hopped spread-spectrum multiple-access communication over fading channels. IEEE Transactions on Communications, 30(5):996–1009, May 1982.

    Article  Google Scholar 

  4. E.A. Geraniotis. Multiple-access capability of frequency-hopped spread-spectrum revisited: An analysis of the effect of unequal power levels. IEEE Transactions on Communications, 38(7):1066–1077, Jul. 1990.

    Article  Google Scholar 

  5. M.A. Wickert and R.L. Turcotte. Probability of error analysis for FHSS/CDMA communications in the presence of fading. IEEE Journal on Selected Areas in Communications, 10(3):523–534, Apr. 1992.

    Article  Google Scholar 

  6. Y.R. Tsai and J.F. Chang. Using frequency hopping spread spectrum technique to combat multipath interference in a multiaccessing environment. IEEE Transactions on Vehicular Technology, 43(2):211–222, May 1994.

    Article  Google Scholar 

  7. F. Dominique and J.H. Reed. Robust frequency hop synchronisation algorithm. Electronics Letters, 32:1450–1451, August 1996.

    Article  Google Scholar 

  8. M. Simon, G. Huth, and A. Polydoros. Differentially coherent detection of QASK for frequency-hopping systems–part i: Performance in the presence of a Gaussian noise environment. IEEE Transactions on Communications, 30:158–164, January 1982.

    Article  Google Scholar 

  9. Y.M. Lam and P.H. Wittke. Frequency-hopped spread-spectrum transmission with band-efficient modulations and simplified noncoherent sequence estimation. IEEE Transactions on Communications, 38:2184–2196, December 1990.

    Article  Google Scholar 

  10. Joonyoung Cho, Youhan Kim, and Kyungwhoon Cheun. A novel FHSS multiple-access network using M-ary orthogonal Walsh modulation. In Proc. 52nd IEEE Veh. Technol. Conf., volume 3, pages 1134–1141, Sept. 2000.

    Google Scholar 

  11. S. Glisic, Z. Nikolic, N. Milosevic, and A. Pouttu. Advanced frequency hopping modulation for spread spectrum WLAN. IEEE Journal on Selected Areas in Communications, 18:16–29, January 2000.

    Article  Google Scholar 

  12. Kwonhue Choi and Kyungwhoon Cheun. Maximum throughput of FHSS multiple-access networks using MFSK modulation. IEEE Transactions on Communications, 52(3):426–434, March 2004.

    Article  Google Scholar 

  13. Kang-Chun Peng, Chien-Hsiang Huang, Chien-Jung Li, and Tzyy-Sheng Horng. High-performance frequency-hopping transmitters using two-point Delta-Sigma modulation. IEEE Transactions on Microwave Theory and Techniques, 52:2529–2535, November 2004.

    Article  Google Scholar 

  14. K. Choi and K. Cheun. Optimum parameters for maximum throughput of FHMA system with multilevel FSK. IEEE Transactions on Vehicular Technology, 55:1485–1492, Sept. 2006.

    Article  Google Scholar 

  15. Qi Ling and Tongtong Li. Message-driven frequency hopping: Design and analysis. IEEE Transactions on Wireless Communications, 8(4):1773–1782, April 2009.

    Article  Google Scholar 

  16. F.H.P. Fitzek. The medium is the message. In Proc. IEEE Intl. Conf. Commun., volume 11, pages 5016–5021, June 2006.

    Google Scholar 

  17. Tongtong Li, Qi Ling, and Jian Ren. Physical layer built-in security analysis and enhancement algorithms for CDMA systems. EURASIP Journal on Wireless Communications and Networking, 2007:Article ID 83589, 7 pages, 2007.

    Google Scholar 

  18. John G. Proakis. Digital Communications. McGraw-Hill, fourth edition, 2000.

    Google Scholar 

  19. D.I. Goodman, P.S. Henry, and V.K. Prabhu. Frequency-hopped multilevel FSK for mobile radio. Bell System Technical Journal, 59:1257–1275, Sept. 1980.

    Article  Google Scholar 

  20. J.I. Marcum. Table of Q functions. U.S. Air Force Project RAND Res. Memo. M-339, January 1950. ASTIA Document AD 1165451, Rand Corp.

    Google Scholar 

  21. Lei Zhang, Huahui Wang, and Tongtong Li. Anti-jamming message-driven frequency hopping: part I – system design. IEEE Transactions on Wireless Communications, pages 70–79, 2013.

    Article  Google Scholar 

  22. Lei Zhang and Tongtong Li. Anti-jamming message-driven frequency hopping: part II — capacity analysis under disguised jamming. IEEE Transactions on Wireless Communications, Vol. 12, No. 1, pages 80–88, 2013.

    Article  Google Scholar 

  23. Advanced encryption standard. ser. FIPS-197, November 2001.

    Google Scholar 

  24. Leonard Lightfoot, Lei Zhang, and Tongtong Li. Secure collision-free frequency hopping for OFDMA based wireless networks. EURASIP Journal on Advances in Signal Processing, 2009, 2009.

    Google Scholar 

  25. R. Viswanathan and K. Taghizadeh. Diversity combining in FH/BFSK systems to combat partial band jamming. IEEE Transactions on Communications, 36(9):1062–1069, Sep 1988.

    Article  Google Scholar 

  26. Jhong Lee, L. Miller, and Young Kim. Probability of error analyses of a BFSK frequency-hopping system with diversity under partial-band jamming interference–part II: Performance of square-law nonlinear combining soft decision receivers. IEEE Transactions on Communications, 32(12):1243–1250, Dec 1984.

    Article  Google Scholar 

  27. L. Miller, Jhong Lee, and A. Kadrichu. Probability of error analyses of a BFSK frequency-hopping system with diversity under partial-band jamming interference–part III: Performance of a square-law self-normalizing soft decision receiver. IEEE Transactions on Communications, 34(7):669–675, Jul 1986.

    Article  Google Scholar 

  28. Jhong Lee and L. Miller. Error performance analyses of differential phase-shift-keyed/frequency-hopping spread-spectrum communication system in the partial-band jamming environments. IEEE Transactions on Communications, 30(5):943–952, May 1982.

    Article  Google Scholar 

  29. J.J. Kang and K.C. Teh. Performance of coherent fast frequency-hopped spread-spectrum receivers with partial-band noise jamming and AWGN. IEE Proceedings–Communications, 152(5):679–685, Oct. 2005.

    Article  Google Scholar 

  30. C. Esli and H. Delic. Antijamming performance of space-frequency coding in partial-band noise. IEEE Transactions on Vehicular Technology, 55(2):466–476, March 2006.

    Article  Google Scholar 

  31. S. Stein. Unified analysis of certain coherent and noncoherent binary communications systems. IEEE Transactions on Information Theory, 10(1):43–51, Jan 1964.

    Article  Google Scholar 

  32. Marek Kuczma. An Introduction to the Theory of Functional Equations and Inequalities: Cauchy’s Equation and Jensen’s Inequality. Springer, second edition, 2009.

    Google Scholar 

  33. D. Blackwell, L. Breiman, and AJ Thomasian. The capacities of certain channel classes under random coding. The Annals of Mathematical Statistics, pages 558–567, 1960.

    Article  Google Scholar 

  34. I. Csiszar and J. Körner. Information theory: coding theorems for discrete memoryless systems, volume 244. Academic press, 1981.

    MATH  Google Scholar 

  35. I. Csiszár and P. Narayan. Arbitrarily varying channels with constrained inputs and states. IEEE Transactions on Information Theory, 34(1):27–34, 1988.

    Article  MathSciNet  Google Scholar 

  36. I. Csiszar and P. Narayan. The capacity of the arbitrarily varying channel revisited: Positivity, constraints. IEEE Transactions on Information Theory, 34(2):181–193, 1988.

    Article  MathSciNet  Google Scholar 

  37. A. Lapidoth and P. Narayan. Reliable communication under channel uncertainty. IEEE Transactions on Information Theory, 44(6):2148–2177, Oct. 1998.

    Article  MathSciNet  Google Scholar 

  38. A.D. Sarwate. Robust and adaptive communication under uncertain interference. Technical report, Technical Report No. UCB/EECS-2008-86, University of California at Berkeley, 2008.

    Google Scholar 

  39. T. Ericson. Exponential error bounds for random codes in the arbitrarily varying channel. IEEE Transactions on Information Theory, 31(1):42–48, Jan. 1985.

    Article  MathSciNet  Google Scholar 

  40. R. Ahlswede. Elimination of correlation in random codes for arbitrarily varying channels. Probability Theory and Related Fields, 44(2):159–175, 1978.

    MathSciNet  MATH  Google Scholar 

  41. J.M. Borden, D.M. Mason, and R.J. McEliece. Some information theoretic saddlepoints. SIAM journal on control and optimization, 23:129, 1985.

    Article  MathSciNet  Google Scholar 

  42. T Basar and Y W Wu. Solutions to a class of minimax decision problems arising in communications systems. J. Optim. Theory Appl., 51:375–404, Decr 1986.

    Article  MathSciNet  Google Scholar 

  43. T. Başar. The Gaussian test channel with an intelligent jammer. IEEE Transactions on Information Theory, 29(1):152–157, 1983.

    Article  Google Scholar 

  44. T. Başar and G.J. Olsder. Dynamic noncooperative game theory, volume 23. Society for Industrial Mathematics, 1999.

    Google Scholar 

  45. I. Stiglitz. Coding for a class of unknown channels. 12(2):189–195, apr 1966.

    Google Scholar 

  46. J.G. Goh and S.V. Maric. The capacities of frequency-hopped code-division multiple-access channels. IEEE Transactions on Information Theory, 44(3):1204–1211, 1998.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Michigan State University, East Lansing, MI, USA

    Tongtong Li & Yuan Liang

  2. Zillow Inc, Seattle, WA, USA

    Tianlong Song

Authors
  1. Tongtong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tianlong Song
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuan Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Li, T., Song, T., Liang, Y. (2018). Message-Driven Frequency Hopping Systems. In: Wireless Communications under Hostile Jamming: Security and Efficiency. Springer, Singapore. https://doi.org/10.1007/978-981-13-0821-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-0821-5_3

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-0820-8

  • Online ISBN: 978-981-13-0821-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation