Optimal node placement in wireless networks

In this paper, we consider wireless networks that have fixed and movable nodes, where we aim at maximizing network centric objectives, by optimizing over admissible choices of the positions of the movable nodes as well as the transmission power at all the nodes. We adopt exponential path loss, which is a realistic assumption in urban and sub sea environments, and we propose ways of using this assumption to obtain a tractable optimization problem. Our formulation allows for the optimization of typical network centric objectives, such as power and throughput. It also allows signal-to-interference based constraints, such as rate-regions and outage probabilities, under the high signal to interference regime. We can show that our optimization paradigm is convex and that it can be solved up to an arbitrary degree of accuracy via geometric programming techniques. By using a primal-dual decomposition, we also provide a case-study that illustrates how certain instances of our optimization paradigm can be solved via distributed iterative algorithms.