Towards optimal adaptive UFH-based anti-jamming wireless communication

IEEE Journal on Selected Areas in Communications

Volumn 30, Issue 1, 2012, Pages 16-30

  Wang, Qian ^a   Xu, Ping ^b   Ren, Kui ^a   Li, Xiang Yang ^b,c  

^a Illinois Institute of Technology   (United States)

^b Illinois Institute of Technology   (United States)

^c TSINGHUA UNIVERSITY   (China)

Author keywords

Anti jamming; multi armed bandit problem; uncoordinated frequency hopping; wireless communication

Indexed keywords

ANTI-JAMMING; EXTENSIVE SIMULATIONS; INTERNAL STRUCTURE; MULTI ARMED BANDIT; MULTI-ARMED BANDIT PROBLEM; ONLINE OPTIMIZATION; OPTIMALITY; PERFORMANCE CHARACTERIZATION; PERFORMANCE EVALUATION; SPACE COMPLEXITY; STRATEGY SELECTION; THEORETICAL FOUNDATIONS; WIRELESS COMMUNICATION; WIRELESS COMMUNICATIONS;

COMMUNICATION; FREQUENCY HOPPING; GAME THEORY; LEARNING ALGORITHMS; OPTIMIZATION; SECURITY SYSTEMS; SITE SELECTION; WIRELESS TELECOMMUNICATION SYSTEMS;

JAMMING;

EID: 84855425212     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2012.120103     Document Type: Article

References (29)

1. Q. Wang, P. Xu, K. Ren, and X.-Y. Li, "Delay-bounded adaptive ufhbased anti-jamming wireless communication," in Proc. IEEE INFOCOM' 11, 2011, pp. 1413-1421.
2. L. Lazos, S. Liu, and M. Krunz, "Mitigating control-channel jamming attacks in multi-channel ad hoc networks," in Proc. ACM WISEC'09, 2009, pp. 169-180.
3. D. Slater, P. Tague, R. Poovendran, and B. J. Matt, "A coding-theoretic approach for efficient message verification over insecure channels," in Proc. ACM WISEC'09, 2009, pp. 151-160.
4. W. Xu, W. Trappe, Y. Zhang, and T. Wood, "The feasibility of launching and detecting jamming attacks in wireless networks," in Proc. ACM MobiHoc'05, 2005, pp. 46-57. (Pubitemid 43037582)
5. A. J. Viterbi, CDMA: Principles of Spread Spectrum Communication. Addison Wesley, 1995.
6. M. Strasser, C. Pöpper, and S. Capkun, "Efficient uncoordinated fhss anti-jamming communication," in Proc. ACM MobiHoc'09, 2009, pp. 207-218.
7. M. Strasser, C. Pöpper, S. Capkun, and M. Cagalj, "Jamming-resistant key establishment using uncoordinated frequency hopping," in Proc. IEEE S&P'08, 2008, pp. 64-78.
8. C. Pöpper, M. Strasser, and S. Capkun, "Jamming-resistant broadcast communication without shared keys," in Proc. USENIX'09 Security Symposium, 2009, pp. 231-248.
9. T. Jin, G. Noubir, and B. Thapa, "Zero pre-shared secret key establishment in the presence of jammers," in Proc. MobiHoc'09, 2009, pp. 219-228.
10. Y. Liu, P. Ning, H. Dai, and A. Liu, "Randomized differential dsss: Jamming-resistant wireless broadcast communication," in Proc. IEEE INFOCOM'10, 2010, pp. 695-703.
11. W. Arbaugh, "Improving the latency of the probe phase during 802.11 handoff," online at www.umiacs.umd.edu/partnerships/ltsdocs/Arbaugtalk2. pdf.
12. T. Shu and M. Krunz, "Throughput-efficient sequential channel sensing and probing in cognitive radio networks under sensing errors," in Proc. MobiCom'09, 2009, pp. 37-48.
13. J. C. Gittins, "Bandit processes and dynamic allocation indices," Journal of the Royal Statistical Society Series B Methodological, vol. 41, pp. 148-177, 1979.
14. P. Whittle, "Restless bandits: activity allocation in a changing world," Journal of Applied Probability, vol. 25A, pp. 287-298, 1988.
15. P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire, "Gambling in a rigged casino: The adversarial multi-arm bandit problem," in Proc. IEEE FOCS'95, 1995, pp. 322-331.
16. -, "The nonstochastic multiarmed bandit problem," SIAM J. Comput., vol. 32, no. 1, pp. 48-77, 2002.
17. A. Kalai and S. Vempala, "Efficient algorithms for online decision problems," in Proc. COLT'03, 2003, pp. 26-40. (Pubitemid 37053193)
18. B. Awerbuch and R. D. Kleinberg, "Adaptive routing with end-to-end feedback: distributed learning and geometric approaches," in Proc. ACM STOC'04, 2004, pp. 45-53.
19. H. B. McMahan and A. Blum, "Online geometric optimization in the bandit setting against an adaptive adversary," in Proc. COLT'04, 2004, pp. 109-123. (Pubitemid 38940329)
20. A. György, T. Linder, G. Lugosi, and G. Ottucsák, "The on-line shortest path problem under partial monitoring," J. Mach. Learn. Res., vol. 8, pp. 2369-2403, 2007. (Pubitemid 350064071)
21. A. T. Kalai and S. Vempala, "Efficient algorithms for online decision problems," Journal of Computer System and Sciences, vol. 71, no. 3, pp. 291-307, 2005. (Pubitemid 41278182)
22. M. Strasser, B. Danev, and S. Čapkun, "Detection of reactive jamming in sensor networks," ACM Transactions on Sensor Networks (TOSN), vol. 7, pp. 16:1-16:29, September 2010.
23. D. Boneh, B. Lynn, and H. Shacham, "Short signatures from the weil pairing," in Proc. ASIACRYPT'01. Springer-Verlag, pp. 514-532.
24. X.-Y. Li, Y. Wang, and W. Feng, "Multiple round random ball placement: Power of second chance," in Proc. COCOON '09, 2009, pp. 439- 448.
25. S. G. Wilson, "Digital modulation and coding," Prentice-Hall, 1996.
26. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. A. Spielman, and V. Stemann, "Practical loss-resilient codes," in Proc. ACM STOC'97, 1997, pp. 150-159.
27. P. Maymounkov, "Online codes," Technical Report TR2002-833, New York University, 2002.
28. M. Luby, "Lt codes," in Proc. IEEE FOCS'02, 2002, pp. 271-280.
29. A. Shokrollahi, "Raptor codes," IEEE/ACM Trans. Netw., vol. 14, no. SI, pp. 2551-2567, 2006. (Pubitemid 43898908)