On Relay Node Placement and Assignment 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 (RNs) can improve network capacity and save communication energy. A two-hop relay routing scheme is considered, in which the RNs are temporarily placed and have energy constraints. This paper investigates a joint optimization problem on Relay Node Placement (RNP) 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 Base Station (BS) during the network lifetime. We first present an optimization algorithm based on Binary Integer Programming (BIP) for Relay Node Assignment (RNA) with the current node locations. Subsequently, a weighted clustering algorithm is applied to move the RNs to the best locations to best serve their respectively associated Edge Nodes (ENs). The algorithm has the complexity of O(2n). 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.

[1]  G. Nemhauser,et al.  Integer Programming , 2020 .

[2]  Ahmed Helmy,et al.  A local metric for geographic routing with power control in wireless networks , 2005, 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005..

[3]  Hui Liu,et al.  Resource Allocation for OFDMA Relay Networks With Fairness Constraints , 2006, IEEE Journal on Selected Areas in Communications.

[4]  Chunming Qiao,et al.  Integrated cellular and ad hoc relaying systems: iCAR , 2001, IEEE J. Sel. Areas Commun..

[5]  John G. Proakis,et al.  Digital Communications , 1983 .

[6]  Errol L. Lloyd,et al.  Relay Node Placement in Wireless Sensor Networks , 2011, IEEE Transactions on Computers.

[7]  Zhu Han,et al.  A Distributed Relay-Assignment Algorithm for Cooperative Communications in Wireless Networks , 2006, 2006 IEEE International Conference on Communications.

[8]  Giuseppe Anastasi,et al.  Understanding the real behavior of Mote and 802.11 ad hoc networks: an experimental approach , 2005, Pervasive Mob. Comput..

[9]  Hossam S. Hassanein,et al.  Locally optimal relay node placement in heterogeneous wireless sensor networks , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[10]  Jeffrey C. Lagarias,et al.  Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions , 1998, SIAM J. Optim..

[11]  Ben Liang,et al.  Enhancing WLAN Capacity by Strategic Placement of Tetherless Relay Points , 2007, IEEE Transactions on Mobile Computing.

[12]  Hung-Yu Wei,et al.  Two-hop-relay architecture for next-generation WWAN/WLAN integration , 2004, IEEE Wireless Communications.

[13]  Mark A. Shayman,et al.  Relay Deployment and Power Control for Lifetime Elongation in Sensor Networks , 2006, 2006 IEEE International Conference on Communications.

[14]  Hai Liu,et al.  On optimal placement of relay nodes for reliable connectivity in wireless sensor networks , 2006, J. Comb. Optim..

[15]  Xinming Huang,et al.  Relaying Packets in a Two-tiered Wireless Network Using Binary Integer Programming , 2007, International Conference on Wireless Algorithms, Systems and Applications (WASA 2007).

[16]  Michael J. Neve,et al.  Base station placement in indoor wireless systems using binary integer programming , 2006 .

[17]  P. M. Grant,et al.  Digital communications. 3rd ed , 2009 .

[18]  Zhu Han,et al.  Lifetime maximization via cooperative nodes and relay deployment in wireless networks , 2007, IEEE Journal on Selected Areas in Communications.

[19]  Y.T. Hou,et al.  On energy provisioning and relay node placement for wireless sensor networks , 2005, IEEE Transactions on Wireless Communications.