Spatial Relay Node Placement in Wireless Sensor Networks
Armeline Dembo Mafuta, Tom Mmbasu Walingo · 2016
Controlled relay node placement in wireless sensor networks (WSN) is paramount to achieving desired performance goals of improving communication while reducing energy consumption. The network topology should be structured such that the relay nodes (RN) cater for appropriate node densities to the formation of an optimal communication network. This work presents an Optimal Greedy RN Placement (OGRNP) algorithm that selects a subset of sensors node (SN) from a pool according to matroid constraint based greedy algorithm. The algorithm exploits sub-modularity and monotonicity to guarantee a near-optimal placement of SN when the matroid rank function is sub-modular and monotonic. The algorithm achieves a near-optimal solution by minimizing the communication cost function. Performance results demonstrate the superior performance of the OGRNP algorithm over competing techniques based on random placement and conventional greedy algorithm.