A mobile agent routing algorithm based on improved genetic algorithm for wireless sensor networks

Author(s):  
Xiang-li Wang ◽  
La-yuan Li
2021 ◽  
Vol 2021 ◽  
pp. 1-6
Author(s):  
Shuang Wang

The two most important factors that must be considered in the wireless sensor networks are energy efficiency and fault tolerance. Multipath routing is an effective method to improve the fault tolerance in wireless sensor networks. By taking the energy consumption into consideration, in this paper, a multipath routing algorithm for the wireless sensor networks based on the genetic algorithm is proposed. The proposed algorithm computes the fitness function by using the distance between nodes in the network and then generates the routing scheme at the base station. The routing scheme is shared with all the nodes of the entire network, to realize the multipath routing for each node. Finally, the simulation experiment is used to verify the validity of our method, and the results show that the routing method in this paper has a better effect.


2018 ◽  
Vol 14 (03) ◽  
pp. 52
Author(s):  
Zhi Huang

<span lang="EN-US">The GA(genetic algorithms) was applied to find routing trees with minimal maximal sensor load</span><span lang="EN-US"> thus extend network lifetime in wireless sensor networks. However,  t</span><span lang="EN-US">he existing algorithm</span><span lang="EN-US">limits search space of GA to avoid generating cycles by dividing sensors into layers and stipulating that a sensor only can select a sensor in its lower layer as its new parent.</span><span lang="EN-US"> In this paper, w</span><span lang="EN-US">e have found that how <a name="OLE_LINK26"></a><a name="OLE_LINK25"></a>cycles are generated during GA operations</span><span lang="EN-US">, and </span><span lang="EN-US">proposed a solution based on subtree to avoid generating cycles during GA operations.</span><span lang="EN-US">The solution only requires a sensor not to change its parent to a sensor in the subtree with it as the root. And layers are no longer considered. As a result, GA has more search space and GA operations can be performed more freely. Thus more optimal routing trees are obtained and network lifetime is extended.</span><span lang="EN-US"> The experiment shows that our proposed algorithm extend network lifetime notably.</span>


Sign in / Sign up

Export Citation Format

Share Document