Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Station Assignment with Reallocation

Station Assignment with Reallocation 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Algorithmica Springer Journals

Station Assignment with Reallocation

Loading next page...
 
/lp/springer_journal/station-assignment-with-reallocation-NsqmnM00i9

References (41)

Publisher
Springer Journals
Copyright
Copyright © 2018 by Springer Science+Business Media, LLC, part of Springer Nature
Subject
Computer Science; Algorithm Analysis and Problem Complexity; Theory of Computation; Mathematics of Computing; Algorithms; Computer Systems Organization and Communication Networks; Data Structures and Information Theory
ISSN
0178-4617
eISSN
1432-0541
DOI
10.1007/s00453-018-0459-9
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

AlgorithmicaSpringer Journals

Published: May 30, 2018

There are no references for this article.