Skip to main content

Jamming Resistant Schemes for Wireless Communication: A Combinatorial Approach

  • Conference paper
Information Systems Security (ICISS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 8303))

Included in the following conference series:

  • 1058 Accesses

Abstract

Jamming resistant communication mechanism is essential for reliable wireless communication. In this paper, we propose two channel hopping protocols using combinatorial designs for alleviating jamming attacks. One of these protocols is for unicast communication model and the other is aimed for multicast communication model. To the best of our knowledge, this is the first paper which uses combinatorial designs as a tool to solve the anti-jamming communication problem. Our protocols guarantee that the sender and receiver rendezvous within a finite amount of time to exchange information. In our protocol, each sender and receiver has a secret hopping sequence, instead of pairwise secret codes. Our unicast-communication protocol ensures that no two pairs of nodes collide over a single channel at the same time. Besides, the channels used by node-pairs for communication keep changing after every session making it infeasible for the adversary to anticipate the common channel to be used by a particular pair of nodes. We show these protocols using combinatorial designs performs better than existing anti-jamming protocol.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baird, L.C., Bahn, W.L., Collins, M.D., Carlisle, M.C., Butler, S.C.: Keyless jam resistance. In: IEEE Information Assurance and Security Workshop, pp. 143–150 (2009)

    Google Scholar 

  2. Bian, K., Park, J.-M., Chen, R.: A quorum-based framework for establishing control channels in dynamic spectrum access networks. In: ACM MOBICOM, pp. 25–36 (2009)

    Google Scholar 

  3. Çamtepe, S.A., Yener, B.: Combinatorial design of key distribution mechanisms for wireless sensor networks. In: Samarati, P., Ryan, P.Y.A., Gollmann, D., Molva, R. (eds.) ESORICS 2004. LNCS, vol. 3193, pp. 293–308. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Lee, E.-K., Oh, S.-Y., Gerla, M.: Randomized channel hopping scheme for anti-jamming communication. IEEE Wireless Days, 1–5 (2010)

    Google Scholar 

  5. Lee, E.-K., Oh, S.-Y., Gerla, M.: Frequency quorum rendezvous for fast and resilient key establishment under jamming attack. SIGMOBILE Mob. Comput. Commun. Rev, 1–3 (2010)

    Google Scholar 

  6. Lee, J., Stinson, D.R.: A combinatorial approach to key predistribution for distributed sensor networks. In: IEEE WCNC (2005)

    Google Scholar 

  7. Pei, D.: Authentication Codes and Combinatorial Designs. Chapman & HallCRC (2006)

    Google Scholar 

  8. Poisel, R.A.: Modern Communications Jamming Principles and Techniques. Artech House Publishers (2006)

    Google Scholar 

  9. Pöpper, C., Strasser, M., Capkun, S.: Jamming-resistant broadcast communication without shared keys. In: USENIX Security Symposium, pp. 231–248 (2009)

    Google Scholar 

  10. Pöpper, C., Strasser, M., Capkun, S.: Anti-jamming broadcast communication using uncoordinated spread spectrum techniques. IEEE Journal on Selected Areas in Communications 28(5), 703–715 (2010)

    Article  Google Scholar 

  11. Slater, D., Tague, P., Poovendran, R., Matt, B.J.: A coding-theoretic approach for efficient message verification over insecure channels. In: ACM WISEC, pp. 151–160 (2009)

    Google Scholar 

  12. Stinson, D.R.: Combinatorial Designs: Construction and Analysis. Springer, New York (2004)

    Google Scholar 

  13. Strasser, M., Pöpper, C., Capkun, S.: Efficient uncoordinated fhss anti-jamming communication. In: ACM MobiHoc, pp. 207–218 (2009)

    Google Scholar 

  14. Strasser, M., Pöpper, C., Capkun, S., Cagalj, M.: Jamming-resistant key establishment using uncoordinated frequency hopping. In: IEEE Symposium on Security and Privacy, pp. 64–78 (2008)

    Google Scholar 

  15. Wood, A.D., Stankovic, J.A., Zhou, G.: Deejam: Defeating energy-efficient jamming in ieee 802.15.4-based wireless networks. In: IEEE SECON, pp. 60–69 (2007)

    Google Scholar 

  16. Xu, W., Trappe, W., Zhang, Y., Wood, T.: The feasibility of launching and detecting jamming attacks in wireless networks. In: ACM MobiHoc, pp. 46–57 (2005)

    Google Scholar 

  17. Nguyen, L.: Accumulators from bilinear pairings and applications. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 275–292. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  18. Barić, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 480–494. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  19. Luby, M.: LT Codes. In: Proc. 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bag, S., Ruj, S., Roy, B. (2013). Jamming Resistant Schemes for Wireless Communication: A Combinatorial Approach. In: Bagchi, A., Ray, I. (eds) Information Systems Security. ICISS 2013. Lecture Notes in Computer Science, vol 8303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45204-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45204-8_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45203-1

  • Online ISBN: 978-3-642-45204-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics