Genetic Algorithm for Routing in Sensor Networks with Dynamic Topology
摘要
The main steps of the proposed genetic algorithm (GA)-based method, which enables the determination of an optimal route considering dynamically changing operating conditions of sensor networks, are presented. To evaluate the efficiency of the proposed solution, sequential node addition and removal from the network topology were analyzed using the developed software. The simulation results demonstrated that the gradual removal of five nodes from a network topology of 25 nodes confirmed the feasibility of the proposed solution for establishing a data transmission route between two specific nodes, outperforming the greedy algorithm. The addition of new nodes using the GA-based method reduced the route length, highlighting its ability to effectively adapt routes in response to new nodes while optimizing overall distance. The greedy algorithm successfully formed routes in certain cases of node addition, but the route lengths were longer compared to the GA-based results. Thus, it was shown that the proposed method enhances the performance of sensor networks by ensuring data transmission under dynamically changing conditions, compared to the greedy algorithm. Additionally, it aligns with sustainable development principles aimed at creating adaptive information and communication systems.