Packet Scheduling over a Wireless Channel: AQT-Based Constrained Jamming
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.
KeywordsPacket scheduling Wireless channel Unreliable communication Adversarial jamming Adversarial Queueing Theory
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.
- 1.http://alljammer.com/. Accessed 8 April 2015
- 2.http://www.jammer-store.com/. Accessed 8 April 2015
- 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.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
- 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.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
- 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.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.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
- 17.Jakubiak, M.: Cellular network coverage analysis using UAV and SDR. Master’s thesis, Tampere University of Technology (2014)Google Scholar
- 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.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.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.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