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.
This work has been supported in part by the Regional Government of Madrid (CM) grant Cloud4BigData (S2013/ICE-2894, cofunded by FSE & FEDER).
E. Zavou—Partially supported by FPU Grant from MECD.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
http://alljammer.com/. Accessed 8 April 2015
http://www.jammer-store.com/. Accessed 8 April 2015
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)
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)
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)
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)
Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial queuing theory. J. ACM (JACM) 48(1), 13–38 (2001)
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)
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)
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)
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)
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)
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)
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)
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)
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)
Jakubiak, M.: Cellular network coverage analysis using UAV and SDR. Master’s thesis, Tampere University of Technology (2014)
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)
Pruhs, K.: Competitive online scheduling for server systems. ACM SIGMETRICS Perform. Eval. Rev. 34(4), 52–58 (2007)
Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Handbook of Scheduling: Algorithms, Models, and Performance Analysis, p. 15-1 (2004)
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)
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)
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)
Tsibonis, V., Georgiadis, L., Tassiulas, L.: Exploiting wireless channel state information for throughput maximization. IEEE Trans. Inf. Theory 50(11), 2566–2582 (2004)
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)
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Fernández Anta, A., Georgiou, C., Zavou, E. (2015). Packet Scheduling over a Wireless Channel: AQT-Based Constrained Jamming. In: Bouajjani, A., Fauconnier, H. (eds) Networked Systems . NETYS 2015. Lecture Notes in Computer Science(), vol 9466. Springer, Cham. https://doi.org/10.1007/978-3-319-26850-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-26850-7_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26849-1
Online ISBN: 978-3-319-26850-7
eBook Packages: Computer ScienceComputer Science (R0)