TY - GEN

T1 - Joint Base Station Scheduling

AU - Erlebach, Thomas

AU - Jacob, Riko

AU - Mihalák, Matúš

AU - Nunkesser, Marc

AU - Szabó, Gábor

AU - Widmayer, Peter

PY - 2004

Y1 - 2004

N2 - Consider a scenario where base stations need to send data to users with wireless devices. Time is discrete and slotted into synchronous rounds. Transmitting a data item from a base station to a user takes one round. A user can receive the data item from any of the base stations. The positions of the base stations and users are modeled as points in euclidean space. If base station b transmits to user u in a certain round, no other user within distance at most ||b - u||2 from b can receive data in the same round due to interference phenomena. The goal is to minimize, given the positions of the base stations and users, the number of rounds until all users have their data.we call this problem the joint base station scheduling problem (jbs) and consider it on the line (1d-jbs) and in the plane (2d-jbs). For 1d-jbs, we give a 2-approximation algorithm and polynomial optimal algorithms for special cases. We model transmissions from base stations to users as arrows (intervals with a distinguished endpoint) and show that their conflict graphs, which we call arrow graphs, are a subclass of the class of perfect graphs. For 2d-jbs, we prove np-hardness and discuss an approximation algorithm.

AB - Consider a scenario where base stations need to send data to users with wireless devices. Time is discrete and slotted into synchronous rounds. Transmitting a data item from a base station to a user takes one round. A user can receive the data item from any of the base stations. The positions of the base stations and users are modeled as points in euclidean space. If base station b transmits to user u in a certain round, no other user within distance at most ||b - u||2 from b can receive data in the same round due to interference phenomena. The goal is to minimize, given the positions of the base stations and users, the number of rounds until all users have their data.we call this problem the joint base station scheduling problem (jbs) and consider it on the line (1d-jbs) and in the plane (2d-jbs). For 1d-jbs, we give a 2-approximation algorithm and polynomial optimal algorithms for special cases. We model transmissions from base stations to users as arrows (intervals with a distinguished endpoint) and show that their conflict graphs, which we call arrow graphs, are a subclass of the class of perfect graphs. For 2d-jbs, we prove np-hardness and discuss an approximation algorithm.

U2 - 10.1007/978-3-540-31833-0_19

DO - 10.1007/978-3-540-31833-0_19

M3 - Conference article in proceeding

T3 - Lecture Notes in Computer Science

SP - 225

EP - 238

BT - Proceedings of the 2nd International Workshop on Approximation and Online Algorithms (WAOA)

PB - Springer Verlag

ER -