Joint relay node placement and node scheduling in wireless networks with a relay node with controllable mobility

In this paper, we propose an algorithm for joint relay node placement and node scheduling in wireless networks. We consider a system that consists of a relay node with controllable mobility and multiple nodes that communicate with each other via the relay node. Each node communicates with the relay node according to its schedule. The objective of our algorithm is to maximize the lowest weighted throughput among those of all nodes. To this end, we consider a problem to optimally place the relay node and optimally schedule all nodes in the network. We develop three algorithms for relay node placement and node scheduling considering three different cases: when the location of the relay node is controllable while the node scheduling is fixed, when the node scheduling is controllable while the location of the relay node is fixed, and when both the location of the relay node and node scheduling are controllable. The simulation results show that by jointly optimizing relay node placement and node scheduling, we can improve system performance significantly in many cases.