In this paper, we consider the energy-bandwidth allocation for a network with multiple orthogonal broadcast channels, where each transmitter communicates with multiple receivers orthogonally. We assume that the harvested energy and channel gain of each transmitter can be predicted for K slots a priori. To maximize the weighted throughput of the network, we formulate an optimization problem with O(MK) constraints, where M is the number of the receivers, making it hard to solve using a generic convex solver since the computational complexity of the solver becomes impractically high when the number of constraints is large. In order to use the iterative algorithm proposed in [1] to solve the problem efficiently, we decompose the problem into the energy and bandwidth allocation subproblems and propose algorithms to solve the two corresponding subproblems, so that the optimal energy-bandwidth allocation can be obtained with an overall complexity of O(MK).
展开▼
