Abstract
We consider a wireless channel between a single pair of stations (sender and receiver) that is being “watched” and disrupted by a malicious, adversarial jammer. The sender’s objective is to transmit as much useful data as possible, over the channel, despite the jams that are caused by the adversary. The data is transmitted as the payload of packets, and becomes useless if the packet is jammed. In this work, we develop deterministic scheduling algorithms that decide the lengths of the packets to be sent, in order to maximize the total payload successfully transmitted over period T in the presence of up to f packet jams, useful payload.
We first consider the case where all packets must be of the same length and compute the optimal packet length that leads to the best possible useful payload. Then, we consider adaptive algorithms; ones that change the packet length based on the feedback on jammed packets received. We propose an optimal scheduling algorithm that is essentially a recursive algorithm that calculates the length of the next packet to transmit based on the packet errors that have occurred up to that point. We make a thorough non trivial analysis for the algorithm and discuss how our solutions could be used to solve a more general problem than the one we consider.
This research was supported in part by Ministerio de Economía y Competitividad grant TEC2014-55713-R, Regional Government of Madrid (CM) grant Cloud4BigData (S2013/ICE-2894, cofunded by FSE&FEDER), and grant FPU12/00505 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
Notes
- 1.
As we assume that the transmission time of each packet is equal to its length, it follows that T is an absolute upper bound on the useful payload transmitted..
- 2.
We assume that the sender has data with total payload greater than T.
References
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)
Fernández Anta, A., Georgiou, C., Zavou, E.: Packet scheduling over a wireless channel: AQT-based constrained jamming. In: Proceedings of NETYS (2015)
Awerbuch, B., Richa, A., Scheideler, C.: A jamming-resistant mac protocol for single-hop wireless networks. In: Proceedings of PODC, pp. 45–54 (2008)
Dolev, S., Gilbert, S., Guerraoui, R., Kowalski, D., Newport, C., Kohn, F., Lynch, N.: Reliable distributed computing on unreliable radio channels. In: Proceedings of MobiHoc S\(^3\) workshop, pp. 1–4 (2009)
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)
Pelechrinis, K., Iliofotou, M., Krishnamurthy, S.V.: Denial of service attacks in wireless networks: the case of jammers. IEEE Commun. Surv. Tutor. 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, pp. 15-1–15-41 (2004)
Richa, A., Scheideler, C., Schmid, S., Zhang, J.: Competitive and fair medium access despite reactive jamming. In: Proceedings of ICDCS, pp. 507–516 (2011)
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 (2011)
Richa, A., Scheideler, C., Schmid, S., Zhang, J.: Competitive and fair throughput for co-existing networks under adversarial interference. In: Proceedings of PODC, pp. 291–300 (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)
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). Adaptive Scheduling Over a Wireless Channel Under Constrained Jamming. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, DZ. (eds) Combinatorial Optimization and Applications. Lecture Notes in Computer Science(), vol 9486. Springer, Cham. https://doi.org/10.1007/978-3-319-26626-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-26626-8_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26625-1
Online ISBN: 978-3-319-26626-8
eBook Packages: Computer ScienceComputer Science (R0)