A Route Discovery of Dynamic Wireless Network Using Particle Swarm Optimization

摘要

Route discovery in the routing process is of concern when network topology tends to change. This change can be caused by the movement of the node itself and the non-active node. This study aimed to propose a route selection technique using fixed particle swarm optimization (fixed-PSO). This algorithm was modeled in a purpose function, i.e. the minimum distance from the origin to the destination node. To demonstrate the performance of this mechanism, two scenarios used in the simulation. The first scenario used a 25-node in usual state topology where all the nodes in the network were connected and the second scenario used the same number of nodes representing abnormal conditions by disabling some nodes in the network. The simulation results showed that in general, the minimum distance of route selection of both scenarios was obtained in the first scenario (normal condition). More relay nodes were needed when the conditions were not normal. Similarly, when the node transmission coverage was shortened, more relay nodes were required to reach the destination. The fixed-PSO technique can be applied to active mobile network topologies while nodes join or leave the group unexpectedly.