Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
SIAM Journal on Optimization
Relay Node Placement in Wireless Sensor Networks
IEEE Transactions on Computers
Enhancing WLAN Capacity by Strategic Placement of Tetherless Relay Points
IEEE Transactions on Mobile Computing
Relaying Packets in a Two-tiered Wireless Network Using Binary Integer Programming
WASA '07 Proceedings of the International Conference on Wireless Algorithms,Systems and Applications
Understanding the real behavior of Mote and 802.11 ad hoc networks: an experimental approach
Pervasive and Mobile Computing
Two-hop-relay architecture for next-generation WWAN/WLAN integration
IEEE Wireless Communications
On energy provisioning and relay node placement for wireless sensor networks
IEEE Transactions on Wireless Communications
Integrated cellular and ad hoc relaying systems: iCAR
IEEE Journal on Selected Areas in Communications
Resource Allocation for OFDMA Relay Networks With Fairness Constraints
IEEE Journal on Selected Areas in Communications
Lifetime maximization via cooperative nodes and relay deployment in wireless networks
IEEE Journal on Selected Areas in Communications
Minimizing energy consumption in wireless sensor networks using multi-hop relay stations
ACS'11 Proceedings of the 11th WSEAS international conference on Applied computer science
Feasibility of SINR guarantees for downlink transmissions in relay-enabled OFDMA networks
Automatica (Journal of IFAC)
Multi-layer hybrid wired-cum-wireless sensor network design
International Journal of Communication Networks and Distributed Systems
Hi-index | 0.00 |
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.