Access the full text.
Sign up today, get DeepDyve free for 14 days.
Kewei Sha, Guoxing Zhan, Weisong Shi, M. Lumley, Clairy Wiholm, B. Arnetz (2008)
SPA: a smart phone assisted chronic illness self-management system with participatory sensing
B. Kalyanasundaram, K. Pruhs (1996)
An optimal deterministic algorithm for online b-matching
A Bar-Noy, RE Ladner, T Tamir (2007)
Windows scheduling as a restricted version of bin packingACM Trans. Algorithms, 3
Antonio Fernández, D. Kowalski, Miguel Mosteiro, Prudence Wong (2013)
Station Assignment with Applications to Sensing
M. Andrews, S. Antonakopoulos, Lisa Zhang (2010)
Minimum-Cost Network Design with (Dis)economies of Scale2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Y. Azar, A. Broder, Anna Karlin (1992)
On-line load balancingProceedings., 33rd Annual Symposium on Foundations of Computer Science
S. Albers, Matthias Hellwig (2011)
On the Value of Job Migration in Online Makespan MinimizationAlgorithmica, 79
Y. Azar, Arik Litichevskey (2004)
Maximizing throughput in multi-queue switchesAlgorithmica, 45
R. Holte, A. Mok, L. Rosier, Igor Tulchinsky, D. Varvel (1989)
The pinwheel: a real-time scheduling problem[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track, 2
EG Coffman, G Galambos, S Martello, D Vigo (1998)
Handbook of Combinatorial Optimization
Sanjoy Baruah, J. Goossens, J. Leung (2004)
Scheduling real-time tasks: algorithms and complexity
Martín Farach-Colton, Katia Leal, Miguel Mosteiro, Christopher Thraves (2014)
Dynamic Windows Scheduling with ReallocationJournal of Experimental Algorithmics (JEA), 26
M. Bender, Martín Farach-Colton, S. Fekete, Jeremy Fineman, Seth Gilbert (2013)
Reallocation Problems in SchedulingAlgorithmica, 73
Bo Ji, G. Gupta, Manu Sharma, Xiaojun Lin, N. Shroff (2012)
Achieving Optimal Throughput and Near-Optimal Asymptotic Delay Performance in Multichannel Wireless Networks With Low Complexity: A Practical Greedy Scheduling PolicyIEEE/ACM Transactions on Networking, 23
W. Chan, Prudence Wong (2004)
On-Line Windows Scheduling of Temporary Items
Udo Adamy, T. Erlebach (2003)
Online Coloring of Intervals with Bandwidth
W. Khan, Yang Xiang, M. Aalsalem, Quratulain Arshad (2013)
Mobile Phone Sensing Systems: A SurveyIEEE Communications Surveys & Tutorials, 15
W. Chan, T. Lam, Prudence Wong (2008)
Dynamic bin packing of unit fractions itemsTheor. Comput. Sci., 409
Tobias Jacobs, Salvatore Longo (2014)
A New Perspective on the Windows Scheduling ProblemArXiv, abs/1410.7237
S Baruah, J Goossens (2004)
Handbook of Scheduling: Algorithms
Francesco Restuccia, Sajal Das, J. Payton (2015)
Incentive Mechanisms for Participatory SensingACM Transactions on Sensor Networks (TOSN), 12
A. Bar-Noy, R. Bhatia, J. Naor, B. Schieber (2002)
Minimizing service and operation costs of periodic schedulingMath. Oper. Res., 27
L. Becchetti, S. Diggavi, S. Leonardi, S. Marchetti-Spaccamela, S. Muthukrishnan, T. Nandagopal, A. Vitaletti (2005)
Downlink Scheduling for Multirate Wireless NetworksNetworks, 45
A. Fiat, G. Woeginger (1998)
Developments from a June 1996 seminar on Online algorithms: the state of the art
L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, A. Vitaletti, S. Diggavi, S. Muthukrishnan, T. Nandagopal (2002)
Parallel scheduling problems in next generation wireless networksNetworks, 45
S. Albers, H. Fujiwara (2006)
Energy-efficient algorithms for flow time minimizationACM Transactions on Algorithms (TALG), 3
L. Epstein (2006)
Bin Packing with Rejection RevisitedAlgorithmica, 56
E. Coffman, G. Galambos, S. Martello, D. Vigo (1999)
Bin Packing Approximation Algorithms: Combinatorial Analysis
E. Kanjo, S. Benford, M. Paxton, A. Chamberlain, D. Fraser, Dawn Woodgate, D. Crellin, A. Woolard (2008)
MobGeoSen: facilitating personal geosensor data collection and visualization using mobile phonesPersonal and Ubiquitous Computing, 12
L. Epstein, T. Erlebach, Asaf Levin (2006)
Variable Sized Online Interval Coloring with BandwidthAlgorithmica, 53
E. Coffman, J. Csirik, G. Galambos, S. Martello, D. Vigo (2013)
Bin packing approximation algorithms: Survey and classification
Irene Finocchi, F. Grandoni, G. Italiano (2009)
Resilient dictionariesACM Trans. Algorithms, 6
H. Chan, W. Chan, T. Lam, Lap-Kei Lee, Kin-Sum Mak, Prudence Wong (2009)
Optimizing throughput and energy in online deadline schedulingACM Trans. Algorithms, 6
A. Bar-Noy, R. Ladner (2002)
Windows scheduling problems for broadcast systems
J. Feldman, Aranyak Mehta, V. Mirrokni, S. Muthukrishnan (2009)
Online Stochastic Matching: Beating 1-1/e2009 50th Annual IEEE Symposium on Foundations of Computer Science
P. Sanders, N. Sivadasan, M. Skutella (2004)
Online Scheduling with Bounded MigrationMath. Oper. Res., 34
Luca Cominardi, F. Giust, C. Bernardos, A. Oliva (2017)
Distributed mobility management solutions for next mobile network architecturesComput. Networks, 121
J. Balogh, J. Békési, G. Galambos (2010)
New lower bounds for certain classes of bin packing algorithmsTheor. Comput. Sci., 440-441
N. Bansal, H. Chan, K. Pruhs (2009)
Speed Scaling with an Arbitrary Power Function
Anupam Gupta, Ravishankar Krishnaswamy, K. Pruhs (2011)
Online Primal-Dual for Non-linear Optimization with Applications to Speed ScalingArXiv, abs/1109.5931
F Restuccia, SK Das, J Payton (2016)
Incentive mechanisms for participatory sensing: survey and research challengesTOSN, 12
We study a dynamic allocation problem that arises in various scenarios where mobile clients joining and leaving the system have to communicate with static stations via radio transmissions. Restrictions are a maximum delay, or laxity, between consecutive client transmissions and a maximum bandwidth that a station can share among its clients. We study the problem of assigning clients to stations so that every client transmits to some station, satisfying those restrictions. We consider reallocation algorithms, where clients are revealed at its arrival time, the departure time is unknown until they leave, and clients may be reallocated to another station, but at a cost proportional to the reciprocal of the client’s laxity. We present negative results for previous related protocols that motivate the study; we introduce new protocols that expound trade-offs between station usage and reallocation cost; we determine experimentally a classification of the clients attempting to balance those opposite goals; we prove theoretically bounds on our performance metrics; and we show through simulations that, for realistic scenarios, our protocols behave much better than our theoretical guarantees.
Algorithmica – Springer Journals
Published: May 30, 2018
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.