A Genetic Algorithm Based and Subtree Restricted Routing Algorithm in Wireless Sensor Networks

Abstract

<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>