Abstract
We study an allocation problem that arises in various scenarios. For instance, a health monitoring system where ambulatory patients carry sensors that must periodically upload physiological data. Another example is participatory sensing, where communities of mobile device users upload periodically information about their environment. We assume that devices or sensors (generically called clients) join and leave the system continuously, and they must upload/download data to static devices (or base stations), via radio transmissions. The mobility of clients, the limited range of transmission, and the possibly ephemeral nature of the clients are modeled by characterizing each client with a life interval and a stations group, so that different clients may or may not coincide in time and/or stations to connect. The intrinsically shared nature of the access to base stations is modeled by introducing a maximum station bandwidth that is shared among its connected clients, a client laxity, which bounds the maximum time that an active client is not transmitting to some base station, and a client bandwidth, which bounds the minimum bandwidth that a client requires in each transmission. Under the model described, we study the problem of assigning clients to base stations so that every client transmits to some station in its group, limited by laxities and bandwidths. We call this problem the Station Assignment problem. We study the impact of the rate and burstiness of the arrival of clients on the solvability of Station Assignment. To carry out a worst-case analysis we use a typical adversarial methodology: we assume the presence of an adversary that controls the arrival and departure of clients. The adversary is limited by two parameters that model the rate and the burstiness of the stations load (hence, limitting the rate and burstiness of the client arrivals). Specifically, we show upper and lower bounds on the rate and burstiness of the arrival for various client arrival schedules and protocol classes. The problem has connections with Load Balancing and Scheduling, usually studied using competitive analysis. To the best of our knowledge, this is the first time that the Station Assignment problem is studied under adversarial arrivals.
This work was supported in part by the Comunidad de Madrid (S2009TIC-1692), the Spanish MICINN/MINECO (TEC2011-29688-C02-01), the National Natural Science Foundation of China (61020106002), the National Science Foundation (CCF-0937829, CCF-1114930), and Kean University UFRI grant.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling. In: SODA, pp. 493–500 (1997)
Anantharamu, L., Chlebus, B.S., Rokicki, M.A.: Adversarial multiple access channel with individual injection rates. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol. 5923, pp. 174–188. Springer, Heidelberg (2009)
Andrews, M., Awerbuch, B., Fernández, A., Leighton, F.T., Liu, Z., Kleinberg, J.M.: Universal-stability results and performance bounds for greedy contention-resolution protocols. J. ACM 48(1), 39–69 (2001)
Andrews, M., Zhang, L.: Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data. J. ACM 52(5), 809–834 (2005)
Aspnes, J., Azar, Y., Fiat, A., Plotkin, S.A., Waarts, O.: On-line load balancing with applications to machine scheduling and virtual circuit routing. In: STOC, pp. 623–631 (1993)
Azar, Y.: On-line load balancing. In: Online Algorithms, pp. 178–195 (1996)
Azar, Y., Broder, A.Z., Karlin, A.R.: On-line load balancing. Theor. Comput. Sci. 130(1), 73–84 (1994)
Azar, Y., Kalyanasundaram, B., Plotkin, S.A., Pruhs, K., Waarts, O.: On-line load balancing of temporary tasks. J. Algorithms 22(1), 93–110 (1997)
Bienkowski, M., Jurdzinski, T., Korzeniowski, M., Kowalski, D.R.: Distributed online and stochastic queuing on a multiple access channel. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 121–135. Springer, Heidelberg (2012)
Blesa, M.J., Calzada, D., Fernández, A., López, L., Martínez, A.L., Santos, A., Serna, M.J., Thraves, C.: Adversarial queueing model for continuous network dynamics. Theor. Comput. Syst. 44(3), 304–331 (2009)
Borodin, A., Kleinberg, J.M., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial queuing theory. J. ACM 48(1), 13–38 (2001)
Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Adversarial queuing on the multiple-access channel. In: Proceedings of the 25th ACM Symposium on Principles of Distributed Computing (PODC), pp. 92–101 (2006)
Graham, R.L.: Bounds on multiprocessing timing anomalies. Bell Syst. Tech. J. 45, 1563–1581 (1966)
Karger, D.R., Phillips, S.J., Torng, E.: A better algorithm for an ancient scheduling problem. J. Algorithms 20, 400–430 (1996)
Kesselheim, T.: Dynamic packet scheduling in wireless networks. In: PODC, pp. 281–290 (2012)
Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models and Performance Analysis (Chapter 15), pp. 15-1–15-41. CRC Press, Boca Raton (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernández Anta, A., Kowalski, D.R., Mosteiro, M.A., Wong, P.W.H. (2014). Station Assignment with Applications to Sensing. In: Flocchini, P., Gao, J., Kranakis, E., Meyer auf der Heide, F. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2013. Lecture Notes in Computer Science(), vol 8243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45346-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-45346-5_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45345-8
Online ISBN: 978-3-642-45346-5
eBook Packages: Computer ScienceComputer Science (R0)