{'fraction_non_alphanumeric': 0.00984251968503937, 'fraction_numerical': 0.000984251968503937, 'mean_word_length': 5.436708860759493, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Relay Node Position Optimization in Complex Environment

Environment has an essential effect on the selection of relay node positions. Real application environment of Wireless Sensor Networks usually is complex and heterogeneous where wireless channel has different characteristics at different locations. In network deployment, the environment also constrains relay node locations. There are areas unfeasible for node deployment. This paper studies the relay node placement problem in such complex environment. Our target of relay node position optimization is to minimize the relay node number and improve network performance by optimizing route paths of sensor nodes. Heuristic operations for genetic algorithms are proposed to optimize relay node positions. Simulation results show that the relay nodes number of the proposed algorithm is less than that of 2-approximation Steiner tree algorithm and the route paths of selected relay nodes have almost the best cost among route paths of all feasible relay nodes.