ACM Home Page
Please provide us with feedback. Feedback
Efficient uncoordinated FHSS anti-jamming communication
Full text PdfPdf (573 KB)
Source
International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing table of contents
New Orleans, LA, USA
SESSION: Secure communication table of contents
Pages 207-218  
Year of Publication: 2009
ISBN:978-1-60558-624-3
Authors
Mario Strasser  ETH Zurich, Zurich, Switzerland
Christina Pöpper  ETH Zurich, Zurich, Switzerland
Srdjan Čapkun  ETH Zurich, Zurich, Switzerland
Sponsors
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 20,   Downloads (12 Months): 112,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1530748.1530778
What is a DOI?

ABSTRACT

We address the problem of jamming-resistant communication in scenarios in which the communicating parties do not share secret keys. This includes scenarios where the communicating parties are not known in advance or where not all parties can be trusted (e.g., jamming-resistant key establishment or anti-jamming broadcast to a large set of unknown receivers). In these cases, the deployment of shared secret keys is unrealistic, and therefore this problem cannot be solved using existing anti-jamming solutions like FHSS and DSSS that depend on pre-shared keys. Recently, a solution to this problem has been proposed that introduces Uncoordinated Frequency Hopping (UFH), a new spread-spectrum anti-jamming technique that does not rely on secret keys. In this work, we investigate the efficiency of UFH-based communication: we identify optimal strategies for the UFH frequency channel selection and we propose a set of new UFH-based anti-jamming schemes that, compared to the original UFH proposal, reduce the communication latency up to one-half (i.e., increase UFH communication throughput up to two times).


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
ECRYPT Yearly Report on Algorithms and Keysize. D.SPA.28, July 2008. IST-2002-507932.
2
 
3
David Adamy. A first course in electronic warfare. Artech House, 2001.
 
4
Leemon C. Baird, William L. Bahn, Michael D. Collins, Martin C. Carlisle, and Sean C. Butler. Keyless Jam Resistance. In Proceedings of the IEEE Information Assurance and Security Workshop (IAW), 2007.
 
5
Niko Bari and Birgit Pfitzmann. Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees. In Advances in Cryptology EUROCRYPT, volume 1233/1997 of Lecture Notes in Computer Science, pages 480--494. Springer Berlin/Heidelberg, 1997.
 
6
 
7
 
8
Jerry T. Chiang and Yih-Chun Hu. Dynamic Jamming Mitigation for Wireless Broadcast Networks. In Proceedings of the 27th IEEE Conference on Computer Communications (INFOCOM), 2008.
 
9
10
 
11
Anna Lisa Ferrara, Matthew Green, Susan Hohenberger, and Michael Østergaard Pedersen. Practical Short Signature Batch Verification. Topics in Cryptology (CT-RSA), 2009.
 
12
Chris Karlof, Naveen Sastry, Yaping Li, Adrian Perrig, and J. Doug Tygar. Distillation Codes and Applications to DoS Resistant Multicast Authentication. In Proceedings of the 11th Network and Distributed Systems Security Symposium (NDSS), 2004.
 
13
Mingyan Li, Iordanis Koutsopoulos, and Radha Poovendran. Optimal Jamming Attacks and Network Defense Policies in Wireless Sensor Networks. In Proceedings of the 26th IEEE Conference on Computer Communications (INFOCOM), 2007.
 
14
 
15
16
 
17
Frosso S. Makri, Andreas N. Philippou, and Zaharias M. Psillakis. Success run statistics defined on an urn model. Advances in Applied Probability, 39(4):991--1019, 2007.
 
18
Petar Maymounkov. Online Codes. Technical Report TR2002-833, New York University, Nov 2002.
 
19
Lan Nguyen. Accumulators from Bilinear Pairings and Applications. In Topics in Cryptology -- CT-RSA, volume 3376/2005 of Lecture Notes in Computer Science, pages 275--292. Springer Berlin/Heidelberg, 2005.
20
21
 
22
Richard A. Poisel. Modern Communications Jamming Principles and Techniques. Artech House, 2004.
 
23
Christina Pöpper, Mario Strasser, and Srdjan Capkun. Jamming-resistant broadcast communication without shared keys. Technical Report 609, ETH Zurich, 2008.
 
24
Mohammad Amin Shokrollahi. Raptor Codes. IEEE Transactions on Information Theory, 52(6):2551--2567, June 2006.
25
 
26
 
27
 
28
29


Collaborative Colleagues:
Mario Strasser: colleagues
Christina Pöpper: colleagues
Srdjan Čapkun: colleagues