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

摘要

The GA(genetic algorithms) was applied to find routing trees with minimal maximal sensor load thus extend network lifetime in wireless sensor networks. However,? t he existing algorithm 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. In this paper, w e have found that how cycles are generated during GA operations , and proposed a solution based on subtree to avoid generating cycles during GA operations. 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. The experiment shows that our proposed algorithm extend network lifetime notably.