Optimal Relay Node Association for Two-Tiered Wireless Networks

Wireless networks that operate on batteries are imposed with energy constraints and long distance communications between nodes are not desirable. Implementing relay nodes can improve network capacity and save communication energy. A two-hop relay routing scheme is considered, in which the relay nodes are temporarily placed and have energy constraints. This paper investigates a joint optimization problem on relay node placement and route assignment for two-tiered wireless networks. A recursive weighted clustering binary integer programming (WCBIP) algorithm is proposed to maximize the total number of information packets received at the BS during the network lifetime. We first present an optimization algorithm based on binary integer programming (BIP) for relay node assignment with the current node locations. Subsequently, a weighted clustering algorithm is applied to move the relay nodes to the best locations to best serve their respectively associated edge nodes. The algorithm has the complexity of O(2ⁿ). The simulation results show that the proposed algorithm has significantly better performance than the other two relay placement schemes. Both theoretical analysis and practical design procedures are also presented with details.