Advertisement

Packet Scheduling over a Wireless Channel: AQT-Based Constrained Jamming

  • Antonio Fernández Anta
  • Chryssis Georgiou
  • Elli ZavouEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9466)

Abstract

In this paper we consider a two-node setting with a sender transmitting packets to a receiver over a wireless channel. Unfortunately, the channel can be jammed, thus corrupting the packet that is being transmitted at the time. The sender has a specific amount of data that needs to be sent to the receiver and its objective is to complete the transmission of the data as quickly as possible in the presence of jamming.

We assume that the jamming is controlled by a constrained adversary. In particular, the adversary’s power is constrained by two parameters, \(\rho \) and \(\sigma \). Intuitively, \(\rho \) represents the rate at which the adversary can jam the channel, and \(\sigma \) the length of the largest bursts of jams it can cause. This definition corresponds to the translation of the Adversarial Queuing Theory (AQT) constrains, typically defined for packet injections in similar settings, to channel jamming.

We propose deterministic scheduling algorithms that decide the lengths of the packets to be sent by the sender in order to minimize the transmission time. We first assume all packets being of the same length (uniform) and characterize the corresponding optimal packet length. Then, we show that if the packet length can be adapted, for specific values of \(\rho \) and \(\sigma \) the transmission time can be improved.

Keywords

Packet scheduling Wireless channel Unreliable communication Adversarial jamming Adversarial Queueing Theory 

Notes

Acknowledgments

The authors would like to thank Dariusz Kowalski and Joerg Widmer for many fruitful discussions. We would also like to thank the anonymous reviewers for their constructive comments and suggestions that helped us improve the presentation of our work.

References

  1. 1.
    http://alljammer.com/. Accessed 8 April 2015
  2. 2.
    http://www.jammer-store.com/. Accessed 8 April 2015
  3. 3.
    Andrews, M., Awerbuch, B., Fernández, A., Leighton, T., Liu, Z., Kleinberg, J.: Universal-stability results and performance bounds for greedy contention-resolution protocols. J. ACM (JACM) 48(1), 39–69 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Fernández Anta, A., Georgiou, C., Kowalski, D.R., Widmer, J., Zavou, E.: Measuring the impact of adversarial errors on packet scheduling strategies. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 261–273. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  5. 5.
    Awerbuch, B., Richa, A., Scheideler, C.: A jamming-resistant mac protocol for single-hop wireless networks. In: Proceedings of the Twenty-Seventh ACM Symposium on Principles of Distributed Computing, PODC 2008, pp. 45–54. ACM, New York (2008)Google Scholar
  6. 6.
    Bhagwat, P., Bhattacharya, P., Krishna, A., Tripathi, S.K.: Enhancing throughput over wireless lans using channel state dependent packet scheduling. In: Proceedings of IEEE Fifteenth Annual Joint Conference of the IEEE Computer Societies. Networking the Next Generation, INFOCOM 1996, vol. 3, pp. 1133–1140. IEEE (1996)Google Scholar
  7. 7.
    Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial queuing theory. J. ACM (JACM) 48(1), 13–38 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Chlebus, B.S., Cholvi, V., Kowalski, D.R.: Stability of adversarial routing with feedback. In: Gramoli, V., Guerraoui, R. (eds.) NETYS 2013. LNCS, vol. 7853, pp. 206–220. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  9. 9.
    Chlebus, B.S., Cholvi, V., Kowalski, D.R.: Universal routing in multi hop radio networks. In: Proceedings of the 10th ACM International Workshop on Foundations of Mobile Computing, pp. 19–28. ACM (2014)Google Scholar
  10. 10.
    Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Adversarial queuing on the multiple-access channel. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, pp. 92–101. ACM (2006)Google Scholar
  11. 11.
    Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Stability of the multiple-access channel under maximum broadcast loads. In: Masuzawa, T., Tixeuil, S. (eds.) SSS 2007. LNCS, vol. 4838, pp. 124–138. Springer, Heidelberg (2007) CrossRefGoogle Scholar
  12. 12.
    Dolev, S., Gilbert, S., Guerraoui, R., Kowalski, D.R., Newport, C., Kohn, F., Lynch, N.: Reliable distributed computing on unreliable radio channels. In: Proceedings of the 2009 MobiHoc S 3 Workshop on MobiHoc S 3, pp. 1–4. ACM (2009)Google Scholar
  13. 13.
    Faughnan, M.S., Hourican, B.J., MacDonald, G.C., Srivastava, M., Wright, J.A., Haimes, Y.Y., Andrijcic, E., Guo, Z., White, J.C.: Risk analysis of unmanned aerial vehicle hijacking and methods of its detection. In: 2013 IEEE Systems and Information Engineering Design Symposium (SIEDS), pp. 145–150. IEEE (2013)Google Scholar
  14. 14.
    Fu, Z., Zerfos, P., Luo, H., Lu, S., Zhang, L., Gerla, M.: The impact of multihop wireless channel on TCP throughput and loss. In: Twenty-Second Annual Joint Conference of the IEEE Computer and Communications, INFOCOM 2003, IEEE Societies, vol. 3, pp. 1744–1753. IEEE (2003)Google Scholar
  15. 15.
    Gilbert, S., Guerraoui, R., Newport, C.: Of malicious motes and suspicious sensors: on the efficiency of malicious interference in wireless networks. Theor. Comput. Sci. 410(6), 546–569 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Gummadi, R., Wetherall, D., Greenstein, B., Seshan, S.: Understanding and mitigating the impact of RF Interference on 802.11 networks. ACM SIGCOMM Comput. Commun. Rev. 37(4), 385–396 (2007)CrossRefGoogle Scholar
  17. 17.
    Jakubiak, M.: Cellular network coverage analysis using UAV and SDR. Master’s thesis, Tampere University of Technology (2014)Google Scholar
  18. 18.
    Pelechrinis, K., Iliofotou, M., Krishnamurthy, S.V.: Denial of service attacks in wireless networks: the case of jammers. IEEE Commun. Surv. Tutorials 13(2), 245–257 (2011)CrossRefGoogle Scholar
  19. 19.
    Pruhs, K.: Competitive online scheduling for server systems. ACM SIGMETRICS Perform. Eval. Rev. 34(4), 52–58 (2007)CrossRefGoogle Scholar
  20. 20.
    Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Handbook of Scheduling: Algorithms, Models, and Performance Analysis, p. 15-1 (2004)Google Scholar
  21. 21.
    Richa, A., Scheideler, C., Schmid, S., Zhang, J.: Towards jamming-resistant and competitive medium access in the SINR model. In: Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, pp. 33–36. ACM (2011)Google Scholar
  22. 22.
    Richa, A., Scheideler, C., Schmid, S., Zhang, J.: Competitive and fair throughput for co-existing networks under adversarial interference. In: Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, pp. 291–300. ACM (2012)Google Scholar
  23. 23.
    Thuente, D., Acharya, M.: Intelligent jamming in wireless networks with applications to 802.11 b and other networks. In: Proceedings of MILCOM, vol. 6 (2006)Google Scholar
  24. 24.
    Tsibonis, V., Georgiadis, L., Tassiulas, L.: Exploiting wireless channel state information for throughput maximization. IEEE Trans. Inf. Theory 50(11), 2566–2582 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    Uysal-Biyikoglu, E., Prabhakar, B., El Gamal, A.: Energy-efficient packet transmission over a wireless link. IEEE/ACM Trans. Netw. 10(4), 487–499 (2002)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Antonio Fernández Anta
    • 1
  • Chryssis Georgiou
    • 2
  • Elli Zavou
    • 1
    • 3
    Email author
  1. 1.IMDEA Networks InstituteMadridSpain
  2. 2.University of CyprusNicosiaCyprus
  3. 3.Universidad Carlos III de MadridMadridSpain

Personalised recommendations