Abstract—To obtain satisfactory performance in hierarchical wireless sensor networks (WSNs), it is a challenge to properly place the relay nodes in an efficient and effective way. The key focus of the current paper is the design of practical algorithm to achieve the solution of placement of relay nodes in a hierarchical WSN. We propose a relay node cover algorithm (RNCA) to generate all the possible positions for relay nodes and a genetic simulated annealing hybrid algorithm (GA-H-SA) to optimize the positions. Our goal is to find a acceptable trade-off among the three important objectives in order to maximize the lifetime and improve performance of the given WSN. The considered objectives are (1) the number of relay nodes is minimized, (2) the energy consumption is minimized, and (3) the connectivity degree between relay nodes and sensor nodes is maximized. Both theoretical analyses and numerical results demonstrate that, the proposed algorithms within limited number of iterations are promising. It is observed that they outperform other relevant state-of-the-art approaches.
Index Terms—Genetic simulated annealing hybrid algorithm, fault tolerant, relay node cover algorithm, relay node placement, wireless sensor networks.
Yan Wang, Liansheng Tan and Yanjiao Zhang are with the Computer Science Department, Central China Normal University, Wuhan, China (e-mails: wangyan@mails.ccnu.edu.cn, l.tan@mail.ccnu.edu.cn, zhangyanjiao@mails.ccnu.edu.cn).
[PDF]
Cite:Yan Wang, Liansheng Tan, and Yanjiao Zhang, "Relay Node Placement in Hierarchical Wireless Sensor Networks ," Journal of Advances in Computer Networks vol. 5, no. 1, pp. 41-46, 2017.
