favorite90The main contributions of this paper are two-fold: (i) we define a rigorous model for CoMP with JT and develop novel scheduling algorithms with throughput guarantees for networks with queueing dynamics; (ii) via extensive simulations, we observe the benefits of JT and the tradeoffs related to its implementation.
favorite6Moreover, we demonstrate that when the OJS problem is formulated with a specific queue-length based utility function and solved optimally in each subframe, we obtain a MaxWeight-like scheduling policy (e.g., ), which we show to be throughput optimal.
favorite14We first focus on a single subframe, and study the OFDMA Joint Scheduling (OJS) problem of determining a schedule to maximize some utility function, given a set of packets for each user.
favorite0We consider a cellular network comprised of multiple BSs interconnected via backhaul links.Users are assigned a serving and a secondary BS, and packets destined for a user can be transmitted either by the serving BS only, or jointly by the serving and secondary BSs. The latter provides better signal-to-interference-plus-noise ratio (SINR), but requires a subframe in both BSs, as well as forwarding the packet from the serving to the secondary BS prior to the transmission.
favorite0In contrast, we consider a cellular network where new packets are generated over time, and construct a rigorous framework to develop scheduling algorithms for CoMP with JT that maximize throughput.